./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI --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 c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:13:18,733 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:13:18,737 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:13:18,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:13:18,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:13:18,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:13:18,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:13:18,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:13:18,804 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:13:18,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:13:18,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:13:18,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:13:18,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:13:18,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:13:18,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:13:18,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:13:18,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:13:18,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:13:18,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:13:18,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:13:18,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:13:18,820 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:13:18,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:13:18,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:13:18,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:13:18,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:13:18,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:13:18,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:13:18,829 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:13:18,830 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:13:18,830 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:13:18,831 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:13:18,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:13:18,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:13:18,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:13:18,835 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:13:18,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:13:18,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:13:18,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:13:18,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:13:18,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:13:18,839 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:13:18,864 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:13:18,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:13:18,864 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:13:18,865 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:13:18,866 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:13:18,866 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:13:18,866 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:13:18,867 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:13:18,867 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:13:18,867 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:13:18,868 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:13:18,868 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:13:18,868 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:13:18,868 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:13:18,869 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:13:18,869 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:13:18,869 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:13:18,869 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:13:18,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:13:18,871 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:13:18,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:13:18,871 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:13:18,871 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:13:18,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:13:18,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:13:18,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:13:18,872 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:13:18,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:13:18,873 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:13:18,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:13:18,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:13:18,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:13:18,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:13:18,874 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:13:18,874 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:13:18,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:13:18,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:13:18,875 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:13:18,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:13:18,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:13:18,876 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:13:18,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/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_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI 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 -> c388302d41c726edd49d8ab9cbc4112c9573480c6a1055a6e43438be9deac626 [2022-11-03 02:13:19,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:13:19,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:13:19,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:13:19,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:13:19,243 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:13:19,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-11-03 02:13:19,324 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/data/d6cc0ec7a/678f2d82273c4c5086e234c8c6d04589/FLAG807670f61 [2022-11-03 02:13:19,885 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:13:19,899 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-11-03 02:13:19,909 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/data/d6cc0ec7a/678f2d82273c4c5086e234c8c6d04589/FLAG807670f61 [2022-11-03 02:13:20,214 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/data/d6cc0ec7a/678f2d82273c4c5086e234c8c6d04589 [2022-11-03 02:13:20,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:13:20,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:13:20,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:13:20,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:13:20,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:13:20,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4398800f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20, skipping insertion in model container [2022-11-03 02:13:20,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:13:20,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:13:20,495 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_29d87888-8aa4-4da7-8157-e3fbc1699366/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-11-03 02:13:20,536 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_29d87888-8aa4-4da7-8157-e3fbc1699366/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-11-03 02:13:20,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:13:20,601 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:13:20,616 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_29d87888-8aa4-4da7-8157-e3fbc1699366/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2022-11-03 02:13:20,636 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_29d87888-8aa4-4da7-8157-e3fbc1699366/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2022-11-03 02:13:20,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:13:20,682 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:13:20,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20 WrapperNode [2022-11-03 02:13:20,683 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:13:20,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:13:20,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:13:20,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:13:20,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,740 INFO L138 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 475 [2022-11-03 02:13:20,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:13:20,741 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:13:20,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:13:20,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:13:20,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,775 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:13:20,783 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:13:20,783 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:13:20,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:13:20,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (1/1) ... [2022-11-03 02:13:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:13:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:20,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:13:20,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:13:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-03 02:13:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-03 02:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-03 02:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-03 02:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-03 02:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-03 02:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-03 02:13:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-03 02:13:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-03 02:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-03 02:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-03 02:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-03 02:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-03 02:13:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-03 02:13:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-03 02:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-03 02:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:13:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-03 02:13:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-03 02:13:21,013 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:13:21,029 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:13:21,738 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:13:21,957 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:13:21,957 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-03 02:13:21,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:13:21 BoogieIcfgContainer [2022-11-03 02:13:21,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:13:21,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:13:21,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:13:21,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:13:21,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:13:20" (1/3) ... [2022-11-03 02:13:21,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31654380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:13:21, skipping insertion in model container [2022-11-03 02:13:21,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:13:20" (2/3) ... [2022-11-03 02:13:21,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31654380 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:13:21, skipping insertion in model container [2022-11-03 02:13:21,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:13:21" (3/3) ... [2022-11-03 02:13:21,972 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2022-11-03 02:13:21,992 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:13:21,992 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-03 02:13:22,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:13:22,075 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2f821c91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:13:22,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-03 02:13:22,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 129 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 100 states have internal predecessors, (145), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-11-03 02:13:22,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:13:22,087 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:22,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:22,089 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:22,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1077340385, now seen corresponding path program 1 times [2022-11-03 02:13:22,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:22,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473227629] [2022-11-03 02:13:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:22,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:22,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473227629] [2022-11-03 02:13:22,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473227629] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:22,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:22,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:22,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059072967] [2022-11-03 02:13:22,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:22,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:22,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:22,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:22,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:22,573 INFO L87 Difference]: Start difference. First operand has 129 states, 95 states have (on average 1.5263157894736843) internal successors, (145), 100 states have internal predecessors, (145), 22 states have call successors, (22), 9 states have call predecessors, (22), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:22,803 INFO L93 Difference]: Finished difference Result 291 states and 426 transitions. [2022-11-03 02:13:22,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-03 02:13:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:22,825 INFO L225 Difference]: With dead ends: 291 [2022-11-03 02:13:22,825 INFO L226 Difference]: Without dead ends: 162 [2022-11-03 02:13:22,830 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:22,834 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 156 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:22,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 218 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-03 02:13:22,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-11-03 02:13:22,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.421487603305785) internal successors, (172), 124 states have internal predecessors, (172), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-03 02:13:22,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2022-11-03 02:13:22,909 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 28 [2022-11-03 02:13:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:22,910 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2022-11-03 02:13:22,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:22,911 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2022-11-03 02:13:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:13:22,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:22,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:22,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:13:22,914 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:22,915 INFO L85 PathProgramCache]: Analyzing trace with hash -835382772, now seen corresponding path program 1 times [2022-11-03 02:13:22,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:22,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890837653] [2022-11-03 02:13:22,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:23,013 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:23,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890837653] [2022-11-03 02:13:23,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890837653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:23,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:23,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842928727] [2022-11-03 02:13:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:23,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:23,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:23,017 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:23,133 INFO L93 Difference]: Finished difference Result 314 states and 437 transitions. [2022-11-03 02:13:23,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:23,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-11-03 02:13:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:23,136 INFO L225 Difference]: With dead ends: 314 [2022-11-03 02:13:23,139 INFO L226 Difference]: Without dead ends: 233 [2022-11-03 02:13:23,140 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:23,142 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 154 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:23,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 203 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-11-03 02:13:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2022-11-03 02:13:23,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 184 states have internal predecessors, (253), 32 states have call successors, (32), 15 states have call predecessors, (32), 14 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-11-03 02:13:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 315 transitions. [2022-11-03 02:13:23,185 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 315 transitions. Word has length 29 [2022-11-03 02:13:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:23,186 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 315 transitions. [2022-11-03 02:13:23,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 315 transitions. [2022-11-03 02:13:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:13:23,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:23,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:23,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:13:23,197 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash 653810174, now seen corresponding path program 1 times [2022-11-03 02:13:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:23,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387566226] [2022-11-03 02:13:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:23,309 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:23,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387566226] [2022-11-03 02:13:23,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387566226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:23,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:23,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:23,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128010340] [2022-11-03 02:13:23,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:23,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:23,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:23,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:23,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:23,312 INFO L87 Difference]: Start difference. First operand 229 states and 315 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:23,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:23,416 INFO L93 Difference]: Finished difference Result 469 states and 643 transitions. [2022-11-03 02:13:23,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:23,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-11-03 02:13:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:23,423 INFO L225 Difference]: With dead ends: 469 [2022-11-03 02:13:23,423 INFO L226 Difference]: Without dead ends: 317 [2022-11-03 02:13:23,432 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:23,435 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:23,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 291 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-03 02:13:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 303. [2022-11-03 02:13:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 244 states have (on average 1.3852459016393444) internal successors, (338), 249 states have internal predecessors, (338), 38 states have call successors, (38), 20 states have call predecessors, (38), 19 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-03 02:13:23,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 412 transitions. [2022-11-03 02:13:23,473 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 412 transitions. Word has length 30 [2022-11-03 02:13:23,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:23,474 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 412 transitions. [2022-11-03 02:13:23,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-03 02:13:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 412 transitions. [2022-11-03 02:13:23,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-03 02:13:23,476 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:23,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:23,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:13:23,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:23,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:23,478 INFO L85 PathProgramCache]: Analyzing trace with hash 525311981, now seen corresponding path program 1 times [2022-11-03 02:13:23,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:23,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496786850] [2022-11-03 02:13:23,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:23,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:23,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:23,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496786850] [2022-11-03 02:13:23,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496786850] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:23,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:23,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:13:23,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667195983] [2022-11-03 02:13:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:23,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:13:23,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:23,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:13:23,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:13:23,586 INFO L87 Difference]: Start difference. First operand 303 states and 412 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:13:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:24,135 INFO L93 Difference]: Finished difference Result 631 states and 901 transitions. [2022-11-03 02:13:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:13:24,136 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-11-03 02:13:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:24,142 INFO L225 Difference]: With dead ends: 631 [2022-11-03 02:13:24,142 INFO L226 Difference]: Without dead ends: 560 [2022-11-03 02:13:24,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:13:24,145 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 501 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:24,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 529 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:13:24,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-11-03 02:13:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 549. [2022-11-03 02:13:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 421 states have (on average 1.3776722090261282) internal successors, (580), 429 states have internal predecessors, (580), 83 states have call successors, (83), 44 states have call predecessors, (83), 43 states have return successors, (103), 76 states have call predecessors, (103), 81 states have call successors, (103) [2022-11-03 02:13:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 766 transitions. [2022-11-03 02:13:24,221 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 766 transitions. Word has length 37 [2022-11-03 02:13:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:24,221 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 766 transitions. [2022-11-03 02:13:24,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-03 02:13:24,222 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 766 transitions. [2022-11-03 02:13:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-03 02:13:24,224 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:24,224 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:24,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:13:24,225 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:24,225 INFO L85 PathProgramCache]: Analyzing trace with hash -569519032, now seen corresponding path program 1 times [2022-11-03 02:13:24,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:24,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962906547] [2022-11-03 02:13:24,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:24,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:24,310 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-03 02:13:24,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:24,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962906547] [2022-11-03 02:13:24,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962906547] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:24,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:24,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:24,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883304194] [2022-11-03 02:13:24,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:24,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:24,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:24,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:24,314 INFO L87 Difference]: Start difference. First operand 549 states and 766 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:13:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:24,435 INFO L93 Difference]: Finished difference Result 712 states and 984 transitions. [2022-11-03 02:13:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:24,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2022-11-03 02:13:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:24,444 INFO L225 Difference]: With dead ends: 712 [2022-11-03 02:13:24,445 INFO L226 Difference]: Without dead ends: 554 [2022-11-03 02:13:24,446 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:24,448 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 32 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:24,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 323 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:24,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2022-11-03 02:13:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 543. [2022-11-03 02:13:24,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 415 states have (on average 1.363855421686747) internal successors, (566), 423 states have internal predecessors, (566), 83 states have call successors, (83), 44 states have call predecessors, (83), 43 states have return successors, (103), 76 states have call predecessors, (103), 81 states have call successors, (103) [2022-11-03 02:13:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 752 transitions. [2022-11-03 02:13:24,525 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 752 transitions. Word has length 43 [2022-11-03 02:13:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:24,526 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 752 transitions. [2022-11-03 02:13:24,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:13:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 752 transitions. [2022-11-03 02:13:24,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-03 02:13:24,532 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:24,532 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:24,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:13:24,533 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:24,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash 438941583, now seen corresponding path program 1 times [2022-11-03 02:13:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:24,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626806214] [2022-11-03 02:13:24,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:24,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:13:24,607 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:24,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626806214] [2022-11-03 02:13:24,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626806214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:24,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:24,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:24,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633585172] [2022-11-03 02:13:24,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:24,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:24,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:24,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:24,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:24,610 INFO L87 Difference]: Start difference. First operand 543 states and 752 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:13:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:24,711 INFO L93 Difference]: Finished difference Result 792 states and 1076 transitions. [2022-11-03 02:13:24,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:24,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2022-11-03 02:13:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:24,715 INFO L225 Difference]: With dead ends: 792 [2022-11-03 02:13:24,715 INFO L226 Difference]: Without dead ends: 589 [2022-11-03 02:13:24,716 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:24,717 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 140 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:24,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 201 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-11-03 02:13:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2022-11-03 02:13:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.341409691629956) internal successors, (609), 462 states have internal predecessors, (609), 87 states have call successors, (87), 47 states have call predecessors, (87), 46 states have return successors, (107), 80 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:13:24,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2022-11-03 02:13:24,784 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 46 [2022-11-03 02:13:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:24,785 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2022-11-03 02:13:24,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-03 02:13:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2022-11-03 02:13:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-03 02:13:24,787 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:24,787 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:24,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:13:24,788 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:24,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:24,788 INFO L85 PathProgramCache]: Analyzing trace with hash 157459066, now seen corresponding path program 1 times [2022-11-03 02:13:24,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:24,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492763799] [2022-11-03 02:13:24,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:24,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:13:24,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:24,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492763799] [2022-11-03 02:13:24,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492763799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:24,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:24,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:13:24,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135210919] [2022-11-03 02:13:24,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:24,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:13:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:13:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:13:24,856 INFO L87 Difference]: Start difference. First operand 589 states and 803 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:13:25,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:25,069 INFO L93 Difference]: Finished difference Result 629 states and 850 transitions. [2022-11-03 02:13:25,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:13:25,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-11-03 02:13:25,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:25,073 INFO L225 Difference]: With dead ends: 629 [2022-11-03 02:13:25,074 INFO L226 Difference]: Without dead ends: 626 [2022-11-03 02:13:25,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:13:25,075 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 264 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:25,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 199 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:25,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2022-11-03 02:13:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 588. [2022-11-03 02:13:25,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 454 states have (on average 1.3370044052863437) internal successors, (607), 461 states have internal predecessors, (607), 86 states have call successors, (86), 47 states have call predecessors, (86), 46 states have return successors, (107), 80 states have call predecessors, (107), 85 states have call successors, (107) [2022-11-03 02:13:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 800 transitions. [2022-11-03 02:13:25,148 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 800 transitions. Word has length 47 [2022-11-03 02:13:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:25,149 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 800 transitions. [2022-11-03 02:13:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-03 02:13:25,149 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2022-11-03 02:13:25,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-03 02:13:25,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:25,151 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:25,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:13:25,151 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:25,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:25,152 INFO L85 PathProgramCache]: Analyzing trace with hash 585604338, now seen corresponding path program 1 times [2022-11-03 02:13:25,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:25,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615495914] [2022-11-03 02:13:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:25,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:13:25,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:25,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615495914] [2022-11-03 02:13:25,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615495914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:25,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881124055] [2022-11-03 02:13:25,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:25,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:25,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:25,309 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:25,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:13:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:25,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:13:25,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:25,883 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:13:25,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 02:13:26,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881124055] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:13:26,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [112435447] [2022-11-03 02:13:26,089 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2022-11-03 02:13:26,090 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:13:26,093 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:13:26,099 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:13:26,099 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:13:28,519 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 85 for LOIs [2022-11-03 02:13:28,530 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 100 for LOIs [2022-11-03 02:13:28,544 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 216 for LOIs [2022-11-03 02:13:29,994 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:13:44,901 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10383#(and (= ~t1_pc~0 0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= ~T2_E~0 2) (= 1 ~c_dr_i~0) (= ~t2_i~0 0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (<= ~p_num_write~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) (= ~q_write_ev~0 2) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= 0 ~t2_pc~0) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (= ~a_t~0 0) (= 0 ~t2_st~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-03 02:13:44,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:13:44,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:13:44,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-03 02:13:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039107400] [2022-11-03 02:13:44,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:13:44,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:13:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:13:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:13:44,905 INFO L87 Difference]: Start difference. First operand 588 states and 800 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:13:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:45,303 INFO L93 Difference]: Finished difference Result 1031 states and 1368 transitions. [2022-11-03 02:13:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:13:45,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 48 [2022-11-03 02:13:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:45,309 INFO L225 Difference]: With dead ends: 1031 [2022-11-03 02:13:45,309 INFO L226 Difference]: Without dead ends: 1028 [2022-11-03 02:13:45,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2022-11-03 02:13:45,312 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 276 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:45,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 803 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:13:45,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2022-11-03 02:13:45,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 797. [2022-11-03 02:13:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 631 states have (on average 1.3312202852614896) internal successors, (840), 640 states have internal predecessors, (840), 105 states have call successors, (105), 60 states have call predecessors, (105), 59 states have return successors, (126), 97 states have call predecessors, (126), 104 states have call successors, (126) [2022-11-03 02:13:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1071 transitions. [2022-11-03 02:13:45,389 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1071 transitions. Word has length 48 [2022-11-03 02:13:45,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:45,390 INFO L495 AbstractCegarLoop]: Abstraction has 797 states and 1071 transitions. [2022-11-03 02:13:45,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 6 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2022-11-03 02:13:45,390 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1071 transitions. [2022-11-03 02:13:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-03 02:13:45,393 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:45,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:45,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:45,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:45,608 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:45,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1248117755, now seen corresponding path program 2 times [2022-11-03 02:13:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:45,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779166326] [2022-11-03 02:13:45,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:45,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 02:13:45,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779166326] [2022-11-03 02:13:45,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779166326] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:45,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:45,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238565412] [2022-11-03 02:13:45,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:45,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:45,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:45,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:45,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:45,691 INFO L87 Difference]: Start difference. First operand 797 states and 1071 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:13:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:45,812 INFO L93 Difference]: Finished difference Result 1127 states and 1504 transitions. [2022-11-03 02:13:45,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:45,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 61 [2022-11-03 02:13:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:45,817 INFO L225 Difference]: With dead ends: 1127 [2022-11-03 02:13:45,818 INFO L226 Difference]: Without dead ends: 739 [2022-11-03 02:13:45,819 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:45,821 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 153 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:45,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 214 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2022-11-03 02:13:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 730. [2022-11-03 02:13:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 730 states, 574 states have (on average 1.3222996515679442) internal successors, (759), 584 states have internal predecessors, (759), 99 states have call successors, (99), 56 states have call predecessors, (99), 55 states have return successors, (120), 90 states have call predecessors, (120), 98 states have call successors, (120) [2022-11-03 02:13:45,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 978 transitions. [2022-11-03 02:13:45,899 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 978 transitions. Word has length 61 [2022-11-03 02:13:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:45,903 INFO L495 AbstractCegarLoop]: Abstraction has 730 states and 978 transitions. [2022-11-03 02:13:45,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-03 02:13:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 978 transitions. [2022-11-03 02:13:45,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 02:13:45,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:45,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:45,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:13:45,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:45,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -640293950, now seen corresponding path program 1 times [2022-11-03 02:13:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:45,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90519400] [2022-11-03 02:13:45,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:13:46,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:46,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90519400] [2022-11-03 02:13:46,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90519400] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693098208] [2022-11-03 02:13:46,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:46,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:46,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:46,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:46,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:13:46,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:46,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:13:46,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:46,219 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:13:46,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:46,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693098208] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:46,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:46,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-03 02:13:46,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676219640] [2022-11-03 02:13:46,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:46,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:46,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:46,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:46,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:46,221 INFO L87 Difference]: Start difference. First operand 730 states and 978 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:13:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:46,467 INFO L93 Difference]: Finished difference Result 1348 states and 1892 transitions. [2022-11-03 02:13:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-03 02:13:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:46,474 INFO L225 Difference]: With dead ends: 1348 [2022-11-03 02:13:46,474 INFO L226 Difference]: Without dead ends: 1031 [2022-11-03 02:13:46,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:46,477 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 146 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:46,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 229 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2022-11-03 02:13:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1024. [2022-11-03 02:13:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 786 states have (on average 1.3256997455470738) internal successors, (1042), 799 states have internal predecessors, (1042), 151 states have call successors, (151), 86 states have call predecessors, (151), 85 states have return successors, (190), 139 states have call predecessors, (190), 150 states have call successors, (190) [2022-11-03 02:13:46,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1383 transitions. [2022-11-03 02:13:46,664 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1383 transitions. Word has length 66 [2022-11-03 02:13:46,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:46,665 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1383 transitions. [2022-11-03 02:13:46,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-03 02:13:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1383 transitions. [2022-11-03 02:13:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-03 02:13:46,667 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:46,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:46,708 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:46,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash 714522722, now seen corresponding path program 1 times [2022-11-03 02:13:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:46,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330665540] [2022-11-03 02:13:46,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:46,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 02:13:47,251 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:47,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330665540] [2022-11-03 02:13:47,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330665540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:47,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:47,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:13:47,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497321075] [2022-11-03 02:13:47,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:47,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:13:47,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:47,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:13:47,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:47,254 INFO L87 Difference]: Start difference. First operand 1024 states and 1383 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:13:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:47,812 INFO L93 Difference]: Finished difference Result 2030 states and 2836 transitions. [2022-11-03 02:13:47,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:13:47,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 66 [2022-11-03 02:13:47,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:47,820 INFO L225 Difference]: With dead ends: 2030 [2022-11-03 02:13:47,821 INFO L226 Difference]: Without dead ends: 1420 [2022-11-03 02:13:47,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:13:47,825 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 308 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:47,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 381 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:13:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2022-11-03 02:13:47,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1366. [2022-11-03 02:13:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1366 states, 1029 states have (on average 1.3177842565597668) internal successors, (1356), 1046 states have internal predecessors, (1356), 214 states have call successors, (214), 122 states have call predecessors, (214), 121 states have return successors, (280), 198 states have call predecessors, (280), 213 states have call successors, (280) [2022-11-03 02:13:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1850 transitions. [2022-11-03 02:13:47,974 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1850 transitions. Word has length 66 [2022-11-03 02:13:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:47,974 INFO L495 AbstractCegarLoop]: Abstraction has 1366 states and 1850 transitions. [2022-11-03 02:13:47,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:13:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1850 transitions. [2022-11-03 02:13:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-03 02:13:47,976 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:47,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:47,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:13:47,977 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:47,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2008382746, now seen corresponding path program 1 times [2022-11-03 02:13:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:47,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677146720] [2022-11-03 02:13:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:47,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:48,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 02:13:48,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:48,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677146720] [2022-11-03 02:13:48,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677146720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:48,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:48,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:13:48,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330581443] [2022-11-03 02:13:48,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:48,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:13:48,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:48,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:13:48,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:48,289 INFO L87 Difference]: Start difference. First operand 1366 states and 1850 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:13:48,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:48,812 INFO L93 Difference]: Finished difference Result 2811 states and 3930 transitions. [2022-11-03 02:13:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:13:48,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 67 [2022-11-03 02:13:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:48,824 INFO L225 Difference]: With dead ends: 2811 [2022-11-03 02:13:48,824 INFO L226 Difference]: Without dead ends: 1859 [2022-11-03 02:13:48,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:13:48,830 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 299 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:48,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 426 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:13:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-11-03 02:13:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2022-11-03 02:13:49,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1342 states have (on average 1.3077496274217586) internal successors, (1755), 1364 states have internal predecessors, (1755), 296 states have call successors, (296), 170 states have call predecessors, (296), 169 states have return successors, (392), 275 states have call predecessors, (392), 295 states have call successors, (392) [2022-11-03 02:13:49,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2443 transitions. [2022-11-03 02:13:49,105 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2443 transitions. Word has length 67 [2022-11-03 02:13:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:49,106 INFO L495 AbstractCegarLoop]: Abstraction has 1809 states and 2443 transitions. [2022-11-03 02:13:49,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-03 02:13:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2443 transitions. [2022-11-03 02:13:49,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-03 02:13:49,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:49,116 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:49,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:13:49,116 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:49,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1725413794, now seen corresponding path program 1 times [2022-11-03 02:13:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:49,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242336928] [2022-11-03 02:13:49,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-03 02:13:49,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:49,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242336928] [2022-11-03 02:13:49,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242336928] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:49,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:13:49,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:13:49,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067199629] [2022-11-03 02:13:49,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:49,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:49,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:49,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:49,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:13:49,176 INFO L87 Difference]: Start difference. First operand 1809 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:13:49,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:49,504 INFO L93 Difference]: Finished difference Result 3324 states and 4570 transitions. [2022-11-03 02:13:49,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:49,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2022-11-03 02:13:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:49,516 INFO L225 Difference]: With dead ends: 3324 [2022-11-03 02:13:49,517 INFO L226 Difference]: Without dead ends: 2105 [2022-11-03 02:13:49,522 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:13:49,522 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 36 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:49,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 329 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2022-11-03 02:13:49,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1932. [2022-11-03 02:13:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1932 states, 1447 states have (on average 1.318590186592951) internal successors, (1908), 1469 states have internal predecessors, (1908), 305 states have call successors, (305), 179 states have call predecessors, (305), 178 states have return successors, (401), 284 states have call predecessors, (401), 304 states have call successors, (401) [2022-11-03 02:13:49,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2614 transitions. [2022-11-03 02:13:49,797 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2614 transitions. Word has length 68 [2022-11-03 02:13:49,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:49,798 INFO L495 AbstractCegarLoop]: Abstraction has 1932 states and 2614 transitions. [2022-11-03 02:13:49,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-03 02:13:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2614 transitions. [2022-11-03 02:13:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-03 02:13:49,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:49,802 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:49,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:13:49,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash -894939824, now seen corresponding path program 1 times [2022-11-03 02:13:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:49,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287194999] [2022-11-03 02:13:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:49,948 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:13:49,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:49,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287194999] [2022-11-03 02:13:49,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287194999] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:49,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366910046] [2022-11-03 02:13:49,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:49,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:49,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:49,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:49,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:13:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:50,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:13:50,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-03 02:13:50,083 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:50,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366910046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:50,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:50,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:13:50,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475660695] [2022-11-03 02:13:50,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:50,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:50,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:50,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:50,086 INFO L87 Difference]: Start difference. First operand 1932 states and 2614 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:13:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:50,318 INFO L93 Difference]: Finished difference Result 2059 states and 2773 transitions. [2022-11-03 02:13:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 73 [2022-11-03 02:13:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:50,327 INFO L225 Difference]: With dead ends: 2059 [2022-11-03 02:13:50,328 INFO L226 Difference]: Without dead ends: 1525 [2022-11-03 02:13:50,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:50,331 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 25 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:50,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 294 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:50,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2022-11-03 02:13:50,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2022-11-03 02:13:50,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1104 states have (on average 1.3278985507246377) internal successors, (1466), 1120 states have internal predecessors, (1466), 267 states have call successors, (267), 153 states have call predecessors, (267), 153 states have return successors, (364), 252 states have call predecessors, (364), 267 states have call successors, (364) [2022-11-03 02:13:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2097 transitions. [2022-11-03 02:13:50,590 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2097 transitions. Word has length 73 [2022-11-03 02:13:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:50,591 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 2097 transitions. [2022-11-03 02:13:50,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-03 02:13:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2097 transitions. [2022-11-03 02:13:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:13:50,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:50,597 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:50,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:50,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-03 02:13:50,812 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:50,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:50,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1709823751, now seen corresponding path program 1 times [2022-11-03 02:13:50,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:50,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681351559] [2022-11-03 02:13:50,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:50,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:50,953 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-03 02:13:50,953 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:50,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681351559] [2022-11-03 02:13:50,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681351559] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:50,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80017104] [2022-11-03 02:13:50,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:50,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:50,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:50,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:50,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 02:13:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:51,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:13:51,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:13:51,176 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:51,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80017104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:51,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:51,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:13:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259471599] [2022-11-03 02:13:51,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:51,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:51,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:51,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:51,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:51,179 INFO L87 Difference]: Start difference. First operand 1525 states and 2097 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:51,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:51,451 INFO L93 Difference]: Finished difference Result 2989 states and 4147 transitions. [2022-11-03 02:13:51,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:51,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 02:13:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:51,462 INFO L225 Difference]: With dead ends: 2989 [2022-11-03 02:13:51,464 INFO L226 Difference]: Without dead ends: 1866 [2022-11-03 02:13:51,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:51,472 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:51,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2022-11-03 02:13:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1810. [2022-11-03 02:13:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1351 states have (on average 1.313101406365655) internal successors, (1774), 1364 states have internal predecessors, (1774), 273 states have call successors, (273), 183 states have call predecessors, (273), 185 states have return successors, (369), 263 states have call predecessors, (369), 273 states have call successors, (369) [2022-11-03 02:13:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2416 transitions. [2022-11-03 02:13:51,739 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2416 transitions. Word has length 101 [2022-11-03 02:13:51,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:51,740 INFO L495 AbstractCegarLoop]: Abstraction has 1810 states and 2416 transitions. [2022-11-03 02:13:51,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2416 transitions. [2022-11-03 02:13:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:13:51,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:51,746 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:51,787 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:51,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-03 02:13:51,972 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -929842822, now seen corresponding path program 1 times [2022-11-03 02:13:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:51,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729877858] [2022-11-03 02:13:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:52,075 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-03 02:13:52,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729877858] [2022-11-03 02:13:52,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729877858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:52,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972565605] [2022-11-03 02:13:52,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:52,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:52,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:52,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:52,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 02:13:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:52,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:13:52,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:13:52,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:52,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972565605] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:52,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:52,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:13:52,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398820140] [2022-11-03 02:13:52,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:52,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:52,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:52,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:52,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:52,233 INFO L87 Difference]: Start difference. First operand 1810 states and 2416 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:52,554 INFO L93 Difference]: Finished difference Result 3450 states and 4662 transitions. [2022-11-03 02:13:52,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:52,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2022-11-03 02:13:52,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:52,566 INFO L225 Difference]: With dead ends: 3450 [2022-11-03 02:13:52,566 INFO L226 Difference]: Without dead ends: 2234 [2022-11-03 02:13:52,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:52,571 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:52,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2022-11-03 02:13:52,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1939. [2022-11-03 02:13:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1458 states have (on average 1.3237311385459534) internal successors, (1930), 1471 states have internal predecessors, (1930), 284 states have call successors, (284), 194 states have call predecessors, (284), 196 states have return successors, (380), 274 states have call predecessors, (380), 284 states have call successors, (380) [2022-11-03 02:13:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2594 transitions. [2022-11-03 02:13:52,888 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2594 transitions. Word has length 101 [2022-11-03 02:13:52,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:52,888 INFO L495 AbstractCegarLoop]: Abstraction has 1939 states and 2594 transitions. [2022-11-03 02:13:52,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:52,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2594 transitions. [2022-11-03 02:13:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:13:52,895 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:52,896 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:52,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:53,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-03 02:13:53,112 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash -230485118, now seen corresponding path program 2 times [2022-11-03 02:13:53,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:53,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120907378] [2022-11-03 02:13:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:53,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-03 02:13:53,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:53,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120907378] [2022-11-03 02:13:53,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120907378] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:53,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957374233] [2022-11-03 02:13:53,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:13:53,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:53,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:53,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:53,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 02:13:53,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 02:13:53,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:53,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:13:53,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:53,573 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-03 02:13:53,573 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:53,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957374233] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:53,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:53,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2022-11-03 02:13:53,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305721186] [2022-11-03 02:13:53,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:53,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:13:53,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:53,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:13:53,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:13:53,577 INFO L87 Difference]: Start difference. First operand 1939 states and 2594 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:13:53,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:53,934 INFO L93 Difference]: Finished difference Result 3513 states and 4696 transitions. [2022-11-03 02:13:53,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:13:53,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 101 [2022-11-03 02:13:53,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:53,944 INFO L225 Difference]: With dead ends: 3513 [2022-11-03 02:13:53,945 INFO L226 Difference]: Without dead ends: 2093 [2022-11-03 02:13:53,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:13:53,949 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 86 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:53,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:53,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2022-11-03 02:13:54,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2024. [2022-11-03 02:13:54,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1518 states have (on average 1.3175230566534915) internal successors, (2000), 1537 states have internal predecessors, (2000), 292 states have call successors, (292), 199 states have call predecessors, (292), 213 states have return successors, (406), 288 states have call predecessors, (406), 292 states have call successors, (406) [2022-11-03 02:13:54,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2698 transitions. [2022-11-03 02:13:54,212 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2698 transitions. Word has length 101 [2022-11-03 02:13:54,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:54,213 INFO L495 AbstractCegarLoop]: Abstraction has 2024 states and 2698 transitions. [2022-11-03 02:13:54,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-03 02:13:54,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2698 transitions. [2022-11-03 02:13:54,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:13:54,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:54,219 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:54,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:54,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-03 02:13:54,436 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:54,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1103962813, now seen corresponding path program 2 times [2022-11-03 02:13:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:54,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959568822] [2022-11-03 02:13:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:54,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 02:13:54,677 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:54,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959568822] [2022-11-03 02:13:54,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959568822] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:54,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155992168] [2022-11-03 02:13:54,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 02:13:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:54,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:54,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 02:13:54,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-03 02:13:54,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 02:13:54,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-03 02:13:54,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-03 02:13:55,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:13:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 02:13:55,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155992168] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:55,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-03 02:13:55,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 14 [2022-11-03 02:13:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155210241] [2022-11-03 02:13:55,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:55,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:13:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:55,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:13:55,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:13:55,526 INFO L87 Difference]: Start difference. First operand 2024 states and 2698 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:13:55,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:55,958 INFO L93 Difference]: Finished difference Result 3913 states and 5359 transitions. [2022-11-03 02:13:55,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:13:55,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-03 02:13:55,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:55,971 INFO L225 Difference]: With dead ends: 3913 [2022-11-03 02:13:55,971 INFO L226 Difference]: Without dead ends: 2536 [2022-11-03 02:13:55,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:13:55,977 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 89 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:55,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 217 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:55,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2022-11-03 02:13:56,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2452. [2022-11-03 02:13:56,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 1907 states have (on average 1.2831672784478239) internal successors, (2447), 1929 states have internal predecessors, (2447), 294 states have call successors, (294), 232 states have call predecessors, (294), 250 states have return successors, (452), 291 states have call predecessors, (452), 294 states have call successors, (452) [2022-11-03 02:13:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3193 transitions. [2022-11-03 02:13:56,327 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3193 transitions. Word has length 101 [2022-11-03 02:13:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:56,327 INFO L495 AbstractCegarLoop]: Abstraction has 2452 states and 3193 transitions. [2022-11-03 02:13:56,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:13:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3193 transitions. [2022-11-03 02:13:56,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 02:13:56,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:56,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:56,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:56,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:13:56,556 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:56,556 INFO L85 PathProgramCache]: Analyzing trace with hash 198691535, now seen corresponding path program 1 times [2022-11-03 02:13:56,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:56,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043227391] [2022-11-03 02:13:56,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:56,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-03 02:13:56,663 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043227391] [2022-11-03 02:13:56,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043227391] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:56,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271345888] [2022-11-03 02:13:56,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:56,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:56,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:56,666 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:56,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 02:13:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:56,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:13:56,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:56,818 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-03 02:13:56,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:56,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271345888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:56,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:56,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-03 02:13:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974749293] [2022-11-03 02:13:56,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:56,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:56,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:56,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:56,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:56,823 INFO L87 Difference]: Start difference. First operand 2452 states and 3193 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:57,310 INFO L93 Difference]: Finished difference Result 4637 states and 6117 transitions. [2022-11-03 02:13:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:57,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-11-03 02:13:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:57,328 INFO L225 Difference]: With dead ends: 4637 [2022-11-03 02:13:57,329 INFO L226 Difference]: Without dead ends: 2827 [2022-11-03 02:13:57,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:13:57,335 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:57,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 220 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:13:57,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2022-11-03 02:13:57,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2589. [2022-11-03 02:13:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2589 states, 2020 states have (on average 1.2900990099009901) internal successors, (2606), 2042 states have internal predecessors, (2606), 306 states have call successors, (306), 244 states have call predecessors, (306), 262 states have return successors, (464), 303 states have call predecessors, (464), 306 states have call successors, (464) [2022-11-03 02:13:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3376 transitions. [2022-11-03 02:13:57,772 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3376 transitions. Word has length 100 [2022-11-03 02:13:57,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:57,772 INFO L495 AbstractCegarLoop]: Abstraction has 2589 states and 3376 transitions. [2022-11-03 02:13:57,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:57,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3376 transitions. [2022-11-03 02:13:57,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 02:13:57,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:57,779 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:57,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:57,996 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:57,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 962551112, now seen corresponding path program 1 times [2022-11-03 02:13:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:57,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540821031] [2022-11-03 02:13:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-03 02:13:58,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:58,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540821031] [2022-11-03 02:13:58,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540821031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:58,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023533765] [2022-11-03 02:13:58,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:58,196 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:58,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 02:13:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:58,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:13:58,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:13:58,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:58,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023533765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:58,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:58,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:13:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698618326] [2022-11-03 02:13:58,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:58,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:58,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:13:58,422 INFO L87 Difference]: Start difference. First operand 2589 states and 3376 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:13:58,814 INFO L93 Difference]: Finished difference Result 4975 states and 6674 transitions. [2022-11-03 02:13:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:13:58,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-11-03 02:13:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:13:58,840 INFO L225 Difference]: With dead ends: 4975 [2022-11-03 02:13:58,840 INFO L226 Difference]: Without dead ends: 3028 [2022-11-03 02:13:58,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:13:58,849 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 61 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:13:58,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 240 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:13:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2022-11-03 02:13:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2939. [2022-11-03 02:13:59,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2939 states, 2297 states have (on average 1.2742707879843274) internal successors, (2927), 2319 states have internal predecessors, (2927), 349 states have call successors, (349), 280 states have call predecessors, (349), 292 states have return successors, (541), 340 states have call predecessors, (541), 349 states have call successors, (541) [2022-11-03 02:13:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3817 transitions. [2022-11-03 02:13:59,259 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3817 transitions. Word has length 100 [2022-11-03 02:13:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:13:59,260 INFO L495 AbstractCegarLoop]: Abstraction has 2939 states and 3817 transitions. [2022-11-03 02:13:59,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:13:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3817 transitions. [2022-11-03 02:13:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-03 02:13:59,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:13:59,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:13:59,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:13:59,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:59,480 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:13:59,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:13:59,480 INFO L85 PathProgramCache]: Analyzing trace with hash 871634837, now seen corresponding path program 1 times [2022-11-03 02:13:59,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:13:59,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693390937] [2022-11-03 02:13:59,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:59,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:13:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:59,678 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 02:13:59,678 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:13:59,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693390937] [2022-11-03 02:13:59,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693390937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:13:59,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95177014] [2022-11-03 02:13:59,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:13:59,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:13:59,680 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:13:59,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:13:59,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 02:13:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:13:59,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:13:59,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:13:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-03 02:13:59,863 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:13:59,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95177014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:13:59,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:13:59,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:13:59,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152627431] [2022-11-03 02:13:59,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:13:59,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:13:59,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:13:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:13:59,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:13:59,865 INFO L87 Difference]: Start difference. First operand 2939 states and 3817 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:14:00,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:00,258 INFO L93 Difference]: Finished difference Result 4927 states and 6656 transitions. [2022-11-03 02:14:00,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:14:00,259 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2022-11-03 02:14:00,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:00,280 INFO L225 Difference]: With dead ends: 4927 [2022-11-03 02:14:00,280 INFO L226 Difference]: Without dead ends: 2920 [2022-11-03 02:14:00,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:00,286 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 73 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 228 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 [2022-11-03 02:14:00,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 228 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:00,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2022-11-03 02:14:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2895. [2022-11-03 02:14:00,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2895 states, 2257 states have (on average 1.2374833850243687) internal successors, (2793), 2275 states have internal predecessors, (2793), 349 states have call successors, (349), 280 states have call predecessors, (349), 288 states have return successors, (535), 340 states have call predecessors, (535), 349 states have call successors, (535) [2022-11-03 02:14:00,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3677 transitions. [2022-11-03 02:14:00,702 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3677 transitions. Word has length 100 [2022-11-03 02:14:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:00,703 INFO L495 AbstractCegarLoop]: Abstraction has 2895 states and 3677 transitions. [2022-11-03 02:14:00,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-03 02:14:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3677 transitions. [2022-11-03 02:14:00,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-03 02:14:00,708 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:00,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:00,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:00,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:00,933 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:00,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:00,933 INFO L85 PathProgramCache]: Analyzing trace with hash -876197802, now seen corresponding path program 1 times [2022-11-03 02:14:00,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:00,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958005499] [2022-11-03 02:14:00,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:00,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-11-03 02:14:01,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:01,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958005499] [2022-11-03 02:14:01,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958005499] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:01,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75544231] [2022-11-03 02:14:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:01,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:01,109 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:01,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 02:14:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:01,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:14:01,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:01,260 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 02:14:01,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:01,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75544231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:01,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:01,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-03 02:14:01,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89400539] [2022-11-03 02:14:01,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:01,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:14:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:14:01,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:01,263 INFO L87 Difference]: Start difference. First operand 2895 states and 3677 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:14:01,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:01,874 INFO L93 Difference]: Finished difference Result 6742 states and 8676 transitions. [2022-11-03 02:14:01,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:14:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 101 [2022-11-03 02:14:01,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:01,896 INFO L225 Difference]: With dead ends: 6742 [2022-11-03 02:14:01,897 INFO L226 Difference]: Without dead ends: 3904 [2022-11-03 02:14:01,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:01,907 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:01,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 189 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:14:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2022-11-03 02:14:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3181. [2022-11-03 02:14:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2493 states have (on average 1.2470918572001604) internal successors, (3109), 2512 states have internal predecessors, (3109), 374 states have call successors, (374), 305 states have call predecessors, (374), 313 states have return successors, (560), 364 states have call predecessors, (560), 374 states have call successors, (560) [2022-11-03 02:14:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4043 transitions. [2022-11-03 02:14:02,413 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4043 transitions. Word has length 101 [2022-11-03 02:14:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:02,414 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4043 transitions. [2022-11-03 02:14:02,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:14:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4043 transitions. [2022-11-03 02:14:02,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-03 02:14:02,420 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:02,420 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:02,460 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:02,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 02:14:02,635 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:02,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2055335588, now seen corresponding path program 1 times [2022-11-03 02:14:02,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:02,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345339497] [2022-11-03 02:14:02,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:02,803 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-03 02:14:02,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:02,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345339497] [2022-11-03 02:14:02,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345339497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:02,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345536954] [2022-11-03 02:14:02,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:02,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:02,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:02,805 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:02,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-03 02:14:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:02,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:14:02,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:03,046 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-03 02:14:03,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:03,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345536954] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:03,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:03,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 02:14:03,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800111692] [2022-11-03 02:14:03,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:03,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:14:03,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:03,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:14:03,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:03,048 INFO L87 Difference]: Start difference. First operand 3181 states and 4043 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 02:14:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:03,555 INFO L93 Difference]: Finished difference Result 6925 states and 8850 transitions. [2022-11-03 02:14:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:14:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 102 [2022-11-03 02:14:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:03,568 INFO L225 Difference]: With dead ends: 6925 [2022-11-03 02:14:03,568 INFO L226 Difference]: Without dead ends: 4118 [2022-11-03 02:14:03,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:03,577 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 125 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:03,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 227 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:14:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2022-11-03 02:14:04,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3643. [2022-11-03 02:14:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3643 states, 2891 states have (on average 1.2345209270148738) internal successors, (3569), 2920 states have internal predecessors, (3569), 397 states have call successors, (397), 338 states have call predecessors, (397), 354 states have return successors, (593), 385 states have call predecessors, (593), 397 states have call successors, (593) [2022-11-03 02:14:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4559 transitions. [2022-11-03 02:14:04,091 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4559 transitions. Word has length 102 [2022-11-03 02:14:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:04,092 INFO L495 AbstractCegarLoop]: Abstraction has 3643 states and 4559 transitions. [2022-11-03 02:14:04,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 02:14:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4559 transitions. [2022-11-03 02:14:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 02:14:04,098 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:04,098 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:04,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:04,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-03 02:14:04,320 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:04,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:04,321 INFO L85 PathProgramCache]: Analyzing trace with hash 99916088, now seen corresponding path program 1 times [2022-11-03 02:14:04,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:04,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277461653] [2022-11-03 02:14:04,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:04,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-03 02:14:04,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:04,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277461653] [2022-11-03 02:14:04,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277461653] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:04,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:14:04,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:14:04,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743109015] [2022-11-03 02:14:04,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:04,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:14:04,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:04,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:14:04,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:14:04,511 INFO L87 Difference]: Start difference. First operand 3643 states and 4559 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:14:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:05,561 INFO L93 Difference]: Finished difference Result 9096 states and 11384 transitions. [2022-11-03 02:14:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:14:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 103 [2022-11-03 02:14:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:05,576 INFO L225 Difference]: With dead ends: 9096 [2022-11-03 02:14:05,576 INFO L226 Difference]: Without dead ends: 4771 [2022-11-03 02:14:05,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:14:05,585 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 81 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:05,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 283 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:14:05,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2022-11-03 02:14:06,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4597. [2022-11-03 02:14:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 3612 states have (on average 1.2134551495016612) internal successors, (4383), 3659 states have internal predecessors, (4383), 519 states have call successors, (519), 436 states have call predecessors, (519), 465 states have return successors, (789), 502 states have call predecessors, (789), 519 states have call successors, (789) [2022-11-03 02:14:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 5691 transitions. [2022-11-03 02:14:06,255 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 5691 transitions. Word has length 103 [2022-11-03 02:14:06,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:06,255 INFO L495 AbstractCegarLoop]: Abstraction has 4597 states and 5691 transitions. [2022-11-03 02:14:06,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-03 02:14:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 5691 transitions. [2022-11-03 02:14:06,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-03 02:14:06,261 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:06,262 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:06,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-03 02:14:06,262 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:06,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:06,263 INFO L85 PathProgramCache]: Analyzing trace with hash 586827523, now seen corresponding path program 1 times [2022-11-03 02:14:06,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:06,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256769035] [2022-11-03 02:14:06,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:06,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:06,434 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-03 02:14:06,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:06,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256769035] [2022-11-03 02:14:06,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256769035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363719810] [2022-11-03 02:14:06,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:06,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:06,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:06,436 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:06,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-03 02:14:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:06,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:14:06,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:14:06,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:14:06,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363719810] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:14:06,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:14:06,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 02:14:06,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701801921] [2022-11-03 02:14:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:14:06,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:14:06,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:14:06,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:14:06,712 INFO L87 Difference]: Start difference. First operand 4597 states and 5691 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:14:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:07,810 INFO L93 Difference]: Finished difference Result 9058 states and 11289 transitions. [2022-11-03 02:14:07,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:14:07,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 103 [2022-11-03 02:14:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:07,832 INFO L225 Difference]: With dead ends: 9058 [2022-11-03 02:14:07,832 INFO L226 Difference]: Without dead ends: 5902 [2022-11-03 02:14:07,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:14:07,843 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 162 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:07,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 296 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:14:07,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2022-11-03 02:14:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5570. [2022-11-03 02:14:08,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5570 states, 4366 states have (on average 1.2052221713238662) internal successors, (5262), 4421 states have internal predecessors, (5262), 641 states have call successors, (641), 532 states have call predecessors, (641), 562 states have return successors, (1004), 617 states have call predecessors, (1004), 641 states have call successors, (1004) [2022-11-03 02:14:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 6907 transitions. [2022-11-03 02:14:08,468 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 6907 transitions. Word has length 103 [2022-11-03 02:14:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:08,468 INFO L495 AbstractCegarLoop]: Abstraction has 5570 states and 6907 transitions. [2022-11-03 02:14:08,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 5 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-03 02:14:08,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 6907 transitions. [2022-11-03 02:14:08,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-03 02:14:08,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:08,475 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:08,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:08,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-03 02:14:08,700 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:08,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash 55542943, now seen corresponding path program 1 times [2022-11-03 02:14:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270651836] [2022-11-03 02:14:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:14:09,248 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:09,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270651836] [2022-11-03 02:14:09,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270651836] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:09,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924240514] [2022-11-03 02:14:09,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:09,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:09,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:09,251 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:09,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-03 02:14:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:09,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:14:09,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:14:09,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:09,805 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 02:14:09,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924240514] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:09,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [79342182] [2022-11-03 02:14:09,811 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2022-11-03 02:14:09,811 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:14:09,813 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:14:09,813 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:14:09,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:14:18,385 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 178 for LOIs [2022-11-03 02:14:22,887 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 62 for LOIs [2022-11-03 02:14:22,895 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 184 for LOIs [2022-11-03 02:14:22,953 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 71 for LOIs [2022-11-03 02:14:23,180 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-11-03 02:14:23,697 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 208 for LOIs [2022-11-03 02:14:24,812 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:14:54,323 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '181641#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_pc~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= 0 ~t2_pc~0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:14:54,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:14:54,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:14:54,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2022-11-03 02:14:54,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972904180] [2022-11-03 02:14:54,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:14:54,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-03 02:14:54,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:14:54,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-03 02:14:54,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=4015, Unknown=0, NotChecked=0, Total=4422 [2022-11-03 02:14:54,327 INFO L87 Difference]: Start difference. First operand 5570 states and 6907 transitions. Second operand has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:14:57,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:14:57,792 INFO L93 Difference]: Finished difference Result 9815 states and 12063 transitions. [2022-11-03 02:14:57,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-11-03 02:14:57,793 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 109 [2022-11-03 02:14:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:14:57,806 INFO L225 Difference]: With dead ends: 9815 [2022-11-03 02:14:57,806 INFO L226 Difference]: Without dead ends: 4242 [2022-11-03 02:14:57,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 310 SyntacticMatches, 10 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8224 ImplicationChecksByTransitivity, 30.9s TimeCoverageRelationStatistics Valid=1343, Invalid=17839, Unknown=0, NotChecked=0, Total=19182 [2022-11-03 02:14:57,821 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 969 mSDsluCounter, 1995 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:14:57,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 1863 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 02:14:57,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4242 states. [2022-11-03 02:14:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4242 to 3281. [2022-11-03 02:14:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3281 states, 2594 states have (on average 1.1734772552043176) internal successors, (3044), 2629 states have internal predecessors, (3044), 347 states have call successors, (347), 315 states have call predecessors, (347), 339 states have return successors, (447), 336 states have call predecessors, (447), 347 states have call successors, (447) [2022-11-03 02:14:58,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 3838 transitions. [2022-11-03 02:14:58,203 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 3838 transitions. Word has length 109 [2022-11-03 02:14:58,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:14:58,204 INFO L495 AbstractCegarLoop]: Abstraction has 3281 states and 3838 transitions. [2022-11-03 02:14:58,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 7.764705882352941) internal successors, (132), 19 states have internal predecessors, (132), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:14:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3838 transitions. [2022-11-03 02:14:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-03 02:14:58,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:14:58,209 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:14:58,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:14:58,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-03 02:14:58,424 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:14:58,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:14:58,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1369522639, now seen corresponding path program 1 times [2022-11-03 02:14:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:14:58,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396623334] [2022-11-03 02:14:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:14:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-03 02:14:58,945 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:14:58,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396623334] [2022-11-03 02:14:58,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396623334] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:14:58,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374632439] [2022-11-03 02:14:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:14:58,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:14:58,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:14:58,947 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:14:58,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:14:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:14:59,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:14:59,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:14:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-03 02:14:59,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:14:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-11-03 02:14:59,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374632439] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:14:59,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [710842066] [2022-11-03 02:14:59,556 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2022-11-03 02:14:59,556 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:14:59,557 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:14:59,557 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:14:59,558 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:15:06,679 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 179 for LOIs [2022-11-03 02:15:16,115 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2022-11-03 02:15:16,125 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 185 for LOIs [2022-11-03 02:15:16,183 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 72 for LOIs [2022-11-03 02:15:16,283 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 63 for LOIs [2022-11-03 02:15:16,631 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 209 for LOIs [2022-11-03 02:15:23,648 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:15:40,607 WARN L234 SmtUtils]: Spent 14.43s on a formula simplification. DAG size of input: 421 DAG size of output: 294 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:15:51,356 WARN L234 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 421 DAG size of output: 289 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:16:06,264 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '200848#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (<= 1 ~m_i~0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= 0 ~t2_pc~0) (<= ~m_i~0 1) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:16:06,264 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:16:06,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:16:06,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2022-11-03 02:16:06,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281170493] [2022-11-03 02:16:06,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:16:06,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-03 02:16:06,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:16:06,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-03 02:16:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=4855, Unknown=0, NotChecked=0, Total=5256 [2022-11-03 02:16:06,268 INFO L87 Difference]: Start difference. First operand 3281 states and 3838 transitions. Second operand has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:16:10,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:16:10,458 INFO L93 Difference]: Finished difference Result 6024 states and 7085 transitions. [2022-11-03 02:16:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2022-11-03 02:16:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) Word has length 112 [2022-11-03 02:16:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:16:10,467 INFO L225 Difference]: With dead ends: 6024 [2022-11-03 02:16:10,467 INFO L226 Difference]: Without dead ends: 2892 [2022-11-03 02:16:10,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 314 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13978 ImplicationChecksByTransitivity, 45.0s TimeCoverageRelationStatistics Valid=1785, Invalid=29367, Unknown=0, NotChecked=0, Total=31152 [2022-11-03 02:16:10,481 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1264 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:16:10,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 1540 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 02:16:10,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2022-11-03 02:16:10,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2305. [2022-11-03 02:16:10,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1826 states have (on average 1.1615553121577218) internal successors, (2121), 1851 states have internal predecessors, (2121), 237 states have call successors, (237), 221 states have call predecessors, (237), 241 states have return successors, (315), 232 states have call predecessors, (315), 237 states have call successors, (315) [2022-11-03 02:16:10,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 2673 transitions. [2022-11-03 02:16:10,870 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 2673 transitions. Word has length 112 [2022-11-03 02:16:10,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:16:10,871 INFO L495 AbstractCegarLoop]: Abstraction has 2305 states and 2673 transitions. [2022-11-03 02:16:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.833333333333333) internal successors, (141), 20 states have internal predecessors, (141), 9 states have call successors, (33), 5 states have call predecessors, (33), 8 states have return successors, (34), 9 states have call predecessors, (34), 9 states have call successors, (34) [2022-11-03 02:16:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 2673 transitions. [2022-11-03 02:16:10,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-03 02:16:10,875 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:16:10,876 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:16:10,918 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:16:11,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-03 02:16:11,104 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:16:11,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:16:11,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1183124369, now seen corresponding path program 1 times [2022-11-03 02:16:11,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:16:11,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314034048] [2022-11-03 02:16:11,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:11,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:16:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-03 02:16:11,828 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:16:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314034048] [2022-11-03 02:16:11,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314034048] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:16:11,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037937340] [2022-11-03 02:16:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:16:11,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:16:11,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:16:11,832 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:16:11,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-03 02:16:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:16:11,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-03 02:16:11,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:16:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-03 02:16:12,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:16:13,206 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-11-03 02:16:13,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037937340] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:16:13,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [658066722] [2022-11-03 02:16:13,214 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-03 02:16:13,215 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:16:13,216 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:16:13,216 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:16:13,217 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:16:24,081 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 180 for LOIs [2022-11-03 02:16:27,821 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 64 for LOIs [2022-11-03 02:16:27,830 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 186 for LOIs [2022-11-03 02:16:27,889 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 73 for LOIs [2022-11-03 02:16:28,033 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 64 for LOIs [2022-11-03 02:16:28,432 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 210 for LOIs [2022-11-03 02:16:34,676 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:16:50,576 WARN L234 SmtUtils]: Spent 13.05s on a formula simplification. DAG size of input: 402 DAG size of output: 316 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-03 02:17:18,608 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '213363#(and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (<= ~t1_pc~0 1) (= ~p_num_write~0 0) (<= ~local~0 2147483647) (= ~c_num_read~0 0) (= ~q_buf_0~0 0) (= ~t1_i~0 1) (not (= ~token~0 (+ 2 ~local~0))) (= ~p_last_write~0 0) (<= 0 (+ ~local~0 2147483648)) (<= 0 (+ |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483648)) (<= 0 ~t2_pc~0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (<= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 2147483647) (<= 0 |ULTIMATE.start_eval2_~tmp~4#1|) (= ~m_pc~0 1) (<= ~t2_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (<= |ULTIMATE.start_eval2_~tmp~4#1| 1) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-03 02:17:18,608 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:17:18,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:17:18,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 36 [2022-11-03 02:17:18,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954457080] [2022-11-03 02:17:18,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:17:18,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-03 02:17:18,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:18,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-03 02:17:18,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=7559, Unknown=0, NotChecked=0, Total=8190 [2022-11-03 02:17:18,612 INFO L87 Difference]: Start difference. First operand 2305 states and 2673 transitions. Second operand has 36 states, 24 states have (on average 7.166666666666667) internal successors, (172), 27 states have internal predecessors, (172), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 02:17:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:26,347 INFO L93 Difference]: Finished difference Result 5759 states and 6769 transitions. [2022-11-03 02:17:26,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-03 02:17:26,347 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 24 states have (on average 7.166666666666667) internal successors, (172), 27 states have internal predecessors, (172), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) Word has length 114 [2022-11-03 02:17:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:26,357 INFO L225 Difference]: With dead ends: 5759 [2022-11-03 02:17:26,357 INFO L226 Difference]: Without dead ends: 3768 [2022-11-03 02:17:26,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9869 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=2690, Invalid=23716, Unknown=0, NotChecked=0, Total=26406 [2022-11-03 02:17:26,366 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 4283 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 3868 mSolverCounterSat, 2536 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4283 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 6404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2536 IncrementalHoareTripleChecker+Valid, 3868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:26,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4283 Valid, 1295 Invalid, 6404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2536 Valid, 3868 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-03 02:17:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2022-11-03 02:17:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 2154. [2022-11-03 02:17:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 1695 states have (on average 1.1581120943952803) internal successors, (1963), 1719 states have internal predecessors, (1963), 231 states have call successors, (231), 213 states have call predecessors, (231), 227 states have return successors, (283), 221 states have call predecessors, (283), 231 states have call successors, (283) [2022-11-03 02:17:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2477 transitions. [2022-11-03 02:17:26,796 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2477 transitions. Word has length 114 [2022-11-03 02:17:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:26,797 INFO L495 AbstractCegarLoop]: Abstraction has 2154 states and 2477 transitions. [2022-11-03 02:17:26,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 24 states have (on average 7.166666666666667) internal successors, (172), 27 states have internal predecessors, (172), 14 states have call successors, (40), 11 states have call predecessors, (40), 18 states have return successors, (40), 14 states have call predecessors, (40), 14 states have call successors, (40) [2022-11-03 02:17:26,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2477 transitions. [2022-11-03 02:17:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-03 02:17:26,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:26,800 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:26,839 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:27,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-03 02:17:27,016 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1963226919, now seen corresponding path program 1 times [2022-11-03 02:17:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650065472] [2022-11-03 02:17:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:27,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:27,164 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-11-03 02:17:27,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:27,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650065472] [2022-11-03 02:17:27,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650065472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:27,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:17:27,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:17:27,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562011175] [2022-11-03 02:17:27,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:27,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:17:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:27,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:17:27,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:27,168 INFO L87 Difference]: Start difference. First operand 2154 states and 2477 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 02:17:28,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:28,223 INFO L93 Difference]: Finished difference Result 5729 states and 6637 transitions. [2022-11-03 02:17:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 127 [2022-11-03 02:17:28,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:28,235 INFO L225 Difference]: With dead ends: 5729 [2022-11-03 02:17:28,235 INFO L226 Difference]: Without dead ends: 4293 [2022-11-03 02:17:28,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:28,239 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 229 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:28,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 551 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:17:28,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2022-11-03 02:17:28,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3157. [2022-11-03 02:17:28,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3157 states, 2464 states have (on average 1.1643668831168832) internal successors, (2869), 2490 states have internal predecessors, (2869), 360 states have call successors, (360), 321 states have call predecessors, (360), 332 states have return successors, (420), 345 states have call predecessors, (420), 360 states have call successors, (420) [2022-11-03 02:17:28,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3649 transitions. [2022-11-03 02:17:28,933 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3649 transitions. Word has length 127 [2022-11-03 02:17:28,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:28,933 INFO L495 AbstractCegarLoop]: Abstraction has 3157 states and 3649 transitions. [2022-11-03 02:17:28,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-03 02:17:28,934 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3649 transitions. [2022-11-03 02:17:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-11-03 02:17:28,937 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:28,937 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:28,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-03 02:17:28,938 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:28,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash -17658865, now seen corresponding path program 1 times [2022-11-03 02:17:28,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:28,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803479495] [2022-11-03 02:17:28,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:28,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-03 02:17:29,089 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803479495] [2022-11-03 02:17:29,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803479495] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:17:29,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031642289] [2022-11-03 02:17:29,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:29,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:29,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:29,091 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:29,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-03 02:17:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:29,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:17:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-11-03 02:17:29,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:17:29,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031642289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:29,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:17:29,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 02:17:29,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687825998] [2022-11-03 02:17:29,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:29,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:17:29,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:29,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:17:29,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:17:29,310 INFO L87 Difference]: Start difference. First operand 3157 states and 3649 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-03 02:17:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:30,096 INFO L93 Difference]: Finished difference Result 5951 states and 6861 transitions. [2022-11-03 02:17:30,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:30,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 158 [2022-11-03 02:17:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:30,104 INFO L225 Difference]: With dead ends: 5951 [2022-11-03 02:17:30,105 INFO L226 Difference]: Without dead ends: 3140 [2022-11-03 02:17:30,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:30,110 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:30,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2022-11-03 02:17:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3083. [2022-11-03 02:17:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 2398 states have (on average 1.1313594662218516) internal successors, (2713), 2425 states have internal predecessors, (2713), 358 states have call successors, (358), 315 states have call predecessors, (358), 326 states have return successors, (418), 342 states have call predecessors, (418), 358 states have call successors, (418) [2022-11-03 02:17:30,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3489 transitions. [2022-11-03 02:17:30,726 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3489 transitions. Word has length 158 [2022-11-03 02:17:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:30,726 INFO L495 AbstractCegarLoop]: Abstraction has 3083 states and 3489 transitions. [2022-11-03 02:17:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 3 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-03 02:17:30,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3489 transitions. [2022-11-03 02:17:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-11-03 02:17:30,730 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:30,731 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:30,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-03 02:17:30,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:30,944 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:30,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1120897049, now seen corresponding path program 1 times [2022-11-03 02:17:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:30,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979391677] [2022-11-03 02:17:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:30,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-11-03 02:17:31,129 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:31,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979391677] [2022-11-03 02:17:31,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979391677] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:17:31,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233535022] [2022-11-03 02:17:31,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:31,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:31,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:31,131 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:31,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-03 02:17:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:31,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:17:31,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:31,319 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-03 02:17:31,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:17:31,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233535022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:31,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:17:31,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-11-03 02:17:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878750622] [2022-11-03 02:17:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:17:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:17:31,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:17:31,321 INFO L87 Difference]: Start difference. First operand 3083 states and 3489 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-03 02:17:31,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:31,784 INFO L93 Difference]: Finished difference Result 4525 states and 5102 transitions. [2022-11-03 02:17:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:17:31,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 159 [2022-11-03 02:17:31,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:31,788 INFO L225 Difference]: With dead ends: 4525 [2022-11-03 02:17:31,788 INFO L226 Difference]: Without dead ends: 1837 [2022-11-03 02:17:31,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:17:31,792 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 54 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:31,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 328 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 02:17:31,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2022-11-03 02:17:32,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1771. [2022-11-03 02:17:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1383 states have (on average 1.1120751988430948) internal successors, (1538), 1400 states have internal predecessors, (1538), 200 states have call successors, (200), 178 states have call predecessors, (200), 187 states have return successors, (238), 192 states have call predecessors, (238), 200 states have call successors, (238) [2022-11-03 02:17:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1976 transitions. [2022-11-03 02:17:32,187 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1976 transitions. Word has length 159 [2022-11-03 02:17:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:32,187 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 1976 transitions. [2022-11-03 02:17:32,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-03 02:17:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1976 transitions. [2022-11-03 02:17:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-03 02:17:32,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:17:32,190 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:17:32,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:32,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-03 02:17:32,392 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-03 02:17:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:17:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 792979339, now seen corresponding path program 1 times [2022-11-03 02:17:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:17:32,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419643052] [2022-11-03 02:17:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:32,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:17:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:32,599 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-03 02:17:32,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:17:32,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419643052] [2022-11-03 02:17:32,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419643052] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:17:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501146691] [2022-11-03 02:17:32,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:17:32,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:17:32,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:17:32,603 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:17:32,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-03 02:17:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:17:32,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-03 02:17:32,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:17:32,832 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-11-03 02:17:32,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:17:32,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501146691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:17:32,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:17:32,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2022-11-03 02:17:32,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751937084] [2022-11-03 02:17:32,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:17:32,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:17:32,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:17:32,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:17:32,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:17:32,834 INFO L87 Difference]: Start difference. First operand 1771 states and 1976 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-03 02:17:33,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:17:33,197 INFO L93 Difference]: Finished difference Result 2327 states and 2593 transitions. [2022-11-03 02:17:33,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:17:33,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 160 [2022-11-03 02:17:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:17:33,198 INFO L225 Difference]: With dead ends: 2327 [2022-11-03 02:17:33,198 INFO L226 Difference]: Without dead ends: 0 [2022-11-03 02:17:33,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:17:33,201 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 146 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:17:33,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 276 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:17:33,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-03 02:17:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-03 02:17:33,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:17:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-03 02:17:33,203 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2022-11-03 02:17:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:17:33,203 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-03 02:17:33,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 5 states have call successors, (14), 5 states have call predecessors, (14), 5 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-11-03 02:17:33,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-03 02:17:33,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-03 02:17:33,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-03 02:17:33,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-03 02:17:33,234 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-03 02:17:33,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-03 02:17:33,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-03 02:17:53,753 WARN L234 SmtUtils]: Spent 15.11s on a formula simplification. DAG size of input: 494 DAG size of output: 451 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:18:27,576 WARN L234 SmtUtils]: Spent 15.55s on a formula simplification. DAG size of input: 494 DAG size of output: 451 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-03 02:18:44,963 WARN L234 SmtUtils]: Spent 6.57s on a formula simplification. DAG size of input: 574 DAG size of output: 197 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:18:53,671 WARN L234 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 585 DAG size of output: 199 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:19:04,816 WARN L234 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 621 DAG size of output: 178 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:19:30,476 WARN L234 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 718 DAG size of output: 191 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:19:43,858 WARN L234 SmtUtils]: Spent 5.05s on a formula simplification. DAG size of input: 451 DAG size of output: 120 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-11-03 02:19:47,891 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2022-11-03 02:19:47,892 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 820 830) the Hoare annotation is: (let ((.cse30 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse22 (not (= ~E_M~0 ~E_1~0))) (.cse47 (not (= ~E_1~0 1))) (.cse24 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse58 (+ ~local~0 1)) (.cse4 (= ~E_2~0 1)) (.cse36 (= ~t1_st~0 0)) (.cse52 (= ~p_dw_pc~0 0)) (.cse59 (<= 2 ~E_1~0)) (.cse54 (= ~p_num_write~0 0)) (.cse44 (not .cse30)) (.cse50 (= ~c_num_read~0 0)) (.cse53 (= ~t1_i~0 1)) (.cse51 (= ~p_last_write~0 ~q_buf_0~0)) (.cse43 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= ~m_pc~0 1)) (.cse35 (= ~m_st~0 |old(~m_st~0)|)) (.cse49 (= ~q_free~0 0)) (.cse46 (= |old(~t2_st~0)| ~t2_st~0)) (.cse57 (= ~p_dw_st~0 0)) (.cse56 (= ~t2_i~0 1)) (.cse55 (= ~c_dr_pc~0 0)) (.cse48 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse38 (not (= ~m_pc~0 0))) (.cse31 (and .cse52 .cse59 .cse54 .cse44 .cse50 .cse53 .cse51 .cse43 (not .cse10) .cse35 .cse49 .cse46 .cse57 .cse56 .cse55 .cse48)) (.cse18 (not (= |old(~t2_st~0)| 0))) (.cse21 (not (<= ~t2_pc~0 0))) (.cse37 (= 0 ~t2_st~0)) (.cse29 (= ~E_M~0 1)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse6 (and .cse35 .cse46 .cse36)) (.cse39 (not (= ~t1_pc~0 0))) (.cse17 (and .cse43 .cse35 .cse46)) (.cse27 (not (= ~E_1~0 2))) (.cse20 (not .cse4)) (.cse23 (not (<= .cse58 ~token~0))) (.cse13 (not (= 2 |old(~m_st~0)|))) (.cse16 (not .cse59)) (.cse25 (not (<= ~token~0 .cse58))) (.cse26 (not (= ~E_2~0 2))) (.cse1 (not .cse57)) (.cse2 (not .cse56)) (.cse32 (not (= ~E_M~0 2))) (.cse3 (not .cse55)) (.cse33 (= |old(~m_st~0)| 0)) (.cse34 (not (<= ~token~0 ~local~0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not .cse54)) (.cse7 (not .cse53)) (.cse8 (not .cse52)) (.cse9 (not .cse51)) (.cse11 (not .cse50)) (.cse12 (not .cse49)) (.cse40 (and .cse47 .cse24)) (.cse41 (not (<= ~local~0 ~token~0))) (.cse28 (not (= |old(~t1_st~0)| 2))) (.cse14 (not (= ~t2_pc~0 1))) (.cse45 (not (= 2 |old(~t2_st~0)|))) (.cse15 (not .cse48)) (.cse42 (and .cse22 .cse47))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse17 .cse3 .cse18 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse11 .cse21 .cse12 .cse22 .cse23 .cse24 .cse13 .cse15 .cse25) (or .cse26 .cse1 .cse2 .cse17 .cse3 (not (<= (+ 2 ~local~0) ~token~0)) .cse19 .cse5 .cse27 .cse7 .cse8 .cse9 .cse11 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 (not (< ~token~0 (+ 3 ~local~0))) (not .cse29)) (or .cse1 .cse2 .cse30 .cse3 .cse19 .cse5 .cse31 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse29) (or .cse0 .cse26 .cse1 .cse2 .cse32 .cse3 .cse33 .cse34 .cse18 (and .cse35 .cse36 .cse37) .cse38 .cse5 .cse7 .cse8 .cse9 .cse39 .cse11 .cse21 .cse12 .cse40 .cse41 .cse15 .cse42) (or .cse26 .cse1 .cse2 .cse17 .cse32 .cse3 .cse33 .cse34 .cse18 .cse19 .cse38 .cse5 .cse7 .cse8 .cse9 .cse11 .cse21 .cse12 .cse40 .cse41 .cse28 .cse15 .cse42) (or .cse1 .cse2 .cse30 .cse3 .cse4 .cse19 .cse5 .cse31 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse1 .cse2 .cse3 .cse18 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse21 .cse12 (and .cse43 .cse35 .cse37) .cse13 .cse15 .cse16 .cse29) (or .cse0 .cse26 .cse44 .cse1 .cse2 .cse32 .cse3 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse39 .cse11 .cse12 .cse40 .cse41 .cse14 .cse45 .cse15 .cse42) (or .cse1 .cse2 .cse17 .cse3 .cse19 .cse5 .cse27 .cse7 .cse20 .cse8 .cse9 .cse11 .cse12 .cse22 .cse23 .cse13 .cse14 .cse15 .cse16 .cse25) (or .cse26 .cse1 .cse2 (and .cse35 (= 2 ~t1_st~0) .cse46) .cse32 .cse3 .cse33 .cse34 .cse19 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse40 .cse41 .cse28 .cse14 .cse45 .cse15 .cse42))))) [2022-11-03 02:19:47,892 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2022-11-03 02:19:47,893 INFO L895 garLoopResultBuilder]: At program point immediate_notify_threadsENTRY(lines 84 108) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (<= 2 |old(~p_dw_st~0)|)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (not (<= ~t2_pc~0 0)) (not (= 0 ~t2_st~0)) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-11-03 02:19:47,893 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2022-11-03 02:19:47,893 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2022-11-03 02:19:47,893 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2022-11-03 02:19:47,893 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2022-11-03 02:19:47,894 INFO L899 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2022-11-03 02:19:47,894 INFO L895 garLoopResultBuilder]: At program point L61(lines 49 63) the Hoare annotation is: (or (not (= ~m_pc~0 ~t1_pc~0)) (not (<= 2 |old(~p_dw_st~0)|)) (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) (= ~m_pc~0 1) (not (<= ~t2_pc~0 0)) (not (= 0 ~t2_st~0)) (not (= ~t1_st~0 0)) (not (= ~q_free~0 1)) (<= 2 ~p_dw_st~0) (not (= ~c_last_read~0 ~p_last_write~0))) [2022-11-03 02:19:47,894 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2022-11-03 02:19:47,894 INFO L902 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2022-11-03 02:19:47,894 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2022-11-03 02:19:47,895 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 710 747) the Hoare annotation is: (let ((.cse34 (= ~t2_pc~0 1)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse22 (not (= ~m_st~0 0))) (.cse39 (= ~m_st~0 2)) (.cse43 (= ~q_free~0 0)) (.cse38 (= ~c_num_read~0 0)) (.cse41 (= ~p_last_write~0 ~q_buf_0~0)) (.cse36 (= ~p_dw_pc~0 0)) (.cse40 (= ~t1_i~0 1)) (.cse37 (= ~p_num_write~0 0)) (.cse42 (= 2 ~t2_st~0)) (.cse35 (= ~t1_pc~0 1)) (.cse47 (= ~c_dr_pc~0 0)) (.cse46 (= ~t2_i~0 1)) (.cse45 (= ~p_dw_st~0 0)) (.cse44 (= ~E_M~0 ~E_1~0)) (.cse48 (= ~E_2~0 |old(~E_2~0)|)) (.cse49 (= ~E_1~0 2))) (let ((.cse5 (not (= 2 |old(~E_1~0)|))) (.cse19 (and .cse44 .cse48 .cse49)) (.cse28 (not (<= ~token~0 ~local~0))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse13 (= ~m_pc~0 1)) (.cse23 (not (<= ~t2_pc~0 0))) (.cse25 (not (= 0 ~t2_st~0))) (.cse26 (and (<= 2 ~E_1~0) (not (= ~E_2~0 1)) (not (= ~E_M~0 1)))) (.cse27 (not (= ~t1_st~0 0))) (.cse0 (not .cse45)) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse2 (not .cse46)) (.cse3 (not .cse47)) (.cse4 (not .cse35)) (.cse6 (not .cse42)) (.cse7 (not .cse37)) (.cse8 (not .cse40)) (.cse9 (not .cse36)) (.cse10 (not .cse41)) (.cse11 (not (= 2 ~t1_st~0))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse14 (= |old(~E_M~0)| 1)) (.cse15 (not .cse38)) (.cse16 (not .cse43)) (.cse24 (not .cse39)) (.cse17 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse18 (= |old(~E_2~0)| 1)) (.cse30 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse22)) (.cse31 (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (= ~E_M~0 |old(~E_M~0)|) .cse42 .cse43 .cse44 .cse34 (= ~E_2~0 2) .cse45 .cse46 .cse47 (= ~E_1~0 |old(~E_1~0)|) .cse33 .cse48 .cse49)) (.cse20 (not .cse34)) (.cse21 (not .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 (not (<= (+ 2 ~local~0) ~token~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse20 .cse21 (not (< ~token~0 (+ 3 ~local~0)))) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse24 .cse18 .cse25 .cse26 .cse21) (or .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse18 .cse26 .cse27 .cse20 .cse21) (or (not (= ~m_pc~0 ~t1_pc~0)) .cse0 .cse1 .cse2 .cse3 .cse28 .cse5 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_pc~0 0)) .cse15 .cse23 .cse16 .cse17 .cse29 .cse19 .cse25 .cse30 .cse27 .cse21) (or .cse0 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse24 .cse18 .cse26 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse24 .cse17 .cse29 .cse18 .cse30 .cse31 .cse20 .cse21) (or .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse24 .cse18 .cse25 .cse26 .cse27 .cse21) (let ((.cse32 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse24 .cse17 (not (<= .cse32 ~token~0)) .cse18 .cse30 .cse31 .cse20 .cse21 (not (<= ~token~0 .cse32))))))) [2022-11-03 02:19:47,895 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2022-11-03 02:19:47,897 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 786 819) the Hoare annotation is: (let ((.cse51 (= |old(~m_st~0)| 0))) (let ((.cse59 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse23 (not (= ~E_M~0 ~E_1~0))) (.cse60 (not (= ~E_1~0 1))) (.cse64 (+ ~local~0 1)) (.cse41 (= ~E_2~0 1)) (.cse24 (not .cse51)) (.cse62 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse63 (= ~t1_pc~0 1)) (.cse61 (= ~t2_pc~0 1)) (.cse29 (= ~p_dw_pc~0 0)) (.cse30 (<= 2 ~E_1~0)) (.cse31 (= ~p_num_write~0 0)) (.cse58 (not (= ~m_pc~0 ~t1_pc~0))) (.cse32 (= ~c_num_read~0 0)) (.cse33 (= ~t1_i~0 1)) (.cse34 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (= |old(~t1_st~0)| ~t1_st~0)) (.cse9 (= ~m_pc~0 1)) (.cse14 (= ~m_st~0 |old(~m_st~0)|)) (.cse35 (= ~q_free~0 0)) (.cse36 (= |old(~t2_st~0)| ~t2_st~0)) (.cse37 (= ~p_dw_st~0 0)) (.cse38 (= ~t2_i~0 1)) (.cse39 (= ~c_dr_pc~0 0)) (.cse40 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse20 (not (<= (+ 2 ~local~0) ~token~0))) (.cse28 (not (< ~token~0 (+ 3 ~local~0)))) (.cse42 (and .cse29 .cse30 .cse31 .cse58 .cse32 .cse33 .cse34 .cse13 (not .cse9) .cse14 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40)) (.cse22 (and .cse63 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse13 .cse14 .cse35 .cse36 .cse61 .cse37 .cse38 .cse39 .cse40)) (.cse44 (and .cse24 .cse62)) (.cse48 (not (= ~m_pc~0 0))) (.cse54 (not (= ~t1_pc~0 0))) (.cse43 (and .cse13 .cse14 .cse36)) (.cse21 (not (= ~E_1~0 2))) (.cse45 (not .cse41)) (.cse46 (not (<= .cse64 ~token~0))) (.cse47 (not (<= ~token~0 .cse64))) (.cse19 (not (= ~E_2~0 2))) (.cse50 (not (= ~E_M~0 2))) (.cse52 (not (<= ~token~0 ~local~0))) (.cse4 (not .cse63)) (.cse55 (and .cse60 .cse62)) (.cse56 (not (<= ~local~0 ~token~0))) (.cse25 (not (= |old(~t1_st~0)| 2))) (.cse26 (not .cse61)) (.cse27 (not (= 2 |old(~t2_st~0)|))) (.cse57 (and .cse23 .cse60)) (.cse49 (not (= |old(~t1_st~0)| 0))) (.cse0 (not .cse37)) (.cse1 (not .cse38)) (.cse2 (not .cse39)) (.cse3 (not (= |old(~t2_st~0)| 0))) (.cse53 (and .cse14 .cse59 .cse15)) (.cse5 (not .cse31)) (.cse6 (not .cse33)) (.cse7 (not .cse29)) (.cse8 (not .cse34)) (.cse10 (not .cse32)) (.cse11 (not (<= ~t2_pc~0 0))) (.cse12 (not .cse35)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse17 (not .cse40)) (.cse18 (not .cse30))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (and .cse13 .cse14 .cse15) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse20 .cse4 .cse5 .cse21 .cse22 .cse6 .cse7 .cse8 .cse10 .cse12 .cse23 .cse24 .cse25 .cse26 .cse27 .cse17 .cse18 .cse28) (or (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse13 .cse14 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40) .cse19 .cse0 .cse1 .cse2 .cse41 .cse20 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse12 .cse25 .cse16 .cse26 .cse17 .cse18 .cse28 (not (= ~E_M~0 1))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse42 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse16 .cse26 .cse17 .cse18) (or .cse0 .cse1 .cse43 .cse2 .cse3 .cse44 .cse4 .cse5 .cse6 .cse45 .cse7 .cse8 .cse10 .cse11 .cse12 .cse23 .cse46 .cse16 .cse17 .cse47) (or .cse19 .cse0 .cse1 .cse2 .cse4 .cse48 .cse5 .cse21 .cse42 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse23 .cse25 .cse26 .cse27 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse41 .cse4 .cse5 .cse21 .cse22 .cse6 .cse7 .cse8 .cse10 .cse12 .cse23 .cse46 .cse25 .cse16 .cse26 .cse27 .cse17 .cse18 .cse47) (or .cse49 .cse19 .cse0 .cse1 .cse50 .cse2 .cse51 .cse52 .cse3 .cse53 .cse48 .cse5 .cse6 .cse7 .cse8 .cse54 .cse10 .cse11 .cse12 .cse55 .cse56 .cse17 .cse57) (or .cse19 .cse0 .cse1 .cse43 .cse50 .cse2 .cse51 .cse52 .cse3 .cse4 .cse48 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse55 .cse56 .cse25 .cse17 .cse57) (or .cse49 .cse19 .cse0 .cse1 .cse2 .cse52 .cse3 .cse44 .cse53 .cse48 .cse5 .cse21 .cse6 .cse7 .cse8 .cse54 .cse10 .cse11 .cse12 .cse23 .cse56 .cse17) (or .cse49 .cse19 .cse58 .cse0 .cse1 .cse50 .cse2 .cse51 .cse52 .cse5 (and .cse14 .cse36 .cse59) .cse6 .cse7 .cse8 .cse54 .cse10 .cse12 .cse55 .cse56 .cse26 .cse27 .cse17 .cse57) (or .cse49 .cse0 .cse1 .cse43 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse16 .cse26 .cse17 .cse18) (or .cse0 .cse1 .cse43 .cse2 .cse4 .cse5 .cse21 .cse6 .cse45 .cse7 .cse8 .cse10 .cse12 .cse23 .cse46 .cse16 .cse26 .cse17 .cse18 .cse47) (or .cse19 .cse0 .cse1 (and .cse14 (= 2 ~t1_st~0) .cse36) .cse50 .cse2 .cse51 .cse52 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse12 .cse55 .cse56 .cse25 .cse26 .cse27 .cse17 .cse57) (or .cse49 .cse0 .cse1 .cse2 .cse3 .cse53 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse18))))) [2022-11-03 02:19:47,897 INFO L899 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2022-11-03 02:19:47,898 INFO L895 garLoopResultBuilder]: At program point L585(lines 573 587) the Hoare annotation is: (let ((.cse28 (= ~E_2~0 1)) (.cse45 (= ~m_pc~0 1)) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (= |old(~m_st~0)| 0))) (let ((.cse43 (= 0 ~t2_st~0)) (.cse22 (= ~t1_st~0 0)) (.cse19 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse40 (= 2 ~t1_st~0)) (.cse23 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse41 (= ~E_1~0 2)) (.cse71 (+ ~local~0 1)) (.cse68 (not .cse7)) (.cse32 (not (= ~E_M~0 ~E_1~0))) (.cse69 (= ~t1_pc~0 1)) (.cse55 (= ~p_dw_pc~0 0)) (.cse56 (<= 2 ~E_1~0)) (.cse57 (= ~p_num_write~0 0)) (.cse2 (not .cse44)) (.cse58 (= ~c_num_read~0 0)) (.cse59 (= ~t1_i~0 1)) (.cse60 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse61 (not .cse45)) (.cse20 (= ~m_st~0 |old(~m_st~0)|)) (.cse62 (= ~q_free~0 0)) (.cse52 (not .cse28)) (.cse21 (= |old(~t2_st~0)| ~t2_st~0)) (.cse70 (= ~t2_pc~0 1)) (.cse63 (= ~p_dw_st~0 0)) (.cse64 (= ~t2_i~0 1)) (.cse65 (= ~c_dr_pc~0 0)) (.cse66 (= ~c_last_read~0 ~p_last_write~0)) (.cse73 (not (= ~E_1~0 1))) (.cse72 (not (= ~E_M~0 |old(~m_st~0)|)))) (let ((.cse16 (and .cse73 .cse72)) (.cse33 (and .cse69 .cse55 .cse56 .cse57 .cse2 .cse58 (= ~m_st~0 2) .cse59 .cse60 .cse18 .cse61 .cse20 .cse62 .cse52 .cse21 .cse70 .cse63 .cse64 .cse65 .cse66)) (.cse38 (not (= ~m_pc~0 0))) (.cse13 (not (= ~t1_pc~0 0))) (.cse42 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse5 (not (= ~E_M~0 2))) (.cse8 (not (<= ~token~0 ~local~0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse27 (and .cse32 .cse73)) (.cse67 (and .cse68 .cse72)) (.cse50 (= |old(~t1_st~0)| ~t1_st~0)) (.cse51 (and .cse55 .cse56 .cse57 .cse2 .cse58 .cse59 .cse60 .cse61 .cse62 .cse21 .cse63 .cse64 .cse65 .cse66)) (.cse53 (not (<= .cse71 ~token~0))) (.cse54 (not (<= ~token~0 .cse71))) (.cse1 (not (= ~E_2~0 2))) (.cse48 (not (<= (+ 2 ~local~0) ~token~0))) (.cse29 (not .cse69)) (.cse30 (not .cse41)) (.cse31 (and .cse18 .cse19 .cse20 .cse40 .cse21 .cse23)) (.cse34 (not (= |old(~t1_st~0)| 2))) (.cse24 (not .cse70)) (.cse25 (not (= 2 |old(~t2_st~0)|))) (.cse49 (not (< ~token~0 (+ 3 ~local~0)))) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse3 (not .cse63)) (.cse4 (not .cse64)) (.cse6 (not .cse65)) (.cse47 (and .cse69 .cse22)) (.cse37 (not (= |old(~t2_st~0)| 0))) (.cse9 (not .cse57)) (.cse10 (not .cse59)) (.cse11 (not .cse55)) (.cse12 (not .cse60)) (.cse14 (not .cse58)) (.cse39 (not (<= ~t2_pc~0 0))) (.cse15 (not .cse62)) (.cse46 (and .cse18 .cse19 .cse20 .cse22 .cse43 .cse23)) (.cse35 (not (= 2 |old(~m_st~0)|))) (.cse26 (not .cse66)) (.cse36 (not .cse56))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse24 .cse25 .cse26 .cse27) (or .cse1 .cse3 .cse4 .cse6 .cse8 .cse28 .cse29 .cse9 .cse30 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse32 .cse17 .cse33 .cse34 .cse35 .cse24 .cse25 .cse26 .cse36) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse37 .cse29 .cse38 .cse9 .cse10 .cse11 .cse12 .cse14 .cse39 .cse15 .cse16 .cse17 (and .cse40 .cse41 .cse23) .cse34 (and .cse42 .cse18 .cse19 .cse20 .cse22 .cse43) .cse26 .cse27) (or .cse1 .cse3 .cse4 .cse44 .cse6 .cse29 .cse38 .cse9 .cse30 .cse10 .cse11 .cse12 .cse45 .cse14 .cse31 .cse15 .cse32 .cse34 .cse24 .cse25 .cse26 .cse36) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse37 .cse38 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39 .cse15 .cse16 .cse17 .cse46 .cse26 .cse27) (or .cse0 .cse3 .cse4 .cse6 .cse47 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse15 (and .cse18 .cse20 .cse21 .cse22 .cse23) .cse35 .cse24 .cse26 .cse36) (or .cse1 .cse3 .cse4 (and .cse19 .cse40 .cse23) (and .cse42 .cse19 .cse22) .cse5 .cse44 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse15 .cse16 .cse17 .cse34 .cse24 .cse25 .cse26 .cse27) (or (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse19 (= ~m_st~0 0) .cse40 .cse21 .cse23) .cse1 .cse3 .cse4 .cse6 .cse28 .cse48 .cse29 .cse9 .cse30 .cse10 .cse11 .cse12 .cse14 .cse15 .cse33 .cse34 .cse35 .cse24 .cse26 .cse36 .cse49 (not (= ~E_M~0 1))) (or (and .cse18 .cse50 .cse20 .cse21 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse23) .cse3 .cse4 .cse6 .cse51 .cse29 .cse9 .cse30 .cse10 .cse52 .cse11 .cse12 .cse14 .cse15 .cse32 .cse53 .cse35 .cse24 .cse26 .cse36 .cse54) (or .cse3 .cse4 .cse6 .cse37 .cse29 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse39 .cse15 (and .cse18 .cse19 .cse20 .cse43) .cse35 .cse26 .cse36) (or .cse3 .cse4 .cse44 .cse6 (and .cse55 .cse56 .cse57 .cse2 .cse58 .cse59 .cse60 .cse18 .cse61 .cse20 .cse62 .cse21 .cse63 .cse64 .cse65 .cse66) .cse29 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse15 .cse35 .cse24 .cse26 .cse36) (or .cse0 .cse1 .cse3 .cse4 .cse6 .cse8 .cse37 .cse67 .cse38 .cse9 .cse30 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39 .cse15 .cse32 .cse17 .cse46 .cse26) (or .cse1 .cse3 .cse4 (and .cse42 .cse18 .cse19 .cse20 .cse21 .cse22) .cse5 .cse6 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse17 .cse34 .cse24 .cse41 .cse25 .cse26 .cse27) (or .cse3 .cse4 .cse6 .cse37 .cse67 .cse61 .cse29 .cse9 .cse10 .cse52 .cse11 .cse12 .cse14 .cse39 .cse15 .cse32 .cse53 .cse35 .cse26 .cse54 (and .cse18 .cse50 .cse19 .cse20 .cse43 .cse23)) (or .cse1 .cse3 .cse4 .cse6 .cse28 .cse51 .cse29 .cse9 .cse30 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse32 .cse53 .cse34 .cse35 .cse24 .cse25 .cse26 .cse36 .cse54) (or .cse1 .cse3 .cse4 .cse6 .cse48 .cse29 .cse9 .cse30 .cse10 .cse11 .cse12 .cse14 .cse31 .cse15 .cse32 .cse68 .cse34 .cse24 .cse25 .cse26 .cse36 .cse49) (or .cse0 .cse3 .cse4 .cse6 .cse47 .cse37 .cse9 .cse10 .cse11 .cse12 .cse45 .cse14 .cse39 .cse15 .cse46 .cse35 .cse26 .cse36))))) [2022-11-03 02:19:47,898 INFO L899 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2022-11-03 02:19:47,899 INFO L899 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2022-11-03 02:19:47,899 INFO L899 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2022-11-03 02:19:47,899 INFO L899 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2022-11-03 02:19:47,899 INFO L899 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2022-11-03 02:19:47,900 INFO L895 garLoopResultBuilder]: At program point L566(lines 554 568) the Hoare annotation is: (let ((.cse63 (= |old(~m_st~0)| 0)) (.cse55 (= ~m_pc~0 1)) (.cse53 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~E_2~0 1)) (.cse75 (= ~E_M~0 ~E_1~0))) (let ((.cse14 (not .cse75)) (.cse73 (not (= ~E_1~0 1))) (.cse48 (<= ~t2_pc~0 0)) (.cse71 (= ~t1_st~0 0)) (.cse46 (= 0 ~t2_st~0)) (.cse72 (= ~E_2~0 2)) (.cse65 (= ~E_1~0 2)) (.cse47 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse39 (not .cse4)) (.cse56 (= ~t1_pc~0 1)) (.cse24 (= ~p_dw_pc~0 0)) (.cse25 (<= 2 ~E_1~0)) (.cse26 (= ~p_num_write~0 0)) (.cse27 (not .cse53)) (.cse28 (= ~c_num_read~0 0)) (.cse29 (= ~t1_i~0 1)) (.cse30 (= ~p_last_write~0 ~q_buf_0~0)) (.cse44 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse31 (= |old(~t1_st~0)| ~t1_st~0)) (.cse32 (not .cse55)) (.cse45 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (= ~q_free~0 0)) (.cse34 (= |old(~t2_st~0)| ~t2_st~0)) (.cse70 (= ~t2_pc~0 1)) (.cse35 (= ~p_dw_st~0 0)) (.cse36 (= ~t2_i~0 1)) (.cse37 (= ~c_dr_pc~0 0)) (.cse38 (= ~c_last_read~0 ~p_last_write~0)) (.cse69 (not .cse63)) (.cse74 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse76 (+ ~local~0 1))) (let ((.cse15 (not (<= .cse76 ~token~0))) (.cse22 (not (<= ~token~0 .cse76))) (.cse42 (and .cse69 .cse74)) (.cse23 (and .cse56 .cse24 .cse25 .cse26 .cse27 .cse28 (= ~m_st~0 2) .cse29 .cse30 .cse44 .cse31 .cse32 .cse45 .cse33 .cse34 .cse70 .cse35 .cse36 .cse37 .cse38)) (.cse49 (= 2 ~t1_st~0)) (.cse51 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse39 .cse34 .cse35 .cse36 .cse37 .cse38)) (.cse9 (and .cse56 .cse24 .cse25 .cse26 .cse28 .cse29 (= ~m_st~0 ~E_M~0) .cse30 .cse44 .cse31 (= 2 ~t2_st~0) .cse45 .cse33 .cse34 .cse75 .cse70 .cse72 .cse35 .cse36 .cse37 .cse38 .cse65 .cse47)) (.cse58 (and .cse44 .cse45 .cse71 .cse46 .cse47)) (.cse41 (not (= |old(~t2_st~0)| 0))) (.cse54 (not (= ~m_pc~0 0))) (.cse60 (not (= ~t1_pc~0 0))) (.cse43 (not .cse48)) (.cse64 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse62 (not (= ~E_M~0 2))) (.cse59 (not (<= ~token~0 ~local~0))) (.cse67 (and .cse73 .cse74)) (.cse61 (not (<= ~local~0 ~token~0))) (.cse66 (and .cse14 .cse73)) (.cse0 (not .cse72)) (.cse50 (not (<= (+ 2 ~local~0) ~token~0))) (.cse5 (not .cse56)) (.cse7 (not .cse65)) (.cse16 (not (= |old(~t1_st~0)| 2))) (.cse40 (and .cse24 .cse25 .cse26 .cse28 .cse29 .cse30 .cse44 .cse31 .cse45 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse47)) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse52 (not (< ~token~0 (+ 3 ~local~0)))) (.cse57 (not (= |old(~t1_st~0)| 0))) (.cse1 (not .cse35)) (.cse2 (not .cse36)) (.cse3 (not .cse37)) (.cse6 (not .cse26)) (.cse8 (not .cse29)) (.cse10 (not .cse24)) (.cse11 (not .cse30)) (.cse12 (not .cse28)) (.cse13 (not .cse33)) (.cse68 (and .cse44 .cse45 .cse34 .cse71 .cse47)) (.cse17 (not (= 2 |old(~m_st~0)|))) (.cse18 (not .cse70)) (.cse20 (not .cse38)) (.cse21 (not .cse25))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse39 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse40 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse41 .cse42 .cse5 .cse6 .cse8 .cse39 .cse10 .cse11 .cse12 .cse43 .cse13 .cse14 (and .cse44 .cse31 .cse45 .cse46 .cse47) .cse15 .cse17 (and .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse37 .cse38 .cse48) .cse20 .cse22) (or .cse0 .cse1 .cse2 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) (= ~m_st~0 0) .cse49 .cse34 .cse47) .cse3 .cse4 .cse50 .cse5 .cse6 .cse7 .cse8 .cse51 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse18 .cse20 .cse21 .cse52 (not (= ~E_M~0 1))) (or (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse44 .cse31 .cse32 .cse45 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse47) .cse0 .cse1 .cse2 .cse53 .cse3 .cse5 .cse54 .cse6 .cse7 .cse8 .cse10 .cse11 .cse55 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 .cse20 .cse21) (or .cse56 .cse57 .cse1 .cse2 .cse58 .cse3 .cse41 .cse6 .cse8 .cse10 .cse11 .cse55 .cse12 .cse43 .cse13 .cse17 .cse20 .cse21) (or .cse57 .cse0 .cse1 .cse2 .cse58 .cse3 .cse59 .cse41 .cse42 .cse54 .cse6 .cse7 .cse8 .cse10 .cse11 .cse60 .cse12 .cse43 .cse13 .cse14 .cse61 .cse20) (or .cse0 .cse1 .cse2 .cse62 .cse3 .cse63 .cse59 .cse5 .cse6 .cse8 (and .cse24 .cse26 .cse64 .cse28 .cse29 .cse30 .cse44 .cse31 .cse45 .cse33 .cse34 .cse35 .cse37 .cse38) .cse10 .cse11 .cse12 .cse13 .cse61 .cse16 .cse18 .cse65 .cse19 .cse20 .cse66) (or .cse1 .cse2 .cse53 .cse3 .cse5 .cse6 .cse8 .cse10 .cse11 .cse55 .cse12 .cse13 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse62 .cse3 .cse63 .cse59 .cse41 .cse5 .cse54 .cse6 .cse8 .cse10 .cse11 .cse12 .cse43 .cse13 (and .cse64 .cse44 .cse45 .cse49 .cse46) .cse67 .cse61 (and .cse65 .cse47) .cse16 .cse20 .cse66) (or .cse57 .cse0 .cse27 .cse1 .cse2 .cse62 .cse3 .cse63 .cse59 .cse6 .cse8 .cse10 .cse11 .cse60 .cse12 .cse13 .cse67 .cse61 .cse68 .cse18 .cse19 .cse20 .cse66) (or .cse1 .cse2 .cse3 .cse41 .cse5 .cse6 (and .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse44 .cse31 .cse32 .cse45 .cse33 .cse35 .cse37 .cse38 .cse46 .cse48) .cse8 .cse10 .cse11 .cse55 .cse12 .cse43 .cse13 .cse17 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse59 .cse4 .cse5 .cse6 .cse7 .cse8 .cse51 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse61 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse57 .cse0 .cse1 .cse2 .cse58 .cse62 .cse3 .cse63 .cse59 .cse41 .cse54 .cse6 .cse8 .cse10 .cse11 .cse60 .cse12 .cse43 .cse13 .cse67 .cse61 .cse20 .cse66) (or .cse64 .cse0 .cse1 .cse2 .cse62 .cse53 .cse3 .cse63 .cse59 .cse5 .cse6 .cse8 .cse10 .cse11 .cse55 .cse12 .cse13 .cse67 .cse61 .cse16 .cse18 .cse19 .cse20 .cse66 .cse47) (or .cse0 .cse1 .cse2 .cse3 .cse50 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse69 .cse16 .cse18 .cse40 .cse19 .cse20 .cse21 .cse52) (or .cse56 .cse57 .cse1 .cse2 .cse3 .cse6 .cse8 .cse10 .cse11 .cse55 .cse12 .cse13 .cse68 .cse17 .cse18 .cse20 .cse21))))) [2022-11-03 02:19:47,901 INFO L899 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2022-11-03 02:19:47,901 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2022-11-03 02:19:47,901 INFO L899 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2022-11-03 02:19:47,901 INFO L899 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2022-11-03 02:19:47,902 INFO L895 garLoopResultBuilder]: At program point L547(lines 535 549) the Hoare annotation is: (let ((.cse52 (= |old(~m_st~0)| 0))) (let ((.cse24 (<= 2 ~E_1~0)) (.cse38 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (= ~q_free~0 0)) (.cse26 (= ~c_num_read~0 0)) (.cse28 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~p_dw_pc~0 0)) (.cse27 (= ~t1_i~0 1)) (.cse25 (= ~p_num_write~0 0)) (.cse55 (= 0 ~t2_st~0)) (.cse37 (= ~c_dr_pc~0 0)) (.cse36 (= ~t2_i~0 1)) (.cse35 (= ~p_dw_st~0 0)) (.cse19 (not (= ~E_M~0 ~E_1~0))) (.cse34 (= ~t2_pc~0 1)) (.cse63 (not (= ~E_1~0 1))) (.cse22 (= ~t1_pc~0 1)) (.cse62 (= ~t1_st~0 0)) (.cse65 (+ ~local~0 1)) (.cse48 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse29 (= |old(~t1_st~0)| ~t1_st~0)) (.cse45 (= ~m_st~0 |old(~m_st~0)|)) (.cse33 (= |old(~t2_st~0)| ~t2_st~0)) (.cse39 (= ~E_2~0 1)) (.cse58 (not .cse52)) (.cse64 (not (= ~E_M~0 |old(~m_st~0)|))) (.cse57 (= ~m_pc~0 1))) (let ((.cse40 (not (<= (+ 2 ~local~0) ~token~0))) (.cse47 (not (< ~token~0 (+ 3 ~local~0)))) (.cse9 (not (= ~m_pc~0 0))) (.cse30 (not .cse57)) (.cse7 (and .cse58 .cse64)) (.cse32 (not .cse39)) (.cse60 (and .cse48 .cse29 .cse45 .cse33)) (.cse11 (not (= ~E_1~0 2))) (.cse49 (not (<= .cse65 ~token~0))) (.cse50 (not (<= ~token~0 .cse65))) (.cse15 (not (= ~t1_pc~0 0))) (.cse61 (and .cse48 .cse45 .cse33 .cse62)) (.cse1 (not (= ~E_2~0 2))) (.cse51 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse41 (not .cse22)) (.cse53 (and .cse63 .cse64)) (.cse20 (not (<= ~local~0 ~token~0))) (.cse42 (not (= |old(~t1_st~0)| 2))) (.cse44 (not .cse34)) (.cse59 (not (= 2 |old(~t2_st~0)|))) (.cse54 (= 2 ~t1_st~0)) (.cse56 (and .cse19 .cse63)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse35)) (.cse3 (not .cse36)) (.cse4 (not .cse37)) (.cse6 (not (= |old(~t2_st~0)| 0))) (.cse8 (and .cse48 .cse45 .cse62 .cse55)) (.cse10 (not .cse25)) (.cse12 (not .cse27)) (.cse13 (not .cse23)) (.cse14 (not .cse28)) (.cse16 (not .cse26)) (.cse17 (not (<= ~t2_pc~0 0))) (.cse18 (not .cse31)) (.cse43 (not (= 2 |old(~m_st~0)|))) (.cse21 (not .cse38)) (.cse46 (not .cse24))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse1 .cse2 .cse3 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse4 .cse39 .cse40 .cse41 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse42 .cse43 .cse44 (and .cse23 .cse24 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse25 .cse26 .cse27 .cse28 .cse29 .cse45 .cse31 .cse33 .cse35 .cse36 .cse37 .cse38) .cse21 .cse46 .cse47 (not (= ~E_M~0 1))) (or .cse2 .cse3 (and .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse45 .cse31 .cse33 .cse35 .cse36 .cse37 .cse38) .cse4 .cse41 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse16 .cse18 .cse19 .cse49 .cse43 .cse44 .cse21 .cse46 .cse50) (or .cse1 .cse2 .cse3 .cse51 .cse4 .cse52 .cse5 .cse6 .cse41 .cse9 .cse10 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse53 .cse20 (and .cse48 .cse45 .cse54 .cse55) .cse42 .cse21 .cse56) (or .cse2 .cse3 (and .cse48 .cse29 .cse45 .cse55) .cse4 .cse6 .cse41 .cse10 .cse12 .cse13 .cse14 .cse57 .cse16 .cse17 .cse18 .cse43 .cse21 .cse46) (or .cse0 .cse1 .cse2 .cse3 .cse51 .cse4 .cse52 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse53 .cse20 .cse21 .cse56) (or .cse1 .cse2 .cse3 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 (= ~m_st~0 0) .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse4 .cse40 .cse41 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 .cse58 .cse42 .cse44 .cse59 .cse21 .cse46 .cse47) (or .cse1 .cse2 .cse3 .cse4 .cse41 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse30 .cse45 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse57 .cse16 .cse18 .cse19 .cse42 .cse44 .cse59 .cse21 .cse46) (or .cse2 .cse3 .cse4 .cse41 .cse10 .cse12 .cse13 .cse14 .cse57 .cse16 .cse18 .cse60 .cse43 .cse44 .cse21 .cse46) (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse41 .cse10 .cse12 .cse32 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse49 .cse60 .cse43 .cse21 .cse50) (or .cse1 .cse2 .cse3 .cse4 .cse39 .cse41 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse19 .cse49 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse48 .cse29 .cse45 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) .cse42 .cse43 .cse44 .cse59 .cse21 .cse46 .cse50) (or .cse0 .cse1 (not (= ~m_pc~0 ~t1_pc~0)) .cse2 .cse3 .cse51 .cse4 .cse52 .cse5 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse53 .cse20 .cse61 .cse44 .cse59 .cse21 .cse56) (or .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse13 .cse14 .cse57 .cse16 .cse18 .cse61 .cse43 .cse44 .cse21 .cse46) (or .cse1 .cse2 .cse3 .cse51 .cse4 .cse52 .cse5 .cse41 .cse10 .cse12 .cse13 .cse14 .cse16 .cse18 .cse53 .cse20 .cse42 .cse44 .cse59 (and .cse48 .cse45 .cse54 .cse33) .cse21 .cse56) (or .cse0 .cse2 .cse3 .cse4 .cse6 .cse8 .cse10 .cse12 .cse13 .cse14 .cse57 .cse16 .cse17 .cse18 .cse43 .cse21 .cse46))))) [2022-11-03 02:19:47,903 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2022-11-03 02:19:47,903 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2022-11-03 02:19:47,903 INFO L895 garLoopResultBuilder]: At program point L961(lines 908 966) the Hoare annotation is: (= ~p_dw_st~0 0) [2022-11-03 02:19:47,904 INFO L895 garLoopResultBuilder]: At program point L895(line 895) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,904 INFO L895 garLoopResultBuilder]: At program point L895-1(line 895) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,904 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2022-11-03 02:19:47,905 INFO L899 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2022-11-03 02:19:47,905 INFO L899 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2022-11-03 02:19:47,905 INFO L895 garLoopResultBuilder]: At program point L467(lines 467 471) the Hoare annotation is: (let ((.cse15 (= 0 ~t2_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse10 (= ~E_2~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse22 (not (= ~E_2~0 1))) (.cse24 (= ~t2_pc~0 1)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse22 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse24 .cse10 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse14 .cse16 .cse17 .cse18) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse6 .cse7 .cse21 .cse8 .cse22 .cse24 .cse11 .cse12 .cse13 .cse14 .cse23))) [2022-11-03 02:19:47,905 INFO L899 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2022-11-03 02:19:47,906 INFO L899 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2022-11-03 02:19:47,906 INFO L895 garLoopResultBuilder]: At program point L204(lines 153 209) the Hoare annotation is: (and (= ~c_dr_st~0 2) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:19:47,906 INFO L895 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse24 (= ~t1_st~0 0)) (.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse4 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ 3 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 .cse25) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse25 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19))) [2022-11-03 02:19:47,907 INFO L899 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2022-11-03 02:19:47,907 INFO L895 garLoopResultBuilder]: At program point L503(lines 503 507) the Hoare annotation is: (let ((.cse32 (+ ~local~0 1))) (let ((.cse25 (= ~t2_pc~0 1)) (.cse21 (= ~m_st~0 0)) (.cse23 (= ~m_pc~0 0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse31 (<= 2 ~t1_st~0)) (.cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse24 (<= ~token~0 .cse32)) (.cse22 (= 2 ~t1_st~0)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse26 (<= .cse32 ~token~0)) (.cse11 (= ~E_2~0 2)) (.cse15 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse19 (= ~E_1~0 2)) (.cse1 (= ~p_dw_pc~0 0)) (.cse27 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse29 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse30 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse8 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse24 .cse8 .cse22 .cse9 .cse25 .cse26 .cse11 .cse12 .cse13 .cse14 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse15 .cse16 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= ~t1_pc~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse28 .cse8 .cse29 .cse12 .cse13 .cse14 .cse16 .cse20 .cse30) (and .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse25 .cse12 .cse13 .cse14 .cse16 .cse30) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse28 .cse8 .cse29 .cse25 .cse12 .cse13 .cse14 .cse16 .cse30) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse22 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse31 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse22 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20) (and .cse1 .cse27 .cse2 .cse3 .cse4 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse12 .cse13 .cse14 .cse16 .cse20 .cse30)))) [2022-11-03 02:19:47,908 INFO L895 garLoopResultBuilder]: At program point L437(line 437) the Hoare annotation is: (let ((.cse28 (= ~E_1~0 1))) (let ((.cse7 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~t1_st~0 0)) (.cse24 (= 2 ~t2_st~0)) (.cse25 (= ~t2_pc~0 1)) (.cse26 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (or .cse28 (= ~E_M~0 ~E_1~0))) (.cse8 (or (= ~m_st~0 ~E_M~0) .cse28)) (.cse9 (= ~q_free~0 0)) (.cse27 (= 2 ~t1_st~0)) (.cse11 (or .cse28 (and (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|)) (= ~E_1~0 |old(~E_1~0)|)))) (.cse12 (= ~E_2~0 2)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (not (= ~m_st~0 0))) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~E_M~0 2)) (.cse20 (= 0 ~t2_st~0)) (.cse21 (<= ~token~0 ~local~0)) (.cse22 (<= ~local~0 ~token~0)) (.cse23 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22) (and .cse26 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse24 .cse8 .cse9 .cse27 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse18 .cse19 .cse21 .cse22) (and .cse26 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2022-11-03 02:19:47,908 INFO L899 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2022-11-03 02:19:47,908 INFO L899 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2022-11-03 02:19:47,908 INFO L895 garLoopResultBuilder]: At program point L142(line 142) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:19:47,908 INFO L899 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2022-11-03 02:19:47,909 INFO L895 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse24 (= ~t1_st~0 0)) (.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse4 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ 3 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 .cse25) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse25 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19))) [2022-11-03 02:19:47,909 INFO L895 garLoopResultBuilder]: At program point L935-1(line 935) the Hoare annotation is: (let ((.cse20 (= ~t1_st~0 0)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (<= ~t2_pc~0 0)) (.cse7 (= 2 ~t2_st~0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~E_2~0 2)) (.cse17 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse18 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse11 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17) (and .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse20 .cse11 .cse13 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse13 .cse14 .cse15 .cse16 .cse21 .cse22) (and .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse20 .cse13 .cse14 .cse15 .cse16 .cse21 .cse22) (let ((.cse23 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 .cse23) .cse8 .cse9 .cse10 .cse11 (<= .cse23 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse5 .cse6 .cse7 .cse19 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17) (and .cse0 .cse1 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 .cse19 .cse8 .cse11 .cse13 .cse14 .cse15 .cse16))) [2022-11-03 02:19:47,910 INFO L895 garLoopResultBuilder]: At program point L704(lines 645 709) the Hoare annotation is: (let ((.cse24 (= ~t1_st~0 0)) (.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse4 (= ~m_st~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse20 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse8 (= ~q_free~0 0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (= ~t2_pc~0 1)) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse7 (= ~m_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 (< ~token~0 (+ 3 ~local~0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse12 .cse14 .cse15 .cse16 .cse17 .cse19) (and .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse8 .cse10 .cse24 .cse14 .cse15 .cse16 .cse17 .cse22 .cse23 .cse19) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~token~0 .cse25) .cse8 .cse9 .cse10 .cse11 .cse12 (<= .cse25 ~token~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)) (and .cse0 .cse1 .cse20 .cse2 .cse3 .cse5 .cse6 .cse7 .cse21 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= ~m_pc~0 0) .cse17 .cse18 .cse19))) [2022-11-03 02:19:47,910 INFO L895 garLoopResultBuilder]: At program point L308(line 308) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,911 INFO L895 garLoopResultBuilder]: At program point L308-1(line 308) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,911 INFO L895 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse19 (= ~m_st~0 ~E_M~0)) (.cse4 (not (= ~m_pc~0 ~t1_pc~0))) (.cse0 (= ~t1_pc~0 1)) (.cse20 (= 2 ~t2_st~0)) (.cse22 (= 2 ~t1_st~0)) (.cse23 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse25 (= ~E_1~0 2)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~m_st~0 2)) (.cse7 (= ~t1_i~0 1)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= 0 ~t2_st~0)) (.cse18 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (let ((.cse21 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 (<= ~token~0 .cse21) .cse10 .cse22 .cse23 .cse11 (<= .cse21 ~token~0) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse19 .cse8 .cse20 .cse10 .cse22 .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 .cse15 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse20 .cse9 .cse10 .cse22 .cse23 .cse11 .cse24 .cse12 .cse13 .cse14 (= ~m_pc~0 0) .cse15 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (<= (+ 2 ~local~0) ~token~0) .cse8 .cse20 (= ~m_st~0 0) .cse10 .cse22 .cse23 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse12 .cse13 .cse14 .cse15 .cse25) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18))) [2022-11-03 02:19:47,912 INFO L895 garLoopResultBuilder]: At program point L937(line 937) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,913 INFO L895 garLoopResultBuilder]: At program point L475-1(lines 463 494) the Hoare annotation is: (let ((.cse32 (+ ~local~0 1))) (let ((.cse8 (<= ~token~0 .cse32)) (.cse13 (<= .cse32 ~token~0)) (.cse23 (= ~m_st~0 ~E_M~0)) (.cse29 (= 2 ~t2_st~0)) (.cse4 (= ~m_st~0 2)) (.cse12 (= ~t2_pc~0 1)) (.cse21 (not (= ~E_M~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse22 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse28 (= ~t1_pc~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse30 (= ~m_st~0 0)) (.cse25 (not (= ~m_pc~0 1))) (.cse9 (= ~q_free~0 0)) (.cse10 (not (= ~E_2~0 1))) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse14 (= ~E_2~0 2)) (.cse15 (= ~p_dw_st~0 0)) (.cse16 (= ~t2_i~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse31 (= ~m_pc~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= 0 ~t2_st~0)) (.cse26 (<= ~token~0 ~local~0)) (.cse27 (<= ~local~0 ~token~0)) (.cse20 (= ~E_1~0 2)) (.cse24 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse18 .cse19 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse5 .cse22 .cse6 .cse23 .cse7 .cse8 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 .cse24 .cse21) (and .cse0 .cse2 .cse3 .cse5 .cse22 .cse6 .cse23 .cse7 .cse9 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse26 .cse27 .cse20 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 .cse28 .cse6 .cse7 .cse29 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse26 .cse27 .cse20 .cse21) (and .cse0 .cse2 .cse3 .cse5 .cse22 .cse28 .cse6 .cse7 .cse29 .cse30 .cse25 .cse9 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse26 .cse27 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse25 .cse9 .cse10 .cse12 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse22 .cse28 .cse6 .cse7 .cse30 .cse25 .cse9 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19 .cse26 .cse27 .cse20 .cse24)))) [2022-11-03 02:19:47,913 INFO L902 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2022-11-03 02:19:47,913 INFO L895 garLoopResultBuilder]: At program point L146(lines 109 151) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:19:47,913 INFO L899 garLoopResultBuilder]: For program point L675(lines 651 703) no Hoare annotation was computed. [2022-11-03 02:19:47,914 INFO L899 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2022-11-03 02:19:47,914 INFO L899 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2022-11-03 02:19:47,914 INFO L895 garLoopResultBuilder]: At program point L511-1(lines 499 530) the Hoare annotation is: (let ((.cse19 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse1 (<= 2 ~E_1~0)) (.cse9 (not (= ~E_2~0 1))) (.cse15 (not (= ~E_M~0 1))) (.cse17 (not .cse19)) (.cse7 (not (= ~m_pc~0 1))) (.cse23 (= ~m_pc~0 0)) (.cse10 (= ~t1_st~0 0)) (.cse25 (<= ~token~0 ~local~0)) (.cse26 (<= ~local~0 ~token~0)) (.cse20 (= ~m_st~0 0)) (.cse16 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse28 (= 2 ~t1_st~0)) (.cse21 (= ~E_M~0 ~E_1~0)) (.cse22 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse24 (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0)))) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse27 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse16 .cse0 .cse1 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse18 .cse5 .cse6 .cse19 .cse20 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse23 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse28 .cse21 .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse16 .cse0 .cse2 .cse17 .cse3 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse28 .cse21 .cse22 .cse11 .cse12 .cse13 .cse23 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse0 .cse2 .cse3 .cse4 .cse18 (= ~t1_pc~0 0) .cse5 .cse6 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse21 .cse10 .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse16 .cse0 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse20 .cse8 .cse28 .cse21 (< ~token~0 (+ 3 ~local~0)) .cse22 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse24 .cse14 .cse27) (let ((.cse29 (+ ~local~0 1))) (and .cse16 .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 (<= ~token~0 .cse29) .cse8 .cse28 .cse21 (<= .cse29 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27))))) [2022-11-03 02:19:47,915 INFO L895 garLoopResultBuilder]: At program point L445-1(lines 419 458) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse8 (= 2 ~t1_st~0)) (.cse16 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse6 (= 2 ~t2_st~0)) (.cse10 (= ~t2_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse19 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (= ~q_free~0 0)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse26 (= ~t1_st~0 0)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (not (= ~m_st~0 0))) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse20 (= ~m_pc~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= 0 ~t2_st~0)) (.cse22 (<= ~token~0 ~local~0)) (.cse23 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse24 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 2 ~local~0) ~token~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (< ~token~0 (+ 3 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse17 .cse21 .cse22 .cse23 .cse18 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse25 .cse6 .cse7 .cse9 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse17 .cse22 .cse23 .cse18) (and .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse25 .cse7 .cse9 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse17 .cse21 .cse22 .cse23 .cse18 .cse24))) [2022-11-03 02:19:47,915 INFO L895 garLoopResultBuilder]: At program point L280(lines 255 295) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,916 INFO L895 garLoopResultBuilder]: At program point L942(lines 942 951) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,916 INFO L899 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2022-11-03 02:19:47,916 INFO L899 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2022-11-03 02:19:47,916 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2022-11-03 02:19:47,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-03 02:19:47,916 INFO L899 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2022-11-03 02:19:47,917 INFO L899 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2022-11-03 02:19:47,917 INFO L895 garLoopResultBuilder]: At program point L946(line 946) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,918 INFO L895 garLoopResultBuilder]: At program point L946-1(line 946) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse26 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 (= ~m_st~0 0) .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse25))) [2022-11-03 02:19:47,918 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 1) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:19:47,918 INFO L899 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2022-11-03 02:19:47,919 INFO L895 garLoopResultBuilder]: At program point L485(line 485) the Hoare annotation is: (let ((.cse24 (+ ~local~0 1))) (let ((.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse9 (<= ~token~0 .cse24)) (.cse11 (= ~E_M~0 ~E_1~0)) (.cse12 (<= .cse24 ~token~0)) (.cse17 (= ~E_M~0 2)) (.cse18 (= 0 ~t2_st~0)) (.cse19 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse21 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~E_2~0 1)) (.cse22 (not (= ~m_pc~0 1))) (.cse10 (= ~q_free~0 0)) (.cse20 (= ~t2_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse14 (= ~t2_i~0 1)) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_eval2_~tmp~4#1| 1) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse16 .cse17) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse22 .cse10 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse23) (and .cse0 .cse1 .cse21 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse22 .cse10 .cse20 .cse13 .cse14 .cse15 .cse16 .cse23)))) [2022-11-03 02:19:47,919 INFO L899 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2022-11-03 02:19:47,919 INFO L895 garLoopResultBuilder]: At program point L981(lines 981 984) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,920 INFO L895 garLoopResultBuilder]: At program point L453(lines 416 459) the Hoare annotation is: (let ((.cse27 (= ~m_st~0 2)) (.cse7 (= 2 ~t2_st~0)) (.cse11 (= ~t2_pc~0 1)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse23 (not (= ~m_pc~0 ~t1_pc~0))) (.cse25 (= ~t1_pc~0 0)) (.cse26 (= ~t1_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse24 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= 2 ~t1_st~0)) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse12 (or (= |old(~E_M~0)| 0) (= ~E_M~0 |old(~E_M~0)|))) (.cse13 (= ~E_2~0 2)) (.cse14 (= ~p_dw_st~0 0)) (.cse15 (= ~t2_i~0 1)) (.cse16 (= ~c_dr_pc~0 0)) (.cse18 (= ~E_1~0 |old(~E_1~0)|)) (.cse19 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= 0 ~t2_st~0)) (.cse20 (<= ~token~0 ~local~0)) (.cse21 (<= ~local~0 ~token~0)) (.cse22 (= ~E_1~0 2)) (.cse29 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse23 .cse3 .cse24 .cse25 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse24 .cse4 .cse6 .cse8 .cse10 .cse26 .cse13 .cse14 .cse15 .cse16 .cse19 .cse28 .cse20 .cse21 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse6 .cse7 .cse8 .cse10 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse23 .cse3 .cse24 .cse25 .cse4 .cse5 .cse6 .cse8 .cse10 .cse26 .cse13 .cse14 .cse15 .cse16 .cse19 .cse28 .cse20 .cse21 .cse22 .cse29) (and .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse28 .cse20 .cse21 .cse22 .cse29))) [2022-11-03 02:19:47,920 INFO L899 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2022-11-03 02:19:47,920 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,920 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,921 INFO L895 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse35 (+ ~local~0 1))) (let ((.cse22 (<= ~token~0 .cse35)) (.cse25 (<= .cse35 ~token~0)) (.cse5 (= ~t1_pc~0 0)) (.cse27 (<= 2 ~E_1~0)) (.cse29 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse30 (not (= ~E_M~0 1))) (.cse31 (= ~m_st~0 ~E_M~0)) (.cse3 (= ~m_st~0 2)) (.cse4 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse33 (= ~m_st~0 0)) (.cse28 (not (= ~m_pc~0 1))) (.cse26 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse21 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= 2 ~t2_st~0)) (.cse8 (= ~q_free~0 0)) (.cse23 (= 2 ~t1_st~0)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse24 (= ~t2_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse34 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse19) (and .cse21 .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse30) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse31 .cse7 .cse32 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse32 .cse33 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse30) (and .cse21 .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse24 .cse12 .cse13 .cse14 .cse15 .cse30) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse30) (and .cse21 .cse0 .cse1 .cse2 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse32 .cse33 .cse8 .cse23 .cse9 .cse24 (< ~token~0 (+ 3 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse31 .cse7 .cse32 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse33 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse32 .cse33 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse32 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse19)))) [2022-11-03 02:19:47,921 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-03 02:19:47,922 INFO L895 garLoopResultBuilder]: At program point L256(line 256) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,922 INFO L899 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2022-11-03 02:19:47,922 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2022-11-03 02:19:47,922 INFO L895 garLoopResultBuilder]: At program point L521(line 521) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse13 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~m_st~0 2)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse15 (not (= ~E_2~0 1))) (.cse8 (= ~t2_pc~0 1)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~t2_i~0 1)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse7 (= 2 ~t1_st~0) .cse8 (< ~token~0 (+ 3 ~local~0)) (= ~E_2~0 2) .cse9 .cse10 .cse11 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (or (= |exists_runnable_thread2_#res| 1) (not (= 0 ~t2_st~0))) .cse12 (= ~E_1~0 2) (= ~E_M~0 1)) (and .cse0 .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse15 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse15 (= ~t1_st~0 0) .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-11-03 02:19:47,923 INFO L899 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2022-11-03 02:19:47,923 INFO L899 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2022-11-03 02:19:47,923 INFO L895 garLoopResultBuilder]: At program point L125-1(lines 113 150) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~q_free~0 1)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6))) [2022-11-03 02:19:47,924 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,924 INFO L895 garLoopResultBuilder]: At program point L918-1(line 918) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,924 INFO L899 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2022-11-03 02:19:47,924 INFO L899 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2022-11-03 02:19:47,924 INFO L895 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2022-11-03 02:19:47,925 INFO L899 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2022-11-03 02:19:47,925 INFO L899 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2022-11-03 02:19:47,925 INFO L895 garLoopResultBuilder]: At program point L919(line 919) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~E_M~0 ~E_1~0) (= ~t1_st~0 0) (= ~E_2~0 2) (= ~p_dw_st~0 0) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~t2_st~0) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) (<= ~t2_pc~0 0)) [2022-11-03 02:19:47,926 INFO L895 garLoopResultBuilder]: At program point L424(lines 419 458) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~t1_i~0 1) (<= (+ 2 ~local~0) ~token~0) (= ~p_last_write~0 ~q_buf_0~0) (= 2 ~t2_st~0) (= ~q_free~0 0) (= 2 ~t1_st~0) (= ~E_M~0 ~E_1~0) (= ~t2_pc~0 1) (< ~token~0 (+ 3 ~local~0)) (= ~E_2~0 2) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~t2_i~0 1) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) (= ~c_last_read~0 ~p_last_write~0) (= ~E_1~0 2)) [2022-11-03 02:19:47,926 INFO L895 garLoopResultBuilder]: At program point L160(lines 160 164) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (not (= ~m_pc~0 1)) (= ~q_free~0 0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= 2 ~p_dw_st~0) (<= ~t2_pc~0 0) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-11-03 02:19:47,926 INFO L895 garLoopResultBuilder]: At program point L127(lines 113 150) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1)) (<= ~p_num_write~0 ~c_num_read~0) (= ~t1_st~0 0) (= 0 ~t2_st~0) (<= ~t2_pc~0 0) (< ~c_num_read~0 (+ ~p_num_write~0 1))) [2022-11-03 02:19:47,927 INFO L895 garLoopResultBuilder]: At program point L689(lines 651 703) the Hoare annotation is: (let ((.cse35 (+ ~local~0 1))) (let ((.cse22 (<= ~token~0 .cse35)) (.cse25 (<= .cse35 ~token~0)) (.cse5 (= ~t1_pc~0 0)) (.cse27 (<= 2 ~E_1~0)) (.cse29 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse30 (not (= ~E_M~0 1))) (.cse31 (= ~m_st~0 ~E_M~0)) (.cse3 (= ~m_st~0 2)) (.cse4 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse16 (= 0 ~t2_st~0)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse20 (<= ~t2_pc~0 0)) (.cse33 (= ~m_st~0 0)) (.cse28 (not (= ~m_pc~0 1))) (.cse26 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0))) (.cse21 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= 2 ~t2_st~0)) (.cse8 (= ~q_free~0 0)) (.cse23 (= 2 ~t1_st~0)) (.cse9 (= ~E_M~0 ~E_1~0)) (.cse24 (= ~t2_pc~0 1)) (.cse11 (= ~E_2~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse13 (= ~t2_i~0 1)) (.cse14 (= ~c_dr_pc~0 0)) (.cse34 (= ~m_pc~0 0)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse16 .cse19) (and .cse21 .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse30) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse31 .cse7 .cse32 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse22 .cse8 .cse23 .cse9 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse32 .cse33 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse30) (and .cse21 .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse24 .cse12 .cse13 .cse14 .cse15 .cse30) (and .cse0 .cse27 .cse1 .cse2 .cse3 .cse6 .cse7 .cse28 .cse8 .cse29 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse30) (and .cse21 .cse0 .cse1 .cse2 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse32 .cse33 .cse8 .cse23 .cse9 .cse24 (< ~token~0 (+ 3 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse31 .cse7 .cse32 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse33 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse32 .cse33 .cse28 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse32 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse34 .cse15 .cse19)))) [2022-11-03 02:19:47,927 INFO L899 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2022-11-03 02:19:47,927 INFO L899 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2022-11-03 02:19:47,927 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2022-11-03 02:19:47,928 INFO L899 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2022-11-03 02:19:47,928 INFO L895 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2022-11-03 02:19:47,928 INFO L899 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2022-11-03 02:19:47,928 INFO L895 garLoopResultBuilder]: At program point L923-1(lines 920 960) the Hoare annotation is: (let ((.cse2 (<= 2 ~E_1~0)) (.cse5 (= ~m_st~0 2)) (.cse8 (not (= ~m_pc~0 1))) (.cse10 (not (= ~E_2~0 1))) (.cse27 (= ~t1_st~0 0)) (.cse15 (= 0 ~t2_st~0)) (.cse16 (<= ~t2_pc~0 0)) (.cse17 (not (= ~E_M~0 1))) (.cse26 (= ~m_st~0 0)) (.cse18 (= ~m_st~0 ~E_M~0)) (.cse29 (<= ~token~0 ~local~0)) (.cse30 (<= ~local~0 ~token~0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse9 (= ~q_free~0 0)) (.cse21 (= 2 ~t1_st~0)) (.cse22 (= ~E_M~0 ~E_1~0)) (.cse23 (= ~t2_pc~0 1)) (.cse24 (= ~E_2~0 2)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (= ~t2_i~0 1)) (.cse13 (= ~c_dr_pc~0 0)) (.cse28 (= ~m_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (= ~E_1~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (let ((.cse20 (+ ~local~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 (<= ~token~0 .cse20) .cse9 .cse21 .cse22 .cse23 (<= .cse20 ~token~0) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25)) (and .cse1 .cse3 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse26 .cse9 .cse22 .cse27 .cse24 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse29 .cse30 .cse25 .cse16) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse19 .cse26 .cse9 .cse21 .cse22 .cse23 (< ~token~0 (+ 3 ~local~0)) .cse24 .cse11 .cse12 .cse13 .cse14 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse18 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse14 .cse29 .cse30 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse6 .cse7 .cse19 .cse9 .cse21 .cse22 .cse23 .cse24 .cse11 .cse12 .cse13 .cse28 .cse14 .cse25))) [2022-11-03 02:19:47,929 INFO L899 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2022-11-03 02:19:47,929 INFO L895 garLoopResultBuilder]: At program point L296(lines 248 301) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2022-11-03 02:19:47,929 INFO L899 garLoopResultBuilder]: For program point L661(lines 651 703) no Hoare annotation was computed. [2022-11-03 02:19:47,930 INFO L899 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2022-11-03 02:19:47,930 INFO L895 garLoopResultBuilder]: At program point L331-2(lines 331 343) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 1)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (not (= ~m_pc~0 1))) (.cse4 (= ~t1_st~0 0)) (.cse5 (= 0 ~t2_st~0)) (.cse6 (<= ~t2_pc~0 0))) (or (and (= ~c_dr_st~0 2) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 .cse5 .cse6 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) .cse5 .cse6) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse3 (= ~q_free~0 0) .cse4 .cse5 (<= 2 ~p_dw_st~0) .cse6 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,930 INFO L899 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2022-11-03 02:19:47,930 INFO L895 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2022-11-03 02:19:47,931 INFO L895 garLoopResultBuilder]: At program point L200-1(lines 156 208) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (not (= ~m_pc~0 1))) (.cse3 (= ~t1_st~0 0)) (.cse4 (= 0 ~t2_st~0)) (.cse5 (<= ~t2_pc~0 0))) (or (and .cse0 .cse1 (= ~q_free~0 1) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse3 (= ~c_last_read~0 ~p_last_write~0) .cse4 .cse5 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 (= ~q_free~0 0) .cse3 .cse4 (<= 2 ~p_dw_st~0) .cse5 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-11-03 02:19:47,931 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2022-11-03 02:19:47,931 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2022-11-03 02:19:47,931 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2022-11-03 02:19:47,931 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2022-11-03 02:19:47,932 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2022-11-03 02:19:47,932 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 620 644) the Hoare annotation is: true [2022-11-03 02:19:47,932 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2022-11-03 02:19:47,933 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 748 785) the Hoare annotation is: (let ((.cse24 (not (= ~m_st~0 0)))) (let ((.cse4 (not (<= ~token~0 ~local~0))) (.cse27 (not (<= ~t2_pc~0 0))) (.cse17 (not (<= ~local~0 ~token~0))) (.cse28 (not (= 0 ~t2_st~0))) (.cse19 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse24)) (.cse25 (<= 2 ~E_1~0)) (.cse15 (not (= ~m_st~0 2))) (.cse29 (not (= ~t1_st~0 0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse2 (not (= ~t2_i~0 1))) (.cse3 (not (= ~c_dr_pc~0 0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse23 (not (= 2 |old(~E_1~0)|))) (.cse30 (not (= ~m_pc~0 0))) (.cse6 (not (= 2 ~t2_st~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= 2 ~t1_st~0))) (.cse12 (not (<= 2 |old(~E_1~0)|))) (.cse26 (= ~m_pc~0 1)) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse16 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse18 (and (= ~E_M~0 ~E_1~0) (= ~E_2~0 |old(~E_2~0)|) (= ~E_1~0 2))) (.cse20 (not (= ~t2_pc~0 1))) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (not (<= .cse22 ~token~0)) .cse18 .cse19 .cse20 .cse21 (not (<= ~token~0 .cse22)))) (or .cse0 .cse1 .cse2 .cse3 (not (<= (+ 2 ~local~0) ~token~0)) .cse5 .cse23 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse18 .cse24 .cse20 .cse21 (not (< ~token~0 (+ 3 ~local~0)))) (or .cse25 .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse26 .cse13 .cse14 .cse15 .cse20 .cse21) (or .cse25 .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse26 .cse13 .cse27 .cse14 .cse15 .cse28 .cse29 .cse21) (or .cse25 .cse0 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse12 .cse26 .cse13 .cse27 .cse14 .cse15 .cse28 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse30 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_pc~0 0)) .cse13 .cse27 .cse14 .cse16 .cse17 .cse18 .cse28 .cse19 .cse29 .cse21) (or .cse25 .cse0 .cse2 .cse3 .cse7 .cse8 .cse9 .cse10 .cse12 .cse26 .cse13 .cse14 .cse15 .cse29 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse23 .cse30 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse13 .cse14 .cse16 .cse18 .cse20 .cse21)))) [2022-11-03 02:19:47,933 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2022-11-03 02:19:47,937 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:19:47,939 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:19:48,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:19:48 BoogieIcfgContainer [2022-11-03 02:19:48,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:19:48,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:19:48,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:19:48,093 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:19:48,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:13:21" (3/4) ... [2022-11-03 02:19:48,096 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-03 02:19:48,101 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-03 02:19:48,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-11-03 02:19:48,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-03 02:19:48,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-03 02:19:48,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-03 02:19:48,102 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-03 02:19:48,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-03 02:19:48,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-03 02:19:48,103 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-03 02:19:48,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2022-11-03 02:19:48,125 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2022-11-03 02:19:48,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-03 02:19:48,127 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-03 02:19:48,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(c_last_read == p_last_write)) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-03 02:19:48,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) [2022-11-03 02:19:48,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) [2022-11-03 02:19:48,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) && ((((((((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0)) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && ((((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= __retres1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((1 <= __retres1 && 0 == __retres1) && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((1 <= __retres1 || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || __retres1 == 0)) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && ((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-03 02:19:48,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2) [2022-11-03 02:19:48,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1)) [2022-11-03 02:19:48,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && E_1 == \old(E_1)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_1 == \old(E_1)) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) [2022-11-03 02:19:48,169 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || ((2 == t1_st && E_1 == 2) && __retres1 == 0)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || ((1 <= __retres1 && __retres1 == 0) && t1_st == 0)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && (((((((((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-11-03 02:19:48,169 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(m_pc == t1_pc) || !(2 <= \old(p_dw_st))) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(t2_pc <= 0)) || !(0 == t2_st)) || !(t1_st == 0)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write) [2022-11-03 02:19:48,247 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:19:48,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:19:48,252 INFO L158 Benchmark]: Toolchain (without parser) took 388029.74ms. Allocated memory was 100.7MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 69.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 387.8MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,257 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 50.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:19:48,257 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.55ms. Allocated memory is still 100.7MB. Free memory was 68.9MB in the beginning and 72.0MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,257 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.08ms. Allocated memory is still 100.7MB. Free memory was 72.0MB in the beginning and 69.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,260 INFO L158 Benchmark]: Boogie Preprocessor took 40.40ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,263 INFO L158 Benchmark]: RCFGBuilder took 1179.15ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 66.7MB in the beginning and 68.5MB in the end (delta: -1.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,265 INFO L158 Benchmark]: TraceAbstraction took 386126.66ms. Allocated memory was 121.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 68.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-11-03 02:19:48,265 INFO L158 Benchmark]: Witness Printer took 155.10ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:19:48,266 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory was 55.6MB in the beginning and 55.5MB in the end (delta: 50.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.55ms. Allocated memory is still 100.7MB. Free memory was 68.9MB in the beginning and 72.0MB in the end (delta: -3.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.08ms. Allocated memory is still 100.7MB. Free memory was 72.0MB in the beginning and 69.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.40ms. Allocated memory is still 100.7MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1179.15ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 66.7MB in the beginning and 68.5MB in the end (delta: -1.8MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 386126.66ms. Allocated memory was 121.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 68.0MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 155.10ms. Allocated memory is still 1.8GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 390]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 27]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 129 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 385.9s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 134.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10513 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10435 mSDsluCounter, 13485 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10108 mSDsCounter, 4153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10769 IncrementalHoareTripleChecker+Invalid, 14922 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4153 mSolverCounterUnsat, 4997 mSDtfsCounter, 10769 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3491 GetRequests, 2828 SyntacticMatches, 27 SemanticMatches, 636 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32574 ImplicationChecksByTransitivity, 139.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5570occurred in iteration=25, InterpolantAutomatonStates: 405, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 7587 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 10765 PreInvPairs, 12076 NumberOfFragments, 23867 HoareAnnotationTreeSize, 10765 FomulaSimplifications, 305189 FormulaSimplificationTreeSizeReduction, 61.6s HoareSimplificationTime, 63 FomulaSimplificationsInter, 1561157 FormulaSimplificationTreeSizeReductionInter, 72.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 4770 NumberOfCodeBlocks, 4713 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 5198 ConstructedInterpolants, 0 QuantifiedInterpolants, 10458 SizeOfPredicates, 36 NumberOfNonLiveVariables, 9317 ConjunctsInSsa, 178 ConjunctsInUnsatCore, 56 InterpolantComputations, 28 PerfectInterpolantSequences, 3207/3569 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 942]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 535]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(c_last_read == p_last_write)) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && 1 <= __retres1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || ((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && ((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || ((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || (((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 916]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: ((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 981]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0 - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_1 == 2) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) && ((((((((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || ((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0)) || !(c_last_read == p_last_write)) || !(token <= local + 1))) && ((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((1 <= __retres1 && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && ((((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || (((((((((((((p_dw_pc == 0 && p_num_write == 0) && 1 <= __retres1) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || ((((1 <= __retres1 && 0 == __retres1) && m_st == \old(m_st)) && 2 == t1_st) && 0 == t2_st)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (E_1 == 2 && __retres1 == 0)) || !(\old(t1_st) == 2)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && 2 == t2_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && __retres1 == 0)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((((0 == __retres1 && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((((((1 <= __retres1 || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) || __retres1 == 0)) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && \old(t1_st) == t1_st) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && ((((((((((((((((t1_pc == 1 || !(\old(t1_st) == 0)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && !(m_st == 0)) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_1 == 2 - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || E_2 == 1) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || ((2 == t1_st && E_1 == 2) && __retres1 == 0)) || !(\old(t1_st) == 2)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || !(t1_pc == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(\old(t2_st) == 0)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || ((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0) && __retres1 == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || ((__retres1 == 0 && 2 == t1_st) && __retres1 == 0)) || ((1 <= __retres1 && __retres1 == 0) && t1_st == 0)) || !(E_M == 2)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && (((((((((((((((((((((((((((1 <= __retres1 && __retres1 == 0) && m_st == 0) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && !(E_2 == 1)) && \old(t2_st) == t2_st) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 1))) && (((((((((((((((((((((((((0 == __retres1 && \old(t1_st) == t1_st) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && 1 <= __retres1) && __retres1 == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || m_pc == t1_pc) || !(c_dr_pc == 0)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 0 == __retres1) && !(m_pc == 1)) && m_st == \old(m_st)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((1 <= __retres1 && 0 == __retres1) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && t1_st == 0)) || !(E_M == 2)) || !(c_dr_pc == 0)) || \old(m_st) == 0) || !(token <= local)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || E_1 == 2) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || (!(E_M == E_1) && !(E_1 == 1)))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(m_pc == 1)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(E_2 == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(token <= local + 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && 0 == t2_st) && __retres1 == 0))) && (((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || (((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && \old(t2_st) == t2_st) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(local + 1 <= token)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(2 + local <= token)) || !(t1_pc == 1)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == t2_st) && __retres1 == 0)) || !(q_free == 0)) || !(E_M == E_1)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local))) && (((((((((((((((((!(\old(t1_st) == 0) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || (t1_pc == 1 && t1_st == 0)) || !(\old(t2_st) == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == 0)) || !(t2_pc <= 0)) || !(q_free == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(2 == \old(m_st))) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && E_1 == \old(E_1)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_pc == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && (\old(E_M) == 0 || E_M == \old(E_M))) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && E_1 == \old(E_1)) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 651]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 == t2_st) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && E_M == E_1) && t1_st == 0) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 946]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((!(m_pc == t1_pc) || !(2 <= \old(p_dw_st))) || !(c_num_read < p_num_write + 1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || m_pc == 1) || !(t2_pc <= 0)) || !(0 == t2_st)) || !(t1_st == 0)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write) - InvariantResult [Line: 620]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 920]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && !(E_M == 1))) || ((((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) - InvariantResult [Line: 228]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 248]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 156]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) - InvariantResult [Line: 645]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && !(E_M == 1)) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && !(E_2 == 1)) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) && !(E_M == 1)) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 308]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && p_num_write <= c_num_read) && t1_st == 0) && 0 == t2_st) && t2_pc <= 0) && c_num_read < p_num_write + 1) || ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(m_pc == 1)) && t1_st == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0)) || (((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && c_num_read < p_num_write) && !(m_pc == 1)) && q_free == 0) && t1_st == 0) && 0 == t2_st) && 2 <= p_dw_st) && t2_pc <= 0) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 467]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: p_dw_st == 0 - InvariantResult [Line: 895]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && 0 == t2_st) && t2_pc <= 0) && !(E_M == 1))) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && 2 == t2_st) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && !(m_pc == t1_pc)) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && !(m_pc == 1)) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && 2 + local <= token) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && token < 3 + local) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2)) || (((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2) - InvariantResult [Line: 503]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0) || (((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && t2_pc == 1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && !(tmp == 0)) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1))) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || ((((((((((((((((t1_pc == 1 && p_dw_pc == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t2_pc == 1) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && !(E_M == 1))) || (((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && 2 == t1_st) && E_M == E_1) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && E_M == E_1) && t1_st == 0) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && m_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && token <= local) && local <= token) && E_1 == 2) && t2_pc <= 0)) || (((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && p_dw_pc == 0) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && tmp == 1) && t1_i == 1) && p_last_write == q_buf_0) && token <= local + 1) && q_free == 0) && 2 == t1_st) && E_M == E_1) && local + 1 <= token) && E_2 == 2) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && (\result == 1 || !(0 == t2_st))) && c_last_read == p_last_write) && E_1 == 2) && t2_pc <= 0)) || ((((((((((((((((p_dw_pc == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && !(E_2 == 1)) && t1_st == 0) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && t2_pc <= 0) && !(E_M == 1)) RESULT: Ultimate proved your program to be correct! [2022-11-03 02:19:48,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29d87888-8aa4-4da7-8157-e3fbc1699366/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE