./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-11-25 20:09:28,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-25 20:09:28,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-25 20:09:28,768 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-25 20:09:28,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-25 20:09:28,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-25 20:09:28,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-25 20:09:28,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-25 20:09:28,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-25 20:09:28,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-25 20:09:28,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-25 20:09:28,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-25 20:09:28,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-25 20:09:28,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-25 20:09:28,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-25 20:09:28,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-25 20:09:28,786 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-25 20:09:28,787 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-25 20:09:28,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-25 20:09:28,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-25 20:09:28,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-25 20:09:28,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-25 20:09:28,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-25 20:09:28,799 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-25 20:09:28,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-25 20:09:28,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-25 20:09:28,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-25 20:09:28,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-25 20:09:28,806 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-25 20:09:28,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-25 20:09:28,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-25 20:09:28,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-25 20:09:28,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-25 20:09:28,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-25 20:09:28,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-25 20:09:28,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-25 20:09:28,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-25 20:09:28,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-25 20:09:28,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-25 20:09:28,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-25 20:09:28,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-25 20:09:28,817 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-25 20:09:28,854 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-25 20:09:28,855 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-25 20:09:28,855 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-25 20:09:28,855 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-25 20:09:28,856 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-25 20:09:28,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-25 20:09:28,857 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-25 20:09:28,861 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-25 20:09:28,861 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-25 20:09:28,861 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-25 20:09:28,862 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-25 20:09:28,862 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-25 20:09:28,863 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-25 20:09:28,863 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-25 20:09:28,863 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-25 20:09:28,863 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-25 20:09:28,863 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-25 20:09:28,864 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-25 20:09:28,865 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-25 20:09:28,865 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-25 20:09:28,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-25 20:09:28,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-25 20:09:28,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-25 20:09:28,866 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-25 20:09:28,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-25 20:09:28,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-25 20:09:28,868 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-25 20:09:28,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-25 20:09:28,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-25 20:09:28,869 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-25 20:09:28,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-25 20:09:28,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-25 20:09:28,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:09:28,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-25 20:09:28,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-25 20:09:28,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-25 20:09:28,870 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-25 20:09:28,870 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-25 20:09:28,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-25 20:09:28,871 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-25 20:09:28,871 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-25 20:09:28,871 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/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_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7 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 -> Taipan 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2021-11-25 20:09:29,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-25 20:09:29,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-25 20:09:29,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-25 20:09:29,194 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-25 20:09:29,194 INFO L275 PluginConnector]: CDTParser initialized [2021-11-25 20:09:29,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2021-11-25 20:09:29,266 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/data/f752a0f4e/0c9cb1d905f84aa0a03f828a8470b2b6/FLAGf7d3b7b8c [2021-11-25 20:09:29,823 INFO L306 CDTParser]: Found 1 translation units. [2021-11-25 20:09:29,823 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/sv-benchmarks/c/pthread/queue_ok_longest.i [2021-11-25 20:09:29,857 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/data/f752a0f4e/0c9cb1d905f84aa0a03f828a8470b2b6/FLAGf7d3b7b8c [2021-11-25 20:09:30,111 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/data/f752a0f4e/0c9cb1d905f84aa0a03f828a8470b2b6 [2021-11-25 20:09:30,114 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-25 20:09:30,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-25 20:09:30,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-25 20:09:30,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-25 20:09:30,120 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-25 20:09:30,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:30,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c99515d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30, skipping insertion in model container [2021-11-25 20:09:30,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:30,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-25 20:09:30,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-25 20:09:30,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2021-11-25 20:09:30,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2021-11-25 20:09:30,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:09:30,809 INFO L203 MainTranslator]: Completed pre-run [2021-11-25 20:09:30,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/sv-benchmarks/c/pthread/queue_ok_longest.i[43280,43293] [2021-11-25 20:09:30,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/sv-benchmarks/c/pthread/queue_ok_longest.i[43553,43566] [2021-11-25 20:09:30,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-25 20:09:30,949 INFO L208 MainTranslator]: Completed translation [2021-11-25 20:09:30,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30 WrapperNode [2021-11-25 20:09:30,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-25 20:09:30,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-25 20:09:30,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-25 20:09:30,952 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-25 20:09:30,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:30,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,034 INFO L137 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2021-11-25 20:09:31,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-25 20:09:31,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-25 20:09:31,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-25 20:09:31,035 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-25 20:09:31,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,063 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,071 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-25 20:09:31,071 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-25 20:09:31,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-25 20:09:31,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-25 20:09:31,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (1/1) ... [2021-11-25 20:09:31,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-25 20:09:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:31,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-25 20:09:31,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-25 20:09:31,146 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-25 20:09:31,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-25 20:09:31,146 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-25 20:09:31,146 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-25 20:09:31,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-25 20:09:31,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-25 20:09:31,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-25 20:09:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-25 20:09:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-25 20:09:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-25 20:09:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-25 20:09:31,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-25 20:09:31,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-25 20:09:31,149 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-25 20:09:31,274 INFO L236 CfgBuilder]: Building ICFG [2021-11-25 20:09:31,276 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-25 20:09:31,704 INFO L277 CfgBuilder]: Performing block encoding [2021-11-25 20:09:31,715 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-25 20:09:31,715 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-25 20:09:31,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:09:31 BoogieIcfgContainer [2021-11-25 20:09:31,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-25 20:09:31,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-25 20:09:31,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-25 20:09:31,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-25 20:09:31,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:09:30" (1/3) ... [2021-11-25 20:09:31,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce46bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:09:31, skipping insertion in model container [2021-11-25 20:09:31,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:09:30" (2/3) ... [2021-11-25 20:09:31,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce46bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:09:31, skipping insertion in model container [2021-11-25 20:09:31,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:09:31" (3/3) ... [2021-11-25 20:09:31,727 INFO L111 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2021-11-25 20:09:31,742 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-25 20:09:31,742 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-25 20:09:31,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-25 20:09:31,742 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-25 20:09:31,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,792 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,793 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,805 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,809 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,810 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,811 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,812 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,812 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,813 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,814 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,815 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,816 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,816 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,817 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,817 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,840 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,841 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,842 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,843 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,844 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,845 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,846 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,847 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,848 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,849 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,849 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,865 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,866 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,867 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,868 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,869 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,870 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,871 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,877 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,879 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,880 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,881 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,882 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,883 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,884 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,888 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,889 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,890 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,891 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,892 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,893 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,894 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,907 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,908 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,909 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,910 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,914 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,915 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,916 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,917 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,918 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,919 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,920 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,921 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,922 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,923 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,924 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,925 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,925 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,927 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,927 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,927 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,927 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,928 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,928 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,928 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,928 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,929 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,930 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,931 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,932 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,933 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,934 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,935 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,936 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,937 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,946 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,952 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,954 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,959 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,960 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,961 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,962 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,963 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,964 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,965 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,966 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,976 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,977 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,977 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,977 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,978 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,984 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~value~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,985 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,986 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,987 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,988 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,988 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,989 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,989 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,989 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~post38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,989 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,989 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_enqueue_#t~mem37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,994 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~mem57#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,995 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,996 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,998 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~x~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,999 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,999 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,999 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,999 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~nondet33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:31,999 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~post48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,000 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,002 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,003 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#t~mem43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dequeue_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,004 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_empty_#in~q#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-25 20:09:32,014 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-25 20:09:32,059 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-25 20:09:32,065 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-11-25 20:09:32,066 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-11-25 20:09:32,085 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-11-25 20:09:32,098 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 225 places, 231 transitions, 478 flow [2021-11-25 20:09:32,101 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 225 places, 231 transitions, 478 flow [2021-11-25 20:09:32,103 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2021-11-25 20:09:32,200 INFO L129 PetriNetUnfolder]: 13/229 cut-off events. [2021-11-25 20:09:32,200 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-11-25 20:09:32,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 369 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2021-11-25 20:09:32,218 INFO L116 LiptonReduction]: Number of co-enabled transitions 10630 [2021-11-25 20:09:41,704 INFO L131 LiptonReduction]: Checked pairs total: 21764 [2021-11-25 20:09:41,705 INFO L133 LiptonReduction]: Total number of compositions: 219 [2021-11-25 20:09:41,722 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 51 transitions, 118 flow [2021-11-25 20:09:41,779 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:41,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2021-11-25 20:09:41,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:41,788 INFO L514 BasicCegarLoop]: trace histogram [1] [2021-11-25 20:09:41,789 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:41,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash 908, now seen corresponding path program 1 times [2021-11-25 20:09:41,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:41,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610972955] [2021-11-25 20:09:41,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:41,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:41,934 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:41,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610972955] [2021-11-25 20:09:41,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610972955] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:41,935 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:41,935 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2021-11-25 20:09:41,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922814411] [2021-11-25 20:09:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:41,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-25 20:09:41,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:41,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-25 20:09:41,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:09:41,967 INFO L87 Difference]: Start difference. First operand has 511 states, 509 states have (on average 2.6935166994106092) internal successors, (1371), 510 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:42,081 INFO L93 Difference]: Finished difference Result 510 states and 1370 transitions. [2021-11-25 20:09:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-25 20:09:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2021-11-25 20:09:42,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:42,109 INFO L225 Difference]: With dead ends: 510 [2021-11-25 20:09:42,109 INFO L226 Difference]: Without dead ends: 510 [2021-11-25 20:09:42,110 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-25 20:09:42,117 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:42,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:42,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-11-25 20:09:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-11-25 20:09:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.6915520628683693) internal successors, (1370), 509 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1370 transitions. [2021-11-25 20:09:42,229 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1370 transitions. Word has length 1 [2021-11-25 20:09:42,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:42,229 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1370 transitions. [2021-11-25 20:09:42,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1370 transitions. [2021-11-25 20:09:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-25 20:09:42,233 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:42,233 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:42,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-25 20:09:42,234 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:42,234 INFO L85 PathProgramCache]: Analyzing trace with hash 2036548527, now seen corresponding path program 1 times [2021-11-25 20:09:42,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:42,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114305927] [2021-11-25 20:09:42,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:42,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:42,454 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:42,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114305927] [2021-11-25 20:09:42,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114305927] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:42,454 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:42,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-25 20:09:42,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892274433] [2021-11-25 20:09:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:42,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:42,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:42,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:42,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,457 INFO L87 Difference]: Start difference. First operand 510 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:42,515 INFO L93 Difference]: Finished difference Result 220 states and 476 transitions. [2021-11-25 20:09:42,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:42,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-11-25 20:09:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:42,517 INFO L225 Difference]: With dead ends: 220 [2021-11-25 20:09:42,517 INFO L226 Difference]: Without dead ends: 198 [2021-11-25 20:09:42,518 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,519 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:42,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 6 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-25 20:09:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-11-25 20:09:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2021-11-25 20:09:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 2.203045685279188) internal successors, (434), 197 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 434 transitions. [2021-11-25 20:09:42,530 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 434 transitions. Word has length 15 [2021-11-25 20:09:42,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:42,531 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 434 transitions. [2021-11-25 20:09:42,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,531 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 434 transitions. [2021-11-25 20:09:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-25 20:09:42,533 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:42,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:42,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-25 20:09:42,533 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:42,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:42,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1851270233, now seen corresponding path program 1 times [2021-11-25 20:09:42,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:42,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670492397] [2021-11-25 20:09:42,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:42,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:42,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:42,601 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670492397] [2021-11-25 20:09:42,601 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670492397] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:42,602 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:42,602 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:42,602 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468014126] [2021-11-25 20:09:42,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:42,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:42,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,604 INFO L87 Difference]: Start difference. First operand 198 states and 434 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:42,689 INFO L93 Difference]: Finished difference Result 258 states and 560 transitions. [2021-11-25 20:09:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:42,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-25 20:09:42,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:42,692 INFO L225 Difference]: With dead ends: 258 [2021-11-25 20:09:42,692 INFO L226 Difference]: Without dead ends: 258 [2021-11-25 20:09:42,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,693 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:42,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:42,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-11-25 20:09:42,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2021-11-25 20:09:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.1970443349753697) internal successors, (446), 203 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 446 transitions. [2021-11-25 20:09:42,703 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 446 transitions. Word has length 19 [2021-11-25 20:09:42,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:42,704 INFO L470 AbstractCegarLoop]: Abstraction has 204 states and 446 transitions. [2021-11-25 20:09:42,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,704 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 446 transitions. [2021-11-25 20:09:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-25 20:09:42,705 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:42,706 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:09:42,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-25 20:09:42,706 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:42,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1917374764, now seen corresponding path program 1 times [2021-11-25 20:09:42,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:42,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577557294] [2021-11-25 20:09:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:42,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:42,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:42,802 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:42,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577557294] [2021-11-25 20:09:42,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577557294] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-25 20:09:42,805 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-25 20:09:42,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-25 20:09:42,806 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227390670] [2021-11-25 20:09:42,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-25 20:09:42,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-25 20:09:42,806 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:42,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-25 20:09:42,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,807 INFO L87 Difference]: Start difference. First operand 204 states and 446 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:42,869 INFO L93 Difference]: Finished difference Result 152 states and 304 transitions. [2021-11-25 20:09:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-25 20:09:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-11-25 20:09:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:42,871 INFO L225 Difference]: With dead ends: 152 [2021-11-25 20:09:42,871 INFO L226 Difference]: Without dead ends: 150 [2021-11-25 20:09:42,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-25 20:09:42,874 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:42,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 3 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:42,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-11-25 20:09:42,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-11-25 20:09:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.0201342281879193) internal successors, (301), 149 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 301 transitions. [2021-11-25 20:09:42,884 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 301 transitions. Word has length 26 [2021-11-25 20:09:42,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:42,884 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 301 transitions. [2021-11-25 20:09:42,885 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 301 transitions. [2021-11-25 20:09:42,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-25 20:09:42,886 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:42,886 INFO L514 BasicCegarLoop]: 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] [2021-11-25 20:09:42,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-25 20:09:42,886 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:42,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1649277712, now seen corresponding path program 1 times [2021-11-25 20:09:42,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:42,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938286769] [2021-11-25 20:09:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:42,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:42,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:42,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938286769] [2021-11-25 20:09:42,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938286769] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:42,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221803692] [2021-11-25 20:09:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:42,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:42,991 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:42,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-25 20:09:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:43,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-25 20:09:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:43,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:09:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:43,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221803692] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:09:43,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [290190980] [2021-11-25 20:09:43,373 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:09:43,391 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:09:43,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-11-25 20:09:43,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212977768] [2021-11-25 20:09:43,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:09:43,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-25 20:09:43,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:43,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-25 20:09:43,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:43,394 INFO L87 Difference]: Start difference. First operand 150 states and 301 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:43,548 INFO L93 Difference]: Finished difference Result 270 states and 523 transitions. [2021-11-25 20:09:43,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-25 20:09:43,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-11-25 20:09:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:43,551 INFO L225 Difference]: With dead ends: 270 [2021-11-25 20:09:43,551 INFO L226 Difference]: Without dead ends: 270 [2021-11-25 20:09:43,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-11-25 20:09:43,552 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:43,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 16 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-25 20:09:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-25 20:09:43,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-25 20:09:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.9442379182156133) internal successors, (523), 269 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 523 transitions. [2021-11-25 20:09:43,562 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 523 transitions. Word has length 27 [2021-11-25 20:09:43,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:43,563 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 523 transitions. [2021-11-25 20:09:43,563 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 523 transitions. [2021-11-25 20:09:43,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-25 20:09:43,565 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:43,565 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:43,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-25 20:09:43,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:43,782 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:43,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2065031247, now seen corresponding path program 2 times [2021-11-25 20:09:43,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:43,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072628252] [2021-11-25 20:09:43,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:43,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:44,001 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:44,002 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:44,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072628252] [2021-11-25 20:09:44,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072628252] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:44,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197501498] [2021-11-25 20:09:44,003 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:09:44,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:44,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:44,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:44,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-25 20:09:44,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:09:44,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:09:44,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 45 conjunts are in the unsatisfiable core [2021-11-25 20:09:44,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:45,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:09:45,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:09:45,180 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:09:45,263 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:09:45,277 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:09:45,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-11-25 20:09:45,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:09:45,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-25 20:09:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 22 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-25 20:09:45,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:09:48,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) is different from false [2021-11-25 20:09:48,761 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:48,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 20:09:48,772 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:48,772 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2021-11-25 20:09:48,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2021-11-25 20:09:49,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-25 20:09:49,164 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:49,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2021-11-25 20:09:49,413 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 2 not checked. [2021-11-25 20:09:49,413 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197501498] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:09:49,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1703145537] [2021-11-25 20:09:49,414 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:09:49,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:09:49,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2021-11-25 20:09:49,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127848497] [2021-11-25 20:09:49,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:09:49,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-11-25 20:09:49,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:49,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-11-25 20:09:49,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=6, NotChecked=32, Total=342 [2021-11-25 20:09:49,419 INFO L87 Difference]: Start difference. First operand 270 states and 523 transitions. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:49,988 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_~i~0#1|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:50,576 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:51,205 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:51,638 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:52,265 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:52,875 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| Int) (v_ArrVal_343 Int) (v_ArrVal_342 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_342) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85| 4) |c_~#queue~0.offset|) v_ArrVal_343) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_85|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:09:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:53,076 INFO L93 Difference]: Finished difference Result 797 states and 1491 transitions. [2021-11-25 20:09:53,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-11-25 20:09:53,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-25 20:09:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:53,086 INFO L225 Difference]: With dead ends: 797 [2021-11-25 20:09:53,086 INFO L226 Difference]: Without dead ends: 797 [2021-11-25 20:09:53,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=480, Invalid=1258, Unknown=12, NotChecked=602, Total=2352 [2021-11-25 20:09:53,088 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 350 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:53,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 58 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 839 Invalid, 0 Unknown, 318 Unchecked, 0.6s Time] [2021-11-25 20:09:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2021-11-25 20:09:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 452. [2021-11-25 20:09:53,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 451 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 834 transitions. [2021-11-25 20:09:53,112 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 834 transitions. Word has length 48 [2021-11-25 20:09:53,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:53,112 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 834 transitions. [2021-11-25 20:09:53,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:53,112 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 834 transitions. [2021-11-25 20:09:53,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-11-25 20:09:53,114 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:53,115 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:53,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-25 20:09:53,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-11-25 20:09:53,341 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:53,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:53,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1225844482, now seen corresponding path program 1 times [2021-11-25 20:09:53,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:53,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240636908] [2021-11-25 20:09:53,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:53,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:53,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:53,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240636908] [2021-11-25 20:09:53,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240636908] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:53,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465731208] [2021-11-25 20:09:53,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:53,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:53,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:53,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:53,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-25 20:09:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:53,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-25 20:09:53,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:53,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:09:53,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:53,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465731208] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:09:53,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845790233] [2021-11-25 20:09:53,948 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:09:53,949 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:09:53,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-11-25 20:09:53,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537629008] [2021-11-25 20:09:53,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:09:53,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-25 20:09:53,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:09:53,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-25 20:09:53,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:09:53,952 INFO L87 Difference]: Start difference. First operand 452 states and 834 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:09:54,187 INFO L93 Difference]: Finished difference Result 897 states and 1586 transitions. [2021-11-25 20:09:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-25 20:09:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2021-11-25 20:09:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:09:54,193 INFO L225 Difference]: With dead ends: 897 [2021-11-25 20:09:54,194 INFO L226 Difference]: Without dead ends: 897 [2021-11-25 20:09:54,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-11-25 20:09:54,195 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 174 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:09:54,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 29 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-25 20:09:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-11-25 20:09:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 816. [2021-11-25 20:09:54,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 1.7730061349693251) internal successors, (1445), 815 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1445 transitions. [2021-11-25 20:09:54,225 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1445 transitions. Word has length 49 [2021-11-25 20:09:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:09:54,226 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1445 transitions. [2021-11-25 20:09:54,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:09:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1445 transitions. [2021-11-25 20:09:54,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-11-25 20:09:54,229 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:09:54,229 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:09:54,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-25 20:09:54,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-11-25 20:09:54,446 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:09:54,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:09:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 521226462, now seen corresponding path program 2 times [2021-11-25 20:09:54,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:09:54,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861248243] [2021-11-25 20:09:54,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:09:54,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:09:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:09:54,709 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:09:54,710 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:09:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861248243] [2021-11-25 20:09:54,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861248243] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:09:54,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443679549] [2021-11-25 20:09:54,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:09:54,711 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:09:54,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:09:54,712 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:09:54,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-25 20:09:55,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-11-25 20:09:55,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:09:55,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 41 conjunts are in the unsatisfiable core [2021-11-25 20:09:55,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:09:55,870 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:09:55,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:09:55,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:09:56,003 INFO L354 Elim1Store]: treesize reduction 69, result has 15.9 percent of original size [2021-11-25 20:09:56,006 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2021-11-25 20:09:56,058 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-11-25 20:09:56,058 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2021-11-25 20:09:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 76 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2021-11-25 20:09:56,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:09:59,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse1) 800) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) is different from false [2021-11-25 20:09:59,506 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:59,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2021-11-25 20:09:59,515 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:59,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 77 [2021-11-25 20:09:59,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2021-11-25 20:09:59,713 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-25 20:09:59,728 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:09:59,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 62 [2021-11-25 20:10:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 68 proven. 45 refuted. 0 times theorem prover too weak. 204 trivial. 8 not checked. [2021-11-25 20:10:00,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443679549] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:10:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1365501593] [2021-11-25 20:10:00,033 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:10:00,034 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:10:00,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 7] total 25 [2021-11-25 20:10:00,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005990438] [2021-11-25 20:10:00,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:10:00,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:10:00,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:10:00,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:10:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=433, Unknown=6, NotChecked=44, Total=600 [2021-11-25 20:10:00,037 INFO L87 Difference]: Start difference. First operand 816 states and 1445 transitions. Second operand has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:00,571 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_~i~0#1|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:01,125 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:01,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:02,128 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:02,789 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:03,389 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:03,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:04,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:05,299 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:05,911 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:06,510 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:07,273 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (= (select .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_722 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| Int) (v_ArrVal_724 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_722) |c_~#queue~0.base|)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (or (< (select (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103| 4)) v_ArrVal_724) .cse2) 800) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_103|)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select .cse0 (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2021-11-25 20:10:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:10:07,414 INFO L93 Difference]: Finished difference Result 1784 states and 3033 transitions. [2021-11-25 20:10:07,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2021-11-25 20:10:07,414 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-11-25 20:10:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:10:07,426 INFO L225 Difference]: With dead ends: 1784 [2021-11-25 20:10:07,426 INFO L226 Difference]: Without dead ends: 1784 [2021-11-25 20:10:07,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 181 SyntacticMatches, 12 SemanticMatches, 89 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 2172 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1664, Invalid=4376, Unknown=18, NotChecked=2132, Total=8190 [2021-11-25 20:10:07,431 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 550 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-11-25 20:10:07,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [550 Valid, 46 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 786 Invalid, 0 Unknown, 339 Unchecked, 0.6s Time] [2021-11-25 20:10:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2021-11-25 20:10:07,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 968. [2021-11-25 20:10:07,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 1.8965873836608067) internal successors, (1834), 967 states have internal predecessors, (1834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:07,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1834 transitions. [2021-11-25 20:10:07,493 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1834 transitions. Word has length 91 [2021-11-25 20:10:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:10:07,496 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1834 transitions. [2021-11-25 20:10:07,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.84) internal successors, (146), 25 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1834 transitions. [2021-11-25 20:10:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-11-25 20:10:07,499 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:10:07,499 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 6, 6, 6, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:10:07,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-25 20:10:07,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:07,725 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:10:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:10:07,726 INFO L85 PathProgramCache]: Analyzing trace with hash -578868339, now seen corresponding path program 1 times [2021-11-25 20:10:07,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:10:07,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228004110] [2021-11-25 20:10:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:07,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:10:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:07,946 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:10:07,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228004110] [2021-11-25 20:10:07,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228004110] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:10:07,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373133153] [2021-11-25 20:10:07,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:07,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:10:07,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:10:07,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-25 20:10:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:08,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 727 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-25 20:10:08,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:10:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:08,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:10:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 0 proven. 283 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:08,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373133153] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:10:08,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [260879969] [2021-11-25 20:10:08,740 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:10:08,742 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:10:08,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2021-11-25 20:10:08,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931202869] [2021-11-25 20:10:08,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:10:08,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-11-25 20:10:08,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:10:08,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-11-25 20:10:08,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:10:08,744 INFO L87 Difference]: Start difference. First operand 968 states and 1834 transitions. Second operand has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:09,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:10:09,227 INFO L93 Difference]: Finished difference Result 1831 states and 3320 transitions. [2021-11-25 20:10:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-11-25 20:10:09,228 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2021-11-25 20:10:09,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:10:09,240 INFO L225 Difference]: With dead ends: 1831 [2021-11-25 20:10:09,241 INFO L226 Difference]: Without dead ends: 1831 [2021-11-25 20:10:09,241 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2021-11-25 20:10:09,242 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 497 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-11-25 20:10:09,242 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [497 Valid, 41 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-25 20:10:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2021-11-25 20:10:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1480. [2021-11-25 20:10:09,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1479 states have (on average 1.8329952670723462) internal successors, (2711), 1479 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 2711 transitions. [2021-11-25 20:10:09,294 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 2711 transitions. Word has length 94 [2021-11-25 20:10:09,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:10:09,297 INFO L470 AbstractCegarLoop]: Abstraction has 1480 states and 2711 transitions. [2021-11-25 20:10:09,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 7.24) internal successors, (181), 25 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 2711 transitions. [2021-11-25 20:10:09,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-25 20:10:09,309 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:10:09,309 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 12, 12, 12, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:10:09,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-25 20:10:09,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:09,525 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:10:09,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:10:09,526 INFO L85 PathProgramCache]: Analyzing trace with hash 633710047, now seen corresponding path program 2 times [2021-11-25 20:10:09,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:10:09,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173984627] [2021-11-25 20:10:09,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:09,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:10:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:10,022 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:10:10,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173984627] [2021-11-25 20:10:10,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173984627] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:10:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565919510] [2021-11-25 20:10:10,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:10:10,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:10:10,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:10:10,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-25 20:10:11,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 20:10:11,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:10:11,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-25 20:10:11,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:10:12,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:10:12,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:12,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:10:12,432 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:12,441 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:10:12,442 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-11-25 20:10:12,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:12,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-25 20:10:12,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:10:12,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:12,636 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:10:12,711 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:12,720 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:10:12,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:10:12,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:12,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-25 20:10:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 267 proven. 105 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2021-11-25 20:10:12,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:10:13,007 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (not (= 800 (let ((.cse1 (+ 3204 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1398)) .cse1))))) is different from false [2021-11-25 20:10:13,015 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (not (= (let ((.cse1 (+ 3204 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1398)) .cse1)) 800))) is different from false [2021-11-25 20:10:13,025 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (not (= 800 (let ((.cse1 (+ 3204 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1398)) .cse1))))) is different from false [2021-11-25 20:10:13,116 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1394 Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1394)) (.cse3 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 800 (let ((.cse1 (+ 3204 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1398)) .cse1)))) (= 800 .cse4))))) is different from false [2021-11-25 20:10:13,155 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_1391) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1394)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (let ((.cse0 (select .cse3 .cse4))) (or (= 800 .cse0) (not (= (let ((.cse2 (+ 3204 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1398)) .cse2)) 800)))))) is different from false [2021-11-25 20:10:13,196 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) is different from false [2021-11-25 20:10:13,236 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) is different from false [2021-11-25 20:10:13,254 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:10:13,255 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 248 treesize of output 178 [2021-11-25 20:10:13,267 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:10:13,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 289 [2021-11-25 20:10:13,276 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:13,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 301 [2021-11-25 20:10:13,296 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 283 [2021-11-25 20:10:13,646 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:13,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2021-11-25 20:10:13,720 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:13,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 157 [2021-11-25 20:10:14,369 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:10:14,370 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 890 treesize of output 862 [2021-11-25 20:10:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 130 proven. 102 refuted. 19 times theorem prover too weak. 1072 trivial. 121 not checked. [2021-11-25 20:10:14,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565919510] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:10:14,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [948606630] [2021-11-25 20:10:14,968 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:10:14,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:10:14,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 11, 14] total 48 [2021-11-25 20:10:14,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047953961] [2021-11-25 20:10:14,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:10:14,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-11-25 20:10:14,971 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:10:14,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-11-25 20:10:14,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1263, Unknown=8, NotChecked=588, Total=2256 [2021-11-25 20:10:14,974 INFO L87 Difference]: Start difference. First operand 1480 states and 2711 transitions. Second operand has 48 states, 48 states have (on average 5.4375) internal successors, (261), 48 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:15,630 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_~i~0#1|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:16,213 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:17,000 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:17,565 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:18,176 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:18,771 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:19,874 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:20,561 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:21,889 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:22,524 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:23,380 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:24,268 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:25,171 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:25,793 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:26,995 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:27,505 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:28,108 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:29,083 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:29,651 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:30,322 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:31,416 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:32,340 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:33,020 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:33,526 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 13) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:34,853 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:35,474 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:36,870 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:38,158 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:38,734 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:39,325 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:40,430 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:41,060 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:42,267 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:43,702 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:44,269 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (= .cse2 800) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse2 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse1) 4)) v_ArrVal_1398)) .cse1) 800))))))) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:44,855 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 Int) (v_ArrVal_1394 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| Int) (v_ArrVal_1398 Int) (v_ArrVal_1397 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1390))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148| 4) |c_~#queue~0.offset|) v_ArrVal_1391) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_1394)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse5 (select .cse4 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_148|) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1397) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_1398)) .cse1) 800)) (= .cse5 800))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:10:45,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:10:45,226 INFO L93 Difference]: Finished difference Result 11748 states and 20441 transitions. [2021-11-25 20:10:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2021-11-25 20:10:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 5.4375) internal successors, (261), 48 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-11-25 20:10:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:10:45,294 INFO L225 Difference]: With dead ends: 11748 [2021-11-25 20:10:45,294 INFO L226 Difference]: Without dead ends: 11748 [2021-11-25 20:10:45,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 740 GetRequests, 446 SyntacticMatches, 44 SemanticMatches, 250 ConstructedPredicates, 43 IntricatePredicates, 0 DeprecatedPredicates, 21876 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=10833, Invalid=32767, Unknown=44, NotChecked=19608, Total=63252 [2021-11-25 20:10:45,320 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 1406 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1406 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 5042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2982 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-11-25 20:10:45,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1406 Valid, 87 Invalid, 5042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 1648 Invalid, 0 Unknown, 2982 Unchecked, 1.2s Time] [2021-11-25 20:10:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2021-11-25 20:10:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 5180. [2021-11-25 20:10:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5180 states, 5179 states have (on average 1.7879899594516315) internal successors, (9260), 5179 states have internal predecessors, (9260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5180 states to 5180 states and 9260 transitions. [2021-11-25 20:10:45,607 INFO L78 Accepts]: Start accepts. Automaton has 5180 states and 9260 transitions. Word has length 184 [2021-11-25 20:10:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:10:45,607 INFO L470 AbstractCegarLoop]: Abstraction has 5180 states and 9260 transitions. [2021-11-25 20:10:45,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 5.4375) internal successors, (261), 48 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:45,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5180 states and 9260 transitions. [2021-11-25 20:10:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-11-25 20:10:45,624 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:10:45,624 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 13, 13, 13, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:10:45,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-25 20:10:45,849 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-25 20:10:45,849 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:10:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:10:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 661553897, now seen corresponding path program 1 times [2021-11-25 20:10:45,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:10:45,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628897164] [2021-11-25 20:10:45,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:45,850 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:10:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:46,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:10:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628897164] [2021-11-25 20:10:46,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628897164] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:10:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50084974] [2021-11-25 20:10:46,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:46,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:46,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:10:46,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:10:46,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-25 20:10:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:46,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 1298 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-25 20:10:46,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:10:47,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:47,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:10:48,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:48,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50084974] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:10:48,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [855934606] [2021-11-25 20:10:48,191 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:10:48,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:10:48,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2021-11-25 20:10:48,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216728746] [2021-11-25 20:10:48,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:10:48,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2021-11-25 20:10:48,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:10:48,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2021-11-25 20:10:48,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:10:48,195 INFO L87 Difference]: Start difference. First operand 5180 states and 9260 transitions. Second operand has 49 states, 49 states have (on average 7.346938775510204) internal successors, (360), 49 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:49,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:10:49,308 INFO L93 Difference]: Finished difference Result 8663 states and 15169 transitions. [2021-11-25 20:10:49,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-11-25 20:10:49,308 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 7.346938775510204) internal successors, (360), 49 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-11-25 20:10:49,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:10:49,346 INFO L225 Difference]: With dead ends: 8663 [2021-11-25 20:10:49,346 INFO L226 Difference]: Without dead ends: 8663 [2021-11-25 20:10:49,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2021-11-25 20:10:49,347 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 1290 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-11-25 20:10:49,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1290 Valid, 65 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-11-25 20:10:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8663 states. [2021-11-25 20:10:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8663 to 7695. [2021-11-25 20:10:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7695 states, 7694 states have (on average 1.750844814140889) internal successors, (13471), 7694 states have internal predecessors, (13471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:49,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7695 states to 7695 states and 13471 transitions. [2021-11-25 20:10:49,574 INFO L78 Accepts]: Start accepts. Automaton has 7695 states and 13471 transitions. Word has length 184 [2021-11-25 20:10:49,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:10:49,575 INFO L470 AbstractCegarLoop]: Abstraction has 7695 states and 13471 transitions. [2021-11-25 20:10:49,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 7.346938775510204) internal successors, (360), 49 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:10:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7695 states and 13471 transitions. [2021-11-25 20:10:49,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2021-11-25 20:10:49,599 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:10:49,600 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 25, 25, 25, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:10:49,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-25 20:10:49,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:49,814 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:10:49,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:10:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash 749485609, now seen corresponding path program 2 times [2021-11-25 20:10:49,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:10:49,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532243496] [2021-11-25 20:10:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:10:49,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:10:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:10:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6451 backedges. 0 proven. 6451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:10:51,335 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:10:51,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532243496] [2021-11-25 20:10:51,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532243496] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:10:51,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760372610] [2021-11-25 20:10:51,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-25 20:10:51,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:10:51,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:10:51,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:10:51,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-25 20:10:53,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-25 20:10:53,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-25 20:10:53,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 90 conjunts are in the unsatisfiable core [2021-11-25 20:10:53,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-25 20:10:54,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-11-25 20:10:54,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:54,598 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:10:54,683 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:54,693 INFO L354 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2021-11-25 20:10:54,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2021-11-25 20:10:54,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:54,761 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-25 20:10:54,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 31 treesize of output 15 [2021-11-25 20:10:54,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:54,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-11-25 20:10:54,960 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:54,968 INFO L354 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2021-11-25 20:10:54,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2021-11-25 20:10:55,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-11-25 20:10:55,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2021-11-25 20:10:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6451 backedges. 812 proven. 5 refuted. 0 times theorem prover too weak. 5634 trivial. 0 not checked. [2021-11-25 20:10:55,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-25 20:10:55,261 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (not (= (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2021-11-25 20:10:55,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2655 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (not (= (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204) 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800))) is different from false [2021-11-25 20:10:55,697 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse0 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse1 .cse2))))))) is different from false [2021-11-25 20:10:55,727 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= 800 (select .cse1 .cse2))))))) is different from false [2021-11-25 20:10:55,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select .cse1 .cse2) 800)))))) is different from false [2021-11-25 20:10:55,790 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int)) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse3 (select .cse0 |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (not (= 800 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)))) (not (= (select .cse1 .cse2) 800)))))) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204)) 800)) is different from false [2021-11-25 20:10:55,853 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2644)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (let ((.cse0 (select .cse5 .cse6))) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (= 800 .cse0) (not (= 800 (select .cse1 .cse2))) (not (= 800 (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)))))))))) is different from false [2021-11-25 20:10:55,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse5 (store (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_2643) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2644)) (.cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 3204))) (let ((.cse0 (select .cse5 .cse6))) (let ((.cse2 (+ 3204 |c_~#queue~0.offset|)) (.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) (+ 3208 |c_~#queue~0.offset|) v_ArrVal_2652))) (or (= .cse0 800) (not (= (select .cse1 .cse2) 800)) (not (= (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)))))))) is different from false [2021-11-25 20:10:56,107 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) is different from false [2021-11-25 20:10:56,258 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) is different from false [2021-11-25 20:10:56,285 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:10:56,286 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 546 treesize of output 386 [2021-11-25 20:10:56,372 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:10:56,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 76751 treesize of output 75911 [2021-11-25 20:10:56,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:56,735 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:56,739 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:56,746 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:56,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79381 treesize of output 74909 [2021-11-25 20:10:57,113 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74674 treesize of output 69938 [2021-11-25 20:10:57,514 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:57,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:57,519 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:57,542 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:10:57,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109542 treesize of output 102538 [2021-11-25 20:10:58,203 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-25 20:11:00,416 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-25 20:11:00,461 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:11:00,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-11-25 20:11:00,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2021-11-25 20:11:00,599 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:11:00,600 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2021-11-25 20:11:00,832 INFO L173 IndexEqualityManager]: detected equality via solver [2021-11-25 20:11:00,851 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-11-25 20:11:00,852 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 380 treesize of output 368 [2021-11-25 20:11:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6451 backedges. 195 proven. 265 refuted. 0 times theorem prover too weak. 5634 trivial. 357 not checked. [2021-11-25 20:11:02,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760372610] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-25 20:11:02,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [954753973] [2021-11-25 20:11:02,070 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Cannot create path program transition for IcfgForkThreadOtherTransition at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:295) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.createPathProgramTransition(PathProgram.java:270) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.accept(ForEachOps.java:183) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:177) at java.base/java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1603) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.ForEachOps$ForEachOp.evaluateSequential(ForEachOps.java:150) at java.base/java.util.stream.ForEachOps$ForEachOp$OfRef.evaluateSequential(ForEachOps.java:173) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.base/java.util.stream.ReferencePipeline.forEach(ReferencePipeline.java:497) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:235) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-11-25 20:11:02,072 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-25 20:11:02,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 10, 20] total 77 [2021-11-25 20:11:02,072 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928341356] [2021-11-25 20:11:02,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-25 20:11:02,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2021-11-25 20:11:02,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-25 20:11:02,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2021-11-25 20:11:02,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1288, Invalid=3154, Unknown=20, NotChecked=1390, Total=5852 [2021-11-25 20:11:02,076 INFO L87 Difference]: Start difference. First operand 7695 states and 13471 transitions. Second operand has 77 states, 77 states have (on average 5.9480519480519485) internal successors, (458), 77 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:11:02,191 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 0 |c_t1Thread1of1ForFork0_~i~0#1|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,199 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,574 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 1) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,626 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,640 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,672 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,695 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 3) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:02,888 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:03,460 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:03,554 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:03,603 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:03,745 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:04,534 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:04,656 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:04,668 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,060 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,070 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,110 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,509 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,630 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:05,643 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:06,171 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:06,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:06,221 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:06,843 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 13) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:06,993 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:07,005 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:07,560 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:07,569 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 16) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:07,618 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:08,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:08,355 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:08,366 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:08,974 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:08,982 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:09,032 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:09,709 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:09,890 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:09,902 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:10,555 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:10,563 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:10,611 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:11,283 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:11,464 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:11,476 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:12,246 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:12,254 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:12,306 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:13,032 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:13,237 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:13,246 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:14,099 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:14,109 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 32) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:14,170 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:15,076 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 33) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:15,324 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 34) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:15,332 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:16,269 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 35) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:16,278 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 36) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:16,342 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 38) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:17,302 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 37) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:17,542 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 38) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:17,550 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 40) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:18,488 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 39) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:18,496 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 40) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:18,556 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 42) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:19,477 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 41) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:19,710 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 42) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:19,720 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 44) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:20,683 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 43) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:20,690 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 44) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:20,754 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 46) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse7 (store (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse1 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse7 .cse1))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse7 .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse3 (store (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (not (= (select (select (store (store .cse2 |c_~#queue~0.base| (store .cse3 .cse1 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (not (= (select .cse3 .cse1) 800)) (= .cse4 800)))))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:20,934 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 45) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:21,061 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 46) (forall ((v_ArrVal_2648 (Array Int Int)) (v_ArrVal_2650 Int) (v_ArrVal_2655 (Array Int Int)) (v_ArrVal_2652 Int) (v_ArrVal_2641 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| Int) (v_ArrVal_2643 Int) (|v_t2Thread1of1ForFork1_dequeue_~q#1.base_253| Int) (v_ArrVal_2644 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2641))) (let ((.cse3 (select .cse7 |c_~#queue~0.base|)) (.cse6 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse8 (store (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239| 4)) v_ArrVal_2643) .cse6 v_ArrVal_2644)) (.cse2 (+ 3204 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse8 .cse2))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store .cse8 .cse2 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_2648))) (let ((.cse1 (store (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (store .cse5 (+ (* (select .cse5 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2650)) .cse6 v_ArrVal_2652))) (or (not (= (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 .cse2 1)) |c_~#stored_elements~0.base| v_ArrVal_2655) |v_t2Thread1of1ForFork1_dequeue_~q#1.base_253|) (+ 3200 |c_~#queue~0.offset|)) 800)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_239|) (= .cse4 800) (not (= 800 (select .cse1 .cse2))))))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| |c_~#queue~0.offset|) (= |c_~#queue~0.base| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (= (select (select |c_#memory_int| |c_~#queue~0.base|) (+ 3204 |c_~#queue~0.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)) is different from false [2021-11-25 20:11:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-25 20:11:21,604 INFO L93 Difference]: Finished difference Result 34727 states and 56163 transitions. [2021-11-25 20:11:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 281 states. [2021-11-25 20:11:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 5.9480519480519485) internal successors, (458), 77 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 364 [2021-11-25 20:11:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-25 20:11:21,687 INFO L225 Difference]: With dead ends: 34727 [2021-11-25 20:11:21,687 INFO L226 Difference]: Without dead ends: 34727 [2021-11-25 20:11:21,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1299 GetRequests, 895 SyntacticMatches, 58 SemanticMatches, 346 ConstructedPredicates, 84 IntricatePredicates, 0 DeprecatedPredicates, 29105 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=16196, Invalid=53478, Unknown=94, NotChecked=50988, Total=120756 [2021-11-25 20:11:21,700 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 2783 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 821 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2783 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 821 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2722 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-11-25 20:11:21,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2783 Valid, 79 Invalid, 5516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [821 Valid, 1973 Invalid, 0 Unknown, 2722 Unchecked, 1.7s Time] [2021-11-25 20:11:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34727 states. [2021-11-25 20:11:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34727 to 12641. [2021-11-25 20:11:22,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12641 states, 12640 states have (on average 1.7194620253164556) internal successors, (21734), 12640 states have internal predecessors, (21734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:11:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12641 states to 12641 states and 21734 transitions. [2021-11-25 20:11:22,239 INFO L78 Accepts]: Start accepts. Automaton has 12641 states and 21734 transitions. Word has length 364 [2021-11-25 20:11:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-25 20:11:22,239 INFO L470 AbstractCegarLoop]: Abstraction has 12641 states and 21734 transitions. [2021-11-25 20:11:22,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 5.9480519480519485) internal successors, (458), 77 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-25 20:11:22,240 INFO L276 IsEmpty]: Start isEmpty. Operand 12641 states and 21734 transitions. [2021-11-25 20:11:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2021-11-25 20:11:22,284 INFO L506 BasicCegarLoop]: Found error trace [2021-11-25 20:11:22,285 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 28, 28, 28, 28, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-25 20:11:22,324 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-11-25 20:11:22,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-11-25 20:11:22,510 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2021-11-25 20:11:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-25 20:11:22,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1003548502, now seen corresponding path program 3 times [2021-11-25 20:11:22,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-25 20:11:22,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150669670] [2021-11-25 20:11:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-25 20:11:22,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-25 20:11:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-25 20:11:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6661 backedges. 0 proven. 6661 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-25 20:11:23,754 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-25 20:11:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150669670] [2021-11-25 20:11:23,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150669670] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-25 20:11:23,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757940840] [2021-11-25 20:11:23,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-25 20:11:23,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-25 20:11:23,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 [2021-11-25 20:11:23,755 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-25 20:11:23,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_36236a6f-1c63-4586-9df5-846e35dd4f03/bin/utaipan-eEHZpOm5b7/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process