./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 aef121e0 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V --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 --- This is Ultimate 0.2.1-dev-aef121e [2021-11-23 01:54:02,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-23 01:54:02,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-23 01:54:02,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-23 01:54:02,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-23 01:54:02,821 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-23 01:54:02,823 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-23 01:54:02,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-23 01:54:02,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-23 01:54:02,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-23 01:54:02,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-23 01:54:02,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-23 01:54:02,841 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-23 01:54:02,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-23 01:54:02,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-23 01:54:02,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-23 01:54:02,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-23 01:54:02,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-23 01:54:02,854 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-23 01:54:02,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-23 01:54:02,866 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-23 01:54:02,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-23 01:54:02,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-23 01:54:02,877 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-23 01:54:02,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-23 01:54:02,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-23 01:54:02,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-23 01:54:02,884 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-23 01:54:02,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-23 01:54:02,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-23 01:54:02,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-23 01:54:02,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-23 01:54:02,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-23 01:54:02,892 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-23 01:54:02,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-23 01:54:02,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-23 01:54:02,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-23 01:54:02,895 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-23 01:54:02,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-23 01:54:02,896 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-23 01:54:02,897 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-23 01:54:02,898 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-23 01:54:02,949 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-23 01:54:02,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-23 01:54:02,950 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-23 01:54:02,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-23 01:54:02,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-23 01:54:02,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-23 01:54:02,955 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-23 01:54:02,955 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-23 01:54:02,955 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-23 01:54:02,955 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-23 01:54:02,956 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-23 01:54:02,957 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-23 01:54:02,957 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-23 01:54:02,957 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-23 01:54:02,957 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-23 01:54:02,957 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-23 01:54:02,958 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-23 01:54:02,958 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-23 01:54:02,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-23 01:54:02,959 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-23 01:54:02,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-23 01:54:02,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-23 01:54:02,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-23 01:54:02,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-23 01:54:02,960 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-23 01:54:02,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-23 01:54:02,962 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-23 01:54:02,962 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-23 01:54:02,962 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-23 01:54:02,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-23 01:54:02,963 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-23 01:54:02,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-23 01:54:02,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 01:54:02,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-23 01:54:02,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-23 01:54:02,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-23 01:54:02,964 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-23 01:54:02,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-23 01:54:02,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-23 01:54:02,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-23 01:54:02,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-23 01:54:02,965 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V 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 [2021-11-23 01:54:03,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-23 01:54:03,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-23 01:54:03,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-23 01:54:03,281 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-23 01:54:03,282 INFO L275 PluginConnector]: CDTParser initialized [2021-11-23 01:54:03,284 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2021-11-23 01:54:03,364 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/data/56be88622/0820fdade5944d0e8beb58577dfcee97/FLAG5dc3d72d4 [2021-11-23 01:54:03,871 INFO L306 CDTParser]: Found 1 translation units. [2021-11-23 01:54:03,871 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2021-11-23 01:54:03,886 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/data/56be88622/0820fdade5944d0e8beb58577dfcee97/FLAG5dc3d72d4 [2021-11-23 01:54:04,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/data/56be88622/0820fdade5944d0e8beb58577dfcee97 [2021-11-23 01:54:04,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-23 01:54:04,198 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-23 01:54:04,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-23 01:54:04,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-23 01:54:04,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-23 01:54:04,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@396613b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04, skipping insertion in model container [2021-11-23 01:54:04,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,213 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-23 01:54:04,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-23 01:54:04,473 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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2021-11-23 01:54:04,528 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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2021-11-23 01:54:04,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:54:04,585 INFO L203 MainTranslator]: Completed pre-run [2021-11-23 01:54:04,609 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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[913,926] [2021-11-23 01:54:04,634 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_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.02.cil-1.c[5977,5990] [2021-11-23 01:54:04,685 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-23 01:54:04,712 INFO L208 MainTranslator]: Completed translation [2021-11-23 01:54:04,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04 WrapperNode [2021-11-23 01:54:04,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-23 01:54:04,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-23 01:54:04,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-23 01:54:04,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-23 01:54:04,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,808 INFO L137 Inliner]: procedures = 52, calls = 54, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 475 [2021-11-23 01:54:04,808 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-23 01:54:04,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-23 01:54:04,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-23 01:54:04,810 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-23 01:54:04,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,855 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-23 01:54:04,856 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-23 01:54:04,856 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-23 01:54:04,856 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-23 01:54:04,858 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (1/1) ... [2021-11-23 01:54:04,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-23 01:54:04,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:04,903 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-23 01:54:04,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-23 01:54:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-23 01:54:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-11-23 01:54:04,951 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-11-23 01:54:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2021-11-23 01:54:04,951 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2021-11-23 01:54:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-11-23 01:54:04,951 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-11-23 01:54:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-11-23 01:54:04,952 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-11-23 01:54:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-11-23 01:54:04,952 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-11-23 01:54:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-11-23 01:54:04,953 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-11-23 01:54:04,953 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-11-23 01:54:04,953 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-11-23 01:54:04,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-23 01:54:04,953 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-11-23 01:54:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-11-23 01:54:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-23 01:54:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-23 01:54:04,954 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-11-23 01:54:04,954 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-11-23 01:54:05,045 INFO L236 CfgBuilder]: Building ICFG [2021-11-23 01:54:05,046 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-23 01:54:05,533 INFO L277 CfgBuilder]: Performing block encoding [2021-11-23 01:54:05,706 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-23 01:54:05,706 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-23 01:54:05,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:05 BoogieIcfgContainer [2021-11-23 01:54:05,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-23 01:54:05,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-23 01:54:05,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-23 01:54:05,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-23 01:54:05,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:54:04" (1/3) ... [2021-11-23 01:54:05,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:05, skipping insertion in model container [2021-11-23 01:54:05,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:54:04" (2/3) ... [2021-11-23 01:54:05,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697e4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:54:05, skipping insertion in model container [2021-11-23 01:54:05,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:05" (3/3) ... [2021-11-23 01:54:05,719 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.02.cil-1.c [2021-11-23 01:54:05,725 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-23 01:54:05,725 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-23 01:54:05,777 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-23 01:54:05,784 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-23 01:54:05,785 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-23 01:54:05,806 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) [2021-11-23 01:54:05,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-23 01:54:05,813 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:05,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:05,814 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:05,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1077340385, now seen corresponding path program 1 times [2021-11-23 01:54:05,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:05,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38350635] [2021-11-23 01:54:05,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:05,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:06,032 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:06,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38350635] [2021-11-23 01:54:06,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38350635] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:06,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:06,034 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:06,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111438311] [2021-11-23 01:54:06,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:06,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:06,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:06,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:06,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,074 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) [2021-11-23 01:54:06,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:06,320 INFO L93 Difference]: Finished difference Result 291 states and 426 transitions. [2021-11-23 01:54:06,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:06,323 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 [2021-11-23 01:54:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:06,340 INFO L225 Difference]: With dead ends: 291 [2021-11-23 01:54:06,341 INFO L226 Difference]: Without dead ends: 162 [2021-11-23 01:54:06,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,350 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:06,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 218 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:06,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-11-23 01:54:06,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2021-11-23 01:54:06,407 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) [2021-11-23 01:54:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2021-11-23 01:54:06,411 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 28 [2021-11-23 01:54:06,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:06,412 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2021-11-23 01:54:06,412 INFO L471 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) [2021-11-23 01:54:06,413 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2021-11-23 01:54:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-23 01:54:06,416 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:06,416 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:06,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-23 01:54:06,417 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:06,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:06,418 INFO L85 PathProgramCache]: Analyzing trace with hash -835382772, now seen corresponding path program 1 times [2021-11-23 01:54:06,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:06,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103895690] [2021-11-23 01:54:06,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:06,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:06,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103895690] [2021-11-23 01:54:06,540 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103895690] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:06,540 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:06,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:06,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311876136] [2021-11-23 01:54:06,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:06,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:06,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:06,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,543 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) [2021-11-23 01:54:06,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:06,656 INFO L93 Difference]: Finished difference Result 314 states and 437 transitions. [2021-11-23 01:54:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:06,657 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 [2021-11-23 01:54:06,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:06,663 INFO L225 Difference]: With dead ends: 314 [2021-11-23 01:54:06,663 INFO L226 Difference]: Without dead ends: 233 [2021-11-23 01:54:06,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,666 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 154 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-11-23 01:54:06,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 203 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:06,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-11-23 01:54:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2021-11-23 01:54:06,708 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) [2021-11-23 01:54:06,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 315 transitions. [2021-11-23 01:54:06,712 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 315 transitions. Word has length 29 [2021-11-23 01:54:06,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:06,712 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 315 transitions. [2021-11-23 01:54:06,713 INFO L471 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) [2021-11-23 01:54:06,713 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 315 transitions. [2021-11-23 01:54:06,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-23 01:54:06,718 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:06,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:06,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-23 01:54:06,719 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:06,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:06,720 INFO L85 PathProgramCache]: Analyzing trace with hash 653810174, now seen corresponding path program 1 times [2021-11-23 01:54:06,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:06,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714088182] [2021-11-23 01:54:06,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:06,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:06,826 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:06,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714088182] [2021-11-23 01:54:06,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714088182] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:06,828 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:06,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:06,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293887907] [2021-11-23 01:54:06,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:06,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:06,831 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:06,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:06,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,833 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) [2021-11-23 01:54:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:06,920 INFO L93 Difference]: Finished difference Result 469 states and 643 transitions. [2021-11-23 01:54:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:06,921 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 [2021-11-23 01:54:06,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:06,925 INFO L225 Difference]: With dead ends: 469 [2021-11-23 01:54:06,930 INFO L226 Difference]: Without dead ends: 317 [2021-11-23 01:54:06,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:06,933 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 46 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-11-23 01:54:06,936 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 291 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-11-23 01:54:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 303. [2021-11-23 01:54:06,992 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) [2021-11-23 01:54:06,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 412 transitions. [2021-11-23 01:54:06,998 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 412 transitions. Word has length 30 [2021-11-23 01:54:06,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:06,999 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 412 transitions. [2021-11-23 01:54:06,999 INFO L471 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) [2021-11-23 01:54:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 412 transitions. [2021-11-23 01:54:07,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-11-23 01:54:07,009 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:07,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-23 01:54:07,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-23 01:54:07,011 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:07,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:07,013 INFO L85 PathProgramCache]: Analyzing trace with hash 525311981, now seen corresponding path program 1 times [2021-11-23 01:54:07,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:07,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094231570] [2021-11-23 01:54:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:07,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:07,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:07,102 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:07,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094231570] [2021-11-23 01:54:07,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094231570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:07,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:07,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 01:54:07,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320101059] [2021-11-23 01:54:07,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:07,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 01:54:07,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:07,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 01:54:07,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:54:07,104 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) [2021-11-23 01:54:07,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:07,652 INFO L93 Difference]: Finished difference Result 631 states and 901 transitions. [2021-11-23 01:54:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-23 01:54:07,653 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 [2021-11-23 01:54:07,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:07,664 INFO L225 Difference]: With dead ends: 631 [2021-11-23 01:54:07,664 INFO L226 Difference]: Without dead ends: 560 [2021-11-23 01:54:07,666 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:07,682 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 501 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2021-11-23 01:54:07,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [508 Valid, 529 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-11-23 01:54:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2021-11-23 01:54:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 549. [2021-11-23 01:54:07,764 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) [2021-11-23 01:54:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 766 transitions. [2021-11-23 01:54:07,770 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 766 transitions. Word has length 37 [2021-11-23 01:54:07,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:07,771 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 766 transitions. [2021-11-23 01:54:07,771 INFO L471 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) [2021-11-23 01:54:07,771 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 766 transitions. [2021-11-23 01:54:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-23 01:54:07,779 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:07,779 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:07,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-23 01:54:07,780 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:07,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash -569519032, now seen corresponding path program 1 times [2021-11-23 01:54:07,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:07,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138565370] [2021-11-23 01:54:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:07,782 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-23 01:54:07,852 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:07,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138565370] [2021-11-23 01:54:07,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138565370] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:07,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:07,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:07,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806344309] [2021-11-23 01:54:07,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:07,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:07,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:07,856 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) [2021-11-23 01:54:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:07,966 INFO L93 Difference]: Finished difference Result 712 states and 984 transitions. [2021-11-23 01:54:07,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:07,967 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 [2021-11-23 01:54:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:07,975 INFO L225 Difference]: With dead ends: 712 [2021-11-23 01:54:07,976 INFO L226 Difference]: Without dead ends: 554 [2021-11-23 01:54:07,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:07,983 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:07,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 323 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:07,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2021-11-23 01:54:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 543. [2021-11-23 01:54:08,047 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) [2021-11-23 01:54:08,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 752 transitions. [2021-11-23 01:54:08,053 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 752 transitions. Word has length 43 [2021-11-23 01:54:08,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:08,053 INFO L470 AbstractCegarLoop]: Abstraction has 543 states and 752 transitions. [2021-11-23 01:54:08,054 INFO L471 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) [2021-11-23 01:54:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 752 transitions. [2021-11-23 01:54:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-23 01:54:08,055 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:08,056 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:08,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-23 01:54:08,056 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 438941583, now seen corresponding path program 1 times [2021-11-23 01:54:08,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:08,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779454148] [2021-11-23 01:54:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:08,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 01:54:08,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:08,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779454148] [2021-11-23 01:54:08,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779454148] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:08,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:08,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:08,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578142597] [2021-11-23 01:54:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:08,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:08,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:08,130 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) [2021-11-23 01:54:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:08,235 INFO L93 Difference]: Finished difference Result 792 states and 1076 transitions. [2021-11-23 01:54:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:08,235 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 [2021-11-23 01:54:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:08,242 INFO L225 Difference]: With dead ends: 792 [2021-11-23 01:54:08,243 INFO L226 Difference]: Without dead ends: 589 [2021-11-23 01:54:08,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:08,246 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:08,248 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 201 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:08,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-11-23 01:54:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 589. [2021-11-23 01:54:08,301 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) [2021-11-23 01:54:08,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 803 transitions. [2021-11-23 01:54:08,307 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 803 transitions. Word has length 46 [2021-11-23 01:54:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:08,308 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 803 transitions. [2021-11-23 01:54:08,309 INFO L471 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) [2021-11-23 01:54:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 803 transitions. [2021-11-23 01:54:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-23 01:54:08,311 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:08,312 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:08,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-23 01:54:08,312 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:08,312 INFO L85 PathProgramCache]: Analyzing trace with hash 157459066, now seen corresponding path program 1 times [2021-11-23 01:54:08,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:08,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414062531] [2021-11-23 01:54:08,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:08,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:08,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:54:08,419 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:08,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414062531] [2021-11-23 01:54:08,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414062531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:08,420 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:08,420 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-23 01:54:08,420 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960319651] [2021-11-23 01:54:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:08,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:54:08,421 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:08,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:54:08,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-23 01:54:08,422 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) [2021-11-23 01:54:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:08,588 INFO L93 Difference]: Finished difference Result 629 states and 850 transitions. [2021-11-23 01:54:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 01:54:08,589 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 [2021-11-23 01:54:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:08,594 INFO L225 Difference]: With dead ends: 629 [2021-11-23 01:54:08,594 INFO L226 Difference]: Without dead ends: 626 [2021-11-23 01:54:08,595 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:08,596 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:08,596 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 199 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:08,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2021-11-23 01:54:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 588. [2021-11-23 01:54:08,642 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) [2021-11-23 01:54:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 800 transitions. [2021-11-23 01:54:08,647 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 800 transitions. Word has length 47 [2021-11-23 01:54:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:08,648 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 800 transitions. [2021-11-23 01:54:08,648 INFO L471 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) [2021-11-23 01:54:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 800 transitions. [2021-11-23 01:54:08,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-23 01:54:08,650 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:08,650 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:08,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-23 01:54:08,651 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash 585604338, now seen corresponding path program 1 times [2021-11-23 01:54:08,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:08,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538777084] [2021-11-23 01:54:08,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:08,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:08,828 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:54:08,829 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538777084] [2021-11-23 01:54:08,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538777084] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:08,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385003251] [2021-11-23 01:54:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:08,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:08,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:08,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:08,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-23 01:54:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:08,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-23 01:54:08,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:09,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:54:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-23 01:54:09,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385003251] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:54:09,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1158083705] [2021-11-23 01:54:09,747 INFO L159 IcfgInterpreter]: Started Sifa with 40 locations of interest [2021-11-23 01:54:09,747 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:54:09,753 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:54:09,759 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:54:09,759 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:54:12,263 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 85 for LOIs [2021-11-23 01:54:12,278 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 100 for LOIs [2021-11-23 01:54:12,298 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 216 for LOIs [2021-11-23 01:54:13,405 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:54:25,344 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 [2021-11-23 01:54:25,344 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:54:25,345 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:54:25,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2021-11-23 01:54:25,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566493129] [2021-11-23 01:54:25,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:54:25,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-23 01:54:25,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:25,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-23 01:54:25,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 01:54:25,348 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) [2021-11-23 01:54:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:25,685 INFO L93 Difference]: Finished difference Result 1031 states and 1368 transitions. [2021-11-23 01:54:25,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 01:54:25,686 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 [2021-11-23 01:54:25,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:25,697 INFO L225 Difference]: With dead ends: 1031 [2021-11-23 01:54:25,697 INFO L226 Difference]: Without dead ends: 1028 [2021-11-23 01:54:25,699 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2021-11-23 01:54:25,700 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:25,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [276 Valid, 803 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-23 01:54:25,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-11-23 01:54:25,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 797. [2021-11-23 01:54:25,770 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) [2021-11-23 01:54:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1071 transitions. [2021-11-23 01:54:25,777 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1071 transitions. Word has length 48 [2021-11-23 01:54:25,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:25,778 INFO L470 AbstractCegarLoop]: Abstraction has 797 states and 1071 transitions. [2021-11-23 01:54:25,778 INFO L471 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) [2021-11-23 01:54:25,779 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1071 transitions. [2021-11-23 01:54:25,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-23 01:54:25,781 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:25,782 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:25,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:25,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:25,996 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:25,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1248117755, now seen corresponding path program 2 times [2021-11-23 01:54:25,996 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:25,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177429275] [2021-11-23 01:54:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:25,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:26,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 01:54:26,062 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:26,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177429275] [2021-11-23 01:54:26,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177429275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:26,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:26,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:26,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504939063] [2021-11-23 01:54:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:26,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:26,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:26,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:26,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:26,065 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) [2021-11-23 01:54:26,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:26,157 INFO L93 Difference]: Finished difference Result 1127 states and 1504 transitions. [2021-11-23 01:54:26,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:26,158 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 [2021-11-23 01:54:26,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:26,163 INFO L225 Difference]: With dead ends: 1127 [2021-11-23 01:54:26,164 INFO L226 Difference]: Without dead ends: 739 [2021-11-23 01:54:26,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:26,166 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:26,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 214 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2021-11-23 01:54:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 730. [2021-11-23 01:54:26,212 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) [2021-11-23 01:54:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 978 transitions. [2021-11-23 01:54:26,218 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 978 transitions. Word has length 61 [2021-11-23 01:54:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:26,218 INFO L470 AbstractCegarLoop]: Abstraction has 730 states and 978 transitions. [2021-11-23 01:54:26,219 INFO L471 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) [2021-11-23 01:54:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 978 transitions. [2021-11-23 01:54:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 01:54:26,221 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:26,222 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:26,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-23 01:54:26,222 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:26,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:26,223 INFO L85 PathProgramCache]: Analyzing trace with hash -640293950, now seen corresponding path program 1 times [2021-11-23 01:54:26,223 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:26,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172048378] [2021-11-23 01:54:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:26,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 01:54:26,301 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:26,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172048378] [2021-11-23 01:54:26,302 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172048378] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:26,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759646822] [2021-11-23 01:54:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:26,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:26,307 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:26,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-23 01:54:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:26,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:54:26,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:26,521 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 01:54:26,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:26,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759646822] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:26,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:26,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2021-11-23 01:54:26,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32211035] [2021-11-23 01:54:26,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:26,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:26,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:26,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:26,524 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) [2021-11-23 01:54:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:26,642 INFO L93 Difference]: Finished difference Result 1348 states and 1892 transitions. [2021-11-23 01:54:26,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:26,642 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 [2021-11-23 01:54:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:26,651 INFO L225 Difference]: With dead ends: 1348 [2021-11-23 01:54:26,651 INFO L226 Difference]: Without dead ends: 1031 [2021-11-23 01:54:26,653 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:26,654 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 146 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:26,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 229 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-11-23 01:54:26,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1024. [2021-11-23 01:54:26,724 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) [2021-11-23 01:54:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1383 transitions. [2021-11-23 01:54:26,733 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1383 transitions. Word has length 66 [2021-11-23 01:54:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:26,734 INFO L470 AbstractCegarLoop]: Abstraction has 1024 states and 1383 transitions. [2021-11-23 01:54:26,734 INFO L471 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) [2021-11-23 01:54:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1383 transitions. [2021-11-23 01:54:26,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-11-23 01:54:26,738 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:26,738 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:26,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:26,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:26,955 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:26,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash 714522722, now seen corresponding path program 1 times [2021-11-23 01:54:26,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:26,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954435154] [2021-11-23 01:54:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:26,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 01:54:27,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:27,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954435154] [2021-11-23 01:54:27,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954435154] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:27,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:27,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 01:54:27,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013307855] [2021-11-23 01:54:27,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:27,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 01:54:27,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:27,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 01:54:27,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:27,069 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) [2021-11-23 01:54:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:27,415 INFO L93 Difference]: Finished difference Result 2030 states and 2836 transitions. [2021-11-23 01:54:27,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 01:54:27,416 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 [2021-11-23 01:54:27,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:27,428 INFO L225 Difference]: With dead ends: 2030 [2021-11-23 01:54:27,428 INFO L226 Difference]: Without dead ends: 1420 [2021-11-23 01:54:27,435 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-23 01:54:27,436 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:27,436 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 381 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:54:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2021-11-23 01:54:27,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1366. [2021-11-23 01:54:27,581 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) [2021-11-23 01:54:27,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1366 states to 1366 states and 1850 transitions. [2021-11-23 01:54:27,592 INFO L78 Accepts]: Start accepts. Automaton has 1366 states and 1850 transitions. Word has length 66 [2021-11-23 01:54:27,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:27,593 INFO L470 AbstractCegarLoop]: Abstraction has 1366 states and 1850 transitions. [2021-11-23 01:54:27,593 INFO L471 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) [2021-11-23 01:54:27,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1366 states and 1850 transitions. [2021-11-23 01:54:27,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-11-23 01:54:27,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:27,596 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:27,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-23 01:54:27,597 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:27,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:27,598 INFO L85 PathProgramCache]: Analyzing trace with hash -2008382746, now seen corresponding path program 1 times [2021-11-23 01:54:27,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:27,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025013802] [2021-11-23 01:54:27,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:27,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 01:54:27,694 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025013802] [2021-11-23 01:54:27,695 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025013802] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:27,695 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:27,695 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-23 01:54:27,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560438911] [2021-11-23 01:54:27,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:27,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 01:54:27,696 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:27,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 01:54:27,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:27,697 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) [2021-11-23 01:54:28,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:28,119 INFO L93 Difference]: Finished difference Result 2811 states and 3930 transitions. [2021-11-23 01:54:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-23 01:54:28,119 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 [2021-11-23 01:54:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:28,134 INFO L225 Difference]: With dead ends: 2811 [2021-11-23 01:54:28,134 INFO L226 Difference]: Without dead ends: 1859 [2021-11-23 01:54:28,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-23 01:54:28,139 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:28,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 426 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:54:28,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2021-11-23 01:54:28,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1809. [2021-11-23 01:54:28,328 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) [2021-11-23 01:54:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2443 transitions. [2021-11-23 01:54:28,344 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2443 transitions. Word has length 67 [2021-11-23 01:54:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:28,346 INFO L470 AbstractCegarLoop]: Abstraction has 1809 states and 2443 transitions. [2021-11-23 01:54:28,346 INFO L471 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) [2021-11-23 01:54:28,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2443 transitions. [2021-11-23 01:54:28,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-11-23 01:54:28,355 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:28,356 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:28,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-23 01:54:28,356 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:28,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:28,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1725413794, now seen corresponding path program 1 times [2021-11-23 01:54:28,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:28,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964516558] [2021-11-23 01:54:28,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:28,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-11-23 01:54:28,416 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:28,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964516558] [2021-11-23 01:54:28,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964516558] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:28,416 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:28,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-23 01:54:28,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737877504] [2021-11-23 01:54:28,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:28,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:28,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:28,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:28,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:28,419 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) [2021-11-23 01:54:28,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:28,624 INFO L93 Difference]: Finished difference Result 3324 states and 4570 transitions. [2021-11-23 01:54:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:28,624 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 [2021-11-23 01:54:28,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:28,641 INFO L225 Difference]: With dead ends: 3324 [2021-11-23 01:54:28,642 INFO L226 Difference]: Without dead ends: 2105 [2021-11-23 01:54:28,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-23 01:54:28,650 INFO L933 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:28,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 329 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2021-11-23 01:54:28,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1932. [2021-11-23 01:54:28,834 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) [2021-11-23 01:54:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2614 transitions. [2021-11-23 01:54:28,846 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 2614 transitions. Word has length 68 [2021-11-23 01:54:28,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:28,847 INFO L470 AbstractCegarLoop]: Abstraction has 1932 states and 2614 transitions. [2021-11-23 01:54:28,847 INFO L471 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) [2021-11-23 01:54:28,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 2614 transitions. [2021-11-23 01:54:28,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-11-23 01:54:28,852 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:28,852 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:28,852 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-23 01:54:28,852 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:28,853 INFO L85 PathProgramCache]: Analyzing trace with hash -894939824, now seen corresponding path program 1 times [2021-11-23 01:54:28,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:28,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682380364] [2021-11-23 01:54:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:28,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 01:54:28,913 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:28,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682380364] [2021-11-23 01:54:28,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682380364] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:28,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750017876] [2021-11-23 01:54:28,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:28,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:28,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:28,915 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:28,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-23 01:54:29,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:29,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:54:29,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:29,129 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-23 01:54:29,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:29,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750017876] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:29,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:29,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:54:29,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341063142] [2021-11-23 01:54:29,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:29,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:29,130 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:29,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:29,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:29,131 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) [2021-11-23 01:54:29,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:29,294 INFO L93 Difference]: Finished difference Result 2059 states and 2773 transitions. [2021-11-23 01:54:29,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:29,295 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 [2021-11-23 01:54:29,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:29,310 INFO L225 Difference]: With dead ends: 2059 [2021-11-23 01:54:29,311 INFO L226 Difference]: Without dead ends: 1525 [2021-11-23 01:54:29,313 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:29,313 INFO L933 BasicCegarLoop]: 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:29,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 294 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:29,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2021-11-23 01:54:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1525. [2021-11-23 01:54:29,433 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) [2021-11-23 01:54:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2097 transitions. [2021-11-23 01:54:29,441 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2097 transitions. Word has length 73 [2021-11-23 01:54:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:29,441 INFO L470 AbstractCegarLoop]: Abstraction has 1525 states and 2097 transitions. [2021-11-23 01:54:29,441 INFO L471 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) [2021-11-23 01:54:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2097 transitions. [2021-11-23 01:54:29,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:54:29,447 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:29,448 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:29,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:29,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-11-23 01:54:29,674 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1709823751, now seen corresponding path program 1 times [2021-11-23 01:54:29,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:29,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681030263] [2021-11-23 01:54:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:29,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:29,742 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2021-11-23 01:54:29,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:29,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681030263] [2021-11-23 01:54:29,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681030263] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:29,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964380399] [2021-11-23 01:54:29,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:29,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:29,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:29,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:29,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-23 01:54:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:29,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:54:29,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 01:54:30,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:30,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964380399] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:30,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:30,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:54:30,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719454928] [2021-11-23 01:54:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:30,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:30,099 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:30,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:30,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:30,100 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) [2021-11-23 01:54:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:30,252 INFO L93 Difference]: Finished difference Result 2989 states and 4147 transitions. [2021-11-23 01:54:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:30,252 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 [2021-11-23 01:54:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:30,267 INFO L225 Difference]: With dead ends: 2989 [2021-11-23 01:54:30,267 INFO L226 Difference]: Without dead ends: 1866 [2021-11-23 01:54:30,274 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:30,276 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:30,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 115 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:30,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2021-11-23 01:54:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1810. [2021-11-23 01:54:30,495 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) [2021-11-23 01:54:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2416 transitions. [2021-11-23 01:54:30,505 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2416 transitions. Word has length 101 [2021-11-23 01:54:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:30,505 INFO L470 AbstractCegarLoop]: Abstraction has 1810 states and 2416 transitions. [2021-11-23 01:54:30,506 INFO L471 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) [2021-11-23 01:54:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2416 transitions. [2021-11-23 01:54:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:54:30,511 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:30,513 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:30,551 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:30,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-11-23 01:54:30,728 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash -929842822, now seen corresponding path program 1 times [2021-11-23 01:54:30,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:30,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274940835] [2021-11-23 01:54:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:30,729 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2021-11-23 01:54:30,789 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:30,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274940835] [2021-11-23 01:54:30,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274940835] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:30,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828509284] [2021-11-23 01:54:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:30,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:30,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:30,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-23 01:54:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:30,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:54:30,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 01:54:31,046 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:31,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828509284] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:31,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:31,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:54:31,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512140416] [2021-11-23 01:54:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:31,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:31,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:31,048 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) [2021-11-23 01:54:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:31,260 INFO L93 Difference]: Finished difference Result 3450 states and 4662 transitions. [2021-11-23 01:54:31,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:31,260 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 [2021-11-23 01:54:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:31,277 INFO L225 Difference]: With dead ends: 3450 [2021-11-23 01:54:31,277 INFO L226 Difference]: Without dead ends: 2234 [2021-11-23 01:54:31,282 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:31,283 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:31,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 226 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2234 states. [2021-11-23 01:54:31,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2234 to 1939. [2021-11-23 01:54:31,451 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) [2021-11-23 01:54:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 2594 transitions. [2021-11-23 01:54:31,460 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 2594 transitions. Word has length 101 [2021-11-23 01:54:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:31,460 INFO L470 AbstractCegarLoop]: Abstraction has 1939 states and 2594 transitions. [2021-11-23 01:54:31,461 INFO L471 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) [2021-11-23 01:54:31,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 2594 transitions. [2021-11-23 01:54:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:54:31,467 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:31,467 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:31,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:31,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:31,687 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:31,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash -230485118, now seen corresponding path program 2 times [2021-11-23 01:54:31,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:31,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838307495] [2021-11-23 01:54:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:31,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-11-23 01:54:31,764 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838307495] [2021-11-23 01:54:31,764 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838307495] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:31,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323534726] [2021-11-23 01:54:31,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 01:54:31,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:31,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:31,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:31,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-23 01:54:31,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-23 01:54:31,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 01:54:31,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 01:54:31,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-23 01:54:32,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:32,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323534726] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:32,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:32,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-11-23 01:54:32,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189077069] [2021-11-23 01:54:32,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:32,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:54:32,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:54:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-23 01:54:32,040 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) [2021-11-23 01:54:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:32,288 INFO L93 Difference]: Finished difference Result 3513 states and 4696 transitions. [2021-11-23 01:54:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 01:54:32,289 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 [2021-11-23 01:54:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:32,303 INFO L225 Difference]: With dead ends: 3513 [2021-11-23 01:54:32,303 INFO L226 Difference]: Without dead ends: 2093 [2021-11-23 01:54:32,308 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:32,309 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:32,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 370 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2021-11-23 01:54:32,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 2024. [2021-11-23 01:54:32,468 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) [2021-11-23 01:54:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 2698 transitions. [2021-11-23 01:54:32,478 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 2698 transitions. Word has length 101 [2021-11-23 01:54:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:32,479 INFO L470 AbstractCegarLoop]: Abstraction has 2024 states and 2698 transitions. [2021-11-23 01:54:32,479 INFO L471 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) [2021-11-23 01:54:32,479 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 2698 transitions. [2021-11-23 01:54:32,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:54:32,485 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:32,486 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:32,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:32,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-11-23 01:54:32,710 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:32,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1103962813, now seen corresponding path program 2 times [2021-11-23 01:54:32,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:32,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671171476] [2021-11-23 01:54:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:32,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:32,783 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 01:54:32,784 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671171476] [2021-11-23 01:54:32,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671171476] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:32,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467760680] [2021-11-23 01:54:32,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-23 01:54:32,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:32,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:32,786 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:32,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-11-23 01:54:32,895 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-11-23 01:54:32,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-23 01:54:32,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 20 conjunts are in the unsatisfiable core [2021-11-23 01:54:32,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:33,301 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-11-23 01:54:33,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:54:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-23 01:54:33,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467760680] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:33,698 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-11-23 01:54:33,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 14 [2021-11-23 01:54:33,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15203408] [2021-11-23 01:54:33,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:33,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:54:33,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:33,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:54:33,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-23 01:54:33,700 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) [2021-11-23 01:54:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:33,958 INFO L93 Difference]: Finished difference Result 3913 states and 5359 transitions. [2021-11-23 01:54:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 01:54:33,959 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 [2021-11-23 01:54:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:33,975 INFO L225 Difference]: With dead ends: 3913 [2021-11-23 01:54:33,975 INFO L226 Difference]: Without dead ends: 2536 [2021-11-23 01:54:33,981 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2021-11-23 01:54:33,982 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:33,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 217 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:33,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states. [2021-11-23 01:54:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 2452. [2021-11-23 01:54:34,199 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) [2021-11-23 01:54:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3193 transitions. [2021-11-23 01:54:34,216 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3193 transitions. Word has length 101 [2021-11-23 01:54:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:34,216 INFO L470 AbstractCegarLoop]: Abstraction has 2452 states and 3193 transitions. [2021-11-23 01:54:34,217 INFO L471 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) [2021-11-23 01:54:34,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3193 transitions. [2021-11-23 01:54:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 01:54:34,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:34,226 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:34,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:34,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-11-23 01:54:34,441 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:34,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 198691535, now seen corresponding path program 1 times [2021-11-23 01:54:34,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:34,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143183743] [2021-11-23 01:54:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:34,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:34,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:34,502 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-11-23 01:54:34,502 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:34,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143183743] [2021-11-23 01:54:34,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143183743] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:34,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94271531] [2021-11-23 01:54:34,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:34,503 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:34,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:34,504 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:34,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-11-23 01:54:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:34,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-23 01:54:34,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-11-23 01:54:34,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:34,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94271531] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:34,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:34,764 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-23 01:54:34,764 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739077670] [2021-11-23 01:54:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:34,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:34,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:34,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:34,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:34,768 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) [2021-11-23 01:54:34,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:34,978 INFO L93 Difference]: Finished difference Result 4637 states and 6117 transitions. [2021-11-23 01:54:34,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:34,978 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 [2021-11-23 01:54:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:34,996 INFO L225 Difference]: With dead ends: 4637 [2021-11-23 01:54:34,997 INFO L226 Difference]: Without dead ends: 2827 [2021-11-23 01:54:35,002 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:35,003 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:35,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 220 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2021-11-23 01:54:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2589. [2021-11-23 01:54:35,250 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) [2021-11-23 01:54:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2589 states to 2589 states and 3376 transitions. [2021-11-23 01:54:35,260 INFO L78 Accepts]: Start accepts. Automaton has 2589 states and 3376 transitions. Word has length 100 [2021-11-23 01:54:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:35,260 INFO L470 AbstractCegarLoop]: Abstraction has 2589 states and 3376 transitions. [2021-11-23 01:54:35,260 INFO L471 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) [2021-11-23 01:54:35,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2589 states and 3376 transitions. [2021-11-23 01:54:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 01:54:35,268 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:35,268 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:35,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2021-11-23 01:54:35,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:35,482 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:35,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:35,483 INFO L85 PathProgramCache]: Analyzing trace with hash 962551112, now seen corresponding path program 1 times [2021-11-23 01:54:35,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:35,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868193167] [2021-11-23 01:54:35,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:35,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-11-23 01:54:35,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:35,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868193167] [2021-11-23 01:54:35,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868193167] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:35,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529095981] [2021-11-23 01:54:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:35,546 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:35,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:35,547 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:35,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-23 01:54:35,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:35,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 01:54:35,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:35,829 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 01:54:35,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:35,829 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529095981] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:35,829 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:35,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 01:54:35,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865429376] [2021-11-23 01:54:35,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:35,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:35,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:54:35,831 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) [2021-11-23 01:54:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:36,082 INFO L93 Difference]: Finished difference Result 4975 states and 6674 transitions. [2021-11-23 01:54:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:36,082 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 [2021-11-23 01:54:36,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:36,111 INFO L225 Difference]: With dead ends: 4975 [2021-11-23 01:54:36,111 INFO L226 Difference]: Without dead ends: 3028 [2021-11-23 01:54:36,121 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:36,122 INFO L933 BasicCegarLoop]: 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.0s IncrementalHoareTripleChecker+Time [2021-11-23 01:54:36,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 240 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:36,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3028 states. [2021-11-23 01:54:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3028 to 2939. [2021-11-23 01:54:36,438 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) [2021-11-23 01:54:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 3817 transitions. [2021-11-23 01:54:36,452 INFO L78 Accepts]: Start accepts. Automaton has 2939 states and 3817 transitions. Word has length 100 [2021-11-23 01:54:36,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:36,452 INFO L470 AbstractCegarLoop]: Abstraction has 2939 states and 3817 transitions. [2021-11-23 01:54:36,452 INFO L471 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) [2021-11-23 01:54:36,453 INFO L276 IsEmpty]: Start isEmpty. Operand 2939 states and 3817 transitions. [2021-11-23 01:54:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-11-23 01:54:36,460 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:36,460 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:36,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:36,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:36,682 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:36,683 INFO L85 PathProgramCache]: Analyzing trace with hash 871634837, now seen corresponding path program 1 times [2021-11-23 01:54:36,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:36,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661649936] [2021-11-23 01:54:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:36,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:36,752 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 01:54:36,753 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661649936] [2021-11-23 01:54:36,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661649936] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:36,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449522238] [2021-11-23 01:54:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:36,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:36,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:36,755 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:36,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-23 01:54:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:36,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 01:54:36,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-11-23 01:54:37,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:37,044 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449522238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:37,044 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:37,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 01:54:37,044 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128125996] [2021-11-23 01:54:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:37,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:37,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:37,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:37,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:54:37,045 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) [2021-11-23 01:54:37,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:37,287 INFO L93 Difference]: Finished difference Result 4927 states and 6656 transitions. [2021-11-23 01:54:37,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:37,288 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 [2021-11-23 01:54:37,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:37,313 INFO L225 Difference]: With dead ends: 4927 [2021-11-23 01:54:37,313 INFO L226 Difference]: Without dead ends: 2920 [2021-11-23 01:54:37,324 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:37,325 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:37,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 228 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2021-11-23 01:54:37,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2895. [2021-11-23 01:54:37,582 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) [2021-11-23 01:54:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2895 states to 2895 states and 3677 transitions. [2021-11-23 01:54:37,592 INFO L78 Accepts]: Start accepts. Automaton has 2895 states and 3677 transitions. Word has length 100 [2021-11-23 01:54:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:37,593 INFO L470 AbstractCegarLoop]: Abstraction has 2895 states and 3677 transitions. [2021-11-23 01:54:37,593 INFO L471 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) [2021-11-23 01:54:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 2895 states and 3677 transitions. [2021-11-23 01:54:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-23 01:54:37,600 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:37,600 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:37,639 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:37,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-11-23 01:54:37,815 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:37,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash -876197802, now seen corresponding path program 1 times [2021-11-23 01:54:37,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:37,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495528813] [2021-11-23 01:54:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:37,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:37,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-11-23 01:54:37,873 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495528813] [2021-11-23 01:54:37,874 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495528813] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:37,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296626794] [2021-11-23 01:54:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:37,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:37,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:37,875 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:37,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-23 01:54:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:37,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjunts are in the unsatisfiable core [2021-11-23 01:54:37,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-11-23 01:54:38,119 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:38,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296626794] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:38,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:38,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2021-11-23 01:54:38,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973351296] [2021-11-23 01:54:38,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:38,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-23 01:54:38,121 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-23 01:54:38,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:54:38,122 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) [2021-11-23 01:54:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:38,430 INFO L93 Difference]: Finished difference Result 6742 states and 8676 transitions. [2021-11-23 01:54:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-23 01:54:38,431 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 [2021-11-23 01:54:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:38,448 INFO L225 Difference]: With dead ends: 6742 [2021-11-23 01:54:38,448 INFO L226 Difference]: Without dead ends: 3904 [2021-11-23 01:54:38,458 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:38,460 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:38,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 189 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:54:38,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3904 states. [2021-11-23 01:54:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3904 to 3181. [2021-11-23 01:54:38,768 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) [2021-11-23 01:54:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4043 transitions. [2021-11-23 01:54:38,780 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4043 transitions. Word has length 101 [2021-11-23 01:54:38,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:38,781 INFO L470 AbstractCegarLoop]: Abstraction has 3181 states and 4043 transitions. [2021-11-23 01:54:38,781 INFO L471 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) [2021-11-23 01:54:38,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4043 transitions. [2021-11-23 01:54:38,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-23 01:54:38,788 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:38,788 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:38,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:39,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:39,002 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:39,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2055335588, now seen corresponding path program 1 times [2021-11-23 01:54:39,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:39,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458900137] [2021-11-23 01:54:39,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:39,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:39,087 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-11-23 01:54:39,088 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458900137] [2021-11-23 01:54:39,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458900137] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287958857] [2021-11-23 01:54:39,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:39,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:39,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:39,090 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:39,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-23 01:54:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:39,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 6 conjunts are in the unsatisfiable core [2021-11-23 01:54:39,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-11-23 01:54:39,435 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:39,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287958857] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:39,435 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:39,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-11-23 01:54:39,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917964013] [2021-11-23 01:54:39,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:39,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:54:39,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:54:39,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:54:39,437 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) [2021-11-23 01:54:39,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:39,842 INFO L93 Difference]: Finished difference Result 6925 states and 8850 transitions. [2021-11-23 01:54:39,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-23 01:54:39,843 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 [2021-11-23 01:54:39,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:39,858 INFO L225 Difference]: With dead ends: 6925 [2021-11-23 01:54:39,858 INFO L226 Difference]: Without dead ends: 4118 [2021-11-23 01:54:39,866 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:39,867 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:54:39,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 227 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:54:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4118 states. [2021-11-23 01:54:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4118 to 3643. [2021-11-23 01:54:40,176 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) [2021-11-23 01:54:40,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3643 states to 3643 states and 4559 transitions. [2021-11-23 01:54:40,189 INFO L78 Accepts]: Start accepts. Automaton has 3643 states and 4559 transitions. Word has length 102 [2021-11-23 01:54:40,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:40,189 INFO L470 AbstractCegarLoop]: Abstraction has 3643 states and 4559 transitions. [2021-11-23 01:54:40,190 INFO L471 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) [2021-11-23 01:54:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3643 states and 4559 transitions. [2021-11-23 01:54:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:54:40,197 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:40,197 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:40,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:40,410 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:40,410 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:40,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash 99916088, now seen corresponding path program 1 times [2021-11-23 01:54:40,411 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:40,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912117064] [2021-11-23 01:54:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:40,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-11-23 01:54:40,486 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912117064] [2021-11-23 01:54:40,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912117064] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:40,487 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:54:40,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 01:54:40,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910088467] [2021-11-23 01:54:40,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:40,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 01:54:40,488 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:40,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 01:54:40,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:54:40,489 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) [2021-11-23 01:54:41,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:41,147 INFO L93 Difference]: Finished difference Result 9096 states and 11384 transitions. [2021-11-23 01:54:41,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-23 01:54:41,148 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 [2021-11-23 01:54:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:41,165 INFO L225 Difference]: With dead ends: 9096 [2021-11-23 01:54:41,166 INFO L226 Difference]: Without dead ends: 4771 [2021-11-23 01:54:41,178 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:41,178 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 81 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-11-23 01:54:41,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 283 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:54:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2021-11-23 01:54:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 4597. [2021-11-23 01:54:41,645 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) [2021-11-23 01:54:41,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 5691 transitions. [2021-11-23 01:54:41,660 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 5691 transitions. Word has length 103 [2021-11-23 01:54:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:41,661 INFO L470 AbstractCegarLoop]: Abstraction has 4597 states and 5691 transitions. [2021-11-23 01:54:41,661 INFO L471 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) [2021-11-23 01:54:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 5691 transitions. [2021-11-23 01:54:41,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-23 01:54:41,668 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:41,668 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:41,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-23 01:54:41,669 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:41,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:41,669 INFO L85 PathProgramCache]: Analyzing trace with hash 586827523, now seen corresponding path program 1 times [2021-11-23 01:54:41,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:41,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770501864] [2021-11-23 01:54:41,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:41,670 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-11-23 01:54:41,728 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770501864] [2021-11-23 01:54:41,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770501864] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:41,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127697336] [2021-11-23 01:54:41,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:41,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:41,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:41,729 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:41,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-23 01:54:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:41,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 22 conjunts are in the unsatisfiable core [2021-11-23 01:54:41,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-23 01:54:42,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:54:42,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127697336] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:54:42,025 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:54:42,025 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-23 01:54:42,026 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340499942] [2021-11-23 01:54:42,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:54:42,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 01:54:42,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:54:42,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 01:54:42,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:54:42,027 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) [2021-11-23 01:54:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:54:42,627 INFO L93 Difference]: Finished difference Result 9058 states and 11289 transitions. [2021-11-23 01:54:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 01:54:42,627 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 [2021-11-23 01:54:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:54:42,648 INFO L225 Difference]: With dead ends: 9058 [2021-11-23 01:54:42,648 INFO L226 Difference]: Without dead ends: 5902 [2021-11-23 01:54:42,656 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:54:42,657 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 162 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-11-23 01:54:42,657 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 296 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:54:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5902 states. [2021-11-23 01:54:43,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5902 to 5570. [2021-11-23 01:54:43,126 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) [2021-11-23 01:54:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5570 states to 5570 states and 6907 transitions. [2021-11-23 01:54:43,144 INFO L78 Accepts]: Start accepts. Automaton has 5570 states and 6907 transitions. Word has length 103 [2021-11-23 01:54:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:54:43,147 INFO L470 AbstractCegarLoop]: Abstraction has 5570 states and 6907 transitions. [2021-11-23 01:54:43,147 INFO L471 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) [2021-11-23 01:54:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 5570 states and 6907 transitions. [2021-11-23 01:54:43,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-11-23 01:54:43,155 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:54:43,155 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:54:43,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-23 01:54:43,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-11-23 01:54:43,374 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:54:43,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:54:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 55542943, now seen corresponding path program 1 times [2021-11-23 01:54:43,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:54:43,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731857077] [2021-11-23 01:54:43,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:43,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:54:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:54:43,522 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:54:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731857077] [2021-11-23 01:54:43,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731857077] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:54:43,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060744693] [2021-11-23 01:54:43,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:54:43,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:54:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:54:43,523 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:54:43,550 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-23 01:54:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:54:43,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-23 01:54:43,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:54:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:54:43,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:54:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-23 01:54:44,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060744693] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:54:44,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [219723356] [2021-11-23 01:54:44,296 INFO L159 IcfgInterpreter]: Started Sifa with 63 locations of interest [2021-11-23 01:54:44,296 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:54:44,297 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:54:44,297 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:54:44,297 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:54:50,915 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 178 for LOIs [2021-11-23 01:55:00,155 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 62 for LOIs [2021-11-23 01:55:00,164 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 184 for LOIs [2021-11-23 01:55:00,222 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 71 for LOIs [2021-11-23 01:55:00,455 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2021-11-23 01:55:01,015 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 208 for LOIs [2021-11-23 01:55:01,677 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:55:25,953 WARN L227 SmtUtils]: Spent 13.13s on a formula simplification. DAG size of input: 572 DAG size of output: 365 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 01:55:34,858 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 [2021-11-23 01:55:34,858 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:55:34,858 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:55:34,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 6] total 21 [2021-11-23 01:55:34,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256557535] [2021-11-23 01:55:34,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:55:34,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-11-23 01:55:34,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:55:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-11-23 01:55:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=416, Invalid=4006, Unknown=0, NotChecked=0, Total=4422 [2021-11-23 01:55:34,862 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) [2021-11-23 01:55:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:55:38,261 INFO L93 Difference]: Finished difference Result 10078 states and 12482 transitions. [2021-11-23 01:55:38,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2021-11-23 01:55:38,261 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 [2021-11-23 01:55:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:55:38,277 INFO L225 Difference]: With dead ends: 10078 [2021-11-23 01:55:38,277 INFO L226 Difference]: Without dead ends: 4505 [2021-11-23 01:55:38,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 315 SyntacticMatches, 11 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10196 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=1702, Invalid=21860, Unknown=0, NotChecked=0, Total=23562 [2021-11-23 01:55:38,300 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 1155 mSDsluCounter, 2435 mSDsCounter, 0 mSdLazyCounter, 2569 mSolverCounterSat, 574 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 3143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 2569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-11-23 01:55:38,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1161 Valid, 2306 Invalid, 3143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 2569 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-11-23 01:55:38,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4505 states. [2021-11-23 01:55:38,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4505 to 3281. [2021-11-23 01:55:38,616 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) [2021-11-23 01:55:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3281 states to 3281 states and 3838 transitions. [2021-11-23 01:55:38,626 INFO L78 Accepts]: Start accepts. Automaton has 3281 states and 3838 transitions. Word has length 109 [2021-11-23 01:55:38,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:55:38,626 INFO L470 AbstractCegarLoop]: Abstraction has 3281 states and 3838 transitions. [2021-11-23 01:55:38,627 INFO L471 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) [2021-11-23 01:55:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3281 states and 3838 transitions. [2021-11-23 01:55:38,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2021-11-23 01:55:38,633 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:55:38,633 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:55:38,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-23 01:55:38,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2021-11-23 01:55:38,847 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:55:38,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:55:38,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1369522639, now seen corresponding path program 1 times [2021-11-23 01:55:38,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:55:38,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958059790] [2021-11-23 01:55:38,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:55:38,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:55:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:55:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 13 proven. 34 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-11-23 01:55:39,005 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:55:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958059790] [2021-11-23 01:55:39,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958059790] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:55:39,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076572109] [2021-11-23 01:55:39,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:55:39,006 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:55:39,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:55:39,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:55:39,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-23 01:55:39,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:55:39,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 16 conjunts are in the unsatisfiable core [2021-11-23 01:55:39,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:55:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-11-23 01:55:39,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:55:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2021-11-23 01:55:39,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076572109] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:55:39,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [451125348] [2021-11-23 01:55:39,701 INFO L159 IcfgInterpreter]: Started Sifa with 66 locations of interest [2021-11-23 01:55:39,701 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:55:39,701 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:55:39,702 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:55:39,702 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:55:45,079 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 179 for LOIs [2021-11-23 01:55:49,808 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2021-11-23 01:55:49,818 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 185 for LOIs [2021-11-23 01:55:49,874 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 114 for LOIs [2021-11-23 01:55:49,964 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 63 for LOIs [2021-11-23 01:55:50,342 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 209 for LOIs [2021-11-23 01:55:51,031 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:56:11,461 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '201283#(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 [2021-11-23 01:56:11,462 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:56:11,462 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:56:11,462 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 22 [2021-11-23 01:56:11,462 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078413778] [2021-11-23 01:56:11,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:56:11,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-23 01:56:11,463 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:56:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-23 01:56:11,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=4715, Unknown=0, NotChecked=0, Total=5112 [2021-11-23 01:56:11,465 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) [2021-11-23 01:56:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:56:15,920 INFO L93 Difference]: Finished difference Result 6648 states and 8044 transitions. [2021-11-23 01:56:15,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2021-11-23 01:56:15,921 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 [2021-11-23 01:56:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:56:15,937 INFO L225 Difference]: With dead ends: 6648 [2021-11-23 01:56:15,938 INFO L226 Difference]: Without dead ends: 3516 [2021-11-23 01:56:15,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 318 SyntacticMatches, 18 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17263 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=2247, Invalid=35583, Unknown=0, NotChecked=0, Total=37830 [2021-11-23 01:56:15,955 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 1430 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-11-23 01:56:15,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1447 Valid, 2067 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-11-23 01:56:15,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3516 states. [2021-11-23 01:56:16,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3516 to 2305. [2021-11-23 01:56:16,169 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) [2021-11-23 01:56:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 2673 transitions. [2021-11-23 01:56:16,175 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 2673 transitions. Word has length 112 [2021-11-23 01:56:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:56:16,176 INFO L470 AbstractCegarLoop]: Abstraction has 2305 states and 2673 transitions. [2021-11-23 01:56:16,176 INFO L471 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) [2021-11-23 01:56:16,176 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 2673 transitions. [2021-11-23 01:56:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2021-11-23 01:56:16,180 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:56:16,181 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:56:16,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2021-11-23 01:56:16,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-11-23 01:56:16,394 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:56:16,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:56:16,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1183124369, now seen corresponding path program 1 times [2021-11-23 01:56:16,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:56:16,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827043352] [2021-11-23 01:56:16,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:56:16,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:56:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:56:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 21 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-11-23 01:56:16,659 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:56:16,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827043352] [2021-11-23 01:56:16,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827043352] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:56:16,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042747562] [2021-11-23 01:56:16,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:56:16,660 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:56:16,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:56:16,669 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:56:16,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-23 01:56:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:56:16,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 32 conjunts are in the unsatisfiable core [2021-11-23 01:56:16,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:56:17,233 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 52 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-23 01:56:17,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-23 01:56:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-11-23 01:56:17,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042747562] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-23 01:56:17,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [982254586] [2021-11-23 01:56:17,975 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2021-11-23 01:56:17,975 INFO L166 IcfgInterpreter]: Building call graph [2021-11-23 01:56:17,976 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-11-23 01:56:17,976 INFO L176 IcfgInterpreter]: Starting interpretation [2021-11-23 01:56:17,976 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-11-23 01:56:27,898 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 180 for LOIs [2021-11-23 01:56:30,290 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 64 for LOIs [2021-11-23 01:56:30,300 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 186 for LOIs [2021-11-23 01:56:30,359 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 113 for LOIs [2021-11-23 01:56:30,469 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 64 for LOIs [2021-11-23 01:56:30,850 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 210 for LOIs [2021-11-23 01:56:33,616 INFO L180 IcfgInterpreter]: Interpretation finished [2021-11-23 01:56:40,980 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 258 DAG size of output: 211 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-23 01:57:01,992 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '214733#(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 [2021-11-23 01:57:01,993 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2021-11-23 01:57:01,993 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-23 01:57:01,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 36 [2021-11-23 01:57:01,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710287682] [2021-11-23 01:57:01,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-23 01:57:01,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2021-11-23 01:57:01,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:57:01,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2021-11-23 01:57:01,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=7384, Unknown=0, NotChecked=0, Total=8010 [2021-11-23 01:57:01,995 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) [2021-11-23 01:57:08,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:57:08,310 INFO L93 Difference]: Finished difference Result 5886 states and 6998 transitions. [2021-11-23 01:57:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2021-11-23 01:57:08,311 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 [2021-11-23 01:57:08,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:57:08,323 INFO L225 Difference]: With dead ends: 5886 [2021-11-23 01:57:08,323 INFO L226 Difference]: Without dead ends: 3895 [2021-11-23 01:57:08,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 292 SyntacticMatches, 1 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9735 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=2685, Invalid=23397, Unknown=0, NotChecked=0, Total=26082 [2021-11-23 01:57:08,335 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 5648 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 3743 mSolverCounterSat, 3555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5648 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 7298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3555 IncrementalHoareTripleChecker+Valid, 3743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-11-23 01:57:08,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5648 Valid, 1235 Invalid, 7298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3555 Valid, 3743 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-11-23 01:57:08,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3895 states. [2021-11-23 01:57:08,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3895 to 2154. [2021-11-23 01:57:08,604 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) [2021-11-23 01:57:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2477 transitions. [2021-11-23 01:57:08,610 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2477 transitions. Word has length 114 [2021-11-23 01:57:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:57:08,610 INFO L470 AbstractCegarLoop]: Abstraction has 2154 states and 2477 transitions. [2021-11-23 01:57:08,610 INFO L471 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) [2021-11-23 01:57:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2477 transitions. [2021-11-23 01:57:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-11-23 01:57:08,615 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:57:08,615 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:57:08,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-11-23 01:57:08,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2021-11-23 01:57:08,831 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:57:08,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:57:08,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1963226919, now seen corresponding path program 1 times [2021-11-23 01:57:08,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:57:08,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290090990] [2021-11-23 01:57:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:08,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:57:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:08,911 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2021-11-23 01:57:08,911 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:57:08,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290090990] [2021-11-23 01:57:08,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290090990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:57:08,911 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-23 01:57:08,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-23 01:57:08,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053048534] [2021-11-23 01:57:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:57:08,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-23 01:57:08,913 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:57:08,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-23 01:57:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:57:08,914 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) [2021-11-23 01:57:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:57:09,546 INFO L93 Difference]: Finished difference Result 5729 states and 6637 transitions. [2021-11-23 01:57:09,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 01:57:09,547 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 [2021-11-23 01:57:09,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:57:09,557 INFO L225 Difference]: With dead ends: 5729 [2021-11-23 01:57:09,557 INFO L226 Difference]: Without dead ends: 4293 [2021-11-23 01:57:09,562 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:57:09,563 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:57:09,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 551 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-23 01:57:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2021-11-23 01:57:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 3157. [2021-11-23 01:57:09,951 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) [2021-11-23 01:57:09,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3649 transitions. [2021-11-23 01:57:09,959 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3649 transitions. Word has length 127 [2021-11-23 01:57:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:57:09,960 INFO L470 AbstractCegarLoop]: Abstraction has 3157 states and 3649 transitions. [2021-11-23 01:57:09,960 INFO L471 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) [2021-11-23 01:57:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3649 transitions. [2021-11-23 01:57:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-11-23 01:57:09,966 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:57:09,966 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:57:09,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-11-23 01:57:09,967 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:57:09,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:57:09,967 INFO L85 PathProgramCache]: Analyzing trace with hash -17658865, now seen corresponding path program 1 times [2021-11-23 01:57:09,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:57:09,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173471266] [2021-11-23 01:57:09,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:09,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:57:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 72 proven. 11 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-11-23 01:57:10,023 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:57:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173471266] [2021-11-23 01:57:10,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173471266] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:57:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149567312] [2021-11-23 01:57:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:10,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:57:10,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:57:10,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:57:10,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-23 01:57:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:10,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 01:57:10,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:57:10,383 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-11-23 01:57:10,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:57:10,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149567312] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:57:10,384 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:57:10,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2021-11-23 01:57:10,385 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391468280] [2021-11-23 01:57:10,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:57:10,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:57:10,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:57:10,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:57:10,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-23 01:57:10,386 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) [2021-11-23 01:57:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:57:10,696 INFO L93 Difference]: Finished difference Result 5951 states and 6861 transitions. [2021-11-23 01:57:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 01:57:10,697 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 [2021-11-23 01:57:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:57:10,707 INFO L225 Difference]: With dead ends: 5951 [2021-11-23 01:57:10,707 INFO L226 Difference]: Without dead ends: 3140 [2021-11-23 01:57:10,712 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:57:10,713 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 69 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2021-11-23 01:57:10,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 381 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:57:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2021-11-23 01:57:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 3083. [2021-11-23 01:57:11,101 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) [2021-11-23 01:57:11,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 3489 transitions. [2021-11-23 01:57:11,110 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 3489 transitions. Word has length 158 [2021-11-23 01:57:11,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:57:11,110 INFO L470 AbstractCegarLoop]: Abstraction has 3083 states and 3489 transitions. [2021-11-23 01:57:11,110 INFO L471 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) [2021-11-23 01:57:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 3489 transitions. [2021-11-23 01:57:11,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-11-23 01:57:11,116 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:57:11,116 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:57:11,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2021-11-23 01:57:11,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:57:11,342 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:57:11,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:57:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1120897049, now seen corresponding path program 1 times [2021-11-23 01:57:11,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:57:11,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943406982] [2021-11-23 01:57:11,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:11,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:57:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 36 proven. 32 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2021-11-23 01:57:11,411 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:57:11,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943406982] [2021-11-23 01:57:11,412 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943406982] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:57:11,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122153179] [2021-11-23 01:57:11,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:11,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:57:11,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:57:11,413 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:57:11,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-23 01:57:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:11,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 5 conjunts are in the unsatisfiable core [2021-11-23 01:57:11,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:57:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2021-11-23 01:57:11,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:57:11,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122153179] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:57:11,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:57:11,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2021-11-23 01:57:11,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105285741] [2021-11-23 01:57:11,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:57:11,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-23 01:57:11,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:57:11,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-23 01:57:11,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-11-23 01:57:11,744 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) [2021-11-23 01:57:12,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:57:12,052 INFO L93 Difference]: Finished difference Result 4525 states and 5102 transitions. [2021-11-23 01:57:12,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-23 01:57:12,052 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 [2021-11-23 01:57:12,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:57:12,055 INFO L225 Difference]: With dead ends: 4525 [2021-11-23 01:57:12,055 INFO L226 Difference]: Without dead ends: 1837 [2021-11-23 01:57:12,058 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:57:12,063 INFO L933 BasicCegarLoop]: 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 [2021-11-23 01:57:12,063 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 328 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-11-23 01:57:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2021-11-23 01:57:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1771. [2021-11-23 01:57:12,292 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) [2021-11-23 01:57:12,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1976 transitions. [2021-11-23 01:57:12,297 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1976 transitions. Word has length 159 [2021-11-23 01:57:12,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:57:12,298 INFO L470 AbstractCegarLoop]: Abstraction has 1771 states and 1976 transitions. [2021-11-23 01:57:12,298 INFO L471 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) [2021-11-23 01:57:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1976 transitions. [2021-11-23 01:57:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-11-23 01:57:12,302 INFO L506 BasicCegarLoop]: Found error trace [2021-11-23 01:57:12,302 INFO L514 BasicCegarLoop]: 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] [2021-11-23 01:57:12,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-23 01:57:12,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:57:12,522 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-23 01:57:12,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-23 01:57:12,523 INFO L85 PathProgramCache]: Analyzing trace with hash 792979339, now seen corresponding path program 1 times [2021-11-23 01:57:12,523 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-23 01:57:12,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454929447] [2021-11-23 01:57:12,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:12,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-23 01:57:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:12,595 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 89 proven. 15 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-11-23 01:57:12,595 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-23 01:57:12,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454929447] [2021-11-23 01:57:12,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454929447] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-23 01:57:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082405764] [2021-11-23 01:57:12,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-23 01:57:12,597 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-23 01:57:12,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 [2021-11-23 01:57:12,598 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-23 01:57:12,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-11-23 01:57:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-23 01:57:12,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 24 conjunts are in the unsatisfiable core [2021-11-23 01:57:12,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-23 01:57:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2021-11-23 01:57:12,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-23 01:57:12,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082405764] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-23 01:57:12,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-23 01:57:12,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 6 [2021-11-23 01:57:12,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089000041] [2021-11-23 01:57:12,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-23 01:57:12,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-23 01:57:12,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-23 01:57:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-23 01:57:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-23 01:57:12,974 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) [2021-11-23 01:57:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-23 01:57:13,202 INFO L93 Difference]: Finished difference Result 2327 states and 2593 transitions. [2021-11-23 01:57:13,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-23 01:57:13,202 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 [2021-11-23 01:57:13,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-23 01:57:13,203 INFO L225 Difference]: With dead ends: 2327 [2021-11-23 01:57:13,203 INFO L226 Difference]: Without dead ends: 0 [2021-11-23 01:57:13,206 INFO L932 BasicCegarLoop]: 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 [2021-11-23 01:57:13,207 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 148 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-23 01:57:13,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 222 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-23 01:57:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-23 01:57:13,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-23 01:57:13,208 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) [2021-11-23 01:57:13,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-23 01:57:13,209 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2021-11-23 01:57:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-23 01:57:13,209 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-23 01:57:13,209 INFO L471 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) [2021-11-23 01:57:13,209 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-23 01:57:13,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-23 01:57:13,212 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-11-23 01:57:13,213 INFO L764 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-11-23 01:57:13,258 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2021-11-23 01:57:13,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-11-23 01:57:13,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-23 01:57:18,835 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 228 DAG size of output: 222 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:57:24,182 WARN L227 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 228 DAG size of output: 222 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:57:43,252 WARN L227 SmtUtils]: Spent 17.32s on a formula simplification. DAG size of input: 511 DAG size of output: 468 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:58:03,194 WARN L227 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 228 DAG size of output: 222 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:58:21,494 WARN L227 SmtUtils]: Spent 17.28s on a formula simplification. DAG size of input: 511 DAG size of output: 468 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:58:30,542 WARN L227 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 218 DAG size of output: 215 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2021-11-23 01:58:38,727 WARN L227 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 584 DAG size of output: 195 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 01:58:45,656 WARN L227 SmtUtils]: Spent 6.20s on a formula simplification. DAG size of input: 595 DAG size of output: 198 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 01:59:14,751 WARN L227 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 728 DAG size of output: 183 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-11-23 01:59:28,694 INFO L858 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 820 830) no Hoare annotation was computed. [2021-11-23 01:59:28,695 INFO L854 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 820 830) the Hoare annotation is: (let ((.cse30 (not (= ~E_M~0 ~E_1~0))) (.cse56 (not (= ~E_1~0 1))) (.cse39 (= 0 ~t2_st~0)) (.cse57 (+ ~local~0 1)) (.cse23 (= ~E_2~0 1)) (.cse50 (= ~p_dw_pc~0 0)) (.cse45 (<= 2 ~E_1~0)) (.cse52 (= ~p_num_write~0 0)) (.cse33 (= ~m_pc~0 ~t1_pc~0)) (.cse48 (= ~c_num_read~0 0)) (.cse51 (= ~t1_i~0 1)) (.cse49 (= ~p_last_write~0 ~q_buf_0~0)) (.cse41 (= |old(~t1_st~0)| ~t1_st~0)) (.cse24 (= ~m_pc~0 1)) (.cse47 (= ~q_free~0 0)) (.cse55 (= ~p_dw_st~0 0)) (.cse54 (= ~t2_i~0 1)) (.cse53 (= ~c_dr_pc~0 0)) (.cse46 (= ~c_last_read~0 ~p_last_write~0)) (.cse37 (= ~m_st~0 |old(~m_st~0)|)) (.cse42 (= |old(~t2_st~0)| ~t2_st~0)) (.cse38 (= ~t1_st~0 0))) (let ((.cse10 (and .cse37 .cse42 .cse38)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse14 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~m_pc~0 0))) (.cse34 (and .cse50 .cse45 .cse52 (not .cse33) .cse48 .cse51 .cse49 .cse41 (not .cse24) .cse37 .cse47 .cse42 .cse55 .cse54 .cse53 .cse46)) (.cse36 (not (= |old(~t2_st~0)| 0))) (.cse29 (not .cse23)) (.cse40 (not (<= ~t2_pc~0 0))) (.cse31 (not (<= .cse57 ~token~0))) (.cse44 (and .cse41 .cse37 .cse39)) (.cse32 (not (<= ~token~0 .cse57))) (.cse4 (not (= ~E_M~0 2))) (.cse6 (= |old(~m_st~0)| 0)) (.cse7 (not (<= ~token~0 ~local~0))) (.cse17 (and .cse56 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse18 (not (<= ~local~0 ~token~0))) (.cse20 (not (= 2 |old(~t2_st~0)|))) (.cse22 (and .cse30 .cse56)) (.cse27 (and .cse50 .cse45 .cse52 .cse48 .cse51 .cse49 .cse41 .cse37 .cse47 .cse42 .cse55 .cse54 .cse53 .cse46)) (.cse1 (not (= ~E_2~0 2))) (.cse2 (not .cse55)) (.cse3 (not .cse54)) (.cse5 (not .cse53)) (.cse28 (not (= ~t1_pc~0 1))) (.cse9 (not .cse52)) (.cse11 (not .cse51)) (.cse12 (not .cse50)) (.cse13 (not .cse49)) (.cse15 (not .cse48)) (.cse16 (not .cse47)) (.cse43 (not (= |old(~t1_st~0)| 2))) (.cse25 (not (= 2 |old(~m_st~0)|))) (.cse19 (not (= ~t2_pc~0 1))) (.cse21 (not .cse46)) (.cse26 (not .cse45)) (.cse35 (= ~E_M~0 1))) (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) (or .cse0 .cse2 .cse3 .cse5 .cse23 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16 .cse25 .cse19 .cse21 .cse26) (or .cse27 .cse2 .cse3 .cse4 .cse5 .cse28 .cse9 .cse11 .cse29 .cse12 .cse13 .cse15 .cse16 .cse30 .cse31 .cse25 .cse19 .cse21 .cse26 .cse32) (or .cse2 .cse3 .cse33 .cse5 .cse28 .cse9 .cse34 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16 .cse25 .cse19 .cse21 .cse26 .cse35) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse36 (and .cse37 .cse38 .cse39) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse40 .cse16 .cse17 .cse18 .cse21 .cse22) (or .cse1 .cse2 .cse3 (and .cse41 .cse37 .cse42) .cse4 .cse5 .cse6 .cse7 .cse36 .cse28 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse40 .cse16 .cse17 .cse18 .cse43 .cse21 .cse22) (or .cse2 .cse3 .cse33 .cse5 .cse23 .cse28 .cse9 .cse34 .cse11 .cse12 .cse13 .cse24 .cse15 .cse16 .cse25 .cse19 .cse21 .cse26) (or .cse2 .cse3 .cse5 .cse36 .cse28 .cse9 .cse11 .cse29 .cse12 .cse13 .cse24 .cse15 .cse40 .cse16 .cse44 .cse25 .cse21 .cse26 .cse35) (or .cse2 .cse3 .cse4 .cse5 .cse36 .cse28 .cse9 .cse11 .cse29 .cse12 .cse13 .cse15 .cse40 .cse16 .cse30 .cse31 .cse44 .cse25 .cse21 .cse32) (or .cse1 .cse2 .cse3 (and .cse37 (= 2 ~t1_st~0) .cse42) .cse4 .cse5 .cse6 .cse7 .cse28 .cse9 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse43 .cse19 .cse20 .cse21 .cse22) (or .cse27 .cse1 .cse2 .cse3 .cse5 (not (<= (+ 2 ~local~0) ~token~0)) .cse28 .cse9 (not (= ~E_1~0 2)) .cse11 .cse12 .cse13 .cse15 .cse16 .cse43 .cse25 .cse19 .cse21 .cse26 (not (< ~token~0 (+ 3 ~local~0))) (not .cse35))))) [2021-11-23 01:59:28,695 INFO L858 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 820 830) no Hoare annotation was computed. [2021-11-23 01:59:28,695 INFO L854 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))) [2021-11-23 01:59:28,695 INFO L858 garLoopResultBuilder]: For program point L50(lines 50 59) no Hoare annotation was computed. [2021-11-23 01:59:28,695 INFO L858 garLoopResultBuilder]: For program point L50-2(lines 50 59) no Hoare annotation was computed. [2021-11-23 01:59:28,696 INFO L858 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 84 108) no Hoare annotation was computed. [2021-11-23 01:59:28,696 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 78) no Hoare annotation was computed. [2021-11-23 01:59:28,696 INFO L858 garLoopResultBuilder]: For program point L69-2(lines 69 78) no Hoare annotation was computed. [2021-11-23 01:59:28,696 INFO L854 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))) [2021-11-23 01:59:28,696 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 56) no Hoare annotation was computed. [2021-11-23 01:59:28,696 INFO L861 garLoopResultBuilder]: At program point L80(lines 68 82) the Hoare annotation is: true [2021-11-23 01:59:28,697 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 75) no Hoare annotation was computed. [2021-11-23 01:59:28,697 INFO L854 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 710 747) the Hoare annotation is: (let ((.cse45 (= ~t1_pc~0 1)) (.cse38 (= ~p_dw_pc~0 0)) (.cse40 (= ~p_num_write~0 0)) (.cse36 (= ~c_num_read~0 0)) (.cse34 (= ~m_st~0 2)) (.cse39 (= ~t1_i~0 1)) (.cse37 (= ~p_last_write~0 ~q_buf_0~0)) (.cse35 (= ~q_free~0 0)) (.cse46 (= ~E_M~0 ~E_1~0)) (.cse44 (= ~t2_pc~0 1)) (.cse43 (= ~p_dw_st~0 0)) (.cse42 (= ~t2_i~0 1)) (.cse41 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse47 (= ~E_2~0 |old(~E_2~0)|)) (.cse48 (= ~E_1~0 2)) (.cse49 (= 2 ~t2_st~0))) (let ((.cse7 (not .cse49)) (.cse12 (not (= 2 ~t1_st~0))) (.cse26 (and .cse45 .cse38 .cse40 .cse36 .cse34 .cse39 .cse37 (= ~E_M~0 |old(~E_M~0)|) .cse49 .cse35 .cse46 .cse44 (= ~E_2~0 2) .cse43 .cse42 .cse41 (= ~E_1~0 |old(~E_1~0)|) .cse33 .cse47 .cse48)) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse27 (not (<= ~token~0 ~local~0))) (.cse5 (not (= 2 |old(~E_1~0)|))) (.cse6 (not (= ~m_pc~0 0))) (.cse18 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse28 (not (<= ~local~0 ~token~0))) (.cse20 (and .cse46 .cse47 .cse48)) (.cse23 (not (= ~m_st~0 0))) (.cse4 (not .cse45)) (.cse21 (not .cse44)) (.cse0 (not .cse43)) (.cse2 (not .cse42)) (.cse3 (not .cse41)) (.cse8 (not .cse40)) (.cse9 (not .cse39)) (.cse10 (not .cse38)) (.cse11 (not .cse37)) (.cse13 (not (<= 2 |old(~E_1~0)|))) (.cse14 (= ~m_pc~0 1)) (.cse15 (= |old(~E_M~0)| 1)) (.cse16 (not .cse36)) (.cse29 (not (<= ~t2_pc~0 0))) (.cse17 (not .cse35)) (.cse24 (not .cse34)) (.cse19 (= |old(~E_2~0)| 1)) (.cse30 (not (= 0 ~t2_st~0))) (.cse31 (and (<= 2 ~E_1~0) (not (= ~E_2~0 1)) (not (= ~E_M~0 1)))) (.cse32 (not (= ~t1_st~0 0))) (.cse22 (not .cse33))) (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) (or .cse0 .cse1 .cse2 .cse3 (not (<= (+ 2 ~local~0) ~token~0)) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse23 .cse21 .cse22 (not (< ~token~0 (+ 3 ~local~0)))) (let ((.cse25 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse24 .cse18 (not (<= .cse25 ~token~0)) .cse19 .cse26 .cse21 .cse22 (not (<= ~token~0 .cse25)))) (or .cse0 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse24 .cse18 .cse28 .cse19 .cse26 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse24 .cse19 .cse30 .cse31 .cse22) (or .cse0 .cse2 .cse3 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19 .cse31 .cse32 .cse21 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (not (= ~t1_pc~0 0)) .cse16 .cse29 .cse17 .cse18 .cse28 .cse20 .cse30 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse23) .cse32 .cse22) (or .cse0 .cse2 .cse3 .cse4 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse19 .cse31 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse24 .cse19 .cse30 .cse31 .cse32 .cse22)))) [2021-11-23 01:59:28,697 INFO L858 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 710 747) no Hoare annotation was computed. [2021-11-23 01:59:28,697 INFO L854 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 786 819) the Hoare annotation is: (let ((.cse12 (= ~t1_st~0 0)) (.cse28 (not (= ~E_M~0 ~E_1~0))) (.cse60 (not (= ~E_1~0 1))) (.cse56 (= 0 ~t2_st~0)) (.cse63 (+ ~local~0 1)) (.cse37 (= ~E_2~0 1)) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse34 (= ~m_pc~0 1)) (.cse6 (= |old(~m_st~0)| 0)) (.cse62 (= ~t1_pc~0 1)) (.cse61 (= ~t2_pc~0 1)) (.cse53 (= ~p_dw_pc~0 0)) (.cse48 (<= 2 ~E_1~0)) (.cse55 (= ~p_num_write~0 0)) (.cse51 (= ~c_num_read~0 0)) (.cse54 (= ~t1_i~0 1)) (.cse52 (= ~p_last_write~0 ~q_buf_0~0)) (.cse64 (= |old(~t1_st~0)| ~t1_st~0)) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse50 (= ~q_free~0 0)) (.cse11 (= |old(~t2_st~0)| ~t2_st~0)) (.cse59 (= ~p_dw_st~0 0)) (.cse58 (= ~t2_i~0 1)) (.cse57 (= ~c_dr_pc~0 0)) (.cse49 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse25 (and .cse53 .cse48 .cse55 .cse51 .cse54 .cse52 .cse64 .cse10 .cse50 .cse11 .cse59 .cse58 .cse57 .cse49)) (.cse38 (not (<= (+ 2 ~local~0) ~token~0))) (.cse41 (not (< ~token~0 (+ 3 ~local~0)))) (.cse42 (and .cse62 .cse53 .cse48 .cse55 .cse51 .cse54 .cse52 .cse64 .cse10 .cse50 .cse11 .cse61 .cse59 .cse58 .cse57 .cse49)) (.cse43 (not .cse6)) (.cse16 (not (= ~t1_pc~0 0))) (.cse8 (not (= ~m_pc~0 0))) (.cse39 (not (= ~E_1~0 2))) (.cse45 (and .cse53 .cse48 .cse55 (not .cse44) .cse51 .cse54 .cse52 .cse64 (not .cse34) .cse10 .cse50 .cse11 .cse59 .cse58 .cse57 .cse49)) (.cse47 (and .cse64 .cse10 .cse11)) (.cse27 (not .cse37)) (.cse29 (not (<= .cse63 ~token~0))) (.cse36 (and .cse64 .cse10 .cse56)) (.cse32 (not (<= ~token~0 .cse63))) (.cse1 (not (= ~E_2~0 2))) (.cse4 (not (= ~E_M~0 2))) (.cse7 (not (<= ~token~0 ~local~0))) (.cse26 (not .cse62)) (.cse19 (and .cse60 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse20 (not (<= ~local~0 ~token~0))) (.cse40 (not (= |old(~t1_st~0)| 2))) (.cse21 (not .cse61)) (.cse22 (not (= 2 |old(~t2_st~0)|))) (.cse24 (and .cse28 .cse60)) (.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not .cse59)) (.cse3 (not .cse58)) (.cse5 (not .cse57)) (.cse33 (not (= |old(~t2_st~0)| 0))) (.cse46 (and .cse10 .cse12 .cse56)) (.cse9 (not .cse55)) (.cse13 (not .cse54)) (.cse14 (not .cse53)) (.cse15 (not .cse52)) (.cse17 (not .cse51)) (.cse35 (not (<= ~t2_pc~0 0))) (.cse18 (not .cse50)) (.cse30 (not (= 2 |old(~m_st~0)|))) (.cse23 (not .cse49)) (.cse31 (not .cse48))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse25 .cse2 .cse3 .cse4 .cse5 .cse26 .cse9 .cse13 .cse27 .cse14 .cse15 .cse17 .cse18 .cse28 .cse29 .cse30 .cse21 .cse23 .cse31 .cse32) (or .cse2 .cse3 .cse5 .cse33 .cse26 .cse9 .cse13 .cse14 .cse15 .cse34 .cse17 .cse35 .cse18 .cse36 .cse30 .cse23 .cse31) (or .cse25 .cse1 .cse2 .cse3 .cse5 .cse37 .cse38 .cse26 .cse9 .cse39 .cse13 .cse14 .cse15 .cse17 .cse18 .cse40 .cse30 .cse21 .cse23 .cse31 .cse41 (not (= ~E_M~0 1))) (or .cse1 .cse2 .cse3 .cse5 .cse38 .cse26 .cse9 .cse39 .cse42 .cse13 .cse14 .cse15 .cse17 .cse18 .cse28 .cse43 .cse40 .cse21 .cse22 .cse23 .cse41) (or .cse1 .cse2 .cse3 .cse5 .cse37 .cse26 .cse9 .cse39 .cse42 .cse13 .cse14 .cse15 .cse17 .cse18 .cse28 .cse29 .cse40 .cse30 .cse21 .cse22 .cse23 .cse31 .cse32) (or .cse2 .cse3 .cse44 .cse5 .cse26 .cse9 .cse45 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse30 .cse21 .cse23 .cse31) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse33 .cse46 .cse8 .cse9 .cse39 .cse13 .cse14 .cse15 .cse16 .cse17 .cse35 .cse18 .cse28 .cse20 .cse43 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse33 .cse46 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse35 .cse18 .cse19 .cse20 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse47 .cse4 .cse5 .cse6 .cse7 .cse33 .cse26 .cse8 .cse9 .cse13 .cse14 .cse15 .cse17 .cse35 .cse18 .cse19 .cse20 .cse40 .cse23 .cse24) (or .cse1 .cse2 .cse3 .cse44 .cse5 .cse26 .cse8 .cse9 .cse39 .cse45 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse28 .cse40 .cse21 .cse22 .cse23 .cse31) (or .cse0 .cse2 .cse3 .cse47 .cse5 .cse9 .cse13 .cse14 .cse15 .cse34 .cse17 .cse18 .cse30 .cse21 .cse23 .cse31) (or .cse2 .cse3 .cse4 .cse5 .cse33 .cse26 .cse9 .cse13 .cse27 .cse14 .cse15 .cse17 .cse35 .cse18 .cse28 .cse29 .cse36 .cse30 .cse23 .cse32) (or .cse1 .cse2 .cse3 (and .cse10 (= 2 ~t1_st~0) .cse11) .cse4 .cse5 .cse6 .cse7 .cse26 .cse9 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse40 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse2 .cse3 .cse5 .cse33 .cse46 .cse9 .cse13 .cse14 .cse15 .cse34 .cse17 .cse35 .cse18 .cse30 .cse23 .cse31)))) [2021-11-23 01:59:28,697 INFO L858 garLoopResultBuilder]: For program point L556(lines 556 561) no Hoare annotation was computed. [2021-11-23 01:59:28,698 INFO L854 garLoopResultBuilder]: At program point L585(lines 573 587) the Hoare annotation is: (let ((.cse40 (= ~m_pc~0 1)) (.cse39 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse48 (= 0 ~t2_st~0)) (.cse47 (= ~t1_st~0 0)) (.cse68 (+ ~local~0 1)) (.cse4 (= ~E_2~0 1)) (.cse64 (= ~t1_pc~0 1)) (.cse38 (= |activate_threads2_is_transmit2_triggered_~__retres1~6#1| 0)) (.cse44 (= 2 ~t1_st~0)) (.cse34 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse45 (= ~E_1~0 2)) (.cse61 (= ~p_dw_pc~0 0)) (.cse56 (<= 2 ~E_1~0)) (.cse63 (= ~p_num_write~0 0)) (.cse69 (not .cse39)) (.cse59 (= ~c_num_read~0 0)) (.cse62 (= ~t1_i~0 1)) (.cse60 (= ~p_last_write~0 ~q_buf_0~0)) (.cse31 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse50 (not .cse40)) (.cse32 (= ~m_st~0 |old(~m_st~0)|)) (.cse58 (= ~q_free~0 0)) (.cse33 (= |old(~t2_st~0)| ~t2_st~0)) (.cse67 (= ~p_dw_st~0 0)) (.cse66 (= ~t2_i~0 1)) (.cse65 (= ~c_dr_pc~0 0)) (.cse57 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~E_M~0 ~E_1~0))) (.cse70 (not (= ~E_1~0 1))) (.cse42 (= |old(~m_st~0)| 0))) (let ((.cse16 (not .cse42)) (.cse46 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse5 (not (<= (+ 2 ~local~0) ~token~0))) (.cse22 (not (< ~token~0 (+ 3 ~local~0)))) (.cse24 (not (<= ~token~0 ~local~0))) (.cse26 (not (= ~m_pc~0 0))) (.cse27 (not (= ~t1_pc~0 0))) (.cse43 (and .cse70 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse49 (and .cse15 .cse70)) (.cse0 (not (= ~E_2~0 2))) (.cse35 (and .cse61 .cse56 .cse63 .cse69 .cse59 .cse62 .cse60 .cse31 .cse50 .cse32 .cse58 .cse33 .cse67 .cse66 .cse65 .cse57)) (.cse8 (not .cse45)) (.cse13 (and .cse31 .cse38 .cse32 .cse44 .cse33 .cse34)) (.cse17 (not (= |old(~t1_st~0)| 2))) (.cse19 (not (= 2 |old(~t2_st~0)|))) (.cse37 (= |old(~t1_st~0)| ~t1_st~0)) (.cse41 (not (= ~E_M~0 2))) (.cse55 (and .cse61 .cse56 .cse63 .cse69 .cse59 .cse62 .cse60 .cse50 .cse58 .cse33 .cse67 .cse66 .cse65 .cse57)) (.cse6 (not .cse64)) (.cse51 (not .cse4)) (.cse52 (not (<= .cse68 ~token~0))) (.cse18 (not (= ~t2_pc~0 1))) (.cse53 (not (<= ~token~0 .cse68))) (.cse23 (not (= |old(~t1_st~0)| 0))) (.cse1 (not .cse67)) (.cse2 (not .cse66)) (.cse3 (not .cse65)) (.cse54 (and .cse64 .cse47)) (.cse25 (not (= |old(~t2_st~0)| 0))) (.cse7 (not .cse63)) (.cse9 (not .cse62)) (.cse10 (not .cse61)) (.cse11 (not .cse60)) (.cse12 (not .cse59)) (.cse28 (not (<= ~t2_pc~0 0))) (.cse14 (not .cse58)) (.cse30 (and .cse31 .cse38 .cse32 .cse47 .cse48 .cse34)) (.cse36 (not (= 2 |old(~m_st~0)|))) (.cse20 (not .cse57)) (.cse21 (not .cse56))) (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) (or .cse23 .cse0 .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse14 .cse15 .cse29 .cse16 .cse30 .cse20) (or (and .cse31 .cse32 .cse33 .cse34) .cse0 .cse1 .cse2 .cse3 .cse24 .cse4 .cse35 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse29 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 (and .cse31 .cse37 .cse38 .cse32 .cse33 .cse34) .cse39 .cse3 .cse6 .cse26 .cse7 .cse8 .cse9 .cse10 .cse11 .cse40 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse41 .cse3 .cse42 .cse24 .cse25 .cse6 .cse26 .cse7 .cse9 .cse10 .cse11 .cse12 .cse28 .cse14 .cse43 .cse29 (and .cse44 .cse45 .cse34) .cse17 (and .cse46 .cse31 .cse38 .cse32 .cse47 .cse48) .cse20 .cse49) (or .cse0 .cse1 .cse2 (and .cse46 .cse31 .cse38 .cse32 .cse33 .cse47) .cse41 .cse3 .cse42 .cse24 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse43 .cse29 .cse17 (and .cse38 .cse44 .cse45 .cse34) .cse18 .cse19 .cse20 .cse49) (or .cse23 .cse0 .cse1 .cse2 .cse41 .cse3 .cse42 .cse24 .cse25 .cse26 .cse7 .cse9 .cse10 .cse11 .cse27 .cse12 .cse28 .cse14 .cse43 .cse29 .cse30 .cse20 .cse49) (or .cse1 .cse2 .cse41 .cse3 .cse25 .cse50 .cse6 .cse7 .cse9 .cse51 .cse10 .cse11 .cse12 .cse28 .cse14 .cse15 .cse52 .cse36 .cse20 .cse53 (and .cse31 .cse37 .cse38 .cse32 .cse48 .cse34)) (or .cse23 .cse1 .cse2 .cse3 .cse54 .cse7 .cse9 .cse10 .cse11 .cse40 .cse12 .cse14 (and .cse31 .cse32 .cse33 .cse47 .cse34) .cse36 .cse18 .cse20 .cse21) (or (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse38 (= ~m_st~0 0) .cse44 .cse33 .cse34) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse55 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse17 .cse36 .cse18 .cse20 .cse21 .cse22 (not (= ~E_M~0 1))) (or .cse23 .cse0 .cse1 .cse2 .cse41 .cse3 .cse42 .cse24 .cse26 .cse7 .cse9 .cse10 .cse11 .cse27 .cse12 .cse14 .cse43 .cse29 (and .cse31 .cse38 .cse32 .cse33 .cse47 .cse34) .cse18 .cse19 .cse20 .cse49) (or .cse1 .cse2 .cse3 .cse25 .cse6 .cse7 .cse9 .cse10 .cse11 .cse40 .cse12 .cse28 .cse14 (and .cse31 .cse38 .cse32 .cse48) .cse36 .cse20 .cse21) (or .cse1 .cse2 .cse39 .cse3 .cse35 .cse6 .cse7 .cse9 .cse10 .cse11 .cse40 .cse12 .cse14 .cse36 .cse18 .cse20 .cse21) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse35 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse52 .cse17 .cse36 .cse18 .cse19 .cse20 .cse21 .cse53) (or (and .cse31 .cse37 .cse32 .cse33 (<= 1 |activate_threads2_is_transmit2_triggered_~__retres1~6#1|) .cse34) .cse1 .cse2 .cse41 .cse3 .cse55 .cse6 .cse7 .cse9 .cse51 .cse10 .cse11 .cse12 .cse14 .cse15 .cse52 .cse36 .cse18 .cse20 .cse21 .cse53) (or .cse23 .cse1 .cse2 .cse3 .cse54 .cse25 .cse7 .cse9 .cse10 .cse11 .cse40 .cse12 .cse28 .cse14 .cse30 .cse36 .cse20 .cse21))))) [2021-11-23 01:59:28,698 INFO L858 garLoopResultBuilder]: For program point L536(lines 536 545) no Hoare annotation was computed. [2021-11-23 01:59:28,698 INFO L858 garLoopResultBuilder]: For program point L536-2(lines 536 545) no Hoare annotation was computed. [2021-11-23 01:59:28,698 INFO L858 garLoopResultBuilder]: For program point L574(lines 574 583) no Hoare annotation was computed. [2021-11-23 01:59:28,698 INFO L858 garLoopResultBuilder]: For program point L574-2(lines 574 583) no Hoare annotation was computed. [2021-11-23 01:59:28,698 INFO L858 garLoopResultBuilder]: For program point L537(lines 537 542) no Hoare annotation was computed. [2021-11-23 01:59:28,699 INFO L854 garLoopResultBuilder]: At program point L566(lines 554 568) the Hoare annotation is: (let ((.cse29 (= ~m_pc~0 1))) (let ((.cse54 (= ~E_1~0 2)) (.cse40 (= |old(~m_st~0)| 0)) (.cse51 (= ~t1_pc~0 1)) (.cse3 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (not .cse29)) (.cse68 (= ~t2_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= |old(~t1_st~0)| ~t1_st~0)) (.cse11 (= ~q_free~0 0)) (.cse12 (= |old(~t2_st~0)| ~t2_st~0)) (.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)) (.cse32 (not (= ~E_M~0 ~E_1~0))) (.cse70 (not (= ~E_1~0 1))) (.cse59 (<= ~t2_pc~0 0)) (.cse7 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse10 (= ~m_st~0 |old(~m_st~0)|)) (.cse69 (= ~t1_st~0 0)) (.cse57 (= 0 ~t2_st~0)) (.cse17 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse71 (+ ~local~0 1)) (.cse63 (= ~E_2~0 1))) (let ((.cse56 (not .cse63)) (.cse58 (not (<= .cse71 ~token~0))) (.cse60 (not (<= ~token~0 .cse71))) (.cse53 (<= 1 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse47 (and .cse7 .cse10 .cse69 .cse57 .cse17)) (.cse39 (not (= ~E_M~0 2))) (.cse48 (not (= |old(~t2_st~0)| 0))) (.cse23 (not (= ~m_pc~0 0))) (.cse42 (not (= ~t1_pc~0 0))) (.cse49 (not .cse59)) (.cse43 (and .cse70 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse46 (and .cse32 .cse70)) (.cse41 (not (<= ~token~0 ~local~0))) (.cse44 (not (<= ~local~0 ~token~0))) (.cse62 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse55 (and .cse51 .cse0 .cse1 .cse2 .cse3 .cse4 (= ~m_st~0 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse68 .cse13 .cse14 .cse15 .cse16)) (.cse50 (not .cse40)) (.cse35 (not (= 2 |old(~t2_st~0)|))) (.cse61 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (.cse18 (not (= ~E_2~0 2))) (.cse66 (= ~m_st~0 0)) (.cse64 (= 2 ~t1_st~0)) (.cse65 (not (<= (+ 2 ~local~0) ~token~0))) (.cse22 (not .cse51)) (.cse25 (not .cse54)) (.cse33 (not (= |old(~t1_st~0)| 2))) (.cse67 (not (< ~token~0 (+ 3 ~local~0)))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse19 (not .cse13)) (.cse20 (not .cse14)) (.cse21 (not .cse15)) (.cse24 (not .cse2)) (.cse26 (not .cse5)) (.cse27 (not .cse0)) (.cse28 (not .cse6)) (.cse30 (not .cse4)) (.cse31 (not .cse11)) (.cse45 (and .cse7 .cse10 .cse12 .cse69 .cse17)) (.cse52 (not (= 2 |old(~m_st~0)|))) (.cse34 (not .cse68)) (.cse36 (not .cse16)) (.cse37 (not .cse1))) (and (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 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) (or .cse38 .cse18 .cse19 .cse20 .cse39 .cse21 .cse40 .cse41 .cse23 .cse24 .cse26 .cse27 .cse28 .cse42 .cse30 .cse31 .cse43 .cse44 .cse45 .cse34 .cse35 .cse36 .cse46) (or .cse38 .cse18 .cse19 .cse20 .cse47 .cse21 .cse41 .cse48 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse42 .cse30 .cse49 .cse31 .cse32 .cse44 .cse50 .cse36) (or .cse51 .cse38 .cse19 .cse20 .cse47 .cse21 .cse48 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse52 .cse36 .cse37) (or .cse53 .cse18 .cse19 .cse20 .cse39 .cse21 .cse40 .cse41 .cse22 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse43 .cse44 .cse33 .cse34 .cse35 .cse36 .cse46 .cse17) (or .cse18 .cse19 .cse20 .cse39 .cse21 .cse40 .cse41 .cse22 .cse24 .cse26 (and .cse0 .cse2 .cse53 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16) .cse27 .cse28 .cse30 .cse31 .cse44 .cse33 .cse34 .cse54 .cse35 .cse36 .cse46) (or .cse19 .cse20 .cse21 .cse22 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse52 .cse34 .cse36 .cse37 .cse55) (or .cse19 .cse20 .cse39 .cse21 .cse48 .cse22 .cse24 .cse26 .cse56 .cse27 .cse28 .cse30 .cse49 .cse31 .cse32 (and .cse7 .cse8 .cse10 .cse57 .cse17) .cse58 .cse52 (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse13 .cse15 .cse16 .cse59) .cse36 .cse60) (or .cse61 .cse19 .cse20 .cse39 .cse21 .cse22 .cse24 .cse26 .cse56 .cse27 .cse28 .cse30 .cse31 .cse32 .cse58 .cse52 .cse34 .cse62 .cse36 .cse37 .cse60) (or .cse18 .cse19 .cse20 .cse21 .cse63 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse58 .cse33 .cse52 .cse34 .cse62 .cse35 .cse36 .cse37 .cse60 .cse55) (or .cse18 .cse19 .cse20 .cse39 .cse21 .cse40 .cse41 .cse48 .cse22 .cse23 .cse24 .cse26 .cse27 .cse28 .cse30 .cse49 .cse31 (and .cse53 .cse7 .cse10 .cse64 .cse57) .cse43 .cse44 (and .cse54 .cse17) .cse33 .cse36 .cse46) (or .cse19 .cse20 .cse21 .cse48 .cse22 .cse24 (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse57 .cse59) .cse26 .cse27 .cse28 .cse29 .cse30 .cse49 .cse31 .cse52 .cse36 .cse37) (or .cse38 .cse18 .cse19 .cse20 .cse47 .cse39 .cse21 .cse40 .cse41 .cse48 .cse23 .cse24 .cse26 .cse27 .cse28 .cse42 .cse30 .cse49 .cse31 .cse43 .cse44 .cse36 .cse46) (or .cse18 .cse19 .cse20 .cse21 .cse41 .cse63 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 .cse44 .cse33 .cse52 .cse34 .cse62 .cse35 .cse36 .cse37 .cse55) (or .cse18 .cse19 .cse20 .cse21 .cse65 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse32 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse66 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse50 .cse33 .cse34 .cse35 .cse36 .cse67) (or .cse61 .cse18 .cse19 .cse20 (and (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse66 .cse64 .cse12 .cse17) .cse21 .cse63 .cse65 .cse22 .cse24 .cse25 .cse26 .cse27 .cse28 .cse30 .cse31 .cse33 .cse52 .cse34 .cse36 .cse37 .cse67 (not (= ~E_M~0 1))) (or .cse51 .cse38 .cse19 .cse20 .cse21 .cse24 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse45 .cse52 .cse34 .cse36 .cse37))))) [2021-11-23 01:59:28,699 INFO L858 garLoopResultBuilder]: For program point L575(lines 575 580) no Hoare annotation was computed. [2021-11-23 01:59:28,699 INFO L858 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 786 819) no Hoare annotation was computed. [2021-11-23 01:59:28,700 INFO L858 garLoopResultBuilder]: For program point L555(lines 555 564) no Hoare annotation was computed. [2021-11-23 01:59:28,700 INFO L858 garLoopResultBuilder]: For program point L555-2(lines 555 564) no Hoare annotation was computed. [2021-11-23 01:59:28,700 INFO L854 garLoopResultBuilder]: At program point L547(lines 535 549) the Hoare annotation is: (let ((.cse55 (= 0 ~t2_st~0)) (.cse63 (+ ~local~0 1)) (.cse4 (= ~E_2~0 1)) (.cse17 (= ~t1_pc~0 1)) (.cse49 (not (= ~E_M~0 ~E_1~0))) (.cse54 (= 2 ~t1_st~0)) (.cse29 (= ~t2_pc~0 1)) (.cse64 (not (= ~E_1~0 1))) (.cse62 (= ~t1_st~0 0)) (.cse40 (= |old(~m_st~0)| 0)) (.cse18 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~p_num_write~0 0)) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~t1_i~0 1)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse53 (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse25 (= ~m_st~0 |old(~m_st~0)|)) (.cse26 (= ~q_free~0 0)) (.cse28 (= |old(~t2_st~0)| ~t2_st~0)) (.cse30 (= ~p_dw_st~0 0)) (.cse31 (= ~t2_i~0 1)) (.cse32 (= ~c_dr_pc~0 0)) (.cse33 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse57 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse53 .cse24 .cse25 .cse26 .cse28 .cse30 .cse31 .cse32 .cse33)) (.cse5 (not (<= (+ 2 ~local~0) ~token~0))) (.cse37 (not (< ~token~0 (+ 3 ~local~0)))) (.cse42 (not (= ~m_pc~0 0))) (.cse9 (not (= ~E_1~0 2))) (.cse43 (not (= ~t1_pc~0 0))) (.cse60 (not .cse40)) (.cse46 (and .cse53 .cse25 .cse28 .cse62)) (.cse0 (not (= ~E_2~0 2))) (.cse41 (not (<= ~token~0 ~local~0))) (.cse44 (and .cse64 (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse45 (not (<= ~local~0 ~token~0))) (.cse15 (not (= |old(~t1_st~0)| 2))) (.cse34 (not .cse29)) (.cse47 (not (= 2 |old(~t2_st~0)|))) (.cse50 (and .cse53 .cse25 .cse54 .cse28)) (.cse48 (and .cse49 .cse64)) (.cse39 (not (= ~E_M~0 2))) (.cse7 (not .cse17)) (.cse27 (not .cse4)) (.cse58 (not (<= .cse63 ~token~0))) (.cse61 (and .cse53 .cse24 .cse25 .cse28)) (.cse59 (not (<= ~token~0 .cse63))) (.cse38 (not (= |old(~t1_st~0)| 0))) (.cse1 (not .cse30)) (.cse2 (not .cse31)) (.cse3 (not .cse32)) (.cse51 (not (= |old(~t2_st~0)| 0))) (.cse56 (and .cse53 .cse25 .cse62 .cse55)) (.cse8 (not .cse20)) (.cse10 (not .cse22)) (.cse11 (not .cse18)) (.cse12 (not .cse23)) (.cse6 (= ~m_pc~0 1)) (.cse13 (not .cse21)) (.cse52 (not (<= ~t2_pc~0 0))) (.cse14 (not .cse26)) (.cse16 (not (= 2 |old(~m_st~0)|))) (.cse35 (not .cse33)) (.cse36 (not .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse6) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (and .cse17 .cse18 .cse19 (<= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse34 .cse35 .cse36 .cse37 (not (= ~E_M~0 1))) (or .cse38 .cse0 .cse1 .cse2 .cse39 .cse3 .cse40 .cse41 .cse42 .cse8 .cse10 .cse11 .cse12 .cse43 .cse13 .cse14 .cse44 .cse45 .cse46 .cse34 .cse47 .cse35 .cse48) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse42 .cse8 .cse9 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse49 .cse15 .cse34 .cse47 .cse50 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse39 .cse3 .cse40 .cse41 .cse51 .cse7 .cse42 .cse8 .cse10 .cse11 .cse12 .cse13 .cse52 .cse14 .cse44 .cse45 (and .cse53 .cse25 .cse54 .cse55) .cse15 .cse35 .cse48) (or .cse1 .cse2 (and .cse53 .cse24 .cse25 .cse55) .cse3 .cse51 .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse13 .cse52 .cse14 .cse16 .cse35 .cse36) (or .cse38 .cse0 .cse1 .cse2 .cse39 .cse3 .cse40 .cse41 .cse51 .cse56 .cse42 .cse8 .cse10 .cse11 .cse12 .cse43 .cse13 .cse52 .cse14 .cse44 .cse45 .cse35 .cse48) (or .cse1 .cse2 .cse39 .cse57 .cse3 .cse7 .cse8 .cse10 .cse27 .cse11 .cse12 .cse13 .cse14 .cse49 .cse58 .cse16 .cse34 .cse35 .cse36 .cse59) (or .cse0 .cse1 .cse2 .cse57 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse49 .cse58 .cse15 .cse16 .cse34 .cse47 .cse35 .cse36 .cse59) (or .cse0 .cse1 .cse2 .cse3 (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse53 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse49 .cse60 .cse15 .cse34 .cse47 .cse35 .cse37) (or .cse1 .cse2 .cse3 .cse7 .cse8 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse61 .cse16 .cse34 .cse35 .cse36) (or .cse38 .cse0 .cse1 .cse2 .cse3 .cse41 .cse51 .cse56 .cse42 .cse8 .cse9 .cse10 .cse11 .cse12 .cse43 .cse13 .cse52 .cse14 .cse49 .cse45 .cse60 .cse35) (or .cse38 .cse1 .cse2 .cse3 .cse8 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse46 .cse16 .cse34 .cse35 .cse36) (or .cse0 .cse1 .cse2 .cse39 .cse3 .cse40 .cse41 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse44 .cse45 .cse15 .cse34 .cse47 .cse50 .cse35 .cse48) (or .cse1 .cse2 .cse39 .cse3 .cse51 .cse7 .cse8 .cse10 .cse27 .cse11 .cse12 .cse13 .cse52 .cse14 .cse49 .cse58 .cse61 .cse16 .cse35 .cse59) (or .cse38 .cse1 .cse2 .cse3 .cse51 .cse56 .cse8 .cse10 .cse11 .cse12 .cse6 .cse13 .cse52 .cse14 .cse16 .cse35 .cse36)))) [2021-11-23 01:59:28,701 INFO L858 garLoopResultBuilder]: For program point update_channels2EXIT(lines 589 596) no Hoare annotation was computed. [2021-11-23 01:59:28,701 INFO L861 garLoopResultBuilder]: At program point update_channels2FINAL(lines 589 596) the Hoare annotation is: true [2021-11-23 01:59:28,701 INFO L854 garLoopResultBuilder]: At program point L961(lines 908 966) the Hoare annotation is: (= ~p_dw_st~0 0) [2021-11-23 01:59:28,701 INFO L854 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))) [2021-11-23 01:59:28,701 INFO L854 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))) [2021-11-23 01:59:28,701 INFO L858 garLoopResultBuilder]: For program point L664(lines 664 671) no Hoare annotation was computed. [2021-11-23 01:59:28,702 INFO L858 garLoopResultBuilder]: For program point L169(lines 168 203) no Hoare annotation was computed. [2021-11-23 01:59:28,702 INFO L858 garLoopResultBuilder]: For program point L500(lines 500 508) no Hoare annotation was computed. [2021-11-23 01:59:28,702 INFO L854 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))) [2021-11-23 01:59:28,702 INFO L858 garLoopResultBuilder]: For program point L269(lines 269 276) no Hoare annotation was computed. [2021-11-23 01:59:28,702 INFO L858 garLoopResultBuilder]: For program point L170-1(lines 170 180) no Hoare annotation was computed. [2021-11-23 01:59:28,702 INFO L854 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))) [2021-11-23 01:59:28,702 INFO L854 garLoopResultBuilder]: At program point L931(line 931) the Hoare annotation is: (let ((.cse26 (= ~t1_st~0 0))) (let ((.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse20 (= ~m_st~0 2)) (.cse24 (or (= |exists_runnable_thread2_#res| 1) (not .cse26))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= 2 ~t1_st~0)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.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)) (.cse17 (= ~E_1~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 2 ~local~0) ~token~0) .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 (<= ~token~0 .cse25) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse25 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse18)))) [2021-11-23 01:59:28,702 INFO L858 garLoopResultBuilder]: For program point L931-1(line 931) no Hoare annotation was computed. [2021-11-23 01:59:28,703 INFO L854 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)))) [2021-11-23 01:59:28,703 INFO L854 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)))) [2021-11-23 01:59:28,703 INFO L858 garLoopResultBuilder]: For program point L437-1(line 437) no Hoare annotation was computed. [2021-11-23 01:59:28,703 INFO L858 garLoopResultBuilder]: For program point L338(lines 338 342) no Hoare annotation was computed. [2021-11-23 01:59:28,703 INFO L854 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))) [2021-11-23 01:59:28,703 INFO L858 garLoopResultBuilder]: For program point L142-1(line 142) no Hoare annotation was computed. [2021-11-23 01:59:28,704 INFO L854 garLoopResultBuilder]: At program point L935(line 935) the Hoare annotation is: (let ((.cse26 (= ~t1_st~0 0))) (let ((.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse20 (= ~m_st~0 2)) (.cse24 (or (= |exists_runnable_thread2_#res| 1) (not .cse26))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= 2 ~t1_st~0)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.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)) (.cse17 (= ~E_1~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 2 ~local~0) ~token~0) .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 (<= ~token~0 .cse25) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse25 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse18)))) [2021-11-23 01:59:28,704 INFO L854 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))) [2021-11-23 01:59:28,704 INFO L854 garLoopResultBuilder]: At program point L704(lines 645 709) the Hoare annotation is: (let ((.cse26 (= ~t1_st~0 0))) (let ((.cse22 (= 0 ~t2_st~0)) (.cse23 (<= ~t2_pc~0 0)) (.cse20 (= ~m_st~0 2)) (.cse24 (or (= |exists_runnable_thread2_#res| 1) (not .cse26))) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= 2 ~t2_st~0)) (.cse21 (not (= ~m_pc~0 1))) (.cse7 (= ~q_free~0 0)) (.cse8 (= 2 ~t1_st~0)) (.cse9 (not (= ~E_2~0 1))) (.cse10 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse12 (= ~E_2~0 2)) (.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)) (.cse17 (= ~E_1~0 2)) (.cse18 (not (= ~E_M~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ 2 ~local~0) ~token~0) .cse5 .cse6 (= ~m_st~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (let ((.cse25 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 (<= ~token~0 .cse25) .cse7 .cse8 .cse9 .cse10 .cse11 (<= .cse25 ~token~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse18) (and .cse1 .cse19 .cse2 .cse3 .cse20 .cse4 .cse5 .cse21 .cse7 .cse9 .cse26 .cse13 .cse14 .cse15 .cse16 .cse22 .cse23 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse20 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse17 .cse18) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse5 .cse6 .cse21 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~m_pc~0 0) .cse16 .cse17 .cse18)))) [2021-11-23 01:59:28,704 INFO L854 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))))) [2021-11-23 01:59:28,705 INFO L854 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))))) [2021-11-23 01:59:28,705 INFO L854 garLoopResultBuilder]: At program point L936(line 936) the Hoare annotation is: (let ((.cse16 (= ~t1_st~0 0))) (let ((.cse4 (not (= ~m_pc~0 ~t1_pc~0))) (.cse6 (= ~m_st~0 2)) (.cse9 (not (= ~m_pc~0 1))) (.cse17 (= 0 ~t2_st~0)) (.cse18 (<= ~t2_pc~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse5 (= ~c_num_read~0 0)) (.cse24 (or (= |exists_runnable_thread2_#res| 1) (not .cse16))) (.cse7 (= ~t1_i~0 1)) (.cse25 (= ~m_st~0 ~E_M~0)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= 2 ~t2_st~0)) (.cse10 (= ~q_free~0 0)) (.cse20 (= 2 ~t1_st~0)) (.cse21 (= ~E_M~0 ~E_1~0)) (.cse11 (= ~t2_pc~0 1)) (.cse22 (= ~E_2~0 2)) (.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)) (.cse23 (= ~E_1~0 2))) (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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse19 .cse9 .cse10 .cse20 .cse21 .cse11 .cse22 .cse12 .cse13 .cse14 (= ~m_pc~0 0) .cse15 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 (<= (+ 2 ~local~0) ~token~0) .cse8 .cse19 (= ~m_st~0 0) .cse10 .cse20 .cse21 .cse11 (< ~token~0 (+ 3 ~local~0)) .cse22 .cse12 .cse13 .cse14 .cse15 .cse23) (and .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse16 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (let ((.cse26 (+ ~local~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse25 .cse8 .cse19 (<= ~token~0 .cse26) .cse10 .cse20 .cse21 .cse11 (<= .cse26 ~token~0) .cse22 .cse12 .cse13 .cse14 .cse15 .cse23)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse24 .cse7 .cse25 .cse8 .cse19 .cse10 .cse20 .cse21 .cse11 .cse22 .cse12 .cse13 .cse14 .cse15 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) .cse23)))) [2021-11-23 01:59:28,705 INFO L854 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))) [2021-11-23 01:59:28,706 INFO L854 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)))) [2021-11-23 01:59:28,706 INFO L861 garLoopResultBuilder]: At program point L344(lines 321 349) the Hoare annotation is: true [2021-11-23 01:59:28,706 INFO L854 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))) [2021-11-23 01:59:28,706 INFO L858 garLoopResultBuilder]: For program point L675(lines 651 703) no Hoare annotation was computed. [2021-11-23 01:59:28,707 INFO L858 garLoopResultBuilder]: For program point L114(lines 114 122) no Hoare annotation was computed. [2021-11-23 01:59:28,707 INFO L858 garLoopResultBuilder]: For program point L940(line 940) no Hoare annotation was computed. [2021-11-23 01:59:28,707 INFO L854 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)) (.cse28 (<= 2 ~t1_st~0)) (.cse4 (= ~m_st~0 2)) (.cse18 (= |ULTIMATE.start_eval2_~tmp~4#1| 1)) (.cse16 (= ~t1_pc~0 1)) (.cse0 (= ~p_dw_pc~0 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)) (.cse20 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 0)) (.cse29 (= 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 .cse28 .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse29 .cse21 .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse25 .cse26 .cse27) (and .cse16 .cse0 .cse2 .cse17 .cse3 .cse18 .cse5 .cse6 .cse20 .cse7 .cse8 .cse29 .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) (let ((.cse30 (+ ~local~0 1))) (and .cse16 .cse28 .cse0 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 (<= ~token~0 .cse30) .cse8 .cse29 .cse21 (<= .cse30 ~token~0) .cse22 .cse11 .cse12 .cse13 .cse24 .cse14 .cse27)) (and .cse16 .cse0 .cse2 .cse3 .cse5 (<= (+ 2 ~local~0) ~token~0) .cse6 .cse20 .cse8 .cse29 .cse21 (< ~token~0 (+ 3 ~local~0)) .cse22 .cse11 .cse12 .cse13 (not (= |ULTIMATE.start_eval2_~tmp~4#1| 0)) .cse24 .cse14 .cse27)))) [2021-11-23 01:59:28,707 INFO L854 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))) [2021-11-23 01:59:28,708 INFO L854 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))))) [2021-11-23 01:59:28,708 INFO L854 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))) [2021-11-23 01:59:28,708 INFO L858 garLoopResultBuilder]: For program point L942-2(lines 942 951) no Hoare annotation was computed. [2021-11-23 01:59:28,708 INFO L858 garLoopResultBuilder]: For program point L678(lines 678 685) no Hoare annotation was computed. [2021-11-23 01:59:28,708 INFO L858 garLoopResultBuilder]: For program point L117(lines 117 121) no Hoare annotation was computed. [2021-11-23 01:59:28,709 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-23 01:59:28,709 INFO L858 garLoopResultBuilder]: For program point L284(lines 284 291) no Hoare annotation was computed. [2021-11-23 01:59:28,709 INFO L858 garLoopResultBuilder]: For program point L979(lines 979 985) no Hoare annotation was computed. [2021-11-23 01:59:28,709 INFO L854 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))) [2021-11-23 01:59:28,710 INFO L854 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))) [2021-11-23 01:59:28,710 INFO L854 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))) [2021-11-23 01:59:28,710 INFO L858 garLoopResultBuilder]: For program point L187-1(line 187) no Hoare annotation was computed. [2021-11-23 01:59:28,710 INFO L854 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)))) [2021-11-23 01:59:28,710 INFO L858 garLoopResultBuilder]: For program point L485-1(line 485) no Hoare annotation was computed. [2021-11-23 01:59:28,711 INFO L854 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)) [2021-11-23 01:59:28,711 INFO L854 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))) [2021-11-23 01:59:28,711 INFO L858 garLoopResultBuilder]: For program point L420(lines 420 428) no Hoare annotation was computed. [2021-11-23 01:59:28,711 INFO L854 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)) [2021-11-23 01:59:28,712 INFO L854 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)) [2021-11-23 01:59:28,712 INFO L854 garLoopResultBuilder]: At program point L652(line 652) the Hoare annotation is: (let ((.cse37 (+ ~local~0 1)) (.cse35 (= ~m_st~0 ~E_M~0)) (.cse34 (= ~m_st~0 0))) (let ((.cse27 (or .cse35 .cse34)) (.cse5 (= ~t1_pc~0 0)) (.cse29 (<= 2 ~E_1~0)) (.cse31 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse32 (not (= ~E_M~0 1))) (.cse36 (<= 2 ~t1_st~0)) (.cse3 (= ~m_st~0 2)) (.cse22 (<= ~token~0 .cse37)) (.cse25 (<= .cse37 ~token~0)) (.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)) (.cse30 (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)) (.cse33 (= 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)) (.cse28 (= ~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 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse32) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse8 .cse27 .cse9 .cse10 .cse24 .cse11 .cse12 (not .cse34) .cse13 .cse14 .cse26 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse35 .cse7 .cse33 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse36 .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 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse33 .cse34 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse32) (and .cse21 .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15 .cse32) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse32) (and .cse21 .cse0 .cse1 .cse2 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse33 .cse34 .cse8 .cse23 .cse9 .cse24 (< ~token~0 (+ 3 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse21 .cse36 .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 .cse6 .cse35 .cse7 .cse33 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse34 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse34 .cse30 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse19)))) [2021-11-23 01:59:28,712 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-23 01:59:28,712 INFO L854 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))))) [2021-11-23 01:59:28,713 INFO L858 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-11-23 01:59:28,713 INFO L858 garLoopResultBuilder]: For program point L157(lines 157 165) no Hoare annotation was computed. [2021-11-23 01:59:28,713 INFO L854 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))) [2021-11-23 01:59:28,713 INFO L858 garLoopResultBuilder]: For program point L521-1(line 521) no Hoare annotation was computed. [2021-11-23 01:59:28,713 INFO L858 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-11-23 01:59:28,714 INFO L854 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))) [2021-11-23 01:59:28,714 INFO L854 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)) [2021-11-23 01:59:28,714 INFO L854 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)) [2021-11-23 01:59:28,714 INFO L858 garLoopResultBuilder]: For program point L654(line 654) no Hoare annotation was computed. [2021-11-23 01:59:28,714 INFO L858 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-11-23 01:59:28,715 INFO L854 garLoopResultBuilder]: At program point L390(line 390) the Hoare annotation is: false [2021-11-23 01:59:28,715 INFO L858 garLoopResultBuilder]: For program point L258(line 258) no Hoare annotation was computed. [2021-11-23 01:59:28,715 INFO L858 garLoopResultBuilder]: For program point L126(lines 125 145) no Hoare annotation was computed. [2021-11-23 01:59:28,715 INFO L854 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)) [2021-11-23 01:59:28,715 INFO L854 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)) [2021-11-23 01:59:28,715 INFO L854 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))) [2021-11-23 01:59:28,716 INFO L854 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))) [2021-11-23 01:59:28,716 INFO L854 garLoopResultBuilder]: At program point L689(lines 651 703) the Hoare annotation is: (let ((.cse37 (+ ~local~0 1)) (.cse35 (= ~m_st~0 ~E_M~0)) (.cse34 (= ~m_st~0 0))) (let ((.cse27 (or .cse35 .cse34)) (.cse5 (= ~t1_pc~0 0)) (.cse29 (<= 2 ~E_1~0)) (.cse31 (not (= ~E_2~0 1))) (.cse10 (= ~t1_st~0 0)) (.cse32 (not (= ~E_M~0 1))) (.cse36 (<= 2 ~t1_st~0)) (.cse3 (= ~m_st~0 2)) (.cse22 (<= ~token~0 .cse37)) (.cse25 (<= .cse37 ~token~0)) (.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)) (.cse30 (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)) (.cse33 (= 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)) (.cse28 (= ~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 .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse27 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse32) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse8 .cse27 .cse9 .cse10 .cse24 .cse11 .cse12 (not .cse34) .cse13 .cse14 .cse26 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse35 .cse7 .cse33 .cse22 .cse8 .cse23 .cse9 .cse24 .cse25 .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse33 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse36 .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 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse33 .cse34 .cse8 .cse9 .cse10 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse17 .cse18 .cse19) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse32) (and .cse21 .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse24 .cse12 .cse13 .cse14 .cse15 .cse32) (and .cse0 .cse29 .cse1 .cse2 .cse3 .cse6 .cse7 .cse30 .cse8 .cse31 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse20 .cse32) (and .cse21 .cse0 .cse1 .cse2 .cse6 (<= (+ 2 ~local~0) ~token~0) .cse7 .cse33 .cse34 .cse8 .cse23 .cse9 .cse24 (< ~token~0 (+ 3 ~local~0)) .cse11 .cse12 .cse13 .cse14 .cse15 .cse19) (and .cse21 .cse36 .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 .cse6 .cse35 .cse7 .cse33 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse34 .cse8 .cse23 .cse9 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse34 .cse30 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse26 .cse15 .cse19) (and .cse21 .cse0 .cse1 .cse2 .cse6 .cse7 .cse33 .cse8 .cse23 .cse9 .cse24 .cse11 .cse12 .cse13 .cse14 .cse28 .cse15 .cse19)))) [2021-11-23 01:59:28,716 INFO L858 garLoopResultBuilder]: For program point L656(lines 656 660) no Hoare annotation was computed. [2021-11-23 01:59:28,716 INFO L858 garLoopResultBuilder]: For program point L656-1(lines 651 703) no Hoare annotation was computed. [2021-11-23 01:59:28,717 INFO L858 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2021-11-23 01:59:28,717 INFO L858 garLoopResultBuilder]: For program point L260-1(lines 255 295) no Hoare annotation was computed. [2021-11-23 01:59:28,717 INFO L854 garLoopResultBuilder]: At program point L195(line 195) the Hoare annotation is: false [2021-11-23 01:59:28,717 INFO L858 garLoopResultBuilder]: For program point L955(lines 955 959) no Hoare annotation was computed. [2021-11-23 01:59:28,717 INFO L854 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))) [2021-11-23 01:59:28,718 INFO L858 garLoopResultBuilder]: For program point L692(lines 692 699) no Hoare annotation was computed. [2021-11-23 01:59:28,718 INFO L854 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))))) [2021-11-23 01:59:28,718 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 390) no Hoare annotation was computed. [2021-11-23 01:59:28,718 INFO L858 garLoopResultBuilder]: For program point L661(lines 651 703) no Hoare annotation was computed. [2021-11-23 01:59:28,718 INFO L858 garLoopResultBuilder]: For program point L265(lines 255 295) no Hoare annotation was computed. [2021-11-23 01:59:28,719 INFO L854 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))))) [2021-11-23 01:59:28,719 INFO L858 garLoopResultBuilder]: For program point L464(lines 464 472) no Hoare annotation was computed. [2021-11-23 01:59:28,719 INFO L854 garLoopResultBuilder]: At program point L200(line 200) the Hoare annotation is: false [2021-11-23 01:59:28,719 INFO L854 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))))) [2021-11-23 01:59:28,719 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 228 247) the Hoare annotation is: true [2021-11-23 01:59:28,719 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 228 247) no Hoare annotation was computed. [2021-11-23 01:59:28,720 INFO L861 garLoopResultBuilder]: At program point error1ENTRY(lines 23 30) the Hoare annotation is: true [2021-11-23 01:59:28,720 INFO L858 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2021-11-23 01:59:28,720 INFO L858 garLoopResultBuilder]: For program point error1EXIT(lines 23 30) no Hoare annotation was computed. [2021-11-23 01:59:28,720 INFO L861 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 620 644) the Hoare annotation is: true [2021-11-23 01:59:28,720 INFO L858 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 620 644) no Hoare annotation was computed. [2021-11-23 01:59:28,721 INFO L854 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 748 785) the Hoare annotation is: (let ((.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (not (= ~m_pc~0 0))) (.cse25 (not (<= ~t2_pc~0 0))) (.cse26 (not (= 0 ~t2_st~0))) (.cse22 (not (= ~m_st~0 0))) (.cse28 (not (<= ~token~0 ~local~0))) (.cse29 (not (<= ~local~0 ~token~0))) (.cse1 (not (= 2 |old(~E_2~0)|))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse8 (not (= 2 ~t2_st~0))) (.cse13 (not (= 2 ~t1_st~0))) (.cse18 (not (= |old(~E_1~0)| |old(~E_M~0)|))) (.cse19 (and (= ~E_M~0 ~E_1~0) (= ~E_2~0 |old(~E_2~0)|) (= ~E_1~0 2))) (.cse23 (<= 2 ~E_1~0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~t2_i~0 1))) (.cse4 (not (= ~c_dr_pc~0 0))) (.cse9 (not (= ~p_num_write~0 0))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (<= 2 |old(~E_1~0)|))) (.cse15 (= ~m_pc~0 1)) (.cse16 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~q_free~0 0))) (.cse24 (not (= ~m_st~0 2))) (.cse27 (not (= ~t1_st~0 0))) (.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) (or .cse0 .cse1 .cse2 .cse4 (not (<= (+ 2 ~local~0) ~token~0)) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse22 .cse20 .cse21 (not (< ~token~0 (+ 3 ~local~0)))) (or .cse23 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse20 .cse21) (or .cse23 .cse0 .cse2 .cse4 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse24 .cse26 .cse27 .cse21) (or .cse23 .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse25 .cse17 .cse24 .cse26 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse28 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 (not (= ~t1_pc~0 0)) .cse16 .cse25 .cse17 .cse18 .cse29 .cse19 .cse26 (and (not (= ~m_st~0 |old(~E_M~0)|)) .cse22) .cse27 .cse21) (or .cse0 .cse1 .cse2 .cse4 .cse28 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse24 .cse18 .cse29 .cse19 .cse20 .cse21) (let ((.cse30 (+ ~local~0 1))) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse24 .cse18 (not (<= .cse30 ~token~0)) .cse19 .cse20 .cse21 (not (<= ~token~0 .cse30)))) (or .cse23 .cse0 .cse2 .cse4 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse24 .cse27 .cse20 .cse21))) [2021-11-23 01:59:28,721 INFO L858 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 748 785) no Hoare annotation was computed. [2021-11-23 01:59:28,724 INFO L732 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] [2021-11-23 01:59:28,726 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-23 01:59:28,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:59:28 BoogieIcfgContainer [2021-11-23 01:59:28,854 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-23 01:59:28,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-23 01:59:28,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-23 01:59:28,855 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-23 01:59:28,855 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:54:05" (3/4) ... [2021-11-23 01:59:28,858 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-23 01:59:28,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2021-11-23 01:59:28,863 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2021-11-23 01:59:28,864 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2021-11-23 01:59:28,865 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2021-11-23 01:59:28,877 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2021-11-23 01:59:28,879 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2021-11-23 01:59:28,880 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-11-23 01:59:28,881 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-23 01:59:28,908 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) || !(2 + local <= token)) || !(m_pc == 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)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((((((t1_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) && !(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)) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 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)) || !(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)) || !(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)))) && ((((((((((((((((((((!(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)) || 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))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == 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)) || (((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)))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((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)) || !(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)) || ((((((((((((((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)) || 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)) || !(\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)) || (((((((((((((((((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) && !(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)) || !(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)) || !(token < 3 + local))) && (((((((((((((((!(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))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 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)) || !(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)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((!(\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)))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((!(\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)) [2021-11-23 01:59:28,909 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) && 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))) || ((((((((((((((((((((((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) && 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))) || ((((((((((((((((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) && (\result == 1 || !(t1_st == 0))) && 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) && 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)) [2021-11-23 01:59:28,911 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) [2021-11-23 01:59:28,911 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)) [2021-11-23 01:59:28,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((((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)) || !(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)) && ((((((((((((((((((((((!(\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)) || !(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)) || !(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)))) && (((((((((((((((((((((!(\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)) || !(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)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((((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))) && (((((((((((((((((((((((1 <= __retres1 || !(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)) || 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)) || !(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)) || !(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))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((((((((((((((((((((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)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(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)) || !(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))) && (((((((((((((((((((((((!(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)) || !(\old(t1_st) == 2)) || !(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)) || !(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))) && (((((((((((((((((((((((!(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)))) && ((((((((((((((((!(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))) && ((((((((((((((((((((((!(\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)))) && (((((((((((((((((((((((!(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)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(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)) || !(2 == \old(t2_st))) || !(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)) || !(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)) || (((((((((((((((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) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(token < 3 + local))) && ((((((((((((((((((((((((((((((((((((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) || !(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)) || !(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))) && ((((((((((((((((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)) [2021-11-23 01:59:28,912 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 && 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)) || ((((((((((((((((((((((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 && 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)) || (((((((((((((((((((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) [2021-11-23 01:59:28,912 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)) [2021-11-23 01:59:28,912 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) [2021-11-23 01:59:28,914 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) || !(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) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || !(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)) || !(\old(m_st) == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || 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) && 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)) || !(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 <= 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))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || 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))) && (((((((((((((((((((((((!(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)) || (((((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)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || (((__retres1 == 0 && 2 == t1_st) && E_1 == 2) && __retres1 == 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) || !(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)))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((!(\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))) && (((((((((((((((((((((((((((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)) || (((((((((((((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)) || !(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))) && ((((((((((((((((((((((!(\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)) || !(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)) || !(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)))) && ((((((((((((((((!(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))) && (((((((((((((((((((((((!(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) && 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)) || !(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))) && (((((((((((((((((((((((((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)) || !(E_M == 2)) || !(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)) || !(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))) && (((((((((((((((((!(\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)) [2021-11-23 01:59:28,915 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) [2021-11-23 01:59:28,985 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/witness.graphml [2021-11-23 01:59:28,985 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-23 01:59:28,986 INFO L158 Benchmark]: Toolchain (without parser) took 324787.49ms. Allocated memory was 96.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 59.3MB in the beginning and 897.8MB in the end (delta: -838.5MB). Peak memory consumption was 726.4MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,986 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 96.5MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-23 01:59:28,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.89ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 67.3MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.08ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,987 INFO L158 Benchmark]: Boogie Preprocessor took 46.13ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,987 INFO L158 Benchmark]: RCFGBuilder took 853.66ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.2MB in the beginning and 85.0MB in the end (delta: -22.8MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,988 INFO L158 Benchmark]: TraceAbstraction took 323142.44ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 84.5MB in the beginning and 913.7MB in the end (delta: -829.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2021-11-23 01:59:28,988 INFO L158 Benchmark]: Witness Printer took 130.72ms. Allocated memory is still 1.7GB. Free memory was 913.7MB in the beginning and 897.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-23 01:59:28,990 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.38ms. Allocated memory is still 96.5MB. Free memory was 75.9MB in the beginning and 75.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.89ms. Allocated memory is still 96.5MB. Free memory was 59.1MB in the beginning and 67.3MB in the end (delta: -8.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.08ms. Allocated memory is still 96.5MB. Free memory was 67.3MB in the beginning and 64.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.13ms. Allocated memory is still 96.5MB. Free memory was 64.8MB in the beginning and 62.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 853.66ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 62.2MB in the beginning and 85.0MB in the end (delta: -22.8MB). Peak memory consumption was 39.9MB. Max. memory is 16.1GB. * TraceAbstraction took 323142.44ms. Allocated memory was 117.4MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 84.5MB in the beginning and 913.7MB in the end (delta: -829.3MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 130.72ms. Allocated memory is still 1.7GB. Free memory was 913.7MB in the beginning and 897.8MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. 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: 322.9s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 135.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12230 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12154 mSDsluCounter, 14341 SdHoareTripleChecker+Invalid, 7.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10936 mSDsCounter, 5525 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12129 IncrementalHoareTripleChecker+Invalid, 17654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5525 mSolverCounterUnsat, 5172 mSDtfsCounter, 12129 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3540 GetRequests, 2837 SyntacticMatches, 35 SemanticMatches, 668 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37706 ImplicationChecksByTransitivity, 102.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5570occurred in iteration=25, InterpolantAutomatonStates: 436, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 8601 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 10765 PreInvPairs, 12076 NumberOfFragments, 23749 HoareAnnotationTreeSize, 10765 FomulaSimplifications, 865376 FormulaSimplificationTreeSizeReduction, 77.0s HoareSimplificationTime, 63 FomulaSimplificationsInter, 2074971 FormulaSimplificationTreeSizeReductionInter, 58.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 8.6s 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: (((((((((((((((((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || E_2 == 1) || !(2 + local <= token)) || !(m_pc == 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)) || !(\old(t1_st) == 2)) || !(2 == \old(m_st))) || (((((((((((((((((t1_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) && !(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)) || !(t2_pc == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token < 3 + local)) || !(E_M == 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)) || !(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)) || !(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)))) && ((((((((((((((((((((!(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)) || 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))) || (((0 == __retres1 && m_st == \old(m_st)) && 2 == t1_st) && \old(t2_st) == 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)) || (((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)))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || ((((((((((((((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)) || !(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)) || ((((((((((((((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)) || 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)) || !(\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)) || (((((((((((((((((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) && !(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)) || !(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)) || !(token < 3 + local))) && (((((((((((((((!(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))) && (((((((((((((((((((((!(\old(t1_st) == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 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)) || !(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)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((!(\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)))) && (((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((!(\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: ((((((((((((((((((((((((((((((((((((((((((((((((((((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)) || !(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)) && ((((((((((((((((((((((!(\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)) || !(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)) || !(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)))) && (((((((((((((((((((((!(\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)) || !(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)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write))) && (((((((((((((((((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))) && (((((((((((((((((((((((1 <= __retres1 || !(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)) || 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)) || !(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)) || !(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))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((((((((((((((((((((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)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(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)) || !(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))) && (((((((((((((((((((((((!(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)) || !(\old(t1_st) == 2)) || !(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)) || !(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))) && (((((((((((((((((((((((!(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)))) && ((((((((((((((((!(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))) && ((((((((((((((((((((((!(\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)))) && (((((((((((((((((((((((!(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)) || !(q_free == 0)) || !(E_M == E_1)) || !(local <= token)) || !(\old(t1_st) == 2)) || !(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)) || !(2 == \old(t2_st))) || !(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)) || !(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)) || (((((((((((((((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) && p_dw_st == 0) && t2_i == 1) && c_dr_pc == 0) && c_last_read == p_last_write) && __retres1 == 0)) || !(\old(m_st) == 0)) || !(\old(t1_st) == 2)) || !(t2_pc == 1)) || !(2 == \old(t2_st))) || !(c_last_read == p_last_write)) || !(token < 3 + local))) && ((((((((((((((((((((((((((((((((((((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) || !(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)) || !(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))) && ((((((((((((((((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: ((((((((((((((((((((((((((((((((((((!(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)) || (((((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) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || !(\old(t2_st) == 0)) || !(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)) || !(\old(m_st) == 0)) || (((((0 == __retres1 && __retres1 == 0) && m_st == \old(m_st)) && t1_st == 0) && 0 == t2_st) && __retres1 == 0)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((((((0 == __retres1 && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0) || !(E_2 == 2)) || !(p_dw_st == 0)) || !(t2_i == 1)) || !(c_dr_pc == 0)) || !(token <= local)) || 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) && 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)) || !(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 <= 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))) && (((((((((((((((((((((!(E_2 == 2) || !(p_dw_st == 0)) || !(t2_i == 1)) || (((((0 == __retres1 && \old(t1_st) == t1_st) && __retres1 == 0) && m_st == \old(m_st)) && \old(t2_st) == t2_st) && __retres1 == 0)) || 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))) && (((((((((((((((((((((((!(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)) || (((((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)) || (!(E_1 == 1) && !(E_M == \old(m_st)))) || !(local <= token)) || !(\old(t1_st) == 2)) || (((__retres1 == 0 && 2 == t1_st) && E_1 == 2) && __retres1 == 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) || !(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)))) && ((((((((((((((((((((!(p_dw_st == 0) || !(t2_i == 1)) || !(E_M == 2)) || !(c_dr_pc == 0)) || !(\old(t2_st) == 0)) || !(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))) && ((((((((((((((((!(\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))) && (((((((((((((((((((((((((((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)) || (((((((((((((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)) || !(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))) && ((((((((((((((((((((((!(\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)) || !(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)) || !(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)))) && ((((((((((((((((!(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))) && (((((((((((((((((((((((!(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) && 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)) || !(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))) && (((((((((((((((((((((((((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)) || !(E_M == 2)) || !(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)) || !(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))) && (((((((((((((((((!(\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)) || ((((((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && t1_pc == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && (m_st == E_M || m_st == 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)) || (((((((((((((((((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) && p_last_write == q_buf_0) && 2 == t2_st) && q_free == 0) && (m_st == E_M || m_st == 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) && !(tmp == 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) && 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 && 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) && 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) && 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) && 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)) || ((((((((((((((((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 && 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) && 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) && 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) && 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) && 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))) || ((((((((((((((((((((((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) && 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))) || ((((((((((((((((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) && (\result == 1 || !(t1_st == 0))) && 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) && 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 && 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)) || ((((((((((((((((((((((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 && 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)) || (((((((((((((((((((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) - 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! [2021-11-23 01:59:29,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1cc9766a-8638-463e-89e6-d4a9cfd83cf0/bin/utaipan-EQgc7hIp5V/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