./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a --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 f9b434f3343269d91303305376bff127738dc22172486554888e346753333fd7 --- 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-b5237d8 [2022-11-21 16:16:33,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 16:16:33,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 16:16:33,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 16:16:33,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 16:16:33,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 16:16:33,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 16:16:33,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 16:16:33,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 16:16:33,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 16:16:33,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 16:16:33,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 16:16:33,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 16:16:33,751 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 16:16:33,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 16:16:33,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 16:16:33,758 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 16:16:33,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 16:16:33,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 16:16:33,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 16:16:33,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 16:16:33,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 16:16:33,784 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 16:16:33,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 16:16:33,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 16:16:33,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 16:16:33,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 16:16:33,793 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 16:16:33,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 16:16:33,794 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 16:16:33,795 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 16:16:33,796 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 16:16:33,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 16:16:33,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 16:16:33,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 16:16:33,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 16:16:33,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 16:16:33,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 16:16:33,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 16:16:33,812 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 16:16:33,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 16:16:33,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 16:16:33,851 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 16:16:33,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 16:16:33,852 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 16:16:33,852 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 16:16:33,853 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 16:16:33,853 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 16:16:33,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 16:16:33,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 16:16:33,854 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 16:16:33,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 16:16:33,854 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 16:16:33,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 16:16:33,855 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 16:16:33,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 16:16:33,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 16:16:33,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 16:16:33,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 16:16:33,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 16:16:33,856 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 16:16:33,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:16:33,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 16:16:33,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 16:16:33,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 16:16:33,857 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 16:16:33,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 16:16:33,858 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 16:16:33,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 16:16:33,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 16:16:33,858 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_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/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_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a 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 -> f9b434f3343269d91303305376bff127738dc22172486554888e346753333fd7 [2022-11-21 16:16:34,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 16:16:34,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 16:16:34,272 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 16:16:34,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 16:16:34,275 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 16:16:34,276 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2022-11-21 16:16:37,401 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 16:16:37,598 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 16:16:37,599 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c [2022-11-21 16:16:37,610 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/data/f2a18ec86/d0a0b3cd492346cb886c1561ae48a3fa/FLAGcc97d617c [2022-11-21 16:16:37,624 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/data/f2a18ec86/d0a0b3cd492346cb886c1561ae48a3fa [2022-11-21 16:16:37,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 16:16:37,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 16:16:37,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 16:16:37,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 16:16:37,635 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 16:16:37,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:16:37" (1/1) ... [2022-11-21 16:16:37,637 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a14fb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:37, skipping insertion in model container [2022-11-21 16:16:37,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 04:16:37" (1/1) ... [2022-11-21 16:16:37,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 16:16:37,680 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 16:16:37,950 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-11-21 16:16:37,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:16:37,971 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 16:16:37,994 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/sv-benchmarks/c/weaver/popl20-prod-cons.wvr.c[3056,3069] [2022-11-21 16:16:37,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 16:16:38,013 INFO L208 MainTranslator]: Completed translation [2022-11-21 16:16:38,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38 WrapperNode [2022-11-21 16:16:38,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 16:16:38,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 16:16:38,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 16:16:38,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 16:16:38,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,031 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,057 INFO L138 Inliner]: procedures = 25, calls = 50, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 166 [2022-11-21 16:16:38,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 16:16:38,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 16:16:38,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 16:16:38,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 16:16:38,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,071 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,086 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,088 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 16:16:38,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 16:16:38,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 16:16:38,092 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 16:16:38,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (1/1) ... [2022-11-21 16:16:38,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 16:16:38,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:38,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 16:16:38,131 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 16:16:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 16:16:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 16:16:38,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 16:16:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 16:16:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-21 16:16:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-21 16:16:38,171 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-21 16:16:38,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-21 16:16:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-21 16:16:38,172 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-21 16:16:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 16:16:38,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-21 16:16:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-21 16:16:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 16:16:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 16:16:38,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 16:16:38,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 16:16:38,175 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-21 16:16:38,284 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 16:16:38,285 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 16:16:38,604 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 16:16:38,787 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 16:16:38,787 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-21 16:16:38,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:16:38 BoogieIcfgContainer [2022-11-21 16:16:38,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 16:16:38,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 16:16:38,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 16:16:38,795 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 16:16:38,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 04:16:37" (1/3) ... [2022-11-21 16:16:38,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c31d2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:16:38, skipping insertion in model container [2022-11-21 16:16:38,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 04:16:38" (2/3) ... [2022-11-21 16:16:38,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c31d2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 04:16:38, skipping insertion in model container [2022-11-21 16:16:38,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 04:16:38" (3/3) ... [2022-11-21 16:16:38,798 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons.wvr.c [2022-11-21 16:16:38,807 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-21 16:16:38,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 16:16:38,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 16:16:38,819 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-21 16:16:38,893 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-21 16:16:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 156 transitions, 336 flow [2022-11-21 16:16:39,035 INFO L130 PetriNetUnfolder]: 11/153 cut-off events. [2022-11-21 16:16:39,035 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:16:39,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 153 events. 11/153 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 82 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 122. Up to 3 conditions per place. [2022-11-21 16:16:39,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 156 transitions, 336 flow [2022-11-21 16:16:39,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 142 transitions, 302 flow [2022-11-21 16:16:39,058 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 16:16:39,065 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;@7c4cd825, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 16:16:39,065 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-21 16:16:39,105 INFO L130 PetriNetUnfolder]: 11/141 cut-off events. [2022-11-21 16:16:39,106 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-21 16:16:39,106 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:39,107 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:39,107 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-21 16:16:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:39,113 INFO L85 PathProgramCache]: Analyzing trace with hash -870334346, now seen corresponding path program 1 times [2022-11-21 16:16:39,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:39,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834231721] [2022-11-21 16:16:39,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:39,497 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-21 16:16:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:39,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834231721] [2022-11-21 16:16:39,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834231721] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:39,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:39,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 16:16:39,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110608892] [2022-11-21 16:16:39,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:39,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-21 16:16:39,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:39,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-21 16:16:39,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-21 16:16:39,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 156 [2022-11-21 16:16:39,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 142 transitions, 302 flow. Second operand has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 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-21 16:16:39,568 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:39,568 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 156 [2022-11-21 16:16:39,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:39,713 INFO L130 PetriNetUnfolder]: 24/206 cut-off events. [2022-11-21 16:16:39,713 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-11-21 16:16:39,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 206 events. 24/206 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 367 event pairs, 7 based on Foata normal form. 22/206 useless extension candidates. Maximal degree in co-relation 154. Up to 32 conditions per place. [2022-11-21 16:16:39,717 INFO L137 encePairwiseOnDemand]: 149/156 looper letters, 8 selfloop transitions, 0 changer transitions 4/135 dead transitions. [2022-11-21 16:16:39,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 135 transitions, 304 flow [2022-11-21 16:16:39,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-21 16:16:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-21 16:16:39,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 295 transitions. [2022-11-21 16:16:39,738 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9455128205128205 [2022-11-21 16:16:39,739 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 295 transitions. [2022-11-21 16:16:39,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 295 transitions. [2022-11-21 16:16:39,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:39,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 295 transitions. [2022-11-21 16:16:39,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 147.5) internal successors, (295), 2 states have internal predecessors, (295), 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-21 16:16:39,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-21 16:16:39,769 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 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-21 16:16:39,771 INFO L175 Difference]: Start difference. First operand has 141 places, 142 transitions, 302 flow. Second operand 2 states and 295 transitions. [2022-11-21 16:16:39,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 135 transitions, 304 flow [2022-11-21 16:16:39,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 135 transitions, 292 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-21 16:16:39,783 INFO L231 Difference]: Finished difference. Result has 136 places, 131 transitions, 268 flow [2022-11-21 16:16:39,785 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=268, PETRI_PLACES=136, PETRI_TRANSITIONS=131} [2022-11-21 16:16:39,792 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, -5 predicate places. [2022-11-21 16:16:39,792 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 131 transitions, 268 flow [2022-11-21 16:16:39,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 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-21 16:16:39,794 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:39,794 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:39,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 16:16:39,795 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-21 16:16:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash 991770693, now seen corresponding path program 1 times [2022-11-21 16:16:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884243673] [2022-11-21 16:16:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:40,723 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-21 16:16:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884243673] [2022-11-21 16:16:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884243673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:40,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:40,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 16:16:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288330877] [2022-11-21 16:16:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 16:16:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 16:16:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-21 16:16:40,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 156 [2022-11-21 16:16:40,748 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 131 transitions, 268 flow. Second operand has 9 states, 9 states have (on average 110.44444444444444) internal successors, (994), 9 states have internal predecessors, (994), 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-21 16:16:40,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:40,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 156 [2022-11-21 16:16:40,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:41,197 INFO L130 PetriNetUnfolder]: 191/516 cut-off events. [2022-11-21 16:16:41,197 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-11-21 16:16:41,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 516 events. 191/516 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2406 event pairs, 10 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 901. Up to 130 conditions per place. [2022-11-21 16:16:41,203 INFO L137 encePairwiseOnDemand]: 145/156 looper letters, 50 selfloop transitions, 10 changer transitions 0/154 dead transitions. [2022-11-21 16:16:41,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 154 transitions, 439 flow [2022-11-21 16:16:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 16:16:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-21 16:16:41,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1132 transitions. [2022-11-21 16:16:41,208 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7256410256410256 [2022-11-21 16:16:41,208 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1132 transitions. [2022-11-21 16:16:41,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1132 transitions. [2022-11-21 16:16:41,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:41,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1132 transitions. [2022-11-21 16:16:41,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.2) internal successors, (1132), 10 states have internal predecessors, (1132), 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-21 16:16:41,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 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-21 16:16:41,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 156.0) internal successors, (1716), 11 states have internal predecessors, (1716), 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-21 16:16:41,219 INFO L175 Difference]: Start difference. First operand has 136 places, 131 transitions, 268 flow. Second operand 10 states and 1132 transitions. [2022-11-21 16:16:41,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 154 transitions, 439 flow [2022-11-21 16:16:41,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 154 transitions, 439 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-21 16:16:41,224 INFO L231 Difference]: Finished difference. Result has 143 places, 133 transitions, 304 flow [2022-11-21 16:16:41,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=304, PETRI_PLACES=143, PETRI_TRANSITIONS=133} [2022-11-21 16:16:41,225 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 2 predicate places. [2022-11-21 16:16:41,225 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 133 transitions, 304 flow [2022-11-21 16:16:41,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.44444444444444) internal successors, (994), 9 states have internal predecessors, (994), 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-21 16:16:41,227 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:41,227 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:41,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 16:16:41,227 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-21 16:16:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:41,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1848176078, now seen corresponding path program 1 times [2022-11-21 16:16:41,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:41,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363331965] [2022-11-21 16:16:41,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:41,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:41,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:41,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:41,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363331965] [2022-11-21 16:16:41,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363331965] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:41,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438123878] [2022-11-21 16:16:41,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:41,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:41,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:41,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:41,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 16:16:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:41,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:16:41,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:41,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:16:41,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438123878] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:41,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:41,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-11-21 16:16:41,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754173825] [2022-11-21 16:16:41,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:41,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:16:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:41,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:16:41,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:16:41,742 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 156 [2022-11-21 16:16:41,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 133 transitions, 304 flow. Second operand has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-21 16:16:41,744 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:41,744 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 156 [2022-11-21 16:16:41,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:41,957 INFO L130 PetriNetUnfolder]: 213/563 cut-off events. [2022-11-21 16:16:41,957 INFO L131 PetriNetUnfolder]: For 148/149 co-relation queries the response was YES. [2022-11-21 16:16:41,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1047 conditions, 563 events. 213/563 cut-off events. For 148/149 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2728 event pairs, 4 based on Foata normal form. 8/554 useless extension candidates. Maximal degree in co-relation 1041. Up to 108 conditions per place. [2022-11-21 16:16:41,963 INFO L137 encePairwiseOnDemand]: 150/156 looper letters, 34 selfloop transitions, 8 changer transitions 1/158 dead transitions. [2022-11-21 16:16:41,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 158 transitions, 451 flow [2022-11-21 16:16:41,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:16:41,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:16:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 961 transitions. [2022-11-21 16:16:41,968 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.88003663003663 [2022-11-21 16:16:41,968 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 961 transitions. [2022-11-21 16:16:41,968 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 961 transitions. [2022-11-21 16:16:41,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:41,969 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 961 transitions. [2022-11-21 16:16:41,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.28571428571428) internal successors, (961), 7 states have internal predecessors, (961), 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-21 16:16:41,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:16:41,975 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:16:41,976 INFO L175 Difference]: Start difference. First operand has 143 places, 133 transitions, 304 flow. Second operand 7 states and 961 transitions. [2022-11-21 16:16:41,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 158 transitions, 451 flow [2022-11-21 16:16:41,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 158 transitions, 434 flow, removed 0 selfloop flow, removed 7 redundant places. [2022-11-21 16:16:41,981 INFO L231 Difference]: Finished difference. Result has 145 places, 137 transitions, 331 flow [2022-11-21 16:16:41,981 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=331, PETRI_PLACES=145, PETRI_TRANSITIONS=137} [2022-11-21 16:16:41,982 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 4 predicate places. [2022-11-21 16:16:41,982 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 137 transitions, 331 flow [2022-11-21 16:16:41,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-21 16:16:41,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:41,983 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:41,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 16:16:42,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:42,189 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-21 16:16:42,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 906142484, now seen corresponding path program 2 times [2022-11-21 16:16:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:42,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625118693] [2022-11-21 16:16:42,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:42,380 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-21 16:16:42,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625118693] [2022-11-21 16:16:42,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625118693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:42,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:42,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 16:16:42,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819250624] [2022-11-21 16:16:42,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:42,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 16:16:42,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:42,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 16:16:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 16:16:42,384 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 156 [2022-11-21 16:16:42,385 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 137 transitions, 331 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:42,385 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:42,385 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 156 [2022-11-21 16:16:42,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:42,451 INFO L130 PetriNetUnfolder]: 30/247 cut-off events. [2022-11-21 16:16:42,451 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-21 16:16:42,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396 conditions, 247 events. 30/247 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 579 event pairs, 7 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 387. Up to 41 conditions per place. [2022-11-21 16:16:42,454 INFO L137 encePairwiseOnDemand]: 153/156 looper letters, 13 selfloop transitions, 2 changer transitions 1/141 dead transitions. [2022-11-21 16:16:42,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 141 transitions, 374 flow [2022-11-21 16:16:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 16:16:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-21 16:16:42,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2022-11-21 16:16:42,456 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9081196581196581 [2022-11-21 16:16:42,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2022-11-21 16:16:42,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2022-11-21 16:16:42,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:42,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2022-11-21 16:16:42,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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-21 16:16:42,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-21 16:16:42,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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-21 16:16:42,460 INFO L175 Difference]: Start difference. First operand has 145 places, 137 transitions, 331 flow. Second operand 3 states and 425 transitions. [2022-11-21 16:16:42,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 141 transitions, 374 flow [2022-11-21 16:16:42,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 141 transitions, 372 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-11-21 16:16:42,465 INFO L231 Difference]: Finished difference. Result has 148 places, 138 transitions, 341 flow [2022-11-21 16:16:42,466 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=148, PETRI_TRANSITIONS=138} [2022-11-21 16:16:42,466 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 7 predicate places. [2022-11-21 16:16:42,467 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 138 transitions, 341 flow [2022-11-21 16:16:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 16:16:42,467 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:42,467 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:42,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 16:16:42,468 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-21 16:16:42,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:42,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1824730649, now seen corresponding path program 1 times [2022-11-21 16:16:42,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:42,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970208898] [2022-11-21 16:16:42,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:42,657 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-21 16:16:42,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:42,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970208898] [2022-11-21 16:16:42,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970208898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 16:16:42,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 16:16:42,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 16:16:42,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333030151] [2022-11-21 16:16:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 16:16:42,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 16:16:42,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:42,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 16:16:42,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 16:16:42,662 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 156 [2022-11-21 16:16:42,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 138 transitions, 341 flow. Second operand has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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-21 16:16:42,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:42,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 156 [2022-11-21 16:16:42,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:16:42,815 INFO L130 PetriNetUnfolder]: 34/306 cut-off events. [2022-11-21 16:16:42,815 INFO L131 PetriNetUnfolder]: For 75/83 co-relation queries the response was YES. [2022-11-21 16:16:42,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 306 events. 34/306 cut-off events. For 75/83 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 812 event pairs, 9 based on Foata normal form. 3/286 useless extension candidates. Maximal degree in co-relation 497. Up to 51 conditions per place. [2022-11-21 16:16:42,818 INFO L137 encePairwiseOnDemand]: 148/156 looper letters, 21 selfloop transitions, 6 changer transitions 5/147 dead transitions. [2022-11-21 16:16:42,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 147 transitions, 427 flow [2022-11-21 16:16:42,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:16:42,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:16:42,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 914 transitions. [2022-11-21 16:16:42,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.836996336996337 [2022-11-21 16:16:42,821 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 914 transitions. [2022-11-21 16:16:42,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 914 transitions. [2022-11-21 16:16:42,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:16:42,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 914 transitions. [2022-11-21 16:16:42,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.57142857142858) internal successors, (914), 7 states have internal predecessors, (914), 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-21 16:16:42,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:16:42,828 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:16:42,828 INFO L175 Difference]: Start difference. First operand has 148 places, 138 transitions, 341 flow. Second operand 7 states and 914 transitions. [2022-11-21 16:16:42,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 147 transitions, 427 flow [2022-11-21 16:16:42,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 147 transitions, 425 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-21 16:16:42,834 INFO L231 Difference]: Finished difference. Result has 155 places, 139 transitions, 361 flow [2022-11-21 16:16:42,834 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=361, PETRI_PLACES=155, PETRI_TRANSITIONS=139} [2022-11-21 16:16:42,835 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 14 predicate places. [2022-11-21 16:16:42,835 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 139 transitions, 361 flow [2022-11-21 16:16:42,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.0) internal successors, (774), 6 states have internal predecessors, (774), 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-21 16:16:42,836 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:16:42,836 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:16:42,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 16:16:42,837 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-21 16:16:42,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:16:42,838 INFO L85 PathProgramCache]: Analyzing trace with hash -289263305, now seen corresponding path program 1 times [2022-11-21 16:16:42,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:16:42,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725913454] [2022-11-21 16:16:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:16:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:44,674 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-21 16:16:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:16:44,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725913454] [2022-11-21 16:16:44,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725913454] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:16:44,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998651762] [2022-11-21 16:16:44,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:16:44,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:16:44,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:16:44,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:16:44,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 16:16:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:16:44,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-21 16:16:44,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:16:46,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 16:16:46,787 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-21 16:16:46,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:16:47,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:16:47,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 24 [2022-11-21 16:16:48,764 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-21 16:16:48,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998651762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:16:48,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:16:48,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 20] total 60 [2022-11-21 16:16:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106174387] [2022-11-21 16:16:48,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:16:48,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-21 16:16:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:16:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-21 16:16:48,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=3041, Unknown=0, NotChecked=0, Total=3540 [2022-11-21 16:16:48,775 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 156 [2022-11-21 16:16:48,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 139 transitions, 361 flow. Second operand has 60 states, 60 states have (on average 84.78333333333333) internal successors, (5087), 60 states have internal predecessors, (5087), 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-21 16:16:48,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:16:48,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 156 [2022-11-21 16:16:48,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:16,669 INFO L130 PetriNetUnfolder]: 11672/23308 cut-off events. [2022-11-21 16:17:16,669 INFO L131 PetriNetUnfolder]: For 15222/15222 co-relation queries the response was YES. [2022-11-21 16:17:16,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55049 conditions, 23308 events. 11672/23308 cut-off events. For 15222/15222 co-relation queries the response was YES. Maximal size of possible extension queue 1071. Compared 225635 event pairs, 377 based on Foata normal form. 132/21880 useless extension candidates. Maximal degree in co-relation 55036. Up to 2381 conditions per place. [2022-11-21 16:17:16,803 INFO L137 encePairwiseOnDemand]: 116/156 looper letters, 752 selfloop transitions, 247 changer transitions 1054/2118 dead transitions. [2022-11-21 16:17:16,804 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 2118 transitions, 10643 flow [2022-11-21 16:17:16,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 245 states. [2022-11-21 16:17:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2022-11-21 16:17:16,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 22067 transitions. [2022-11-21 16:17:16,857 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5773678702250131 [2022-11-21 16:17:16,857 INFO L72 ComplementDD]: Start complementDD. Operand 245 states and 22067 transitions. [2022-11-21 16:17:16,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 22067 transitions. [2022-11-21 16:17:16,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:17:16,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 245 states and 22067 transitions. [2022-11-21 16:17:16,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 246 states, 245 states have (on average 90.06938775510204) internal successors, (22067), 245 states have internal predecessors, (22067), 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-21 16:17:17,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 246 states, 246 states have (on average 156.0) internal successors, (38376), 246 states have internal predecessors, (38376), 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-21 16:17:17,086 INFO L81 ComplementDD]: Finished complementDD. Result has 246 states, 246 states have (on average 156.0) internal successors, (38376), 246 states have internal predecessors, (38376), 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-21 16:17:17,087 INFO L175 Difference]: Start difference. First operand has 155 places, 139 transitions, 361 flow. Second operand 245 states and 22067 transitions. [2022-11-21 16:17:17,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 2118 transitions, 10643 flow [2022-11-21 16:17:17,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 2118 transitions, 10613 flow, removed 10 selfloop flow, removed 5 redundant places. [2022-11-21 16:17:17,148 INFO L231 Difference]: Finished difference. Result has 505 places, 400 transitions, 2369 flow [2022-11-21 16:17:17,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=245, PETRI_FLOW=2369, PETRI_PLACES=505, PETRI_TRANSITIONS=400} [2022-11-21 16:17:17,150 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 364 predicate places. [2022-11-21 16:17:17,150 INFO L495 AbstractCegarLoop]: Abstraction has has 505 places, 400 transitions, 2369 flow [2022-11-21 16:17:17,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 84.78333333333333) internal successors, (5087), 60 states have internal predecessors, (5087), 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-21 16:17:17,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:17:17,153 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:17:17,160 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 16:17:17,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:17:17,360 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-21 16:17:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:17:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1131907397, now seen corresponding path program 2 times [2022-11-21 16:17:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:17:17,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891821591] [2022-11-21 16:17:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:17:17,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:17:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:17:19,369 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-21 16:17:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:17:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891821591] [2022-11-21 16:17:19,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891821591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:17:19,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247685028] [2022-11-21 16:17:19,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-21 16:17:19,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:17:19,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:17:19,373 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:17:19,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 16:17:19,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-21 16:17:19,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:17:19,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-21 16:17:19,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:17:21,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:17:21,540 INFO L350 Elim1Store]: Elim1 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-21 16:17:21,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 16:17:21,933 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-21 16:17:21,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:17:22,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:17:22,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 46 [2022-11-21 16:17:22,457 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 7 [2022-11-21 16:17:25,554 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-21 16:17:25,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247685028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:17:25,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:17:25,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 27] total 71 [2022-11-21 16:17:25,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330400265] [2022-11-21 16:17:25,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:17:25,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-21 16:17:25,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:17:25,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-21 16:17:25,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=4587, Unknown=0, NotChecked=0, Total=4970 [2022-11-21 16:17:25,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 156 [2022-11-21 16:17:25,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 400 transitions, 2369 flow. Second operand has 71 states, 71 states have (on average 73.5774647887324) internal successors, (5224), 71 states have internal predecessors, (5224), 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-21 16:17:25,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:17:25,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 156 [2022-11-21 16:17:25,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:17:55,867 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:18:13,109 WARN L233 SmtUtils]: Spent 6.47s on a formula simplification. DAG size of input: 73 DAG size of output: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:18:24,665 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 79 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:18:43,076 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification. DAG size of input: 79 DAG size of output: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:19:03,938 INFO L130 PetriNetUnfolder]: 8279/16404 cut-off events. [2022-11-21 16:19:03,938 INFO L131 PetriNetUnfolder]: For 550069/550146 co-relation queries the response was YES. [2022-11-21 16:19:04,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99923 conditions, 16404 events. 8279/16404 cut-off events. For 550069/550146 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 148065 event pairs, 344 based on Foata normal form. 157/16485 useless extension candidates. Maximal degree in co-relation 99800. Up to 1561 conditions per place. [2022-11-21 16:19:04,264 INFO L137 encePairwiseOnDemand]: 118/156 looper letters, 915 selfloop transitions, 405 changer transitions 84/1462 dead transitions. [2022-11-21 16:19:04,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 1462 transitions, 17172 flow [2022-11-21 16:19:04,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2022-11-21 16:19:04,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2022-11-21 16:19:04,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 10651 transitions. [2022-11-21 16:19:04,285 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5095197091465749 [2022-11-21 16:19:04,285 INFO L72 ComplementDD]: Start complementDD. Operand 134 states and 10651 transitions. [2022-11-21 16:19:04,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 10651 transitions. [2022-11-21 16:19:04,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:19:04,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 134 states and 10651 transitions. [2022-11-21 16:19:04,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 135 states, 134 states have (on average 79.48507462686567) internal successors, (10651), 134 states have internal predecessors, (10651), 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-21 16:19:04,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 135 states, 135 states have (on average 156.0) internal successors, (21060), 135 states have internal predecessors, (21060), 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-21 16:19:04,354 INFO L81 ComplementDD]: Finished complementDD. Result has 135 states, 135 states have (on average 156.0) internal successors, (21060), 135 states have internal predecessors, (21060), 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-21 16:19:04,354 INFO L175 Difference]: Start difference. First operand has 505 places, 400 transitions, 2369 flow. Second operand 134 states and 10651 transitions. [2022-11-21 16:19:04,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 510 places, 1462 transitions, 17172 flow [2022-11-21 16:19:06,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1462 transitions, 12244 flow, removed 2143 selfloop flow, removed 92 redundant places. [2022-11-21 16:19:06,250 INFO L231 Difference]: Finished difference. Result has 453 places, 591 transitions, 4122 flow [2022-11-21 16:19:06,251 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=1755, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=4122, PETRI_PLACES=453, PETRI_TRANSITIONS=591} [2022-11-21 16:19:06,251 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 312 predicate places. [2022-11-21 16:19:06,252 INFO L495 AbstractCegarLoop]: Abstraction has has 453 places, 591 transitions, 4122 flow [2022-11-21 16:19:06,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 73.5774647887324) internal successors, (5224), 71 states have internal predecessors, (5224), 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-21 16:19:06,254 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:19:06,254 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:19:06,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 16:19:06,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:06,460 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-21 16:19:06,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:19:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1419932063, now seen corresponding path program 3 times [2022-11-21 16:19:06,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:19:06,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085560984] [2022-11-21 16:19:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:19:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:19:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:19:08,973 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-21 16:19:08,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:19:08,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085560984] [2022-11-21 16:19:08,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085560984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:19:08,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780475656] [2022-11-21 16:19:08,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-21 16:19:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:19:08,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:19:08,976 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:19:08,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 16:19:09,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-21 16:19:09,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:19:09,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-21 16:19:09,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:19:10,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:19:11,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:19:11,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:11,961 INFO L350 Elim1Store]: Elim1 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-21 16:19:12,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:19:12,140 INFO L350 Elim1Store]: Elim1 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-21 16:19:12,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-21 16:19:12,615 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-21 16:19:12,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:19:17,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:19:17,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2022-11-21 16:19:17,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:19:17,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 192 treesize of output 188 [2022-11-21 16:19:17,431 INFO L350 Elim1Store]: Elim1 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 152 treesize of output 140 [2022-11-21 16:19:17,441 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 116 [2022-11-21 16:19:17,466 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:19:17,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2022-11-21 16:19:19,403 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-21 16:19:19,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780475656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:19:19,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:19:19,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31, 31] total 81 [2022-11-21 16:19:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929973503] [2022-11-21 16:19:19,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:19:19,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-11-21 16:19:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:19:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-11-21 16:19:19,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=5961, Unknown=40, NotChecked=0, Total=6480 [2022-11-21 16:19:19,411 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 156 [2022-11-21 16:19:19,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 591 transitions, 4122 flow. Second operand has 81 states, 81 states have (on average 71.28395061728395) internal successors, (5774), 81 states have internal predecessors, (5774), 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-21 16:19:19,417 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:19:19,417 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 156 [2022-11-21 16:19:19,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:19:39,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:41,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:45,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:47,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:51,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:55,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:19:56,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:00,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:02,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:04,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:07,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:15,907 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4)) (.cse7 (* c_~back~0 4))) (let ((.cse8 (< c_~d~0 1)) (.cse9 (= .cse10 .cse7))) (let ((.cse5 (+ c_~queue~0.offset .cse10)) (.cse6 (+ c_~W~0 1)) (.cse2 (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse8 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse9)) (.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse1 (= (mod c_~v_assert~0 256) 0)) (.cse3 (not (< c_~back~0 c_~n~0))) (.cse4 (not (<= 0 c_~back~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse5)) .cse6)) .cse3 (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse7)) 1)) .cse4) (= c_~d~0 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (or .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2 .cse3 .cse4) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse5)) .cse6)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (or .cse0 .cse1 (and .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse9 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) .cse3 .cse4) (<= c_~d~0 1) (<= c_~d~0 0) (<= 1 c_~v_assert~0) (or (< 0 c_~back~0) .cse2 .cse4) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= 1 c_~W~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and .cse8 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base|)) (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) .cse9) .cse1 .cse3 .cse4) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))))) is different from false [2022-11-21 16:20:29,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:20:37,574 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse4)) (.cse1 (+ c_~W~0 1)) (.cse2 (* c_~back~0 4)) (.cse3 (not (<= 0 c_~back~0)))) (and (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) .cse1)) (or (= (mod c_~v_assert~0 256) 0) (not (< 0 |c_thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) .cse1)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) 1)) .cse3) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= c_~d~0 0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (or (< 0 c_~back~0) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) (< c_~d~0 1) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse4 .cse2)) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= 1 c_~W~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2022-11-21 16:20:40,293 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_~front~0 4))) (let ((.cse0 (+ c_~queue~0.offset .cse4)) (.cse1 (+ c_~W~0 1)) (.cse2 (* c_~back~0 4)) (.cse3 (not (<= 0 c_~back~0)))) (and (or (= (mod |c_thread1Thread1of1ForFork1_~cond~0#1| 256) 0) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ c_~d~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) .cse1)) (not (< c_~back~0 c_~n~0)) (not (= (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset .cse2)) 1)) .cse3) (<= |c_thread2Thread1of1ForFork2_~cond~1#1| 1) (= c_~d~0 0) (<= 1 |c_thread2Thread1of1ForFork2_~cond~1#1|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~v_assert~0 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) c_~queue~0.base) .cse0)) .cse1)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= c_~d~0 1) (<= (div |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= c_~d~0 0) (= |c_thread2Thread1of1ForFork2_~cond~1#1| c_~v_assert~0) (<= 1 c_~v_assert~0) (or (< 0 c_~back~0) (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) (< c_~d~0 1) (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) (= .cse4 .cse2)) .cse3) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (<= 1 c_~W~0) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t2~0#1.base|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2022-11-21 16:20:50,627 INFO L130 PetriNetUnfolder]: 10938/23121 cut-off events. [2022-11-21 16:20:50,627 INFO L131 PetriNetUnfolder]: For 392725/392853 co-relation queries the response was YES. [2022-11-21 16:20:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96747 conditions, 23121 events. 10938/23121 cut-off events. For 392725/392853 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 230504 event pairs, 825 based on Foata normal form. 197/23188 useless extension candidates. Maximal degree in co-relation 96661. Up to 1799 conditions per place. [2022-11-21 16:20:50,927 INFO L137 encePairwiseOnDemand]: 108/156 looper letters, 939 selfloop transitions, 652 changer transitions 133/1782 dead transitions. [2022-11-21 16:20:50,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 1782 transitions, 18036 flow [2022-11-21 16:20:50,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2022-11-21 16:20:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2022-11-21 16:20:50,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 11294 transitions. [2022-11-21 16:20:50,942 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49587284861257463 [2022-11-21 16:20:50,942 INFO L72 ComplementDD]: Start complementDD. Operand 146 states and 11294 transitions. [2022-11-21 16:20:50,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 146 states and 11294 transitions. [2022-11-21 16:20:50,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:20:50,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 146 states and 11294 transitions. [2022-11-21 16:20:50,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 147 states, 146 states have (on average 77.35616438356165) internal successors, (11294), 146 states have internal predecessors, (11294), 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-21 16:20:50,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 147 states, 147 states have (on average 156.0) internal successors, (22932), 147 states have internal predecessors, (22932), 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-21 16:20:50,995 INFO L81 ComplementDD]: Finished complementDD. Result has 147 states, 147 states have (on average 156.0) internal successors, (22932), 147 states have internal predecessors, (22932), 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-21 16:20:50,995 INFO L175 Difference]: Start difference. First operand has 453 places, 591 transitions, 4122 flow. Second operand 146 states and 11294 transitions. [2022-11-21 16:20:50,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 1782 transitions, 18036 flow [2022-11-21 16:20:52,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 1782 transitions, 16548 flow, removed 399 selfloop flow, removed 66 redundant places. [2022-11-21 16:20:52,659 INFO L231 Difference]: Finished difference. Result has 593 places, 871 transitions, 9656 flow [2022-11-21 16:20:52,660 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=3582, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=376, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=9656, PETRI_PLACES=593, PETRI_TRANSITIONS=871} [2022-11-21 16:20:52,661 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 452 predicate places. [2022-11-21 16:20:52,661 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 871 transitions, 9656 flow [2022-11-21 16:20:52,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 71.28395061728395) internal successors, (5774), 81 states have internal predecessors, (5774), 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-21 16:20:52,663 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:20:52,664 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:20:52,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 16:20:52,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-21 16:20:52,870 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-21 16:20:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:20:52,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1803614132, now seen corresponding path program 4 times [2022-11-21 16:20:52,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:20:52,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521032452] [2022-11-21 16:20:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:20:52,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:20:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:20:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-21 16:20:53,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:20:53,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521032452] [2022-11-21 16:20:53,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521032452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:20:53,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338807064] [2022-11-21 16:20:53,069 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-21 16:20:53,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:20:53,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:20:53,071 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:20:53,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 16:20:53,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-21 16:20:53,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:20:53,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-21 16:20:53,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:20:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:53,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:20:54,551 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:20:54,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338807064] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:20:54,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:20:54,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 11] total 22 [2022-11-21 16:20:54,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798560101] [2022-11-21 16:20:54,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:20:54,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-21 16:20:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:20:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-21 16:20:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-11-21 16:20:54,558 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 156 [2022-11-21 16:20:54,562 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 871 transitions, 9656 flow. Second operand has 22 states, 22 states have (on average 124.13636363636364) internal successors, (2731), 22 states have internal predecessors, (2731), 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-21 16:20:54,562 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:20:54,562 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 156 [2022-11-21 16:20:54,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:20:58,214 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([450] L81-->L71: Formula: (not (= (mod |v_thread2Thread1of1ForFork2_~cond~1#1_5| 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} OutVars{thread2Thread1of1ForFork2_~cond~1#1=|v_thread2Thread1of1ForFork2_~cond~1#1_5|} AuxVars[] AssignedVars[][124], [Black: 4560#(and (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (mod ~v_assert~0 256) 0) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1)), Black: 4498#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4441#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 1809#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 4486#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1831#(and (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4473#(and (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4514#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1813#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 ~W~0)), Black: 4488#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~d~0 ~W~0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4544#(and (<= ~d~0 ~W~0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4532#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4546#(and (<= ~d~0 ~W~0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 1897#(and (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4465#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4370#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~d~0) 2)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~back~0 ~front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)))))), Black: 1807#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= ~back~0 ~front~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1797#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 4494#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3952#(not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0)), Black: 912#true, Black: 4439#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4502#(and (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 4554#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (< (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) (+ ~W~0 1)) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4478#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (< (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) (+ ~W~0 1)) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3483#(<= ~d~0 ~W~0), Black: 4457#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~d~0 1) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4424#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~d~0) 2)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (or (not (< ~back~0 ~n~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)) (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4))) ~d~0) 2))) (not (<= 0 ~back~0))) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (< (+ ~d~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0)) (or (and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~back~0 4)) 0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0)))), Black: 4386#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2)) (not (<= 0 ~back~0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~back~0 ~front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~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: 4467#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4475#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 4433#(and (<= ~d~0 1) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), 21#L71true, Black: 4431#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~d~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4524#(and (<= ~d~0 ~W~0) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 4542#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~d~0 1) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (= (mod ~v_assert~0 256) 0) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~d~0 0) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4414#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) ~d~0) 2)))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (or (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (or (not (< ~back~0 ~n~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~back~0 4))) 1)) (< (+ (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_main_#t~ret9#1.base|) (+ |ULTIMATE.start_main_#t~ret9#1.offset| (* ~front~0 4))) ~d~0) 2))) (not (<= 0 ~back~0))) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (or (< (+ ~d~0 (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~front~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) 2) (not (= (select (select (store |#memory_int| |ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_184) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~back~0 4) |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1))))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0)) (or (and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~back~0 4)) 0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0)))), Black: 4007#(forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))), Black: 4552#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4427#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0)) (or (and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (not (= (+ ~queue~0.offset (* ~back~0 4)) 0)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|))))) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (< (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (<= 0 ~back~0)))), Black: 4490#(and (<= ~d~0 ~W~0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4471#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4540#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4404#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 3967#(< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)), Black: 4463#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~d~0 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (= (mod ~v_assert~0 256) 0) (and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= (mod ~v_assert~0 256) 0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (= (mod ~v_assert~0 256) 0) (not (<= 0 ~back~0))) (<= ~d~0 0) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (= (mod ~v_assert~0 256) 0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 3265#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3281#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3275#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3285#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3291#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3323#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3317#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= (+ (* ~front~0 4) ~queue~0.offset) 0) (= ~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|)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3263#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3289#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3305#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 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)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3311#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= (+ (* ~front~0 4) ~queue~0.offset) 0) (= ~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|)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3355#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (or (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 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)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3237#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (= ~queue~0.offset 0) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|)))), Black: 190#(= |thread2Thread1of1ForFork2_~cond~1#1| 1), Black: 3329#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4)) (< ~front~0 0)) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 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)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (and (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (= (* ~front~0 4) (* ~back~0 4))) (not (< ~back~0 ~n~0)) (<= ~n~0 ~front~0) (not (<= 0 ~back~0)) (< ~front~0 0))), Black: 605#(or (= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (not (<= (mod ~v_assert~0 256) 0))), Black: 3283#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (= (+ (* ~front~0 4) ~queue~0.offset) 0) (= ~queue~0.offset 0) (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 3261#(and (or (< |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (or (and (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~back~0 ~front~0) (or (not (= ~queue~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)))) (not (= (+ ~queue~0.offset (* ~back~0 4)) 0))) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (< |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (or (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (not (<= |ULTIMATE.start_main_~#t3~0#1.base| |ULTIMATE.start_main_#t~ret9#1.base|))) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 3375#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (= ~d~0 0) (or (forall ((v_ArrVal_149 (Array Int Int))) (< (+ ~d~0 (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_149) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset))) (+ ~W~0 1))) (<= ~n~0 ~front~0) (< ~front~0 0)) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 906#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 1787#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= ~back~0 ~front~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1925#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1799#(and (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (or (< ~d~0 ~W~0) (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1845#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0)), 4445#(and (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1821#(and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~n~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0)) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 181#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (<= ~d~0 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 2003#(and (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), 3273#(and (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1875#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1951#(and (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1793#(and (<= 1 ~v_assert~0) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (<= ~v_assert~0 1) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 1869#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 ~W~0)), Black: 1819#(and (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (<= ~n~0 1)) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 2035#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1833#(and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~n~0 1)) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0)) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1879#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0)), 158#true, Black: 1853#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 2001#(and (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1919#(and (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1981#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0)), 82#L112-1true, Black: 1943#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), 5492#(and (or (< ~n~0 (+ 2 ~front~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (< ~n~0 (+ 2 ~front~0)) (not (<= 0 ~back~0))) (<= ~back~0 ~front~0)), Black: 2033#(and (= ~d~0 0) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (<= (+ (* ~front~0 4) ~queue~0.offset) 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1773#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= |ULTIMATE.start_create_fresh_int_array_#t~post20#1| 0) (<= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1789#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (= ~queue~0.offset 0) (<= 1 ~W~0) (<= ~back~0 ~front~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1795#(and (or (<= (+ ~queue~0.offset (* ~back~0 4)) 0) (not (= (+ (* ~front~0 4) ~queue~0.offset) 0)) (<= ~n~0 1)) (<= 1 ~v_assert~0) (<= |thread1Thread1of1ForFork1_~w~0#1| ~W~0) (<= ~v_assert~0 1) (= ~d~0 0) (or (<= (+ ~front~0 ~n~0) (+ ~back~0 1)) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (= ~queue~0.offset 0) (<= 1 ~W~0) (or (< 0 (+ (* ~front~0 4) ~queue~0.offset 1)) (<= ~back~0 ~front~0))), Black: 4562#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (< (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) (+ ~W~0 1)) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1991#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)) (= (* ~front~0 4) (* ~back~0 4))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4508#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 2009#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4528#(and (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4420#(and (<= ~d~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1843#(and (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (<= ~front~0 ~back~0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< ~d~0 ~W~0) (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4469#(and (<= ~d~0 ~W~0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4482#(and (<= ~d~0 1) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1893#(and (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (and (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1))) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), 1849#(and (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1815#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (= (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) 1) (<= 0 ~front~0) (= ~queue~0.offset 0) (<= 1 ~W~0) (<= (+ (* ~front~0 4) ~queue~0.offset) 0)), Black: 4522#(and (<= ~d~0 ~W~0) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), 115#thread3ENTRYtrue, Black: 4492#(and (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 1769#(and (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4500#(and (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (not (<= (mod |thread2Thread1of1ForFork2_~cond~1#1| 256) 0))), Black: 4572#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= ~d~0 ~W~0)), Black: 1775#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (<= ~back~0 ~front~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 4570#(and (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4455#(and (<= ~d~0 1) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4380#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ ~front~0 ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~back~0)) (= ~v_assert~0 1) (<= ~front~0 ~back~0) (or (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) 2)) (not (<= 0 ~back~0))) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 2) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~back~0 ~front~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~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: 4480#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 4422#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 4484#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4556#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (<= ~d~0 1) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= (div |thread2Thread1of1ForFork2_~cond~1#1| 256) 0) (<= ~d~0 0) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 3460#true, Black: 4437#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (forall ((v_ArrVal_186 (Array Int Int))) (< (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1)), Black: 4510#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (not (< ~back~0 ~n~0)) (< 1 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (or (< 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (< ~back~0 ~n~0)) (and (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (<= 0 ~back~0))) (< (+ |thread2Thread1of1ForFork2_~temp~0#1| ~d~0) (+ ~W~0 1)) (<= 1 ~W~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|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|))) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0) (or (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= 0 (mod |thread1Thread1of1ForFork1_~cond~0#1| 256)))), Black: 4451#(and (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t3~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= ~d~0 0) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (<= 1 ~W~0) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#t1~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |thread2Thread1of1ForFork2_~temp~0#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0)), Black: 1949#(and (<= 1 ~v_assert~0) (<= ~v_assert~0 1) (= ~d~0 0) (< (+ (select (select |#memory_int| ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1)) (or (< 0 ~back~0) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0)) (= (* ~front~0 4) (* ~back~0 4))) (<= 1 ~W~0)), Black: 4526#(and (or (not (< 0 |thread1Thread1of1ForFork1_~w~0#1|)) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_185 (Array Int Int))) (< (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_185) |ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_186) ~queue~0.base) (+ (* ~front~0 4) ~queue~0.offset)) ~d~0) (+ ~W~0 1))) (not (= (select (select |#memory_int| ~queue~0.base) (+ ~queue~0.offset (* ~back~0 4))) 1)) (not (< ~back~0 ~n~0)) (not (<= 0 ~back~0))) (<= ~d~0 ~W~0) (or (< 0 ~back~0) (and (not (< |ULTIMATE.start_main_~#t3~0#1.base| |#StackHeapBarrier|)) (not (< |ULTIMATE.start_main_~#t2~0#1.base| |#StackHeapBarrier|)) (= (* ~front~0 4) (* ~back~0 4)) (< ~d~0 1)) (not (<= 0 ~back~0))) (<= 1 |thread2Thread1of1ForFork2_~cond~1#1|) (<= |thread2Thread1of1ForFork2_~cond~1#1| 1) (= |thread2Thread1of1ForFork2_~cond~1#1| ~v_assert~0))]) [2022-11-21 16:20:58,220 INFO L383 tUnfolder$Statistics]: this new event has 131 ancestors and is cut-off event [2022-11-21 16:20:58,220 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 16:20:58,221 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 16:20:58,221 INFO L386 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-11-21 16:20:58,709 INFO L130 PetriNetUnfolder]: 3109/10858 cut-off events. [2022-11-21 16:20:58,709 INFO L131 PetriNetUnfolder]: For 453094/458503 co-relation queries the response was YES. [2022-11-21 16:20:58,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57939 conditions, 10858 events. 3109/10858 cut-off events. For 453094/458503 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 123263 event pairs, 984 based on Foata normal form. 449/10651 useless extension candidates. Maximal degree in co-relation 57815. Up to 3015 conditions per place. [2022-11-21 16:20:58,861 INFO L137 encePairwiseOnDemand]: 141/156 looper letters, 120 selfloop transitions, 100 changer transitions 357/925 dead transitions. [2022-11-21 16:20:58,862 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 925 transitions, 10581 flow [2022-11-21 16:20:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 16:20:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-21 16:20:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2365 transitions. [2022-11-21 16:20:58,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7979082321187584 [2022-11-21 16:20:58,865 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2365 transitions. [2022-11-21 16:20:58,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2365 transitions. [2022-11-21 16:20:58,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:20:58,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2365 transitions. [2022-11-21 16:20:58,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 124.47368421052632) internal successors, (2365), 19 states have internal predecessors, (2365), 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-21 16:20:58,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 156.0) internal successors, (3120), 20 states have internal predecessors, (3120), 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-21 16:20:58,873 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 156.0) internal successors, (3120), 20 states have internal predecessors, (3120), 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-21 16:20:58,874 INFO L175 Difference]: Start difference. First operand has 593 places, 871 transitions, 9656 flow. Second operand 19 states and 2365 transitions. [2022-11-21 16:20:58,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 925 transitions, 10581 flow [2022-11-21 16:21:00,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 925 transitions, 8236 flow, removed 1084 selfloop flow, removed 48 redundant places. [2022-11-21 16:21:00,987 INFO L231 Difference]: Finished difference. Result has 563 places, 553 transitions, 4750 flow [2022-11-21 16:21:00,988 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=6981, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=834, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4750, PETRI_PLACES=563, PETRI_TRANSITIONS=553} [2022-11-21 16:21:00,988 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 422 predicate places. [2022-11-21 16:21:00,989 INFO L495 AbstractCegarLoop]: Abstraction has has 563 places, 553 transitions, 4750 flow [2022-11-21 16:21:00,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 124.13636363636364) internal successors, (2731), 22 states have internal predecessors, (2731), 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-21 16:21:00,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:21:00,990 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 16:21:00,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 16:21:01,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:01,191 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-21 16:21:01,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:01,191 INFO L85 PathProgramCache]: Analyzing trace with hash 667132448, now seen corresponding path program 1 times [2022-11-21 16:21:01,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:01,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147195566] [2022-11-21 16:21:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:01,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:01,313 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:21:01,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:01,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147195566] [2022-11-21 16:21:01,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147195566] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:21:01,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423725789] [2022-11-21 16:21:01,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:01,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:01,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:21:01,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 16:21:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:01,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-21 16:21:01,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:21:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 16:21:01,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:21:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 16:21:01,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423725789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:21:01,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:21:01,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2022-11-21 16:21:01,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701942864] [2022-11-21 16:21:01,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:21:01,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 16:21:01,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:01,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 16:21:01,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 16:21:01,708 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 156 [2022-11-21 16:21:01,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 553 transitions, 4750 flow. Second operand has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-21 16:21:01,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:21:01,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 156 [2022-11-21 16:21:01,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:21:04,655 INFO L130 PetriNetUnfolder]: 2763/8773 cut-off events. [2022-11-21 16:21:04,655 INFO L131 PetriNetUnfolder]: For 311342/314684 co-relation queries the response was YES. [2022-11-21 16:21:04,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44885 conditions, 8773 events. 2763/8773 cut-off events. For 311342/314684 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 91233 event pairs, 1288 based on Foata normal form. 405/8654 useless extension candidates. Maximal degree in co-relation 44760. Up to 2621 conditions per place. [2022-11-21 16:21:04,948 INFO L137 encePairwiseOnDemand]: 151/156 looper letters, 220 selfloop transitions, 12 changer transitions 0/461 dead transitions. [2022-11-21 16:21:04,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 461 transitions, 4186 flow [2022-11-21 16:21:04,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 16:21:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-21 16:21:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 963 transitions. [2022-11-21 16:21:04,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8818681318681318 [2022-11-21 16:21:04,952 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 963 transitions. [2022-11-21 16:21:04,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 963 transitions. [2022-11-21 16:21:04,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:21:04,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 963 transitions. [2022-11-21 16:21:04,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.57142857142858) internal successors, (963), 7 states have internal predecessors, (963), 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-21 16:21:04,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:21:04,959 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 156.0) internal successors, (1248), 8 states have internal predecessors, (1248), 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-21 16:21:04,959 INFO L175 Difference]: Start difference. First operand has 563 places, 553 transitions, 4750 flow. Second operand 7 states and 963 transitions. [2022-11-21 16:21:04,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 461 transitions, 4186 flow [2022-11-21 16:21:05,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 461 transitions, 3889 flow, removed 109 selfloop flow, removed 75 redundant places. [2022-11-21 16:21:05,448 INFO L231 Difference]: Finished difference. Result has 355 places, 419 transitions, 3192 flow [2022-11-21 16:21:05,451 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=3126, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3192, PETRI_PLACES=355, PETRI_TRANSITIONS=419} [2022-11-21 16:21:05,453 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 214 predicate places. [2022-11-21 16:21:05,453 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 419 transitions, 3192 flow [2022-11-21 16:21:05,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 134.5) internal successors, (1076), 8 states have internal predecessors, (1076), 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-21 16:21:05,454 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:21:05,454 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2022-11-21 16:21:05,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 16:21:05,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-21 16:21:05,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:21:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:21:05,662 INFO L85 PathProgramCache]: Analyzing trace with hash 2002196128, now seen corresponding path program 5 times [2022-11-21 16:21:05,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:21:05,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069817253] [2022-11-21 16:21:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:21:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:21:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:21:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:21:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:21:08,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069817253] [2022-11-21 16:21:08,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069817253] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:21:08,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298329436] [2022-11-21 16:21:08,764 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-21 16:21:08,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:21:08,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:21:08,765 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:21:08,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 16:21:08,900 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-11-21 16:21:08,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:21:08,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-21 16:21:08,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:21:08,948 INFO L350 Elim1Store]: Elim1 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-21 16:21:08,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 16:21:08,997 INFO L350 Elim1Store]: Elim1 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-21 16:21:09,400 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-21 16:21:09,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 16:21:10,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-21 16:21:11,080 INFO L350 Elim1Store]: Elim1 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-21 16:21:11,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-11-21 16:21:11,419 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 16:21:11,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:21:11,738 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_294 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1))) (= (mod |c_thread2Thread1of1ForFork2_~cond~1#1| 256) 0)) is different from false [2022-11-21 16:21:11,792 WARN L837 $PredicateComparison]: unable to prove that (or (= (mod c_~v_assert~0 256) 0) (forall ((v_ArrVal_294 (Array Int Int))) (< (+ c_~d~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4)))) (+ c_~W~0 1)))) is different from false [2022-11-21 16:21:12,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:21:12,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 178 [2022-11-21 16:21:12,327 INFO L350 Elim1Store]: Elim1 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 162 treesize of output 138 [2022-11-21 16:21:12,337 INFO L350 Elim1Store]: Elim1 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 75 treesize of output 63 [2022-11-21 16:21:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2022-11-21 16:21:14,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298329436] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:21:14,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:21:14,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 25] total 77 [2022-11-21 16:21:14,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077835373] [2022-11-21 16:21:14,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:21:14,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-21 16:21:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:21:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-21 16:21:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=5139, Unknown=11, NotChecked=294, Total=5852 [2022-11-21 16:21:14,573 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 156 [2022-11-21 16:21:14,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 419 transitions, 3192 flow. Second operand has 77 states, 77 states have (on average 73.81818181818181) internal successors, (5684), 77 states have internal predecessors, (5684), 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-21 16:21:14,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:21:14,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 156 [2022-11-21 16:21:14,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-21 16:21:21,327 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 91 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:21:47,337 WARN L233 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 52 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:05,610 WARN L233 SmtUtils]: Spent 6.31s on a formula simplification. DAG size of input: 64 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:12,127 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 66 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:18,581 WARN L233 SmtUtils]: Spent 6.28s on a formula simplification. DAG size of input: 64 DAG size of output: 55 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:34,634 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 71 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:41,539 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 62 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:49,995 WARN L233 SmtUtils]: Spent 6.19s on a formula simplification. DAG size of input: 68 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:22:52,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:22:58,332 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:04,700 WARN L233 SmtUtils]: Spent 6.25s on a formula simplification. DAG size of input: 50 DAG size of output: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:07,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:23:22,119 WARN L233 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 75 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:31,055 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 69 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:33,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-21 16:23:39,931 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 53 DAG size of output: 46 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:23:52,989 WARN L233 SmtUtils]: Spent 8.24s on a formula simplification. DAG size of input: 75 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:04,876 WARN L233 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 80 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:11,351 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 51 DAG size of output: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 16:24:19,960 INFO L130 PetriNetUnfolder]: 16928/35832 cut-off events. [2022-11-21 16:24:19,961 INFO L131 PetriNetUnfolder]: For 480791/481284 co-relation queries the response was YES. [2022-11-21 16:24:20,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168775 conditions, 35832 events. 16928/35832 cut-off events. For 480791/481284 co-relation queries the response was YES. Maximal size of possible extension queue 1301. Compared 373128 event pairs, 2031 based on Foata normal form. 226/35941 useless extension candidates. Maximal degree in co-relation 168704. Up to 10417 conditions per place. [2022-11-21 16:24:20,591 INFO L137 encePairwiseOnDemand]: 119/156 looper letters, 745 selfloop transitions, 597 changer transitions 171/1576 dead transitions. [2022-11-21 16:24:20,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 1576 transitions, 17673 flow [2022-11-21 16:24:20,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-21 16:24:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2022-11-21 16:24:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 9561 transitions. [2022-11-21 16:24:20,608 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4982801751094434 [2022-11-21 16:24:20,608 INFO L72 ComplementDD]: Start complementDD. Operand 123 states and 9561 transitions. [2022-11-21 16:24:20,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 9561 transitions. [2022-11-21 16:24:20,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-21 16:24:20,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 123 states and 9561 transitions. [2022-11-21 16:24:20,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 124 states, 123 states have (on average 77.73170731707317) internal successors, (9561), 123 states have internal predecessors, (9561), 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-21 16:24:20,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 124 states, 124 states have (on average 156.0) internal successors, (19344), 124 states have internal predecessors, (19344), 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-21 16:24:20,659 INFO L81 ComplementDD]: Finished complementDD. Result has 124 states, 124 states have (on average 156.0) internal successors, (19344), 124 states have internal predecessors, (19344), 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-21 16:24:20,659 INFO L175 Difference]: Start difference. First operand has 355 places, 419 transitions, 3192 flow. Second operand 123 states and 9561 transitions. [2022-11-21 16:24:20,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 1576 transitions, 17673 flow [2022-11-21 16:24:23,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 474 places, 1576 transitions, 17537 flow, removed 52 selfloop flow, removed 3 redundant places. [2022-11-21 16:24:23,015 INFO L231 Difference]: Finished difference. Result has 527 places, 824 transitions, 9135 flow [2022-11-21 16:24:23,016 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=156, PETRI_DIFFERENCE_MINUEND_FLOW=3180, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=123, PETRI_FLOW=9135, PETRI_PLACES=527, PETRI_TRANSITIONS=824} [2022-11-21 16:24:23,017 INFO L288 CegarLoopForPetriNet]: 141 programPoint places, 386 predicate places. [2022-11-21 16:24:23,017 INFO L495 AbstractCegarLoop]: Abstraction has has 527 places, 824 transitions, 9135 flow [2022-11-21 16:24:23,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 73.81818181818181) internal successors, (5684), 77 states have internal predecessors, (5684), 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-21 16:24:23,018 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-21 16:24:23,018 INFO L209 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-21 16:24:23,023 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-21 16:24:23,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:23,220 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-21 16:24:23,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 16:24:23,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1097545103, now seen corresponding path program 6 times [2022-11-21 16:24:23,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 16:24:23,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320906601] [2022-11-21 16:24:23,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 16:24:23,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 16:24:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 16:24:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:29,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 16:24:29,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320906601] [2022-11-21 16:24:29,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320906601] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 16:24:29,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109288363] [2022-11-21 16:24:29,178 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-21 16:24:29,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 16:24:29,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 16:24:29,180 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 16:24:29,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a605465e-2af7-4bd9-92d5-b8454a5f868e/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 16:24:29,443 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-21 16:24:29,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-21 16:24:29,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-21 16:24:29,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 16:24:31,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-21 16:24:32,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-21 16:24:32,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:32,793 INFO L350 Elim1Store]: Elim1 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-21 16:24:33,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 16:24:33,451 INFO L350 Elim1Store]: Elim1 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-21 16:24:34,654 INFO L321 Elim1Store]: treesize reduction 24, result has 11.1 percent of original size [2022-11-21 16:24:34,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 16 [2022-11-21 16:24:34,998 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:34,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 16:24:39,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:39,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2022-11-21 16:24:40,001 INFO L321 Elim1Store]: treesize reduction 12, result has 81.5 percent of original size [2022-11-21 16:24:40,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 808 treesize of output 802 [2022-11-21 16:24:40,044 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:40,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 726 treesize of output 600 [2022-11-21 16:24:40,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 16:24:40,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:40,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 437 treesize of output 445 [2022-11-21 16:24:40,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 16:24:40,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 486 [2022-11-21 16:24:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 16:24:51,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109288363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 16:24:51,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 16:24:51,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 35, 35] total 95 [2022-11-21 16:24:51,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559539424] [2022-11-21 16:24:51,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 16:24:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-11-21 16:24:51,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 16:24:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-11-21 16:24:51,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=640, Invalid=8273, Unknown=17, NotChecked=0, Total=8930 [2022-11-21 16:24:51,880 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 156 [2022-11-21 16:24:51,883 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 824 transitions, 9135 flow. Second operand has 95 states, 95 states have (on average 72.38947368421053) internal successors, (6877), 95 states have internal predecessors, (6877), 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-21 16:24:51,883 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-21 16:24:51,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 156 [2022-11-21 16:24:51,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand