./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS --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 f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-8393723 [2022-11-19 07:37:51,861 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:37:51,863 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:37:51,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:37:51,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:37:51,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:37:51,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:37:51,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:37:51,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:37:51,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:37:51,916 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:37:51,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:37:51,924 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:37:51,928 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:37:51,930 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:37:51,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:37:51,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:37:51,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:37:51,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:37:51,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:37:51,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:37:51,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:37:51,960 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:37:51,961 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:37:51,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:37:51,967 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:37:51,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:37:51,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:37:51,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:37:51,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:37:51,975 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:37:51,976 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:37:51,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:37:51,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:37:51,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:37:51,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:37:51,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:37:51,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:37:51,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:37:51,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:37:51,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:37:51,989 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 07:37:52,032 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:37:52,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:37:52,034 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:37:52,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:37:52,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:37:52,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:37:52,036 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:37:52,036 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:37:52,036 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:37:52,036 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:37:52,038 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:37:52,038 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:37:52,038 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:37:52,038 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:37:52,039 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:37:52,039 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:37:52,039 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:37:52,039 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:37:52,040 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:37:52,040 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:37:52,041 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:37:52,041 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:37:52,041 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:37:52,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:37:52,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:37:52,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:37:52,042 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:37:52,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:37:52,043 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:37:52,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:37:52,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:37:52,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:37:52,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:52,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:37:52,044 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:37:52,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:37:52,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:37:52,045 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:37:52,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:37:52,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:37:52,046 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:37:52,046 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/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_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS 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 -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-11-19 07:37:52,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:37:52,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:37:52,373 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:37:52,375 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:37:52,376 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:37:52,377 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-19 07:37:52,482 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/data/b11ac45a2/bce4461fa2f84830ae05a875c97fc5c2/FLAGf0c00717e [2022-11-19 07:37:53,083 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:37:53,097 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-19 07:37:53,112 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/data/b11ac45a2/bce4461fa2f84830ae05a875c97fc5c2/FLAGf0c00717e [2022-11-19 07:37:53,366 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/data/b11ac45a2/bce4461fa2f84830ae05a875c97fc5c2 [2022-11-19 07:37:53,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:37:53,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:37:53,372 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:53,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:37:53,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:37:53,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eab2c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53, skipping insertion in model container [2022-11-19 07:37:53,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:37:53,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:37:53,607 WARN L234 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_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-19 07:37:53,670 WARN L234 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_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-19 07:37:53,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:53,716 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:37:53,732 WARN L234 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_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-11-19 07:37:53,758 WARN L234 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_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-11-19 07:37:53,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:37:53,814 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:37:53,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53 WrapperNode [2022-11-19 07:37:53,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:37:53,816 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:53,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:37:53,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:37:53,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,842 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,920 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-11-19 07:37:53,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:37:53,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:37:53,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:37:53,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:37:53,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:53,999 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:54,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:54,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:37:54,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:37:54,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:37:54,019 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:37:54,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (1/1) ... [2022-11-19 07:37:54,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:37:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:37:54,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:37:54,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:37:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:37:54,166 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-19 07:37:54,167 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-19 07:37:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-19 07:37:54,167 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-19 07:37:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-19 07:37:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-19 07:37:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-19 07:37:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-19 07:37:54,168 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-19 07:37:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-19 07:37:54,169 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-19 07:37:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-19 07:37:54,169 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-19 07:37:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-19 07:37:54,169 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-19 07:37:54,169 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-19 07:37:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-19 07:37:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-19 07:37:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-19 07:37:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-19 07:37:54,170 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-19 07:37:54,170 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-19 07:37:54,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:37:54,171 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-19 07:37:54,171 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-19 07:37:54,172 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-19 07:37:54,173 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-19 07:37:54,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:37:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:37:54,174 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-19 07:37:54,174 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-19 07:37:54,324 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:37:54,327 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:37:54,998 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:37:55,248 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:37:55,248 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-19 07:37:55,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55 BoogieIcfgContainer [2022-11-19 07:37:55,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:37:55,257 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:37:55,257 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:37:55,262 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:37:55,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:53" (1/3) ... [2022-11-19 07:37:55,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363dfea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2022-11-19 07:37:55,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:53" (2/3) ... [2022-11-19 07:37:55,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363dfea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:55, skipping insertion in model container [2022-11-19 07:37:55,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/3) ... [2022-11-19 07:37:55,267 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-11-19 07:37:55,295 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:37:55,296 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-19 07:37:55,375 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:37:55,384 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52e68a4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:37:55,384 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-19 07:37:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 99 states have internal predecessors, (137), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-11-19 07:37:55,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-19 07:37:55,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:55,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:55,405 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:37:55,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:55,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1402728943, now seen corresponding path program 1 times [2022-11-19 07:37:55,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:55,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891831584] [2022-11-19 07:37:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:37:55,835 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:55,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891831584] [2022-11-19 07:37:55,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891831584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:55,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:55,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:37:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318510096] [2022-11-19 07:37:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:37:55,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:37:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:37:55,893 INFO L87 Difference]: Start difference. First operand has 139 states, 93 states have (on average 1.4731182795698925) internal successors, (137), 99 states have internal predecessors, (137), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-19 07:37:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:56,913 INFO L93 Difference]: Finished difference Result 491 states and 708 transitions. [2022-11-19 07:37:56,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:37:56,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 34 [2022-11-19 07:37:56,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:56,945 INFO L225 Difference]: With dead ends: 491 [2022-11-19 07:37:56,945 INFO L226 Difference]: Without dead ends: 347 [2022-11-19 07:37:56,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:37:56,961 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 433 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:56,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 479 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-19 07:37:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-11-19 07:37:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 336. [2022-11-19 07:37:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 227 states have (on average 1.3259911894273129) internal successors, (301), 234 states have internal predecessors, (301), 70 states have call successors, (70), 38 states have call predecessors, (70), 37 states have return successors, (86), 65 states have call predecessors, (86), 68 states have call successors, (86) [2022-11-19 07:37:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 457 transitions. [2022-11-19 07:37:57,113 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 457 transitions. Word has length 34 [2022-11-19 07:37:57,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:57,114 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 457 transitions. [2022-11-19 07:37:57,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-19 07:37:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 457 transitions. [2022-11-19 07:37:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 07:37:57,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:57,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:57,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:37:57,118 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:37:57,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash -6465640, now seen corresponding path program 1 times [2022-11-19 07:37:57,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:57,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442018257] [2022-11-19 07:37:57,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:57,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:37:57,240 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442018257] [2022-11-19 07:37:57,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442018257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:57,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:57,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:37:57,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572421251] [2022-11-19 07:37:57,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:57,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:37:57,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:57,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:37:57,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:37:57,244 INFO L87 Difference]: Start difference. First operand 336 states and 457 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-19 07:37:57,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:57,533 INFO L93 Difference]: Finished difference Result 460 states and 619 transitions. [2022-11-19 07:37:57,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:37:57,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-11-19 07:37:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:57,543 INFO L225 Difference]: With dead ends: 460 [2022-11-19 07:37:57,543 INFO L226 Difference]: Without dead ends: 396 [2022-11-19 07:37:57,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:37:57,547 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 235 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:57,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 334 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:37:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2022-11-19 07:37:57,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2022-11-19 07:37:57,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 265 states have (on average 1.3132075471698113) internal successors, (348), 272 states have internal predecessors, (348), 78 states have call successors, (78), 45 states have call predecessors, (78), 44 states have return successors, (94), 73 states have call predecessors, (94), 76 states have call successors, (94) [2022-11-19 07:37:57,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 520 transitions. [2022-11-19 07:37:57,630 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 520 transitions. Word has length 45 [2022-11-19 07:37:57,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:57,631 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 520 transitions. [2022-11-19 07:37:57,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-19 07:37:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 520 transitions. [2022-11-19 07:37:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 07:37:57,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:57,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:37:57,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:37:57,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 912508983, now seen corresponding path program 1 times [2022-11-19 07:37:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:57,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527405179] [2022-11-19 07:37:57,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:57,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:37:57,877 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:57,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527405179] [2022-11-19 07:37:57,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527405179] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:57,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:57,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:37:57,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412932357] [2022-11-19 07:37:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:57,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:37:57,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:57,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:37:57,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:37:57,880 INFO L87 Difference]: Start difference. First operand 389 states and 520 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-19 07:37:58,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:58,516 INFO L93 Difference]: Finished difference Result 791 states and 1023 transitions. [2022-11-19 07:37:58,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:37:58,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 45 [2022-11-19 07:37:58,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:58,522 INFO L225 Difference]: With dead ends: 791 [2022-11-19 07:37:58,522 INFO L226 Difference]: Without dead ends: 659 [2022-11-19 07:37:58,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:37:58,533 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 556 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:58,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 697 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:37:58,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-11-19 07:37:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2022-11-19 07:37:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 397 states have (on average 1.279596977329975) internal successors, (508), 405 states have internal predecessors, (508), 105 states have call successors, (105), 68 states have call predecessors, (105), 71 states have return successors, (125), 103 states have call predecessors, (125), 103 states have call successors, (125) [2022-11-19 07:37:58,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 738 transitions. [2022-11-19 07:37:58,629 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 738 transitions. Word has length 45 [2022-11-19 07:37:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:58,629 INFO L495 AbstractCegarLoop]: Abstraction has 575 states and 738 transitions. [2022-11-19 07:37:58,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 4 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-19 07:37:58,630 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 738 transitions. [2022-11-19 07:37:58,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-19 07:37:58,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:58,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:58,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:37:58,634 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:37:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:58,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1495493183, now seen corresponding path program 1 times [2022-11-19 07:37:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240290209] [2022-11-19 07:37:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:58,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:37:58,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:58,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240290209] [2022-11-19 07:37:58,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240290209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:58,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:58,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:37:58,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095423468] [2022-11-19 07:37:58,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:58,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:37:58,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:58,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:37:58,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:37:58,950 INFO L87 Difference]: Start difference. First operand 575 states and 738 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-19 07:37:59,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:37:59,647 INFO L93 Difference]: Finished difference Result 1091 states and 1354 transitions. [2022-11-19 07:37:59,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 07:37:59,648 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-11-19 07:37:59,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:37:59,653 INFO L225 Difference]: With dead ends: 1091 [2022-11-19 07:37:59,653 INFO L226 Difference]: Without dead ends: 789 [2022-11-19 07:37:59,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-19 07:37:59,656 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 281 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:37:59,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 540 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:37:59,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2022-11-19 07:37:59,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 754. [2022-11-19 07:37:59,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 522 states have (on average 1.264367816091954) internal successors, (660), 531 states have internal predecessors, (660), 132 states have call successors, (132), 91 states have call predecessors, (132), 98 states have return successors, (156), 133 states have call predecessors, (156), 130 states have call successors, (156) [2022-11-19 07:37:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 948 transitions. [2022-11-19 07:37:59,767 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 948 transitions. Word has length 46 [2022-11-19 07:37:59,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:37:59,768 INFO L495 AbstractCegarLoop]: Abstraction has 754 states and 948 transitions. [2022-11-19 07:37:59,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-19 07:37:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 948 transitions. [2022-11-19 07:37:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-19 07:37:59,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:37:59,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:37:59,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:37:59,770 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:37:59,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:37:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash -201012366, now seen corresponding path program 1 times [2022-11-19 07:37:59,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:37:59,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580770544] [2022-11-19 07:37:59,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:37:59,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:37:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:37:59,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:37:59,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:37:59,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580770544] [2022-11-19 07:37:59,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580770544] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:37:59,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:37:59,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:37:59,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500424958] [2022-11-19 07:37:59,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:37:59,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:37:59,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:37:59,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:37:59,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:37:59,824 INFO L87 Difference]: Start difference. First operand 754 states and 948 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 07:38:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:00,027 INFO L93 Difference]: Finished difference Result 1318 states and 1618 transitions. [2022-11-19 07:38:00,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:00,027 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), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 47 [2022-11-19 07:38:00,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:00,032 INFO L225 Difference]: With dead ends: 1318 [2022-11-19 07:38:00,032 INFO L226 Difference]: Without dead ends: 886 [2022-11-19 07:38:00,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:00,034 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 67 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:00,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 290 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2022-11-19 07:38:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 781. [2022-11-19 07:38:00,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 545 states have (on average 1.2568807339449541) internal successors, (685), 554 states have internal predecessors, (685), 134 states have call successors, (134), 93 states have call predecessors, (134), 100 states have return successors, (158), 135 states have call predecessors, (158), 132 states have call successors, (158) [2022-11-19 07:38:00,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 977 transitions. [2022-11-19 07:38:00,155 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 977 transitions. Word has length 47 [2022-11-19 07:38:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:00,156 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 977 transitions. [2022-11-19 07:38:00,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 07:38:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 977 transitions. [2022-11-19 07:38:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-19 07:38:00,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:00,158 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:00,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:38:00,158 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:00,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:00,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1886269158, now seen corresponding path program 1 times [2022-11-19 07:38:00,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:00,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119532642] [2022-11-19 07:38:00,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:00,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:38:00,207 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:00,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119532642] [2022-11-19 07:38:00,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119532642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:00,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:00,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:00,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105347586] [2022-11-19 07:38:00,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:00,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:00,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:00,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:00,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:00,209 INFO L87 Difference]: Start difference. First operand 781 states and 977 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 07:38:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:00,373 INFO L93 Difference]: Finished difference Result 971 states and 1198 transitions. [2022-11-19 07:38:00,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:00,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 53 [2022-11-19 07:38:00,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:00,378 INFO L225 Difference]: With dead ends: 971 [2022-11-19 07:38:00,378 INFO L226 Difference]: Without dead ends: 698 [2022-11-19 07:38:00,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:00,380 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 148 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:00,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:00,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-11-19 07:38:00,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 589. [2022-11-19 07:38:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 405 states have (on average 1.2419753086419754) internal successors, (503), 412 states have internal predecessors, (503), 110 states have call successors, (110), 73 states have call predecessors, (110), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2022-11-19 07:38:00,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 739 transitions. [2022-11-19 07:38:00,474 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 739 transitions. Word has length 53 [2022-11-19 07:38:00,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:00,475 INFO L495 AbstractCegarLoop]: Abstraction has 589 states and 739 transitions. [2022-11-19 07:38:00,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 07:38:00,475 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 739 transitions. [2022-11-19 07:38:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-19 07:38:00,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:00,477 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:00,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:38:00,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash -6067747, now seen corresponding path program 1 times [2022-11-19 07:38:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:00,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330833758] [2022-11-19 07:38:00,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:00,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:38:00,553 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:00,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330833758] [2022-11-19 07:38:00,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330833758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:00,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:00,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:38:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165287227] [2022-11-19 07:38:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:00,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:00,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:00,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:00,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:00,558 INFO L87 Difference]: Start difference. First operand 589 states and 739 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-19 07:38:00,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:00,866 INFO L93 Difference]: Finished difference Result 692 states and 855 transitions. [2022-11-19 07:38:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:38:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 54 [2022-11-19 07:38:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:00,872 INFO L225 Difference]: With dead ends: 692 [2022-11-19 07:38:00,873 INFO L226 Difference]: Without dead ends: 689 [2022-11-19 07:38:00,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:38:00,875 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 277 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:00,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:38:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2022-11-19 07:38:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 588. [2022-11-19 07:38:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 405 states have (on average 1.2345679012345678) internal successors, (500), 411 states have internal predecessors, (500), 109 states have call successors, (109), 73 states have call predecessors, (109), 72 states have return successors, (126), 105 states have call predecessors, (126), 108 states have call successors, (126) [2022-11-19 07:38:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 735 transitions. [2022-11-19 07:38:00,994 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 735 transitions. Word has length 54 [2022-11-19 07:38:00,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:00,997 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 735 transitions. [2022-11-19 07:38:00,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-19 07:38:00,997 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 735 transitions. [2022-11-19 07:38:00,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-19 07:38:01,000 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:01,001 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:38:01,002 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash -188726821, now seen corresponding path program 1 times [2022-11-19 07:38:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:01,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694082366] [2022-11-19 07:38:01,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:01,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:38:01,213 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694082366] [2022-11-19 07:38:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694082366] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330227959] [2022-11-19 07:38:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:01,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:01,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:38:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:01,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 07:38:01,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:38:01,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:38:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-19 07:38:02,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330227959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:38:02,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906000160] [2022-11-19 07:38:02,076 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 07:38:02,076 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:38:02,081 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:38:02,088 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:38:02,089 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:38:03,938 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2022-11-19 07:38:03,958 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 91 for LOIs [2022-11-19 07:38:03,973 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2022-11-19 07:38:04,296 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2022-11-19 07:38:04,334 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2022-11-19 07:38:04,372 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2022-11-19 07:38:04,390 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2022-11-19 07:38:04,408 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:38:14,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1906000160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:14,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:38:14,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [5, 5, 4] total 41 [2022-11-19 07:38:14,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708718929] [2022-11-19 07:38:14,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:14,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-19 07:38:14,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:14,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-19 07:38:14,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1447, Unknown=0, NotChecked=0, Total=1640 [2022-11-19 07:38:14,561 INFO L87 Difference]: Start difference. First operand 588 states and 735 transitions. Second operand has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-19 07:38:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:31,376 INFO L93 Difference]: Finished difference Result 952 states and 1146 transitions. [2022-11-19 07:38:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-19 07:38:31,377 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 55 [2022-11-19 07:38:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:31,381 INFO L225 Difference]: With dead ends: 952 [2022-11-19 07:38:31,381 INFO L226 Difference]: Without dead ends: 637 [2022-11-19 07:38:31,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=601, Invalid=4091, Unknown=0, NotChecked=0, Total=4692 [2022-11-19 07:38:31,384 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 177 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 3010 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 3010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:31,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1780 Invalid, 3199 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [189 Valid, 3010 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-19 07:38:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-19 07:38:31,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 622. [2022-11-19 07:38:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 431 states have (on average 1.2250580046403712) internal successors, (528), 437 states have internal predecessors, (528), 111 states have call successors, (111), 79 states have call predecessors, (111), 78 states have return successors, (128), 107 states have call predecessors, (128), 110 states have call successors, (128) [2022-11-19 07:38:31,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 767 transitions. [2022-11-19 07:38:31,479 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 767 transitions. Word has length 55 [2022-11-19 07:38:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:31,480 INFO L495 AbstractCegarLoop]: Abstraction has 622 states and 767 transitions. [2022-11-19 07:38:31,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-19 07:38:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 767 transitions. [2022-11-19 07:38:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-19 07:38:31,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:31,482 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:31,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:38:31,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:31,689 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:31,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1451844884, now seen corresponding path program 1 times [2022-11-19 07:38:31,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:31,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650233492] [2022-11-19 07:38:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:31,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:38:32,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:32,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650233492] [2022-11-19 07:38:32,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650233492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:32,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:32,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:38:32,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637619487] [2022-11-19 07:38:32,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:32,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:38:32,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:32,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:38:32,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:32,013 INFO L87 Difference]: Start difference. First operand 622 states and 767 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 07:38:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:32,525 INFO L93 Difference]: Finished difference Result 1041 states and 1359 transitions. [2022-11-19 07:38:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-19 07:38:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 59 [2022-11-19 07:38:32,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:32,538 INFO L225 Difference]: With dead ends: 1041 [2022-11-19 07:38:32,538 INFO L226 Difference]: Without dead ends: 780 [2022-11-19 07:38:32,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-19 07:38:32,543 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 247 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:32,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 331 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:38:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2022-11-19 07:38:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 766. [2022-11-19 07:38:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 527 states have (on average 1.2258064516129032) internal successors, (646), 535 states have internal predecessors, (646), 141 states have call successors, (141), 97 states have call predecessors, (141), 96 states have return successors, (170), 135 states have call predecessors, (170), 140 states have call successors, (170) [2022-11-19 07:38:32,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 957 transitions. [2022-11-19 07:38:32,692 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 957 transitions. Word has length 59 [2022-11-19 07:38:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:32,692 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 957 transitions. [2022-11-19 07:38:32,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 07:38:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 957 transitions. [2022-11-19 07:38:32,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-11-19 07:38:32,695 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:32,695 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:32,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:38:32,696 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:32,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:32,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1495019203, now seen corresponding path program 1 times [2022-11-19 07:38:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:32,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750033682] [2022-11-19 07:38:32,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:32,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:32,752 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:38:32,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:32,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750033682] [2022-11-19 07:38:32,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750033682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:32,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:32,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:32,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277093929] [2022-11-19 07:38:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:32,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:32,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:32,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:32,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:32,756 INFO L87 Difference]: Start difference. First operand 766 states and 957 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:32,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:32,957 INFO L93 Difference]: Finished difference Result 1047 states and 1279 transitions. [2022-11-19 07:38:32,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:32,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2022-11-19 07:38:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:32,963 INFO L225 Difference]: With dead ends: 1047 [2022-11-19 07:38:32,963 INFO L226 Difference]: Without dead ends: 878 [2022-11-19 07:38:32,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:32,968 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 42 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:32,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 329 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:32,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-11-19 07:38:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 801. [2022-11-19 07:38:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 556 states have (on average 1.2266187050359711) internal successors, (682), 564 states have internal predecessors, (682), 144 states have call successors, (144), 100 states have call predecessors, (144), 99 states have return successors, (173), 138 states have call predecessors, (173), 143 states have call successors, (173) [2022-11-19 07:38:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 999 transitions. [2022-11-19 07:38:33,121 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 999 transitions. Word has length 61 [2022-11-19 07:38:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:33,123 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 999 transitions. [2022-11-19 07:38:33,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 999 transitions. [2022-11-19 07:38:33,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-19 07:38:33,125 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:33,126 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:33,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:38:33,126 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -284749030, now seen corresponding path program 1 times [2022-11-19 07:38:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:33,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026582119] [2022-11-19 07:38:33,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 07:38:33,176 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:33,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026582119] [2022-11-19 07:38:33,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026582119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:33,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:33,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688353646] [2022-11-19 07:38:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:33,179 INFO L87 Difference]: Start difference. First operand 801 states and 999 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:33,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:33,371 INFO L93 Difference]: Finished difference Result 1242 states and 1605 transitions. [2022-11-19 07:38:33,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:33,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 60 [2022-11-19 07:38:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:33,378 INFO L225 Difference]: With dead ends: 1242 [2022-11-19 07:38:33,379 INFO L226 Difference]: Without dead ends: 888 [2022-11-19 07:38:33,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:33,381 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 28 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:33,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 321 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2022-11-19 07:38:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 832. [2022-11-19 07:38:33,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 581 states have (on average 1.23407917383821) internal successors, (717), 589 states have internal predecessors, (717), 147 states have call successors, (147), 103 states have call predecessors, (147), 102 states have return successors, (176), 141 states have call predecessors, (176), 146 states have call successors, (176) [2022-11-19 07:38:33,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1040 transitions. [2022-11-19 07:38:33,543 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1040 transitions. Word has length 60 [2022-11-19 07:38:33,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:33,543 INFO L495 AbstractCegarLoop]: Abstraction has 832 states and 1040 transitions. [2022-11-19 07:38:33,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:33,544 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1040 transitions. [2022-11-19 07:38:33,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-19 07:38:33,548 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:33,549 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:33,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:38:33,549 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:33,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:33,550 INFO L85 PathProgramCache]: Analyzing trace with hash -497528863, now seen corresponding path program 1 times [2022-11-19 07:38:33,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:33,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391930820] [2022-11-19 07:38:33,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:33,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:38:33,737 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:33,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391930820] [2022-11-19 07:38:33,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391930820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:33,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:33,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-19 07:38:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842409503] [2022-11-19 07:38:33,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:33,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:38:33,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:33,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:38:33,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:38:33,742 INFO L87 Difference]: Start difference. First operand 832 states and 1040 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 07:38:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:34,557 INFO L93 Difference]: Finished difference Result 1295 states and 1566 transitions. [2022-11-19 07:38:34,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-19 07:38:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 63 [2022-11-19 07:38:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:34,563 INFO L225 Difference]: With dead ends: 1295 [2022-11-19 07:38:34,563 INFO L226 Difference]: Without dead ends: 992 [2022-11-19 07:38:34,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-19 07:38:34,566 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 265 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:34,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 437 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:38:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2022-11-19 07:38:34,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 971. [2022-11-19 07:38:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 675 states have (on average 1.2148148148148148) internal successors, (820), 683 states have internal predecessors, (820), 171 states have call successors, (171), 124 states have call predecessors, (171), 123 states have return successors, (200), 165 states have call predecessors, (200), 170 states have call successors, (200) [2022-11-19 07:38:34,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1191 transitions. [2022-11-19 07:38:34,782 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1191 transitions. Word has length 63 [2022-11-19 07:38:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:34,783 INFO L495 AbstractCegarLoop]: Abstraction has 971 states and 1191 transitions. [2022-11-19 07:38:34,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-19 07:38:34,784 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1191 transitions. [2022-11-19 07:38:34,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-19 07:38:34,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:34,790 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:38:34,791 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:34,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:34,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1065669419, now seen corresponding path program 1 times [2022-11-19 07:38:34,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:34,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886899771] [2022-11-19 07:38:34,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:34,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:34,971 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:38:34,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:34,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886899771] [2022-11-19 07:38:34,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886899771] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:34,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139470204] [2022-11-19 07:38:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:34,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:34,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:38:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:35,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-19 07:38:35,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:38:35,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:38:35,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:38:35,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2139470204] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:38:35,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [197700714] [2022-11-19 07:38:35,643 INFO L159 IcfgInterpreter]: Started Sifa with 54 locations of interest [2022-11-19 07:38:35,643 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:38:35,644 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:38:35,644 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:38:35,644 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:38:38,697 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 95 for LOIs [2022-11-19 07:38:38,713 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 61 for LOIs [2022-11-19 07:38:38,719 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 97 for LOIs [2022-11-19 07:38:38,738 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 99 for LOIs [2022-11-19 07:38:38,950 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 95 for LOIs [2022-11-19 07:38:38,975 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 95 for LOIs [2022-11-19 07:38:39,002 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 95 for LOIs [2022-11-19 07:38:39,010 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 102 for LOIs [2022-11-19 07:38:39,021 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:38:49,531 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '29926#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:38:49,531 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:38:49,532 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:38:49,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 7 [2022-11-19 07:38:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82990282] [2022-11-19 07:38:49,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:38:49,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:38:49,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:38:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 07:38:49,535 INFO L87 Difference]: Start difference. First operand 971 states and 1191 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-19 07:38:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:50,460 INFO L93 Difference]: Finished difference Result 2065 states and 2432 transitions. [2022-11-19 07:38:50,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:38:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 64 [2022-11-19 07:38:50,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:50,470 INFO L225 Difference]: With dead ends: 2065 [2022-11-19 07:38:50,470 INFO L226 Difference]: Without dead ends: 2062 [2022-11-19 07:38:50,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=238, Invalid=1924, Unknown=0, NotChecked=0, Total=2162 [2022-11-19 07:38:50,473 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 350 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:50,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 832 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:38:50,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-11-19 07:38:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 1485. [2022-11-19 07:38:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1485 states, 1031 states have (on average 1.2017458777885548) internal successors, (1239), 1039 states have internal predecessors, (1239), 255 states have call successors, (255), 198 states have call predecessors, (255), 197 states have return successors, (284), 249 states have call predecessors, (284), 254 states have call successors, (284) [2022-11-19 07:38:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1485 states to 1485 states and 1778 transitions. [2022-11-19 07:38:50,787 INFO L78 Accepts]: Start accepts. Automaton has 1485 states and 1778 transitions. Word has length 64 [2022-11-19 07:38:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:50,787 INFO L495 AbstractCegarLoop]: Abstraction has 1485 states and 1778 transitions. [2022-11-19 07:38:50,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 7 states have internal predecessors, (90), 6 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2022-11-19 07:38:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1485 states and 1778 transitions. [2022-11-19 07:38:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-19 07:38:50,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:50,790 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:50,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-19 07:38:51,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-19 07:38:51,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1481538711, now seen corresponding path program 2 times [2022-11-19 07:38:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:51,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335723438] [2022-11-19 07:38:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:38:51,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:51,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335723438] [2022-11-19 07:38:51,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335723438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:51,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:51,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:51,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566726408] [2022-11-19 07:38:51,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:51,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:51,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:51,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:51,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:51,076 INFO L87 Difference]: Start difference. First operand 1485 states and 1778 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:51,432 INFO L93 Difference]: Finished difference Result 2237 states and 2634 transitions. [2022-11-19 07:38:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:51,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2022-11-19 07:38:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:51,441 INFO L225 Difference]: With dead ends: 2237 [2022-11-19 07:38:51,442 INFO L226 Difference]: Without dead ends: 1481 [2022-11-19 07:38:51,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:51,445 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 151 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:51,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 256 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2022-11-19 07:38:51,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1470. [2022-11-19 07:38:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1016 states have (on average 1.18996062992126) internal successors, (1209), 1024 states have internal predecessors, (1209), 255 states have call successors, (255), 198 states have call predecessors, (255), 197 states have return successors, (284), 249 states have call predecessors, (284), 254 states have call successors, (284) [2022-11-19 07:38:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1748 transitions. [2022-11-19 07:38:51,791 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1748 transitions. Word has length 67 [2022-11-19 07:38:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:51,792 INFO L495 AbstractCegarLoop]: Abstraction has 1470 states and 1748 transitions. [2022-11-19 07:38:51,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:51,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1748 transitions. [2022-11-19 07:38:51,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-19 07:38:51,794 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:51,795 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:51,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:38:51,795 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1412372597, now seen corresponding path program 1 times [2022-11-19 07:38:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954933965] [2022-11-19 07:38:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:38:51,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954933965] [2022-11-19 07:38:51,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954933965] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:51,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:51,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:38:51,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616347425] [2022-11-19 07:38:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:51,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:51,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:51,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:51,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:51,857 INFO L87 Difference]: Start difference. First operand 1470 states and 1748 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:52,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:52,274 INFO L93 Difference]: Finished difference Result 2436 states and 2842 transitions. [2022-11-19 07:38:52,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:52,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-11-19 07:38:52,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:52,289 INFO L225 Difference]: With dead ends: 2436 [2022-11-19 07:38:52,289 INFO L226 Difference]: Without dead ends: 1646 [2022-11-19 07:38:52,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:38:52,296 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 37 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:52,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 320 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:52,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2022-11-19 07:38:52,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1517. [2022-11-19 07:38:52,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1055 states have (on average 1.1895734597156398) internal successors, (1255), 1063 states have internal predecessors, (1255), 259 states have call successors, (259), 202 states have call predecessors, (259), 201 states have return successors, (288), 253 states have call predecessors, (288), 258 states have call successors, (288) [2022-11-19 07:38:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1802 transitions. [2022-11-19 07:38:52,672 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1802 transitions. Word has length 71 [2022-11-19 07:38:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:52,673 INFO L495 AbstractCegarLoop]: Abstraction has 1517 states and 1802 transitions. [2022-11-19 07:38:52,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:38:52,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1802 transitions. [2022-11-19 07:38:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:38:52,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:52,677 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:52,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:38:52,678 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1437499496, now seen corresponding path program 1 times [2022-11-19 07:38:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:52,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824402191] [2022-11-19 07:38:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:52,787 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-19 07:38:52,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:52,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824402191] [2022-11-19 07:38:52,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824402191] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:52,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424703772] [2022-11-19 07:38:52,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:52,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:52,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:52,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:52,811 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:38:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:52,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:38:52,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 07:38:52,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:38:52,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424703772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:52,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:38:52,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-19 07:38:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773723922] [2022-11-19 07:38:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:52,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:52,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:52,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:52,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:52,999 INFO L87 Difference]: Start difference. First operand 1517 states and 1802 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-19 07:38:53,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:53,371 INFO L93 Difference]: Finished difference Result 1919 states and 2353 transitions. [2022-11-19 07:38:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:53,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 87 [2022-11-19 07:38:53,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:53,381 INFO L225 Difference]: With dead ends: 1919 [2022-11-19 07:38:53,382 INFO L226 Difference]: Without dead ends: 1596 [2022-11-19 07:38:53,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:53,384 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 145 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:53,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 165 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 07:38:53,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2022-11-19 07:38:53,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1581. [2022-11-19 07:38:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1110 states have (on average 1.1900900900900901) internal successors, (1321), 1117 states have internal predecessors, (1321), 259 states have call successors, (259), 210 states have call predecessors, (259), 210 states have return successors, (286), 255 states have call predecessors, (286), 258 states have call successors, (286) [2022-11-19 07:38:53,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 1866 transitions. [2022-11-19 07:38:53,682 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 1866 transitions. Word has length 87 [2022-11-19 07:38:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:53,683 INFO L495 AbstractCegarLoop]: Abstraction has 1581 states and 1866 transitions. [2022-11-19 07:38:53,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-19 07:38:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 1866 transitions. [2022-11-19 07:38:53,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:38:53,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:53,686 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:53,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 07:38:53,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-19 07:38:53,893 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:53,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:53,894 INFO L85 PathProgramCache]: Analyzing trace with hash 2098833287, now seen corresponding path program 1 times [2022-11-19 07:38:53,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:53,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425966151] [2022-11-19 07:38:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:54,009 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 07:38:54,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:54,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425966151] [2022-11-19 07:38:54,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425966151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:54,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091043555] [2022-11-19 07:38:54,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:54,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:54,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:54,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:54,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:38:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:54,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 07:38:54,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-19 07:38:54,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:38:54,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091043555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:54,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:38:54,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-19 07:38:54,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299747991] [2022-11-19 07:38:54,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:54,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:54,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:54,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:54,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:54,193 INFO L87 Difference]: Start difference. First operand 1581 states and 1866 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-19 07:38:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:54,544 INFO L93 Difference]: Finished difference Result 2047 states and 2480 transitions. [2022-11-19 07:38:54,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:54,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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 87 [2022-11-19 07:38:54,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:54,552 INFO L225 Difference]: With dead ends: 2047 [2022-11-19 07:38:54,552 INFO L226 Difference]: Without dead ends: 1677 [2022-11-19 07:38:54,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:38:54,555 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 36 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:54,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 324 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:54,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1677 states. [2022-11-19 07:38:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1677 to 1607. [2022-11-19 07:38:54,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1130 states have (on average 1.1929203539823008) internal successors, (1348), 1137 states have internal predecessors, (1348), 262 states have call successors, (262), 213 states have call predecessors, (262), 213 states have return successors, (289), 258 states have call predecessors, (289), 261 states have call successors, (289) [2022-11-19 07:38:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 1899 transitions. [2022-11-19 07:38:54,887 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 1899 transitions. Word has length 87 [2022-11-19 07:38:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:54,887 INFO L495 AbstractCegarLoop]: Abstraction has 1607 states and 1899 transitions. [2022-11-19 07:38:54,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-19 07:38:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 1899 transitions. [2022-11-19 07:38:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-19 07:38:54,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:54,891 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-19 07:38:54,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:38:55,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-19 07:38:55,098 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:55,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:55,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1801328296, now seen corresponding path program 2 times [2022-11-19 07:38:55,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:55,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526445259] [2022-11-19 07:38:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-19 07:38:55,291 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526445259] [2022-11-19 07:38:55,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526445259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:55,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889170072] [2022-11-19 07:38:55,291 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:38:55,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:55,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:55,293 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:55,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:38:55,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 07:38:55,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:38:55,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:38:55,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:55,456 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:38:55,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:38:55,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889170072] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:55,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:38:55,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-19 07:38:55,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732705384] [2022-11-19 07:38:55,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:55,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:55,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:55,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:55,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:55,459 INFO L87 Difference]: Start difference. First operand 1607 states and 1899 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-19 07:38:55,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:55,842 INFO L93 Difference]: Finished difference Result 2110 states and 2597 transitions. [2022-11-19 07:38:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:55,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 87 [2022-11-19 07:38:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:55,850 INFO L225 Difference]: With dead ends: 2110 [2022-11-19 07:38:55,850 INFO L226 Difference]: Without dead ends: 1714 [2022-11-19 07:38:55,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:55,853 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 58 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:55,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 326 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-11-19 07:38:56,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1694. [2022-11-19 07:38:56,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1195 states have (on average 1.1907949790794978) internal successors, (1423), 1203 states have internal predecessors, (1423), 275 states have call successors, (275), 223 states have call predecessors, (275), 222 states have return successors, (312), 269 states have call predecessors, (312), 274 states have call successors, (312) [2022-11-19 07:38:56,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2010 transitions. [2022-11-19 07:38:56,167 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2010 transitions. Word has length 87 [2022-11-19 07:38:56,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:56,167 INFO L495 AbstractCegarLoop]: Abstraction has 1694 states and 2010 transitions. [2022-11-19 07:38:56,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-19 07:38:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2010 transitions. [2022-11-19 07:38:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-19 07:38:56,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:56,171 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:56,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:38:56,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-19 07:38:56,377 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:56,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:56,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1629168282, now seen corresponding path program 1 times [2022-11-19 07:38:56,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:56,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532856116] [2022-11-19 07:38:56,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:56,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-19 07:38:56,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532856116] [2022-11-19 07:38:56,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532856116] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:56,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946558133] [2022-11-19 07:38:56,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:56,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:56,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:56,585 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:56,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 07:38:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:56,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 07:38:56,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:38:56,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:38:56,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946558133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:56,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:38:56,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-19 07:38:56,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019041802] [2022-11-19 07:38:56,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:56,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:38:56,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:56,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:38:56,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:56,762 INFO L87 Difference]: Start difference. First operand 1694 states and 2010 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-19 07:38:57,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:57,217 INFO L93 Difference]: Finished difference Result 2541 states and 3109 transitions. [2022-11-19 07:38:57,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:38:57,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 88 [2022-11-19 07:38:57,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:57,228 INFO L225 Difference]: With dead ends: 2541 [2022-11-19 07:38:57,228 INFO L226 Difference]: Without dead ends: 1928 [2022-11-19 07:38:57,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:38:57,232 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 33 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:57,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 301 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:38:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2022-11-19 07:38:57,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1759. [2022-11-19 07:38:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1244 states have (on average 1.1945337620578778) internal successors, (1486), 1253 states have internal predecessors, (1486), 283 states have call successors, (283), 231 states have call predecessors, (283), 230 states have return successors, (320), 276 states have call predecessors, (320), 282 states have call successors, (320) [2022-11-19 07:38:57,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2089 transitions. [2022-11-19 07:38:57,668 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2089 transitions. Word has length 88 [2022-11-19 07:38:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:57,669 INFO L495 AbstractCegarLoop]: Abstraction has 1759 states and 2089 transitions. [2022-11-19 07:38:57,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-19 07:38:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2089 transitions. [2022-11-19 07:38:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-19 07:38:57,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:57,674 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:38:57,684 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 07:38:57,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:57,882 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash -508211262, now seen corresponding path program 1 times [2022-11-19 07:38:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597322298] [2022-11-19 07:38:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:57,994 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-19 07:38:57,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:57,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597322298] [2022-11-19 07:38:57,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597322298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:38:57,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:38:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:38:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143456852] [2022-11-19 07:38:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:38:57,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:38:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:38:57,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:38:57,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:57,996 INFO L87 Difference]: Start difference. First operand 1759 states and 2089 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-19 07:38:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:38:58,540 INFO L93 Difference]: Finished difference Result 2730 states and 3316 transitions. [2022-11-19 07:38:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:38:58,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 89 [2022-11-19 07:38:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:38:58,555 INFO L225 Difference]: With dead ends: 2730 [2022-11-19 07:38:58,555 INFO L226 Difference]: Without dead ends: 2243 [2022-11-19 07:38:58,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:38:58,563 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 217 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:38:58,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 354 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:38:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2022-11-19 07:38:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2205. [2022-11-19 07:38:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2205 states, 1560 states have (on average 1.2038461538461538) internal successors, (1878), 1566 states have internal predecessors, (1878), 361 states have call successors, (361), 283 states have call predecessors, (361), 282 states have return successors, (396), 357 states have call predecessors, (396), 360 states have call successors, (396) [2022-11-19 07:38:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2205 states to 2205 states and 2635 transitions. [2022-11-19 07:38:59,030 INFO L78 Accepts]: Start accepts. Automaton has 2205 states and 2635 transitions. Word has length 89 [2022-11-19 07:38:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:38:59,031 INFO L495 AbstractCegarLoop]: Abstraction has 2205 states and 2635 transitions. [2022-11-19 07:38:59,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-19 07:38:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 2205 states and 2635 transitions. [2022-11-19 07:38:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-11-19 07:38:59,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:38:59,036 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-19 07:38:59,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-19 07:38:59,037 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:38:59,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:38:59,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1002761519, now seen corresponding path program 1 times [2022-11-19 07:38:59,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:38:59,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884747946] [2022-11-19 07:38:59,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:38:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 07:38:59,254 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:38:59,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884747946] [2022-11-19 07:38:59,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884747946] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:38:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310118042] [2022-11-19 07:38:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:38:59,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:38:59,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:38:59,257 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:38:59,269 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 07:38:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:38:59,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-19 07:38:59,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:38:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 50 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 07:38:59,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:38:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-19 07:38:59,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310118042] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:38:59,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [579389533] [2022-11-19 07:38:59,774 INFO L159 IcfgInterpreter]: Started Sifa with 58 locations of interest [2022-11-19 07:38:59,775 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:38:59,775 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:38:59,775 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:38:59,775 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:39:08,378 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2022-11-19 07:39:08,393 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 112 for LOIs [2022-11-19 07:39:08,433 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 172 for LOIs [2022-11-19 07:39:08,523 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 68 for LOIs [2022-11-19 07:39:08,645 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-11-19 07:39:08,948 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 188 for LOIs [2022-11-19 07:39:09,506 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:39:27,547 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '77799#(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) (= ~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) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-19 07:39:27,547 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:39:27,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:39:27,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 6] total 15 [2022-11-19 07:39:27,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521175377] [2022-11-19 07:39:27,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:39:27,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-19 07:39:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-19 07:39:27,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2802, Unknown=0, NotChecked=0, Total=3080 [2022-11-19 07:39:27,551 INFO L87 Difference]: Start difference. First operand 2205 states and 2635 transitions. Second operand has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-19 07:39:29,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:29,792 INFO L93 Difference]: Finished difference Result 3554 states and 4354 transitions. [2022-11-19 07:39:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-19 07:39:29,792 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) Word has length 98 [2022-11-19 07:39:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:29,802 INFO L225 Difference]: With dead ends: 3554 [2022-11-19 07:39:29,802 INFO L226 Difference]: Without dead ends: 2423 [2022-11-19 07:39:29,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 257 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5438 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=899, Invalid=11091, Unknown=0, NotChecked=0, Total=11990 [2022-11-19 07:39:29,809 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 658 mSDsluCounter, 1531 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:29,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1784 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-19 07:39:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2022-11-19 07:39:30,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1991. [2022-11-19 07:39:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1991 states, 1414 states have (on average 1.183168316831683) internal successors, (1673), 1421 states have internal predecessors, (1673), 315 states have call successors, (315), 261 states have call predecessors, (315), 260 states have return successors, (328), 310 states have call predecessors, (328), 314 states have call successors, (328) [2022-11-19 07:39:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 2316 transitions. [2022-11-19 07:39:30,175 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 2316 transitions. Word has length 98 [2022-11-19 07:39:30,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:30,175 INFO L495 AbstractCegarLoop]: Abstraction has 1991 states and 2316 transitions. [2022-11-19 07:39:30,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 7.583333333333333) internal successors, (91), 13 states have internal predecessors, (91), 6 states have call successors, (30), 4 states have call predecessors, (30), 7 states have return successors, (30), 5 states have call predecessors, (30), 6 states have call successors, (30) [2022-11-19 07:39:30,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 2316 transitions. [2022-11-19 07:39:30,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-19 07:39:30,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:30,180 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:39:30,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:30,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-19 07:39:30,387 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1622808639, now seen corresponding path program 1 times [2022-11-19 07:39:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:30,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951898984] [2022-11-19 07:39:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:30,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-19 07:39:30,851 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951898984] [2022-11-19 07:39:30,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951898984] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:30,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198438084] [2022-11-19 07:39:30,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:30,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:30,853 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:30,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 07:39:30,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:31,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 07:39:31,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:39:31,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:39:31,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198438084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:39:31,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:39:31,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 17 [2022-11-19 07:39:31,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383662979] [2022-11-19 07:39:31,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:39:31,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:39:31,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:39:31,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:39:31,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:39:31,078 INFO L87 Difference]: Start difference. First operand 1991 states and 2316 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-19 07:39:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:39:31,658 INFO L93 Difference]: Finished difference Result 2853 states and 3320 transitions. [2022-11-19 07:39:31,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:39:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 102 [2022-11-19 07:39:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:39:31,669 INFO L225 Difference]: With dead ends: 2853 [2022-11-19 07:39:31,670 INFO L226 Difference]: Without dead ends: 1806 [2022-11-19 07:39:31,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:39:31,674 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 146 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:39:31,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 707 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:39:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-19 07:39:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1621. [2022-11-19 07:39:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1621 states, 1176 states have (on average 1.1921768707482994) internal successors, (1402), 1183 states have internal predecessors, (1402), 244 states have call successors, (244), 200 states have call predecessors, (244), 199 states have return successors, (257), 239 states have call predecessors, (257), 243 states have call successors, (257) [2022-11-19 07:39:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1903 transitions. [2022-11-19 07:39:31,966 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1903 transitions. Word has length 102 [2022-11-19 07:39:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:39:31,966 INFO L495 AbstractCegarLoop]: Abstraction has 1621 states and 1903 transitions. [2022-11-19 07:39:31,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-19 07:39:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1903 transitions. [2022-11-19 07:39:31,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-19 07:39:31,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:39:31,969 INFO L195 NwaCegarLoop]: trace histogram [5, 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] [2022-11-19 07:39:31,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 07:39:32,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-19 07:39:32,171 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:39:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:39:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1511613771, now seen corresponding path program 1 times [2022-11-19 07:39:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:39:32,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809842161] [2022-11-19 07:39:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:32,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:39:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:32,933 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 07:39:32,933 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:39:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809842161] [2022-11-19 07:39:32,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809842161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:39:32,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762581308] [2022-11-19 07:39:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:39:32,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:39:32,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:39:32,935 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:39:32,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 07:39:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:39:33,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-19 07:39:33,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:39:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-19 07:39:33,415 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:39:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-19 07:39:34,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762581308] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:39:34,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [231371565] [2022-11-19 07:39:34,286 INFO L159 IcfgInterpreter]: Started Sifa with 61 locations of interest [2022-11-19 07:39:34,286 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:39:34,286 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:39:34,287 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:39:34,287 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:39:43,964 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 169 for LOIs [2022-11-19 07:39:46,628 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 63 for LOIs [2022-11-19 07:39:46,636 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 173 for LOIs [2022-11-19 07:39:46,685 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 69 for LOIs [2022-11-19 07:39:46,776 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 109 for LOIs [2022-11-19 07:39:47,029 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 189 for LOIs [2022-11-19 07:39:47,509 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:40:08,554 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '93471#(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) (= ~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) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (<= ~token~0 2147483647) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-19 07:40:08,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:40:08,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:40:08,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 12] total 32 [2022-11-19 07:40:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346968110] [2022-11-19 07:40:08,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:40:08,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-19 07:40:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-19 07:40:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2022-11-19 07:40:08,559 INFO L87 Difference]: Start difference. First operand 1621 states and 1903 transitions. Second operand has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-19 07:40:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:15,683 INFO L93 Difference]: Finished difference Result 2646 states and 3178 transitions. [2022-11-19 07:40:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-11-19 07:40:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) Word has length 101 [2022-11-19 07:40:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:15,693 INFO L225 Difference]: With dead ends: 2646 [2022-11-19 07:40:15,693 INFO L226 Difference]: Without dead ends: 2004 [2022-11-19 07:40:15,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 258 SyntacticMatches, 7 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10205 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=3063, Invalid=22377, Unknown=0, NotChecked=0, Total=25440 [2022-11-19 07:40:15,702 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 2853 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 1658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2861 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 4241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1658 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:15,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2861 Valid, 916 Invalid, 4241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1658 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-19 07:40:15,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2022-11-19 07:40:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1833. [2022-11-19 07:40:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1337 states have (on average 1.18698578908003) internal successors, (1587), 1344 states have internal predecessors, (1587), 270 states have call successors, (270), 225 states have call predecessors, (270), 224 states have return successors, (285), 265 states have call predecessors, (285), 269 states have call successors, (285) [2022-11-19 07:40:15,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2142 transitions. [2022-11-19 07:40:15,981 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2142 transitions. Word has length 101 [2022-11-19 07:40:15,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:15,982 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2142 transitions. [2022-11-19 07:40:15,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 20 states have (on average 6.65) internal successors, (133), 25 states have internal predecessors, (133), 13 states have call successors, (39), 9 states have call predecessors, (39), 17 states have return successors, (40), 13 states have call predecessors, (40), 13 states have call successors, (40) [2022-11-19 07:40:15,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2142 transitions. [2022-11-19 07:40:15,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-11-19 07:40:15,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:15,986 INFO L195 NwaCegarLoop]: trace histogram [5, 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, 1, 1] [2022-11-19 07:40:15,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:16,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:16,193 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1456597191, now seen corresponding path program 1 times [2022-11-19 07:40:16,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:16,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035337360] [2022-11-19 07:40:16,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:16,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-19 07:40:16,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:16,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035337360] [2022-11-19 07:40:16,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035337360] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:16,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115417760] [2022-11-19 07:40:16,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:16,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:16,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:16,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:16,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-19 07:40:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:16,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 07:40:16,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 07:40:16,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:16,933 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-11-19 07:40:16,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115417760] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:16,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:40:16,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 14 [2022-11-19 07:40:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117953037] [2022-11-19 07:40:16,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:16,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:40:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:16,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:40:16,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-11-19 07:40:16,936 INFO L87 Difference]: Start difference. First operand 1833 states and 2142 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-19 07:40:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:17,643 INFO L93 Difference]: Finished difference Result 2943 states and 3469 transitions. [2022-11-19 07:40:17,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:40:17,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 102 [2022-11-19 07:40:17,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:17,651 INFO L225 Difference]: With dead ends: 2943 [2022-11-19 07:40:17,652 INFO L226 Difference]: Without dead ends: 1601 [2022-11-19 07:40:17,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:40:17,658 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 113 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:17,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 321 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:40:17,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-19 07:40:17,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1452. [2022-11-19 07:40:17,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 1044 states have (on average 1.1522988505747127) internal successors, (1203), 1052 states have internal predecessors, (1203), 225 states have call successors, (225), 186 states have call predecessors, (225), 181 states have return successors, (234), 215 states have call predecessors, (234), 224 states have call successors, (234) [2022-11-19 07:40:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1662 transitions. [2022-11-19 07:40:17,931 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1662 transitions. Word has length 102 [2022-11-19 07:40:17,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:17,931 INFO L495 AbstractCegarLoop]: Abstraction has 1452 states and 1662 transitions. [2022-11-19 07:40:17,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-19 07:40:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1662 transitions. [2022-11-19 07:40:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-19 07:40:17,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:17,934 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:17,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:18,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-19 07:40:18,140 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:18,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:18,141 INFO L85 PathProgramCache]: Analyzing trace with hash 912748251, now seen corresponding path program 1 times [2022-11-19 07:40:18,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:18,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207348878] [2022-11-19 07:40:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-19 07:40:18,321 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:18,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207348878] [2022-11-19 07:40:18,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207348878] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:18,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174171674] [2022-11-19 07:40:18,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:18,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:18,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:18,324 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:18,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-19 07:40:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:18,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-19 07:40:18,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:18,576 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-19 07:40:18,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:40:18,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174171674] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:18,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:40:18,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-11-19 07:40:18,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446185596] [2022-11-19 07:40:18,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:18,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:40:18,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:18,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:40:18,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-19 07:40:18,580 INFO L87 Difference]: Start difference. First operand 1452 states and 1662 transitions. Second operand has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-19 07:40:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:19,081 INFO L93 Difference]: Finished difference Result 2001 states and 2287 transitions. [2022-11-19 07:40:19,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:40:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 112 [2022-11-19 07:40:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:19,088 INFO L225 Difference]: With dead ends: 2001 [2022-11-19 07:40:19,088 INFO L226 Difference]: Without dead ends: 1408 [2022-11-19 07:40:19,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:40:19,091 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 67 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:19,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 866 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:40:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2022-11-19 07:40:19,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1316. [2022-11-19 07:40:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 944 states have (on average 1.1504237288135593) internal successors, (1086), 952 states have internal predecessors, (1086), 206 states have call successors, (206), 169 states have call predecessors, (206), 164 states have return successors, (215), 196 states have call predecessors, (215), 205 states have call successors, (215) [2022-11-19 07:40:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1507 transitions. [2022-11-19 07:40:19,416 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1507 transitions. Word has length 112 [2022-11-19 07:40:19,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:19,416 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1507 transitions. [2022-11-19 07:40:19,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.833333333333334) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-19 07:40:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1507 transitions. [2022-11-19 07:40:19,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-19 07:40:19,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:19,418 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:19,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-19 07:40:19,624 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1254862292, now seen corresponding path program 1 times [2022-11-19 07:40:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409940927] [2022-11-19 07:40:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:19,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-19 07:40:19,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:19,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409940927] [2022-11-19 07:40:19,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409940927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:19,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985912526] [2022-11-19 07:40:19,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:19,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:19,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:19,783 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:19,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-19 07:40:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:19,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:40:19,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-19 07:40:19,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:40:19,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985912526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:40:19,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:40:19,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2022-11-19 07:40:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361827245] [2022-11-19 07:40:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:40:19,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:40:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:40:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:40:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-19 07:40:19,993 INFO L87 Difference]: Start difference. First operand 1316 states and 1507 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-19 07:40:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:40:20,512 INFO L93 Difference]: Finished difference Result 2065 states and 2352 transitions. [2022-11-19 07:40:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 07:40:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 113 [2022-11-19 07:40:20,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:40:20,521 INFO L225 Difference]: With dead ends: 2065 [2022-11-19 07:40:20,521 INFO L226 Difference]: Without dead ends: 1608 [2022-11-19 07:40:20,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-11-19 07:40:20,524 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 131 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:40:20,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 790 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:40:20,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2022-11-19 07:40:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1574. [2022-11-19 07:40:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1106 states have (on average 1.1446654611211573) internal successors, (1266), 1120 states have internal predecessors, (1266), 254 states have call successors, (254), 211 states have call predecessors, (254), 212 states have return successors, (275), 244 states have call predecessors, (275), 253 states have call successors, (275) [2022-11-19 07:40:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 1795 transitions. [2022-11-19 07:40:20,921 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 1795 transitions. Word has length 113 [2022-11-19 07:40:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:40:20,921 INFO L495 AbstractCegarLoop]: Abstraction has 1574 states and 1795 transitions. [2022-11-19 07:40:20,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-19 07:40:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 1795 transitions. [2022-11-19 07:40:20,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-11-19 07:40:20,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:40:20,925 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:40:20,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:40:21,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-19 07:40:21,132 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:40:21,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:40:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2137225785, now seen corresponding path program 1 times [2022-11-19 07:40:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:40:21,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865325933] [2022-11-19 07:40:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:40:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 18 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-19 07:40:22,341 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:40:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865325933] [2022-11-19 07:40:22,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865325933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:40:22,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461561752] [2022-11-19 07:40:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:40:22,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:40:22,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:40:22,342 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:40:22,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-19 07:40:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:40:22,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-19 07:40:22,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:40:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 31 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:40:23,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:40:26,121 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 07:40:26,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461561752] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:40:26,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1331579603] [2022-11-19 07:40:26,124 INFO L159 IcfgInterpreter]: Started Sifa with 68 locations of interest [2022-11-19 07:40:26,124 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:40:26,124 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:40:26,124 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:40:26,125 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:40:44,091 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 164 for LOIs [2022-11-19 07:40:44,287 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 117 for LOIs [2022-11-19 07:40:44,306 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 109 for LOIs [2022-11-19 07:40:44,329 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 176 for LOIs [2022-11-19 07:40:45,144 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 114 for LOIs [2022-11-19 07:40:45,255 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 63 for LOIs [2022-11-19 07:40:45,347 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 168 for LOIs [2022-11-19 07:40:45,656 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 191 for LOIs [2022-11-19 07:40:45,852 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:41:17,630 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '118747#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (<= ~q_buf_0~0 2147483647) (<= ~p_dw_pc~0 1) (<= 0 ~c_dr_pc~0) (<= 0 ~p_dw_st~0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (<= ~c_dr_pc~0 1) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~t1_st~0 0) (= ~m_i~0 0) (<= 0 (+ ~p_last_write~0 2147483648)) (not (= ~c_num_read~0 ~p_num_write~0)) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~p_last_write~0 2147483647) (= ~E_M~0 2) (<= 1 ~c_num_read~0) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:41:17,630 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:41:17,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:41:17,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 17, 16] total 55 [2022-11-19 07:41:17,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384561820] [2022-11-19 07:41:17,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:41:17,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-19 07:41:17,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:17,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-19 07:41:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=11398, Unknown=0, NotChecked=0, Total=12210 [2022-11-19 07:41:17,635 INFO L87 Difference]: Start difference. First operand 1574 states and 1795 transitions. Second operand has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-19 07:41:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:51,072 INFO L93 Difference]: Finished difference Result 4172 states and 4827 transitions. [2022-11-19 07:41:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2022-11-19 07:41:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) Word has length 114 [2022-11-19 07:41:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:51,084 INFO L225 Difference]: With dead ends: 4172 [2022-11-19 07:41:51,085 INFO L226 Difference]: Without dead ends: 3373 [2022-11-19 07:41:51,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 651 GetRequests, 287 SyntacticMatches, 7 SemanticMatches, 357 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52023 ImplicationChecksByTransitivity, 58.4s TimeCoverageRelationStatistics Valid=11710, Invalid=116812, Unknown=0, NotChecked=0, Total=128522 [2022-11-19 07:41:51,104 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 4231 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 7981 mSolverCounterSat, 2349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4232 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 10330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2349 IncrementalHoareTripleChecker+Valid, 7981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:51,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4232 Valid, 2818 Invalid, 10330 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2349 Valid, 7981 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2022-11-19 07:41:51,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2022-11-19 07:41:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 1812. [2022-11-19 07:41:51,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1267 states have (on average 1.1468034727703236) internal successors, (1453), 1282 states have internal predecessors, (1453), 291 states have call successors, (291), 241 states have call predecessors, (291), 252 states have return successors, (324), 289 states have call predecessors, (324), 290 states have call successors, (324) [2022-11-19 07:41:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2068 transitions. [2022-11-19 07:41:51,705 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2068 transitions. Word has length 114 [2022-11-19 07:41:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:51,705 INFO L495 AbstractCegarLoop]: Abstraction has 1812 states and 2068 transitions. [2022-11-19 07:41:51,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 35 states have (on average 5.6) internal successors, (196), 39 states have internal predecessors, (196), 20 states have call successors, (44), 16 states have call predecessors, (44), 23 states have return successors, (46), 20 states have call predecessors, (46), 20 states have call successors, (46) [2022-11-19 07:41:51,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2068 transitions. [2022-11-19 07:41:51,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-19 07:41:51,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:51,712 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:51,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:41:51,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:41:51,918 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:41:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1733899325, now seen corresponding path program 1 times [2022-11-19 07:41:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:51,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807438267] [2022-11-19 07:41:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 07:41:52,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807438267] [2022-11-19 07:41:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807438267] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:41:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044448453] [2022-11-19 07:41:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:52,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:41:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:41:52,316 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:41:52,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-19 07:41:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:52,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-19 07:41:52,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:41:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 07:41:52,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:41:52,915 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-19 07:41:52,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044448453] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:41:52,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:41:52,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14, 8] total 20 [2022-11-19 07:41:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504917137] [2022-11-19 07:41:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:41:52,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:41:52,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:41:52,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:41:52,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:41:52,918 INFO L87 Difference]: Start difference. First operand 1812 states and 2068 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-19 07:41:54,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:41:54,159 INFO L93 Difference]: Finished difference Result 3140 states and 3621 transitions. [2022-11-19 07:41:54,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:41:54,159 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 115 [2022-11-19 07:41:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:41:54,165 INFO L225 Difference]: With dead ends: 3140 [2022-11-19 07:41:54,165 INFO L226 Difference]: Without dead ends: 2149 [2022-11-19 07:41:54,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:41:54,169 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 223 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:41:54,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 459 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:41:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2149 states. [2022-11-19 07:41:54,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2149 to 1892. [2022-11-19 07:41:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1312 states have (on average 1.146341463414634) internal successors, (1504), 1330 states have internal predecessors, (1504), 310 states have call successors, (310), 250 states have call predecessors, (310), 268 states have return successors, (364), 312 states have call predecessors, (364), 309 states have call successors, (364) [2022-11-19 07:41:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2178 transitions. [2022-11-19 07:41:54,686 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2178 transitions. Word has length 115 [2022-11-19 07:41:54,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:41:54,687 INFO L495 AbstractCegarLoop]: Abstraction has 1892 states and 2178 transitions. [2022-11-19 07:41:54,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-19 07:41:54,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2178 transitions. [2022-11-19 07:41:54,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-19 07:41:54,691 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:41:54,691 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:41:54,703 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-19 07:41:54,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-19 07:41:54,898 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:41:54,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:41:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1453979223, now seen corresponding path program 1 times [2022-11-19 07:41:54,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:41:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15752291] [2022-11-19 07:41:54,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:41:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 24 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-11-19 07:41:55,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:41:55,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15752291] [2022-11-19 07:41:55,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15752291] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:41:55,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829415728] [2022-11-19 07:41:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:41:55,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:41:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:41:55,770 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:41:55,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-19 07:41:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:41:55,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-19 07:41:55,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:41:57,100 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 60 proven. 23 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-19 07:41:57,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:41:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-19 07:41:59,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829415728] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:41:59,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1990670673] [2022-11-19 07:41:59,366 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2022-11-19 07:41:59,366 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:41:59,367 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:41:59,367 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:41:59,367 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:42:03,243 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events1 with input of size 152 for LOIs [2022-11-19 07:42:03,584 INFO L197 IcfgInterpreter]: Interpreting procedure error1 with input of size 62 for LOIs [2022-11-19 07:42:03,588 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread1 with input of size 50 for LOIs [2022-11-19 07:42:03,596 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads1 with input of size 164 for LOIs [2022-11-19 07:42:04,359 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_write_p_triggered with input of size 102 for LOIs [2022-11-19 07:42:04,450 INFO L197 IcfgInterpreter]: Interpreting procedure is_do_read_c_triggered with input of size 50 for LOIs [2022-11-19 07:42:04,543 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events1 with input of size 156 for LOIs [2022-11-19 07:42:04,768 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels1 with input of size 179 for LOIs [2022-11-19 07:42:05,047 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:42:29,317 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '137013#(and (= ~q_req_up~0 1) (= ~t1_pc~0 0) (<= 0 ~p_dw_st~0) (= ~T1_E~0 2) (<= 0 ~p_dw_pc~0) (= ~m_st~0 0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= ~c_dr_pc~0 1) (= ~t1_st~0 0) (= ~c_num_read~0 1) (= ~m_i~0 0) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~c_last_read~0 ~q_buf_0~0) (= ~local~0 0) (= ~token~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~E_1~0 2) (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~c_dr_st~0 1) (= ~t1_i~0 0) (= |#NULL.base| 0))' at error location [2022-11-19 07:42:29,317 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:42:29,317 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:42:29,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-11-19 07:42:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964398232] [2022-11-19 07:42:29,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:42:29,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-19 07:42:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:29,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-19 07:42:29,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=10630, Unknown=0, NotChecked=0, Total=11556 [2022-11-19 07:42:29,322 INFO L87 Difference]: Start difference. First operand 1892 states and 2178 transitions. Second operand has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-11-19 07:42:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:44,194 INFO L93 Difference]: Finished difference Result 4110 states and 4771 transitions. [2022-11-19 07:42:44,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2022-11-19 07:42:44,195 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) Word has length 124 [2022-11-19 07:42:44,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:44,202 INFO L225 Difference]: With dead ends: 4110 [2022-11-19 07:42:44,202 INFO L226 Difference]: Without dead ends: 3039 [2022-11-19 07:42:44,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 318 SyntacticMatches, 2 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17436 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=4388, Invalid=39922, Unknown=0, NotChecked=0, Total=44310 [2022-11-19 07:42:44,210 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 4121 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 6817 mSolverCounterSat, 2812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4121 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 9629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2812 IncrementalHoareTripleChecker+Valid, 6817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:44,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4121 Valid, 2253 Invalid, 9629 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2812 Valid, 6817 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-11-19 07:42:44,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2022-11-19 07:42:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 1708. [2022-11-19 07:42:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1200 states have (on average 1.1466666666666667) internal successors, (1376), 1217 states have internal predecessors, (1376), 270 states have call successors, (270), 218 states have call predecessors, (270), 236 states have return successors, (314), 273 states have call predecessors, (314), 269 states have call successors, (314) [2022-11-19 07:42:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 1960 transitions. [2022-11-19 07:42:44,968 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 1960 transitions. Word has length 124 [2022-11-19 07:42:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:44,969 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 1960 transitions. [2022-11-19 07:42:44,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 34 states have (on average 6.264705882352941) internal successors, (213), 39 states have internal predecessors, (213), 24 states have call successors, (49), 15 states have call predecessors, (49), 21 states have return successors, (51), 23 states have call predecessors, (51), 24 states have call successors, (51) [2022-11-19 07:42:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 1960 transitions. [2022-11-19 07:42:44,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-11-19 07:42:44,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:44,973 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:44,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:45,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-19 07:42:45,179 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:42:45,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1748795385, now seen corresponding path program 1 times [2022-11-19 07:42:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:45,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863190670] [2022-11-19 07:42:45,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:45,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 38 proven. 9 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-19 07:42:45,420 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:45,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863190670] [2022-11-19 07:42:45,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863190670] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:45,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656676246] [2022-11-19 07:42:45,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:45,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:45,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:45,423 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:45,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-19 07:42:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:45,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-19 07:42:45,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:45,730 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 50 proven. 17 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-19 07:42:45,730 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-11-19 07:42:46,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656676246] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:46,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-19 07:42:46,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 10] total 17 [2022-11-19 07:42:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222132017] [2022-11-19 07:42:46,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:42:46,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:42:46,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:42:46,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:42:46,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-11-19 07:42:46,021 INFO L87 Difference]: Start difference. First operand 1708 states and 1960 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-19 07:42:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:42:47,297 INFO L93 Difference]: Finished difference Result 2369 states and 2707 transitions. [2022-11-19 07:42:47,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-19 07:42:47,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2022-11-19 07:42:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:42:47,302 INFO L225 Difference]: With dead ends: 2369 [2022-11-19 07:42:47,303 INFO L226 Difference]: Without dead ends: 1482 [2022-11-19 07:42:47,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-11-19 07:42:47,305 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 296 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:42:47,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 484 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:42:47,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2022-11-19 07:42:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1439. [2022-11-19 07:42:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1001 states have (on average 1.12987012987013) internal successors, (1131), 1018 states have internal predecessors, (1131), 234 states have call successors, (234), 188 states have call predecessors, (234), 202 states have return successors, (273), 233 states have call predecessors, (273), 233 states have call successors, (273) [2022-11-19 07:42:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 1638 transitions. [2022-11-19 07:42:47,723 INFO L78 Accepts]: Start accepts. Automaton has 1439 states and 1638 transitions. Word has length 125 [2022-11-19 07:42:47,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:42:47,724 INFO L495 AbstractCegarLoop]: Abstraction has 1439 states and 1638 transitions. [2022-11-19 07:42:47,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-19 07:42:47,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1439 states and 1638 transitions. [2022-11-19 07:42:47,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-19 07:42:47,728 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:42:47,728 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2022-11-19 07:42:47,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-19 07:42:47,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:47,937 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:42:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:42:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1905943600, now seen corresponding path program 1 times [2022-11-19 07:42:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:42:47,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538783707] [2022-11-19 07:42:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:47,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:42:47,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 61 proven. 39 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-11-19 07:42:48,243 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:42:48,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538783707] [2022-11-19 07:42:48,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538783707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:42:48,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102619735] [2022-11-19 07:42:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:42:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:42:48,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:42:48,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:42:48,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-19 07:42:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:42:48,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-19 07:42:48,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:42:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 156 proven. 6 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-19 07:42:48,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:42:49,037 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 84 proven. 23 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-11-19 07:42:49,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102619735] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:42:49,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [77478596] [2022-11-19 07:42:49,040 INFO L159 IcfgInterpreter]: Started Sifa with 64 locations of interest [2022-11-19 07:42:49,040 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:42:49,041 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:42:49,041 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:42:49,041 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:43:04,152 INFO L197 IcfgInterpreter]: Interpreting procedure reset_delta_events2 with input of size 62 for LOIs [2022-11-19 07:43:04,165 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread2 with input of size 109 for LOIs [2022-11-19 07:43:04,191 INFO L197 IcfgInterpreter]: Interpreting procedure update_channels2 with input of size 62 for LOIs [2022-11-19 07:43:04,195 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify with input of size 142 for LOIs [2022-11-19 07:43:05,237 INFO L197 IcfgInterpreter]: Interpreting procedure activate_threads2 with input of size 62 for LOIs [2022-11-19 07:43:05,609 INFO L197 IcfgInterpreter]: Interpreting procedure fire_delta_events2 with input of size 124 for LOIs [2022-11-19 07:43:05,641 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:43:26,555 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '153107#(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) (= ~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) (= ~q_req_up~0 0) (= ~q_ev~0 0) (= ~m_pc~0 1) (= ~p_dw_i~0 0) (= ~m_i~0 1) (= |ULTIMATE.start_start_simulation2_~kernel_st~1#1| 1) (<= 0 |ULTIMATE.start_eval2_~tmp~5#1|) (<= |ULTIMATE.start_eval2_~tmp~5#1| 1) (= ~p_dw_st~0 0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~q_read_ev~0 0) (= ~m_st~0 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (not (= (+ ~local~0 1) ~token~0)) (<= 0 (+ ~token~0 2147483648)) (<= 0 |#StackHeapBarrier|) (<= 0 ~t1_pc~0) (not (= |ULTIMATE.start_eval2_~tmp_ndt_1~0#1| 0)) (= |#NULL.base| 0))' at error location [2022-11-19 07:43:26,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:43:26,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:43:26,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 5] total 13 [2022-11-19 07:43:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308649282] [2022-11-19 07:43:26,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:43:26,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:43:26,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:26,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:43:26,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=3105, Unknown=0, NotChecked=0, Total=3422 [2022-11-19 07:43:26,559 INFO L87 Difference]: Start difference. First operand 1439 states and 1638 transitions. Second operand has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-19 07:43:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:27,932 INFO L93 Difference]: Finished difference Result 1591 states and 1807 transitions. [2022-11-19 07:43:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-19 07:43:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) Word has length 155 [2022-11-19 07:43:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:27,935 INFO L225 Difference]: With dead ends: 1591 [2022-11-19 07:43:27,935 INFO L226 Difference]: Without dead ends: 693 [2022-11-19 07:43:27,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 405 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3213 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=521, Invalid=5959, Unknown=0, NotChecked=0, Total=6480 [2022-11-19 07:43:27,937 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 430 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:27,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 924 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-19 07:43:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-11-19 07:43:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2022-11-19 07:43:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 474 states have (on average 1.1033755274261603) internal successors, (523), 484 states have internal predecessors, (523), 108 states have call successors, (108), 92 states have call predecessors, (108), 110 states have return successors, (137), 116 states have call predecessors, (137), 107 states have call successors, (137) [2022-11-19 07:43:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 768 transitions. [2022-11-19 07:43:28,309 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 768 transitions. Word has length 155 [2022-11-19 07:43:28,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:28,309 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 768 transitions. [2022-11-19 07:43:28,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 10.833333333333334) internal successors, (130), 12 states have internal predecessors, (130), 4 states have call successors, (36), 5 states have call predecessors, (36), 7 states have return successors, (38), 5 states have call predecessors, (38), 4 states have call successors, (38) [2022-11-19 07:43:28,310 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 768 transitions. [2022-11-19 07:43:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-11-19 07:43:28,312 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:43:28,313 INFO L195 NwaCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2022-11-19 07:43:28,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-19 07:43:28,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-19 07:43:28,520 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 07:43:28,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:43:28,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1200537518, now seen corresponding path program 1 times [2022-11-19 07:43:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:43:28,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850908741] [2022-11-19 07:43:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:43:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:43:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 115 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-11-19 07:43:29,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:43:29,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850908741] [2022-11-19 07:43:29,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850908741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:43:29,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996274553] [2022-11-19 07:43:29,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:43:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:43:29,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:43:29,377 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:43:29,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-19 07:43:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:43:29,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 795 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:43:29,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:43:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-11-19 07:43:29,855 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:43:29,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996274553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:43:29,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 07:43:29,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2022-11-19 07:43:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351409036] [2022-11-19 07:43:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:43:29,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:43:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:43:29,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:43:29,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:43:29,857 INFO L87 Difference]: Start difference. First operand 693 states and 768 transitions. Second operand has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-19 07:43:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:43:30,224 INFO L93 Difference]: Finished difference Result 946 states and 1046 transitions. [2022-11-19 07:43:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-19 07:43:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) Word has length 220 [2022-11-19 07:43:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:43:30,226 INFO L225 Difference]: With dead ends: 946 [2022-11-19 07:43:30,226 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:43:30,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:43:30,228 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 44 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:43:30,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 748 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:43:30,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:43:30,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:43:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:43:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:43:30,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 220 [2022-11-19 07:43:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:43:30,231 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:43:30,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 3 states have call successors, (22), 3 states have call predecessors, (22), 5 states have return successors, (22), 5 states have call predecessors, (22), 3 states have call successors, (22) [2022-11-19 07:43:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:43:30,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:43:30,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-19 07:43:30,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-19 07:43:30,244 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-19 07:43:30,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-11-19 07:43:30,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:44:01,991 WARN L233 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:44:12,997 WARN L233 SmtUtils]: Spent 9.76s on a formula simplification. DAG size of input: 178 DAG size of output: 175 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:44:24,369 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification. DAG size of input: 422 DAG size of output: 416 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:44:34,982 WARN L233 SmtUtils]: Spent 8.47s on a formula simplification. DAG size of input: 422 DAG size of output: 416 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-11-19 07:45:57,345 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-11-19 07:45:57,346 INFO L895 garLoopResultBuilder]: At program point immediate_notifyENTRY(lines 812 822) the Hoare annotation is: (let ((.cse27 (= ~t1_i~0 1)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= |old(~t1_st~0)| ~t1_st~0)) (.cse2 (= ~m_st~0 |old(~m_st~0)|)) (.cse25 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse28 (= ~p_dw_st~0 0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse3 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse15 (not (= ~E_1~0 1))) (.cse18 (and .cse27 .cse26 .cse23 .cse2 .cse25 .cse28 (= ~c_dr_pc~0 0) .cse24)) (.cse0 (not (= ~q_req_up~0 0))) (.cse6 (= ~q_read_ev~0 1)) (.cse17 (= ~q_write_ev~0 1)) (.cse1 (not .cse28)) (.cse4 (= |old(~m_st~0)| 0)) (.cse19 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse20 (not (= ~p_num_write~0 0))) (.cse8 (not .cse27)) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not .cse26)) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse14 (not .cse25)) (.cse16 (not .cse24)) (.cse21 (not (<= 2 ~E_1~0))) (.cse22 (not (= ~E_M~0 1)))) (and (or (not (= |old(~t1_st~0)| 0)) .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 (and .cse2 (= ~t1_st~0 0)) .cse3 .cse4 .cse5 (not (= ~m_i~0 1)) .cse6 .cse7 (not (= ~m_pc~0 0)) .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse18 .cse0 .cse1 .cse4 .cse6 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse14 .cse16 .cse17 .cse21 .cse22) (or .cse1 .cse4 .cse19 .cse7 .cse20 .cse8 .cse9 .cse10 (= ~m_pc~0 1) .cse11 .cse12 (and .cse23 (not (= ~m_st~0 0))) .cse14 .cse16 .cse21 .cse22)))) [2022-11-19 07:45:57,346 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-11-19 07:45:57,346 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-11-19 07:45:57,348 INFO L895 garLoopResultBuilder]: At program point update_channels1ENTRY(lines 226 240) the Hoare annotation is: (let ((.cse2 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and .cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_req_up~0 |old(~q_req_up~0)|))) (.cse14 (not (= |old(~q_req_up~0)| 0))) (.cse5 (= ~c_dr_st~0 0)) (.cse16 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= |old(~q_read_ev~0)| 1)) (.cse3 (not (= ~E_M~0 2))) (.cse21 (= |old(~q_req_up~0)| 1)) (.cse4 (not (<= ~token~0 ~local~0))) (.cse6 (not (= ~m_pc~0 0))) (.cse7 (not (= ~E_1~0 2))) (.cse19 (= |old(~q_write_ev~0)| 1)) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= ~local~0 ~token~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse12 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~t1_st~0 0))) (.cse23 (= |old(~q_read_ev~0)| 0)) (.cse15 (not (= 1 ~c_dr_i~0))) (.cse22 (= ~q_free~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (and (= ~q_ev~0 |old(~q_ev~0)|) .cse2 (= ~q_read_ev~0 2) (= ~q_req_up~0 ~p_dw_pc~0)) .cse3 (not (= 2 (select |#length| 1))) .cse4 (not (= |old(~q_ev~0)| 0)) (not (< 0 |#StackHeapBarrier|)) (not .cse5) (not (= (select |#valid| 3) 1)) .cse6 (not (= ~p_num_write~0 0)) .cse7 (not (= ~T1_E~0 2)) (not (= (select |#length| 3) 12)) .cse8 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse9 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse10 .cse11 (not (= |old(~q_read_ev~0)| 2)) (not (= ~p_dw_pc~0 |old(~q_req_up~0)|)) .cse12 .cse13 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) .cse14 (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse15)) (or .cse5 .cse16 .cse17 .cse3 .cse4 .cse18 .cse6 .cse7 .cse19 .cse8 (not (= ~c_num_read~0 ~p_num_write~0)) .cse9 .cse10 .cse11 .cse20 .cse12 (and .cse21 .cse22) (= |old(~q_write_ev~0)| 0) .cse13 .cse23 .cse15) (or .cse18 (let ((.cse24 (and (not (= ~m_st~0 ~E_M~0)) .cse11)) (.cse25 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse26 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse27 (not .cse22))) (and (or .cse5 .cse24 .cse16 .cse17 .cse3 .cse4 .cse25 .cse6 .cse7 .cse26 .cse19 .cse8 .cse27 .cse9 .cse10 .cse20 .cse12 .cse13 .cse14 .cse23 .cse15) (or .cse5 .cse24 .cse16 .cse17 .cse3 (not .cse21) .cse4 .cse25 .cse6 .cse7 .cse26 .cse19 .cse8 .cse27 .cse9 .cse10 .cse20 .cse12 .cse13 .cse23 .cse15))) .cse0 .cse11)))) [2022-11-19 07:45:57,349 INFO L895 garLoopResultBuilder]: At program point activate_threads2ENTRY(lines 787 811) the Hoare annotation is: (let ((.cse41 (<= 2 ~E_1~0)) (.cse45 (= ~p_num_write~0 0)) (.cse42 (= ~c_num_read~0 0)) (.cse25 (= ~t1_i~0 1)) (.cse26 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= |old(~t1_st~0)| ~t1_st~0)) (.cse36 (= ~m_pc~0 1)) (.cse43 (= ~q_free~0 0)) (.cse29 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse31 (= ~c_dr_pc~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse40 (= ~c_dr_st~0 0)) (.cse39 (= ~t1_pc~0 1)) (.cse30 (= ~p_dw_st~0 0)) (.cse23 (= |old(~m_st~0)| 0)) (.cse28 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse0 (not (= |old(~t1_st~0)| 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (and .cse28 (= ~t1_st~0 0))) (.cse7 (not (= ~m_i~0 1))) (.cse11 (not (= ~m_pc~0 0))) (.cse18 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse24 (not (= ~E_1~0 1))) (.cse5 (not (= ~E_M~0 2))) (.cse6 (not (<= ~token~0 ~local~0))) (.cse8 (and (not .cse23) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse12 (not (= ~E_1~0 2))) (.cse19 (not (<= ~local~0 ~token~0))) (.cse35 (= ~m_st~0 ~E_M~0)) (.cse1 (not (= ~q_req_up~0 0))) (.cse9 (= ~q_read_ev~0 1)) (.cse22 (= ~q_write_ev~0 1)) (.cse3 (not .cse30)) (.cse33 (not .cse39)) (.cse10 (not .cse40)) (.cse38 (and .cse39 .cse40 .cse41 .cse45 .cse42 .cse25 .cse26 .cse27 (not .cse36) .cse43 .cse29 .cse30 (not (= ~m_st~0 0)) .cse31 .cse32)) (.cse34 (not .cse45)) (.cse13 (not .cse25)) (.cse14 (not (= ~p_dw_pc~0 0))) (.cse15 (not .cse26)) (.cse16 (not .cse42)) (.cse17 (not .cse43)) (.cse20 (not .cse29)) (.cse21 (not .cse32)) (.cse37 (not .cse41)) (.cse44 (not (= ~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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse21 .cse22) (or (and .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) .cse1 .cse3 .cse5 .cse23 .cse6 .cse9 .cse33 .cse10 .cse34 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse24 .cse21 .cse22) (or .cse3 .cse35 .cse5 .cse23 .cse6 .cse8 .cse33 .cse10 .cse34 .cse12 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse19 .cse20 .cse21 .cse37) (or .cse3 .cse5 .cse23 .cse33 .cse10 .cse38 .cse34 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse20 .cse21 .cse37) (or .cse1 .cse3 .cse5 .cse23 .cse6 .cse8 .cse9 .cse33 .cse10 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 (and .cse39 .cse40 .cse41 .cse42 .cse25 .cse35 .cse26 .cse27 .cse43 .cse29 .cse30 .cse31 .cse32) .cse20 .cse21 .cse22 .cse37) (or .cse1 .cse3 .cse23 .cse9 .cse33 .cse10 .cse34 .cse13 .cse14 .cse15 (not (< ~token~0 (+ 2 ~local~0))) .cse16 .cse17 (and .cse39 .cse40 .cse41 .cse42 .cse25 .cse26 .cse27 .cse28 .cse43 .cse29 .cse30 .cse31 .cse32) (not (<= (+ ~local~0 1) ~token~0)) .cse20 .cse21 .cse22 .cse37 .cse44) (or .cse3 .cse23 .cse33 .cse10 .cse38 .cse34 .cse13 .cse14 .cse15 .cse36 .cse16 .cse17 .cse20 .cse21 .cse37 .cse44)))) [2022-11-19 07:45:57,349 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-11-19 07:45:57,350 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse3 (= |old(~m_st~0)| 0)) (.cse10 (= ~m_pc~0 1)) (.cse25 (= ~m_st~0 0))) (let ((.cse28 (= ~p_dw_st~0 0)) (.cse39 (or .cse25 (= ~m_st~0 |old(~m_st~0)|))) (.cse18 (= ~c_dr_st~0 0)) (.cse19 (<= 2 ~E_1~0)) (.cse20 (= ~p_num_write~0 0)) (.cse31 (not (= ~m_pc~0 ~t1_pc~0))) (.cse21 (= ~c_num_read~0 0)) (.cse22 (= ~t1_i~0 1)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse24 (= |old(~t1_st~0)| ~t1_st~0)) (.cse32 (not .cse10)) (.cse26 (= ~q_free~0 0)) (.cse27 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (and (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) (not .cse25)) .cse3)) (.cse29 (= ~c_dr_pc~0 0)) (.cse30 (= ~c_last_read~0 ~p_last_write~0))) (let ((.cse2 (and .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse32 .cse26 .cse27 .cse40 .cse29 .cse30)) (.cse16 (not (= ~E_M~0 1))) (.cse41 (not (= ~E_1~0 1))) (.cse42 (and .cse39 (= ~t1_st~0 0) .cse40 (= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0))) (.cse43 (not (= |old(~t1_st~0)| 0))) (.cse44 (not (= ~m_i~0 1))) (.cse45 (not (= ~m_pc~0 0))) (.cse46 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse17 (not (= ~q_req_up~0 0))) (.cse0 (not .cse28)) (.cse1 (not (= ~E_M~0 2))) (.cse35 (not (<= ~token~0 ~local~0))) (.cse36 (and (not .cse3) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse33 (= ~q_read_ev~0 1)) (.cse4 (not (= ~t1_pc~0 1))) (.cse5 (not .cse18)) (.cse6 (not .cse20)) (.cse37 (not (= ~E_1~0 2))) (.cse7 (not .cse22)) (.cse8 (not (= ~p_dw_pc~0 0))) (.cse9 (not .cse23)) (.cse11 (not .cse21)) (.cse12 (not .cse26)) (.cse38 (not (<= ~local~0 ~token~0))) (.cse13 (not .cse27)) (.cse14 (not .cse30)) (.cse34 (= ~q_write_ev~0 1)) (.cse15 (not .cse19))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse0 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse28 .cse29 .cse30) .cse3 (and .cse18 .cse19 .cse20 .cse31 .cse21 .cse22 .cse23 .cse24 .cse32 .cse26 .cse27 .cse29 .cse30) .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (< ~token~0 (+ 2 ~local~0))) .cse11 .cse12 (not (<= (+ ~local~0 1) ~token~0)) .cse13 .cse14 .cse34 .cse15 .cse16) (or .cse0 (= ~m_st~0 ~E_M~0) .cse1 .cse3 .cse35 .cse36 .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse38 .cse13 .cse14 .cse15) (or .cse17 .cse0 .cse1 .cse3 .cse35 .cse33 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 (and .cse22 .cse23 .cse24 .cse39 .cse27 .cse40 .cse28 .cse29 .cse30) .cse38 .cse13 .cse41 .cse14 .cse34) (or .cse42 .cse43 .cse17 .cse31 .cse0 .cse1 .cse3 .cse35 .cse44 .cse33 .cse5 .cse45 .cse7 .cse8 .cse9 .cse11 .cse12 .cse46 .cse38 .cse13 .cse41 .cse14 .cse34) (or .cse42 .cse43 .cse17 .cse31 .cse0 .cse1 .cse35 .cse44 .cse36 .cse33 .cse5 .cse45 .cse37 .cse7 .cse8 .cse9 .cse11 .cse12 .cse46 .cse38 .cse13 .cse14 .cse34) (or .cse17 .cse0 .cse1 .cse3 .cse35 .cse36 .cse33 .cse4 .cse5 .cse6 .cse37 .cse7 .cse8 .cse9 .cse11 .cse12 .cse38 .cse13 .cse14 .cse34 .cse15 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse39 .cse26 .cse27 .cse40 .cse28 .cse29 .cse30)))))) [2022-11-19 07:45:57,350 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-11-19 07:45:57,350 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-11-19 07:45:57,350 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-11-19 07:45:57,351 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-11-19 07:45:57,351 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-11-19 07:45:57,351 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-11-19 07:45:57,352 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse2 (= |old(~m_st~0)| 0)) (.cse9 (= ~m_pc~0 1))) (let ((.cse39 (<= 2 ~E_1~0)) (.cse30 (= |old(~t1_st~0)| ~t1_st~0)) (.cse43 (not .cse9)) (.cse35 (= ~c_dr_pc~0 0)) (.cse36 (= ~c_last_read~0 ~p_last_write~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse41 (= ~q_free~0 0)) (.cse40 (= ~c_num_read~0 0)) (.cse29 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~t1_i~0 1)) (.cse42 (= ~p_num_write~0 0)) (.cse38 (= ~c_dr_st~0 0)) (.cse37 (= ~t1_pc~0 1)) (.cse34 (= ~p_dw_st~0 0)) (.cse31 (or (= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse2)) (.cse32 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse26 (not (= ~E_1~0 1))) (.cse16 (not (= |old(~t1_st~0)| 0))) (.cse18 (not (= ~m_pc~0 ~t1_pc~0))) (.cse19 (and .cse31 .cse32 (= ~t1_st~0 0))) (.cse21 (not (= ~m_i~0 1))) (.cse23 (not (= ~m_pc~0 0))) (.cse24 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse17 (not (= ~q_req_up~0 0))) (.cse45 (= ~m_st~0 ~E_M~0)) (.cse1 (not (= ~E_M~0 2))) (.cse20 (not (<= ~token~0 ~local~0))) (.cse46 (and (not .cse2) (not (= ~E_M~0 |old(~m_st~0)|)))) (.cse22 (= ~q_read_ev~0 1)) (.cse47 (not (= ~E_1~0 2))) (.cse25 (not (<= ~local~0 ~token~0))) (.cse27 (= ~q_write_ev~0 1)) (.cse0 (not .cse34)) (.cse3 (not .cse37)) (.cse4 (not .cse38)) (.cse5 (not .cse42)) (.cse6 (not .cse28)) (.cse7 (not (= ~p_dw_pc~0 0))) (.cse8 (not .cse29)) (.cse10 (not .cse40)) (.cse11 (not .cse41)) (.cse12 (not .cse33)) (.cse13 (not .cse36)) (.cse14 (and .cse37 .cse38 .cse39 .cse42 .cse40 .cse28 .cse29 .cse30 .cse31 .cse43 .cse41 .cse33 .cse34 (not (= ~m_st~0 0)) .cse35 .cse36)) (.cse15 (not .cse39)) (.cse44 (not (= ~E_M~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse17 .cse18 .cse0 .cse19 .cse1 .cse2 .cse20 .cse21 .cse22 .cse4 .cse23 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse25 .cse12 .cse26 .cse13 .cse27) (or .cse17 .cse0 .cse1 .cse2 .cse20 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse26 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse13 .cse27) (or .cse17 .cse0 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (< ~token~0 (+ 2 ~local~0))) .cse10 .cse11 (not (<= (+ ~local~0 1) ~token~0)) (and .cse37 .cse38 .cse39 .cse40 .cse28 .cse29 .cse30 .cse32 .cse41 .cse33 (= 1 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse34 .cse35 .cse36) (and .cse37 .cse38 .cse39 .cse42 .cse40 .cse28 .cse29 .cse30 .cse43 .cse41 .cse33 .cse34 .cse35 .cse36) .cse12 .cse13 .cse27 .cse15 .cse44) (or .cse0 .cse45 .cse1 .cse2 .cse20 .cse46 .cse3 .cse4 .cse5 .cse47 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse25 .cse12 .cse13 .cse15) (or .cse16 .cse17 .cse18 .cse0 .cse19 .cse1 .cse20 .cse21 .cse46 .cse22 .cse4 .cse23 .cse47 .cse6 .cse7 .cse8 .cse10 .cse11 .cse24 .cse25 .cse12 .cse13 .cse27) (or .cse17 .cse0 (and .cse37 .cse38 .cse39 .cse40 .cse28 .cse45 .cse29 .cse30 .cse31 .cse41 .cse33 .cse34 .cse35 .cse36) .cse1 .cse2 .cse20 .cse46 .cse22 .cse3 .cse4 .cse5 .cse47 .cse6 .cse7 .cse8 .cse10 .cse11 .cse25 .cse12 .cse13 .cse27 .cse15) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse44))))) [2022-11-19 07:45:57,353 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse23 (= ~c_dr_pc~0 1)) (.cse21 (= ~t1_st~0 0)) (.cse22 (= ~p_dw_i~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse15 (not .cse25)) (.cse2 (not (= ~E_M~0 2))) (.cse13 (= |old(~p_dw_st~0)| 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 (not .cse18) .cse10 .cse23 .cse21 (= ~p_dw_pc~0 1) .cse22)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse24)) (.cse17 (= ~q_free~0 0)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~m_st~0 0))) (.cse19 (not .cse23)) (.cse20 (= ~q_read_ev~0 0)) (.cse11 (not .cse22)) (.cse12 (not .cse21)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse7 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse8 .cse9 (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse13) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse2 .cse16 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse17) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse7 .cse8 .cse9 (= ~q_write_ev~0 0) .cse19 .cse20 .cse11 .cse12 .cse0 (= ~q_write_ev~0 1) .cse14) (or (not (= ~q_req_up~0 0)) .cse15 .cse2 .cse13 .cse16 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse18 (not .cse17) .cse7 .cse8 .cse9 .cse19 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14)))) [2022-11-19 07:45:57,355 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse45 (= ~q_free~0 0))) (let ((.cse12 (= 1 ~c_dr_i~0)) (.cse14 (= ~t1_st~0 0)) (.cse17 (= ~p_dw_i~0 1)) (.cse27 (<= ~local~0 ~token~0)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~E_1~0 2)) (.cse26 (<= ~token~0 ~local~0)) (.cse25 (= ~E_M~0 2)) (.cse13 (= ~c_dr_pc~0 1)) (.cse22 (= ~p_dw_st~0 0)) (.cse41 (= |old(~p_dw_st~0)| 0)) (.cse10 (= ~m_pc~0 ~t1_pc~0)) (.cse38 (= ~q_write_ev~0 1)) (.cse44 (= ~q_req_up~0 1)) (.cse42 (not .cse45)) (.cse32 (= ~q_write_ev~0 0)) (.cse31 (not (= ~m_st~0 0)))) (let ((.cse0 (and (not (= ~m_st~0 ~E_M~0)) .cse31)) (.cse21 (not .cse32)) (.cse15 (= ~p_dw_pc~0 1)) (.cse23 (or (not .cse44) .cse42)) (.cse24 (not .cse38)) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (and .cse44 .cse45)) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse1 (not .cse10)) (.cse8 (= ~q_read_ev~0 1)) (.cse20 (= ~m_pc~0 1)) (.cse16 (or (not .cse22) .cse41)) (.cse33 (not .cse13)) (.cse34 (= ~q_read_ev~0 0)) (.cse37 (= |old(~c_dr_st~0)| 0)) (.cse2 (not .cse25)) (.cse3 (not .cse26)) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not .cse28)) (.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse18 (not .cse9)) (.cse29 (not .cse27)) (.cse30 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse35 (not .cse17)) (.cse36 (not .cse14)) (.cse40 (not .cse41)) (.cse39 (not .cse12))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (not .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 (and .cse9 .cse10 .cse21 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17 .cse24 .cse25 .cse26 .cse27 .cse28) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39) (or .cse0 .cse1 .cse2 .cse3 (and .cse9 .cse10 .cse21 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse17 .cse24 .cse25 .cse26 .cse27 .cse28) .cse4 .cse5 .cse6 .cse7 .cse18 .cse19 .cse20 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse40 .cse38 .cse39) (or (not (= ~q_req_up~0 0)) .cse1 .cse2 .cse41 .cse3 .cse8 .cse5 .cse6 .cse18 .cse20 .cse42 .cse29 .cse30 .cse31 (and .cse11 .cse16) .cse33 .cse34 .cse35 .cse36 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse39) (let ((.cse43 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse37) (not (= (select .cse43 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (and (= activate_threads1_~tmp~1 0) .cse11 .cse22) (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse18 (not (= (select |#valid| 0) 0)) (not (= (select .cse43 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse29 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse30 .cse31 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse35 .cse36 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) .cse40 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse39)))))) [2022-11-19 07:45:57,355 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-11-19 07:45:57,356 INFO L895 garLoopResultBuilder]: At program point activate_threads1ENTRY(lines 315 339) the Hoare annotation is: (let ((.cse24 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (= ~m_pc~0 1)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse23 (= ~c_dr_pc~0 1)) (.cse21 (= ~t1_st~0 0)) (.cse22 (= ~p_dw_i~0 1)) (.cse25 (= ~m_pc~0 ~t1_pc~0))) (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse15 (not .cse25)) (.cse2 (not (= ~E_M~0 2))) (.cse13 (= |old(~p_dw_st~0)| 0)) (.cse16 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse24 .cse25 (not .cse18) .cse10 .cse23 .cse21 (= ~p_dw_pc~0 1) .cse22)) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse6 (not .cse24)) (.cse17 (= ~q_free~0 0)) (.cse7 (not (<= ~local~0 ~token~0))) (.cse8 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~m_st~0 0))) (.cse19 (not .cse23)) (.cse20 (= ~q_read_ev~0 0)) (.cse11 (not .cse22)) (.cse12 (not .cse21)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse7 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse8 .cse9 (and .cse10 (= ~p_dw_st~0 0)) (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not .cse13) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse2 .cse16 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse17) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse7 .cse8 .cse9 (= ~q_write_ev~0 0) .cse19 .cse20 .cse11 .cse12 .cse0 (= ~q_write_ev~0 1) .cse14) (or (not (= ~q_req_up~0 0)) .cse15 .cse2 .cse13 .cse16 .cse3 (= ~q_read_ev~0 1) .cse4 .cse5 .cse6 .cse18 (not .cse17) .cse7 .cse8 .cse9 .cse19 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse14)))) [2022-11-19 07:45:57,356 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-11-19 07:45:57,357 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-11-19 07:45:57,357 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-11-19 07:45:57,357 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-11-19 07:45:57,358 INFO L895 garLoopResultBuilder]: At program point fire_delta_events2ENTRY(lines 731 758) the Hoare annotation is: (let ((.cse4 (= ~m_st~0 0)) (.cse21 (= ~E_M~0 2))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse2 (and .cse21 (= ~E_1~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (= ~q_read_ev~0 1)) (.cse8 (not (= 2 |old(~E_1~0)|))) (.cse15 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse16 (not (<= ~local~0 ~token~0))) (.cse18 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse4))) (.cse20 (= ~q_write_ev~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~c_dr_st~0 0))) (.cse9 (not (= 2 |old(~E_M~0)|))) (.cse10 (not (= ~t1_i~0 1))) (.cse11 (not (= ~p_dw_pc~0 0))) (.cse12 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse13 (not (= ~c_num_read~0 0))) (.cse14 (not (= ~q_free~0 0))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse19 (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) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 (not (= ~m_i~0 1)) .cse5 .cse7 .cse8 (not (= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (not (= ~t1_st~0 0)) .cse19 .cse20) (or .cse1 .cse4 .cse6 .cse7 .cse9 (not (= ~p_num_write~0 0)) .cse10 .cse11 .cse12 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse13 .cse14 (and (= ~E_1~0 |old(~E_1~0)|) .cse21) .cse17 .cse19)))) [2022-11-19 07:45:57,358 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-11-19 07:45:57,359 INFO L895 garLoopResultBuilder]: At program point fire_delta_events1ENTRY(lines 279 296) the Hoare annotation is: (let ((.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse0 (= ~p_dw_st~0 0)) (.cse4 (= ~c_dr_st~0 0)) (.cse15 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (= |old(~q_read_ev~0)| 1)) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse19 (= ~q_free~0 0)) (.cse17 (= |old(~q_write_ev~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse18 (and .cse13 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse20 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse0) (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) (not .cse4) (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse7 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse9 .cse10 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse13 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse4 (not (= ~q_req_up~0 0)) .cse15 .cse16 .cse2 .cse3 .cse5 .cse6 .cse17 .cse7 .cse18 (not .cse19) .cse8 .cse0 .cse9 .cse10 .cse20 .cse11 .cse12 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) (= |old(~q_read_ev~0)| 0) .cse14) (or .cse4 .cse15 .cse16 .cse2 .cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (and (= ~q_req_up~0 1) .cse19) .cse17 .cse7 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse18 .cse8 .cse9 .cse10 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse14)))) [2022-11-19 07:45:57,359 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-11-19 07:45:57,359 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-11-19 07:45:57,360 INFO L902 garLoopResultBuilder]: At program point is_do_read_c_triggeredENTRY(lines 88 106) the Hoare annotation is: true [2022-11-19 07:45:57,360 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-11-19 07:45:57,360 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-11-19 07:45:57,360 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-11-19 07:45:57,361 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse23 (= ~q_free~0 0))) (let ((.cse2 (not (= ~p_dw_st~0 0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~E_M~0 2))) (.cse5 (not (<= ~token~0 ~local~0))) (.cse6 (= is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= ~q_read_ev~0 1)) (.cse7 (not (= ~m_pc~0 0))) (.cse8 (not (= ~E_1~0 2))) (.cse9 (and (= ~q_req_up~0 1) .cse23)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (= ~m_pc~0 1)) (.cse12 (not (= ~c_num_read~0 ~p_num_write~0))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse15 (not (= ~m_st~0 0))) (.cse16 (= ~q_write_ev~0 0)) (.cse17 (not (= ~c_dr_pc~0 1))) (.cse24 (= ~q_read_ev~0 0)) (.cse18 (not (= ~p_dw_i~0 1))) (.cse19 (not (= ~t1_st~0 0))) (.cse20 (= ~q_write_ev~0 1)) (.cse21 (not (= 1 ~c_dr_i~0)))) (and (or .cse0 .cse1 .cse2 (not .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (let ((.cse22 (not .cse20))) (or (not (= ~q_req_up~0 0)) .cse1 .cse4 (and .cse6 .cse22) .cse5 (and .cse0 .cse22) (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse7 .cse8 (not (< ~c_num_read~0 ~p_num_write~0)) .cse10 .cse11 (not .cse23) .cse13 .cse14 .cse15 .cse17 .cse24 .cse18 .cse19 (and (<= 1 is_do_read_c_triggered_~__retres1~1) .cse20) .cse21)) (let ((.cse25 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse2 (not (= (select .cse25 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse4 (not (= 2 (select |#length| 1))) .cse5 .cse6 (not (< 0 |#StackHeapBarrier|)) (not .cse0) (not (= (select |#valid| 3) 1)) .cse7 (not (= ~p_num_write~0 0)) .cse8 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse10 (not (= (select |#valid| 0) 0)) (not (= (select .cse25 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse13 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse14 .cse15 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse18 .cse19 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse21)) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse3 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse18 .cse19 .cse20 .cse21)))) [2022-11-19 07:45:57,362 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-11-19 07:45:57,362 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,362 INFO L895 garLoopResultBuilder]: At program point L927-1(line 927) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,363 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-11-19 07:45:57,363 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-11-19 07:45:57,363 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-11-19 07:45:57,363 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-11-19 07:45:57,363 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:45:57,364 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~q_write_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse20 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,364 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,364 INFO L895 garLoopResultBuilder]: At program point L400-1(line 400) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse20 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse13 (= ~m_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse21 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= ~q_write_ev~0 2) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse20 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse20 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse21 .cse15 .cse16 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,365 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-11-19 07:45:57,365 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-11-19 07:45:57,365 INFO L895 garLoopResultBuilder]: At program point L962(lines 962 965) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~c_last_read~0 0) (= 0 ~c_dr_i~0) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= ~c_dr_pc~0 ~p_dw_pc~0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (<= |ULTIMATE.start_main_#t~nondet28#1| 2147483647) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~p_dw_i~0 0) (= ~m_i~0 0) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_write_ev~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= (select |#valid| 0) 0) (= ~q_read_ev~0 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet28#1|)))) [2022-11-19 07:45:57,366 INFO L895 garLoopResultBuilder]: At program point L450(lines 413 455) the Hoare annotation is: (and (= ~m_pc~0 ~t1_pc~0) (not (= ~m_pc~0 1))) [2022-11-19 07:45:57,366 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~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) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-19 07:45:57,366 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-11-19 07:45:57,366 INFO L895 garLoopResultBuilder]: At program point L897-1(line 897) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~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) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-19 07:45:57,367 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-11-19 07:45:57,367 INFO L895 garLoopResultBuilder]: At program point L220(lines 173 225) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= ~m_st~0 0)) (.cse10 (= ~m_pc~0 0))) (or (and (= ~c_num_read~0 0) (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~q_req_up~0 0) .cse6 .cse7 .cse8 (= ~q_write_ev~0 2) .cse9 (= ~q_read_ev~0 2) .cse10 .cse11 (= ~c_last_read~0 ~p_last_write~0) .cse12 .cse13 .cse14 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16) (and (let ((.cse17 (not (= ~q_read_ev~0 1))) (.cse18 (not (= ~q_write_ev~0 0))) (.cse19 (not (= ~q_read_ev~0 0))) (.cse20 (= ~p_dw_pc~0 1)) (.cse21 (not (= ~q_write_ev~0 1)))) (or (and .cse17 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse20 (= 2 ~p_dw_st~0) .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~q_req_up~0 1) (not .cse9) .cse17 .cse0 .cse1 .cse2 .cse18 .cse4 .cse5 .cse19 .cse6 .cse7 .cse8 .cse20 .cse11 .cse21 .cse12 .cse13 .cse14 .cse15 .cse16))) .cse3 .cse10))) [2022-11-19 07:45:57,367 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-11-19 07:45:57,368 INFO L895 garLoopResultBuilder]: At program point L567(lines 567 571) the Hoare annotation is: (let ((.cse10 (= ~m_st~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse16 (= ~m_pc~0 ~t1_pc~0)) (.cse17 (= ~m_i~0 1)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse22 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse5 (= ~t1_i~0 1)) (.cse15 (= ~m_st~0 ~E_M~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse23 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse24 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse6 .cse16 .cse10 .cse7 .cse8 .cse23 .cse17 .cse9 .cse11 .cse18 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse1 .cse2 (not .cse16) .cse22 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse23 .cse17 .cse9 .cse11 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14) (and .cse0 .cse1 .cse2 .cse22 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse23 .cse9 .cse11 .cse12 .cse24 .cse13 .cse19 .cse20 .cse21 .cse14))) [2022-11-19 07:45:57,368 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 0)) (.cse10 (= ~q_req_up~0 1)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse3 (= ~m_st~0 0))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not .cse10) (not .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse3 .cse12 (let ((.cse19 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (or (= ~m_st~0 ~E_M~0) .cse3)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse10 .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))))) [2022-11-19 07:45:57,368 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-11-19 07:45:57,368 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-11-19 07:45:57,369 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse5 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0)))) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) (.cse15 (= ~E_M~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~q_read_ev~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= ~q_req_up~0 0) (<= (+ ~local~0 1) ~token~0) .cse10 .cse11 .cse12 (< ~token~0 (+ 2 ~local~0)) .cse13 (not (= ~q_write_ev~0 1)) .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) [2022-11-19 07:45:57,369 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-11-19 07:45:57,369 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-19 07:45:57,370 INFO L895 garLoopResultBuilder]: At program point L420-1(line 420) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-19 07:45:57,370 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-19 07:45:57,371 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-19 07:45:57,371 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-11-19 07:45:57,371 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,372 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,372 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-11-19 07:45:57,372 INFO L895 garLoopResultBuilder]: At program point L553(lines 516 559) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~t1_i~0 1)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_dr_pc~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 (= ~p_num_write~0 0) (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 (= ~m_st~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 (= ~c_num_read~0 ~p_num_write~0) .cse3 (= ~m_st~0 ~E_M~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16))) [2022-11-19 07:45:57,372 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-11-19 07:45:57,373 INFO L895 garLoopResultBuilder]: At program point L388(lines 340 393) the Hoare annotation is: (let ((.cse12 (= ~m_pc~0 0)) (.cse10 (= ~q_req_up~0 1)) (.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse11 (= ~q_free~0 0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (= ~E_1~0 2)) (.cse3 (= ~m_st~0 0))) (or (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not .cse10) (not .cse11)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and (not (= ~p_dw_st~0 0)) .cse3 .cse12 (let ((.cse19 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (or (= ~m_st~0 ~E_M~0) .cse3)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21) (and .cse10 .cse0 .cse1 .cse2 .cse19 .cse4 .cse5 .cse11 .cse20 .cse6 .cse7 .cse8 .cse9 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21)))))) [2022-11-19 07:45:57,373 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (and (= ~c_dr_st~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~c_num_read~0 ~p_num_write~0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (or (= ~m_st~0 ~E_M~0) (= ~m_st~0 0)) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~m_i~0 1) (= ~p_dw_st~0 0) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2)) [2022-11-19 07:45:57,373 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:45:57,374 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-11-19 07:45:57,374 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~E_1~0 1)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (not (= ~m_st~0 0))) (.cse12 (= ~c_dr_pc~0 0)) (.cse13 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (not (= ~q_write_ev~0 1))) (.cse15 (= ~E_M~0 2)) (.cse16 (<= ~token~0 ~local~0)) (.cse17 (<= ~local~0 ~token~0)) (.cse18 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 .cse8 .cse9 (= ~t1_st~0 0) (= ~m_i~0 1) .cse10 .cse11 .cse12 (= ~m_pc~0 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18))) [2022-11-19 07:45:57,374 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-11-19 07:45:57,375 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,375 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse27 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse35 (= ~q_req_up~0 1)) (.cse36 (not .cse27)) (.cse13 (= ~p_dw_st~0 0))) (let ((.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse24 (not .cse13)) (.cse33 (or .cse1 (and .cse35 .cse36))) (.cse25 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse32 (not (= ~q_write_ev~0 0))) (.cse26 (< ~c_num_read~0 ~p_num_write~0)) (.cse34 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~q_req_up~0 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse14 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_M~0 2)) (.cse21 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (= ~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 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse25 .cse5 (or (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse3 .cse4 .cse32 .cse33 .cse34 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse28 .cse15) (and .cse25 .cse3 .cse4 .cse32 .cse5 .cse34 .cse7 .cse28 .cse9 .cse10 .cse11 .cse29 (or (not .cse35) .cse36) .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse34 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse37 .cse35 .cse0 .cse3 .cse4 .cse33 .cse5 .cse7 .cse27 .cse11 .cse29 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse35 .cse25 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse26 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse3 .cse4 .cse32 .cse26 .cse34 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30))) .cse5 .cse28 .cse15) (let ((.cse40 (select |#memory_int| 1))) (and .cse37 (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse0 .cse3 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse11 (= ~m_i~0 0) .cse12 .cse13 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) .cse14 .cse38 .cse15 .cse16 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse17 .cse18 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse40 0) 48) .cse21 (= (select .cse40 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))))))) [2022-11-19 07:45:57,376 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-11-19 07:45:57,376 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-19 07:45:57,377 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-19 07:45:57,377 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (= ~m_st~0 0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse6 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse14 (<= ~token~0 ~local~0)) (.cse15 (<= ~local~0 ~token~0)) (.cse16 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 (< ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 (not (= ~q_read_ev~0 0)) (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse6)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-19 07:45:57,378 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~m_pc~0 ~t1_pc~0)) (.cse2 (= ~m_st~0 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= 1 ~c_dr_i~0)) (.cse6 (not (= ~q_read_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse8 (= ~t1_st~0 0)) (.cse9 (= ~p_dw_pc~0 1)) (.cse5 (= ~q_free~0 0)) (.cse10 (= ~m_pc~0 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2))) (or (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse0 .cse1 (< ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 .cse5 .cse6 (= ~q_req_up~0 0) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) .cse2 .cse3 .cse4 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (or (not (= ~q_req_up~0 1)) (not .cse5)) .cse10 .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14 .cse15 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-11-19 07:45:57,378 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,379 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~m_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse25 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse26 .cse13 .cse22) (and .cse1 .cse3 (not .cse15) .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse16 .cse17 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse24 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse15 .cse7 .cse8 (or .cse14 .cse10) .cse25 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse22))) [2022-11-19 07:45:57,379 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (= ~T1_E~0 2) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= 2 (select |#length| 1)) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 0) (= (select |#valid| 3) 1) (= ~q_req_up~0 0) (= ~t1_st~0 0) (= ~q_ev~0 0) (= ~m_i~0 0) (= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~m_pc~0 0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (= ~E_M~0 2) (= ~a_t~0 0) (= (select .cse0 0) 48) (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse0 1) 0) (= ~E_1~0 2) (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) [2022-11-19 07:45:57,379 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-11-19 07:45:57,380 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse21 (= ~q_write_ev~0 1)) (.cse8 (= ~q_free~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (= ~p_dw_st~0 0))) (let ((.cse1 (not .cse28)) (.cse2 (not (= ~q_read_ev~0 1))) (.cse5 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~q_req_up~0 0)) (.cse20 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse22 (not (= ~q_write_ev~0 0))) (.cse6 (= ~m_st~0 0)) (.cse23 (not .cse0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse9 (not (= ~q_read_ev~0 0))) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse12 (= ~t1_st~0 0)) (.cse13 (= ~p_dw_pc~0 1)) (.cse25 (or (not (= ~q_req_up~0 1)) (not .cse8))) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse26 (not .cse21)) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse27 (< ~c_num_read~0 (+ ~p_num_write~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 .cse21) (and .cse2 .cse3 .cse4 .cse22 .cse6 .cse23 .cse7 .cse9 .cse24 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse27) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse3 .cse4 .cse22 .cse6 .cse23 .cse7 .cse9 .cse24 .cse11 .cse12 .cse13 .cse28 .cse25 .cse14 .cse15 .cse26 .cse16 .cse17 .cse18 .cse19 .cse27)))) [2022-11-19 07:45:57,380 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-11-19 07:45:57,380 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-11-19 07:45:57,380 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-11-19 07:45:57,380 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-11-19 07:45:57,381 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-11-19 07:45:57,381 INFO L895 garLoopResultBuilder]: At program point L524(lines 519 558) the Hoare annotation is: (and (= ~t1_pc~0 1) (= ~c_dr_st~0 0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (not (= ~q_read_ev~0 1)) (= ~c_num_read~0 0) (= ~t1_i~0 1) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (= ~q_req_up~0 0) (<= (+ ~local~0 1) ~token~0) (= ~p_dw_st~0 0) (not (= ~m_st~0 0)) (= ~c_dr_pc~0 0) (< ~token~0 (+ 2 ~local~0)) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1)) (= ~E_M~0 2) (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0))) [2022-11-19 07:45:57,381 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 901 941) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,382 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-11-19 07:45:57,382 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-11-19 07:45:57,382 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-11-19 07:45:57,382 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 563 594) the Hoare annotation is: (let ((.cse6 (not (= ~m_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (<= 2 ~E_1~0)) (.cse2 (= ~p_num_write~0 0)) (.cse15 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~m_st~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse16 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse14 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse11 (= ~m_pc~0 0) .cse12 .cse17 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 (or (= |exists_runnable_thread2_#res| 1) (not (= ~t1_st~0 0))) .cse4 (= ~m_st~0 ~E_M~0) .cse5 .cse7 .cse8 .cse16 (= ~m_i~0 1) .cse9 .cse11 .cse12 .cse17 .cse13 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) .cse14) (and .cse0 .cse1 .cse2 .cse15 .cse3 .cse4 .cse5 .cse10 .cse7 .cse8 .cse16 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse17 .cse13 .cse14))) [2022-11-19 07:45:57,382 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-11-19 07:45:57,383 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-11-19 07:45:57,383 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 424 449) the Hoare annotation is: (let ((.cse21 (= ~c_dr_st~0 0)) (.cse22 (= ~p_dw_st~0 0))) (let ((.cse13 (= ~q_write_ev~0 2)) (.cse0 (not .cse22)) (.cse1 (not (= ~q_read_ev~0 1))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (< ~c_num_read~0 ~p_num_write~0)) (.cse5 (= ~m_st~0 0)) (.cse24 (not .cse21)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (not (= ~q_read_ev~0 0))) (.cse9 (= ~q_req_up~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~p_dw_pc~0 1)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse25 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (<= ~p_num_write~0 (+ ~c_num_read~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) (let ((.cse23 (select |#memory_int| 1))) (and .cse21 (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse2 .cse3 (= ~T1_E~0 2) .cse5 (= ~q_free~0 1) (= ~c_last_read~0 0) .cse6 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse9 .cse11 (= ~m_i~0 0) .cse13 .cse22 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse14 .cse15 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) .cse16 (= ~a_t~0 0) (= (select .cse23 0) 48) .cse17 .cse18 (= ~q_req_up~0 ~p_dw_pc~0) (= (select .cse23 1) 0) .cse19 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse5 .cse24 .cse6 .cse8 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11 .cse12 (or (not (= ~q_req_up~0 1)) (not .cse7)) .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20)))) [2022-11-19 07:45:57,384 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-11-19 07:45:57,384 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-11-19 07:45:57,384 INFO L895 garLoopResultBuilder]: At program point L923(lines 923 932) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,384 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-11-19 07:45:57,385 INFO L895 garLoopResultBuilder]: At program point L725(lines 680 730) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,385 INFO L895 garLoopResultBuilder]: At program point L180(lines 180 184) the Hoare annotation is: (and (= ~m_st~0 0) (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) (= ~m_pc~0 0) (let ((.cse0 (not (= ~q_read_ev~0 1))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~m_pc~0 ~t1_pc~0)) (.cse3 (< ~c_num_read~0 ~p_num_write~0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (not (= ~q_read_ev~0 0))) (.cse8 (= ~c_dr_pc~0 1)) (.cse9 (= ~t1_st~0 0)) (.cse10 (= ~p_dw_pc~0 1)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2)) (.cse16 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and (not (= ~p_dw_st~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~q_req_up~0 0) .cse8 .cse9 .cse10 (= ~q_write_ev~0 2) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (and (= ~q_req_up~0 1) .cse0 .cse1 .cse2 (not (= ~q_write_ev~0 0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 2 ~p_dw_st~0) .cse11 (not (= ~q_write_ev~0 1)) .cse12 .cse13 .cse14 .cse15 .cse16)))) [2022-11-19 07:45:57,386 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 135 170) the Hoare annotation is: (let ((.cse30 (= ~p_dw_pc~0 0)) (.cse29 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (= ~c_dr_st~0 2)) (.cse10 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1)) (.cse9 (= ~q_req_up~0 0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~E_M~0 2)) (.cse19 (<= ~local~0 ~token~0)) (.cse20 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (= ~E_1~0 2)) (.cse28 (= ~c_dr_st~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse11 (= ~t1_st~0 0)) (.cse31 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647)) (.cse12 (= ~q_write_ev~0 2)) (.cse32 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648))) (.cse33 (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0))) (.cse13 (= ~q_read_ev~0 2)) (.cse34 (= ~c_dr_pc~0 0)) (.cse14 (= ~m_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse18 (<= ~token~0 ~local~0)) (.cse21 (let ((.cse36 (= ~m_pc~0 ~t1_pc~0)) (.cse37 (not (= ~m_pc~0 1)))) (or (and .cse30 .cse36 .cse37) (and .cse36 .cse37 .cse29))))) (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 (= ~q_req_up~0 1) .cse1 (not (= ~q_read_ev~0 1)) .cse5 (let ((.cse23 (< ~c_num_read~0 ~p_num_write~0)) (.cse24 (or .cse29 (and .cse30 .cse12 .cse13))) (.cse25 (= ~q_free~0 0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse27 (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (or (and .cse3 .cse4 .cse23 .cse24 .cse7 .cse25 .cse10 .cse11 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse21 .cse22 .cse27) (and .cse4 (not (= ~q_write_ev~0 0)) .cse23 .cse24 (not .cse28) .cse7 .cse25 .cse10 .cse11 .cse14 .cse15 .cse26 .cse17 .cse18 .cse19 .cse21 .cse22 .cse27))) (not (= ~q_read_ev~0 0))) (let ((.cse35 (select |#memory_int| 1))) (and .cse28 .cse0 (= (select |#length| 3) 12) .cse2 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse9 .cse11 .cse31 (= ~m_i~0 0) .cse12 (= ~p_dw_st~0 1) .cse32 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~token~0 0) .cse33 .cse13 .cse34 .cse14 .cse15 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse16 .cse17 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse35 0) 48) .cse18 .cse19 .cse20 .cse21 (= (select .cse35 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))) (and (<= ~m_i~0 0) .cse28 (<= ~T1_E~0 2) (<= 2 ~E_1~0) (<= 0 |#NULL.base|) (<= 0 ~m_i~0) (<= 0 ~q_free~0) (<= 1 ~c_dr_i~0) .cse4 (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= ~p_dw_pc~0 0) (<= 0 ~t1_i~0) (<= 2 ~E_M~0) (<= ~c_dr_i~0 1) (<= 1 ~p_dw_st~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (<= 1 ~q_req_up~0) (<= ~a_t~0 0) (<= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (<= 2 ~M_E~0) (<= |#NULL.offset| 0) (<= 2 ~T1_E~0) .cse11 .cse31 (<= ~p_num_write~0 1) (<= ~local~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse12 (<= 1 |ULTIMATE.start_start_simulation1_~kernel_st~0#1|) .cse32 (<= ~q_req_up~0 1) (<= 0 ~token~0) (<= 0 ~a_t~0) (<= |#NULL.base| 0) .cse33 .cse13 (<= ~q_free~0 0) (<= ~t1_i~0 0) .cse34 (<= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse14 .cse15 (<= ~M_E~0 2) (<= ~m_st~0 0) (<= ~p_last_write~0 2147483647) (<= ~p_dw_st~0 1) .cse18 (<= 1 ~p_num_write~0) (<= 0 ~m_st~0) (<= ~E_1~0 2) (<= 0 |#NULL.offset|) .cse21 (<= 0 |#StackHeapBarrier|) (<= ~E_M~0 2) (<= 0 ~c_num_read~0) (<= 0 ~c_last_read~0))))) [2022-11-19 07:45:57,386 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-11-19 07:45:57,387 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-11-19 07:45:57,387 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse15 (= ~m_pc~0 ~t1_pc~0)) (.cse10 (= ~m_st~0 0)) (.cse16 (= ~t1_st~0 0)) (.cse17 (= ~m_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse21 (= ~E_1~0 2)) (.cse0 (= ~t1_pc~0 1)) (.cse23 (<= 2 ~t1_st~0)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse24 (not (= ~q_read_ev~0 1))) (.cse4 (= ~c_num_read~0 0)) (.cse5 (= ~t1_i~0 1)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_req_up~0 0)) (.cse9 (= ~p_dw_st~0 0)) (.cse11 (= ~c_dr_pc~0 0)) (.cse18 (= ~m_pc~0 0)) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (not (= ~q_write_ev~0 1))) (.cse13 (= ~E_M~0 2)) (.cse22 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~m_pc~0 1)) .cse7 .cse8 .cse9 (not .cse10) .cse11 .cse12 .cse13) (and .cse1 .cse3 .cse4 .cse5 .cse14 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse10 .cse7 .cse8 .cse25 (<= (+ ~local~0 1) ~token~0) .cse9 .cse11 (< ~token~0 (+ 2 ~local~0)) .cse12 .cse26 .cse13 .cse22) (and .cse1 .cse3 (not .cse15) .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse16 .cse17 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21 .cse22) (and .cse1 .cse24 .cse4 (= ~c_num_read~0 ~p_num_write~0) .cse5 .cse6 .cse15 .cse7 .cse8 (or .cse14 .cse10) .cse25 .cse16 .cse17 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse1 .cse3 .cse24 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse12 .cse26 .cse13 .cse19 .cse20 .cse21) (and .cse0 .cse23 .cse1 .cse2 .cse3 .cse24 .cse4 .cse5 .cse6 .cse7 .cse8 .cse25 .cse9 .cse11 .cse18 .cse12 .cse26 .cse13 .cse22))) [2022-11-19 07:45:57,388 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 519 558) the Hoare annotation is: (let ((.cse0 (= ~t1_pc~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (= ~p_num_write~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse4 (not (= ~q_read_ev~0 1))) (.cse5 (= ~c_num_read~0 0)) (.cse6 (= ~t1_i~0 1)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~q_free~0 0)) (.cse9 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (= ~p_dw_st~0 0)) (.cse12 (not (= ~m_st~0 0))) (.cse13 (= ~c_dr_pc~0 0)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (not (= ~q_write_ev~0 1))) (.cse16 (= ~E_M~0 2)) (.cse17 (not (= |ULTIMATE.start_eval2_~tmp~5#1| 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= (+ ~local~0 1) ~token~0) .cse11 .cse12 .cse13 (< ~token~0 (+ 2 ~local~0)) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~m_pc~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse1 .cse4 .cse5 (= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 (= ~m_pc~0 ~t1_pc~0) .cse8 .cse9 .cse10 (= ~t1_st~0 0) (= ~m_i~0 1) .cse11 .cse12 .cse13 (= ~m_pc~0 0) .cse14 .cse15 .cse16 (<= ~token~0 ~local~0) (<= ~local~0 ~token~0) (= ~E_1~0 2) .cse17))) [2022-11-19 07:45:57,388 INFO L895 garLoopResultBuilder]: At program point L149(lines 135 170) the Hoare annotation is: (let ((.cse21 (= ~p_dw_pc~0 0)) (.cse20 (= ~p_dw_pc~0 1))) (let ((.cse2 (= ~m_st~0 0)) (.cse8 (= ~m_pc~0 0)) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= 1 ~c_dr_i~0)) (.cse4 (= ~t1_st~0 0)) (.cse6 (let ((.cse22 (= ~m_pc~0 ~t1_pc~0))) (or (and .cse21 .cse22) (and .cse22 .cse20)))) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= ~E_M~0 2)) (.cse11 (<= ~token~0 ~local~0)) (.cse12 (<= ~local~0 ~token~0)) (.cse13 (= ~E_1~0 2)) (.cse5 (= ~q_write_ev~0 2)) (.cse7 (= ~q_read_ev~0 2))) (or (and .cse0 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse1 (= ~p_last_write~0 0) (= ~T1_E~0 2) .cse2 (= ~q_free~0 1) (= ~c_last_read~0 0) .cse3 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) (= ~q_req_up~0 0) .cse4 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647) (= ~m_i~0 0) .cse5 (= ~p_dw_st~0 1) (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648)) .cse6 (= ~token~0 0) (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0)) .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (= |#NULL.offset| 0) .cse10 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) .cse11 .cse12 (= ~q_req_up~0 ~p_dw_pc~0) .cse13 (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0)) (and (not (= ~p_dw_st~0 0)) (not (= ~q_read_ev~0 1)) .cse2 (not (= ~q_read_ev~0 0)) .cse8 (let ((.cse14 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse15 (or .cse20 (and .cse21 .cse5 .cse7))) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (not (= ~q_write_ev~0 1))) (.cse19 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse1 (not (= ~q_write_ev~0 0)) (or .cse14 (and (= ~q_req_up~0 1) (not (= ~q_free~0 0)))) .cse15 (not .cse0) .cse3 .cse16 .cse17 .cse4 .cse6 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse19) (and .cse14 (= ~c_dr_st~0 2) .cse1 .cse15 .cse3 .cse16 .cse17 .cse4 .cse6 .cse9 .cse18 .cse10 .cse11 .cse12 .cse13 .cse19))))))) [2022-11-19 07:45:57,388 INFO L895 garLoopResultBuilder]: At program point L496(line 496) the Hoare annotation is: false [2022-11-19 07:45:57,389 INFO L902 garLoopResultBuilder]: At program point L942(lines 889 947) the Hoare annotation is: true [2022-11-19 07:45:57,389 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,389 INFO L895 garLoopResultBuilder]: At program point L876-1(line 876) the Hoare annotation is: (let ((.cse9 (= ~m_st~0 0)) (.cse0 (= ~t1_pc~0 1)) (.cse1 (= ~c_dr_st~0 0)) (.cse2 (= ~p_num_write~0 0)) (.cse13 (not (= ~q_read_ev~0 1))) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~t1_i~0 1)) (.cse14 (= ~m_st~0 ~E_M~0)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse15 (= ~q_req_up~0 0)) (.cse8 (= ~p_dw_st~0 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse12 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2))) (or (and .cse0 .cse1 (<= 2 ~E_1~0) .cse2 .cse3 .cse4 .cse5 (not (= ~m_pc~0 1)) .cse6 .cse7 .cse8 (not .cse9) .cse10 .cse11 .cse12) (and .cse1 .cse13 .cse3 (= ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 (= ~m_pc~0 ~t1_pc~0) .cse6 .cse7 (or .cse14 .cse9) .cse15 (= ~t1_st~0 0) (= ~m_i~0 1) .cse8 .cse10 (= ~m_pc~0 0) .cse11 .cse16 .cse12 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse15 .cse8 .cse10 .cse11 .cse16 .cse12 .cse17 .cse18 .cse19))) [2022-11-19 07:45:57,390 INFO L895 garLoopResultBuilder]: At program point L166(lines 132 171) the Hoare annotation is: (let ((.cse17 (= ~c_dr_st~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~m_st~0 0)) (.cse4 (= 1 ~c_dr_i~0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~t1_st~0 0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse9 (= 2 ~p_dw_st~0)) (.cse18 (= ~m_pc~0 0)) (.cse10 (= ~p_dw_i~0 1)) (.cse12 (= ~E_M~0 2)) (.cse13 (<= ~token~0 ~local~0)) (.cse14 (<= ~local~0 ~token~0)) (.cse15 (= ~E_1~0 2))) (or (and .cse0 (not (= ~q_read_ev~0 1)) .cse1 (not (= ~q_read_ev~0 0)) (let ((.cse16 (+ ~c_num_read~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and (= ~c_dr_st~0 2) .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= ~p_num_write~0 .cse16)) (and .cse2 (= .cse16 ~p_num_write~0) .cse3 (not (= ~q_write_ev~0 0)) (not .cse17) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15))) .cse18) (and .cse17 .cse0 (= ~c_num_read~0 0) (<= ~q_buf_0~0 2147483647) .cse2 .cse3 (= ~T1_E~0 2) .cse1 (= ~c_last_read~0 0) .cse4 .cse5 (= |ULTIMATE.start_eval1_~tmp___1~0#1| 1) .cse7 (<= |ULTIMATE.start_eval1_~tmp~2#1| 2147483647) (= ~m_i~0 0) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse8 (<= 0 (+ |ULTIMATE.start_eval1_~tmp~2#1| 2147483648)) (= ~token~0 0) (not (= |ULTIMATE.start_eval1_~tmp~2#1| 0)) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) .cse9 .cse18 .cse10 (= ~p_num_write~0 1) (= |#NULL.offset| 0) .cse12 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) .cse13 .cse14 (= ~q_write_ev~0 ~p_dw_st~0) .cse15 (= ~M_E~0 2) (<= 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0)))) [2022-11-19 07:45:57,391 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse27 (= ~q_free~0 0))) (let ((.cse37 (= ~c_dr_st~0 0)) (.cse1 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse35 (= ~q_req_up~0 1)) (.cse36 (not .cse27)) (.cse13 (= ~p_dw_st~0 0))) (let ((.cse9 (<= ~p_num_write~0 ~c_num_read~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse24 (not .cse13)) (.cse33 (or .cse1 (and .cse35 .cse36))) (.cse25 (not (= ~q_read_ev~0 1))) (.cse2 (= ~c_dr_st~0 2)) (.cse32 (not (= ~q_write_ev~0 0))) (.cse26 (< ~c_num_read~0 ~p_num_write~0)) (.cse34 (not .cse37)) (.cse10 (= ~c_dr_pc~0 1)) (.cse29 (= ~p_dw_pc~0 1)) (.cse31 (not (= ~q_write_ev~0 1))) (.cse19 (<= ~token~0 ~local~0)) (.cse20 (<= ~local~0 ~token~0)) (.cse30 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse28 (not (= ~q_read_ev~0 0))) (.cse0 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~q_req_up~0 0)) (.cse11 (= ~t1_st~0 0)) (.cse12 (= ~q_write_ev~0 2)) (.cse14 (= ~q_read_ev~0 2)) (.cse38 (= ~c_dr_pc~0 0)) (.cse15 (= ~m_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ~E_M~0 2)) (.cse21 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse22 (= ~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 .cse21 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse12 .cse15 .cse16 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse25 .cse5 (or (and .cse1 .cse2 .cse3 .cse4 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse3 .cse4 .cse32 .cse33 .cse34 .cse7 .cse9 .cse10 .cse11 .cse29 .cse13 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23)) .cse28 .cse15) (and .cse25 .cse3 .cse4 .cse32 .cse5 .cse34 .cse7 .cse28 .cse9 .cse10 .cse11 .cse29 (or (not .cse35) .cse36) .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse23) (and .cse24 .cse25 .cse3 .cse4 .cse26 .cse5 .cse34 .cse7 .cse27 .cse28 .cse8 .cse10 .cse11 .cse29 .cse15 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse37 .cse35 .cse0 .cse3 .cse4 .cse33 .cse5 .cse7 .cse27 .cse11 .cse29 .cse12 .cse14 .cse38 .cse15 .cse16 (= ~p_num_write~0 1) .cse18 .cse19 .cse20 (= ~q_write_ev~0 ~p_dw_st~0) .cse22) (and .cse35 .cse25 (let ((.cse39 (= 2 ~p_dw_st~0))) (or (and .cse2 .cse3 .cse4 .cse26 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30) (and .cse3 .cse4 .cse32 .cse26 .cse34 .cse7 .cse27 .cse10 .cse11 .cse29 .cse39 .cse16 .cse31 .cse18 .cse19 .cse20 .cse22 .cse30))) .cse5 .cse28 .cse15) (let ((.cse40 (select |#memory_int| 1))) (and .cse37 (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse0 .cse3 .cse4 (= ~T1_E~0 2) .cse5 .cse6 (= ~c_last_read~0 0) .cse7 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse8 .cse11 (= ~m_i~0 0) .cse12 .cse13 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~local~0 0) (= ~token~0 0) .cse14 .cse38 .cse15 .cse16 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse17 .cse18 (= ~a_t~0 0) (= |ULTIMATE.start_start_simulation1_~kernel_st~0#1| 1) (= (select .cse40 0) 48) .cse21 (= (select .cse40 1) 0) .cse22 (= ~M_E~0 2) (< 0 |#StackHeapBarrier|) (= ~t1_i~0 0) (= |#NULL.base| 0))))))) [2022-11-19 07:45:57,391 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-11-19 07:45:57,392 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 176 224) the Hoare annotation is: (let ((.cse0 (= ~q_req_up~0 1)) (.cse12 (= ~p_dw_pc~0 1)) (.cse21 (= 2 ~p_dw_st~0)) (.cse24 (= ~c_num_read~0 0)) (.cse25 (not (= |ULTIMATE.start_eval1_~tmp___1~0#1| 0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= 1 ~c_dr_i~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~t1_st~0 0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse1 (= ~p_dw_st~0 0)) (.cse26 (= ~q_read_ev~0 2)) (.cse23 (= ~m_pc~0 0)) (.cse13 (= ~p_dw_i~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~E_M~0 2)) (.cse17 (<= ~token~0 ~local~0)) (.cse18 (<= ~local~0 ~token~0)) (.cse19 (= ~E_1~0 2)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and (let ((.cse2 (not (= ~q_read_ev~0 1))) (.cse5 (not (= ~q_write_ev~0 0))) (.cse9 (not (= ~q_read_ev~0 0))) (.cse15 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (not .cse1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20))) .cse22 .cse23) (and .cse0 .cse24 .cse25 .cse3 .cse4 .cse22 .cse7 .cse8 (= ~q_free~0 0) .cse11 .cse12 .cse26 (= ~c_dr_pc~0 0) .cse21 .cse23 .cse13 (= ~p_num_write~0 1) .cse16 .cse17 .cse18 (= ~q_write_ev~0 ~p_dw_st~0) .cse19) (and .cse24 .cse25 .cse3 .cse22 .cse6 .cse7 .cse8 (= ~q_req_up~0 0) .cse10 .cse11 (= ~q_write_ev~0 2) (or (and .cse4 (= ~c_dr_pc~0 1)) (and .cse4 (= ~c_dr_pc~0 ~p_dw_pc~0))) .cse1 .cse26 .cse23 .cse13 .cse14 .cse16 .cse17 .cse18 (= ~q_req_up~0 ~p_dw_pc~0) .cse19 .cse20))) [2022-11-19 07:45:57,393 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse19 (= ~c_dr_st~0 0)) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse16 (= is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (not (= ~E_M~0 2))) (.cse2 (not (<= ~token~0 ~local~0))) (.cse4 (not (= ~m_pc~0 0))) (.cse5 (not (= ~E_1~0 2))) (.cse7 (= ~q_free~0 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (= ~q_read_ev~0 1)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~m_st~0 0))) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse13 (= ~q_read_ev~0 0)) (.cse14 (not (= ~p_dw_i~0 1))) (.cse15 (not (= ~t1_st~0 0))) (.cse17 (not (= 1 ~c_dr_i~0)))) (and (or (not (= ~q_req_up~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not (= (+ ~c_num_read~0 1) ~p_num_write~0)) .cse16 .cse17) (let ((.cse18 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) (not .cse9) (not (= (select .cse18 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse1 (not (= 2 (select |#length| 1))) .cse2 (not (< 0 |#StackHeapBarrier|)) (not .cse19) (not (= (select |#valid| 3) 1)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse6 (not (= (select |#valid| 0) 0)) (not (= (select .cse18 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse10 .cse11 (not (= ~q_ev~0 0)) (not (= ~q_write_ev~0 2)) .cse14 .cse15 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) .cse16 (not (= ~q_read_ev~0 2)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (= ~p_last_write~0 0)) .cse17)) (or .cse19 .cse0 (and (not .cse3) .cse16) .cse1 .cse2 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse4 .cse5 (and (= ~q_req_up~0 1) .cse7) .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) (and .cse3 (<= 1 is_do_write_p_triggered_~__retres1~0)) .cse8 .cse9 .cse10 .cse11 (= ~q_write_ev~0 0) .cse12 .cse13 .cse14 .cse15 (= ~q_write_ev~0 1) .cse17))) [2022-11-19 07:45:57,393 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-11-19 07:45:57,393 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-11-19 07:45:57,393 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-11-19 07:45:57,393 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-11-19 07:45:57,394 INFO L902 garLoopResultBuilder]: At program point is_do_write_p_triggeredENTRY(lines 69 87) the Hoare annotation is: true [2022-11-19 07:45:57,394 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread1ENTRY(lines 259 278) the Hoare annotation is: true [2022-11-19 07:45:57,394 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-11-19 07:45:57,394 INFO L902 garLoopResultBuilder]: At program point error1ENTRY(lines 24 31) the Hoare annotation is: true [2022-11-19 07:45:57,394 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-11-19 07:45:57,394 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-11-19 07:45:57,394 INFO L902 garLoopResultBuilder]: At program point exists_runnable_thread2ENTRY(lines 660 679) the Hoare annotation is: true [2022-11-19 07:45:57,395 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-11-19 07:45:57,396 INFO L895 garLoopResultBuilder]: At program point reset_delta_events1ENTRY(lines 297 314) the Hoare annotation is: (let ((.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse28 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse32 (= ~q_free~0 0)) (.cse15 (= ~c_dr_st~0 0)) (.cse30 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse30)) (.cse4 (not .cse15)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse18 (and (= ~q_req_up~0 1) .cse32)) (.cse20 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse24 (= |old(~q_write_ev~0)| 0)) (.cse26 (not (= ~q_req_up~0 0))) (.cse16 (not (= ~m_pc~0 ~t1_pc~0))) (.cse27 (= |old(~q_read_ev~0)| 1)) (.cse2 (not (= ~E_M~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse5 (not (= ~m_pc~0 0))) (.cse6 (not (= ~E_1~0 2))) (.cse19 (= |old(~q_write_ev~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse21 (= ~m_pc~0 1)) (.cse22 (and .cse13 .cse28)) (.cse29 (not .cse32)) (.cse8 (not (<= ~local~0 ~token~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (= ~c_dr_pc~0 1))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~t1_st~0 0))) (.cse31 (not (= (+ ~c_num_read~0 1) ~p_num_write~0))) (.cse25 (= |old(~q_read_ev~0)| 0)) (.cse14 (not (= 1 ~c_dr_i~0)))) (and (let ((.cse1 (select |#memory_int| 1))) (or (not (= ~a_t~0 0)) .cse0 (not (= (select .cse1 0) 48)) (not (= |#NULL.offset| 0)) (not (= ~M_E~0 2)) (not (= ~t1_i~0 0)) (not (= ~q_req_up~0 ~p_dw_pc~0)) .cse2 (not (= 2 (select |#length| 1))) .cse3 (not (< 0 |#StackHeapBarrier|)) .cse4 (not (= (select |#valid| 3) 1)) .cse5 (not (= ~p_num_write~0 0)) .cse6 (not (= ~T1_E~0 2)) (not (= ~p_dw_pc~0 0)) (not (= (select |#length| 3) 12)) .cse7 (not (= (select |#valid| 0) 0)) (not (= (select .cse1 1) 0)) (not (= ~t1_pc~0 0)) (not (= ~c_num_read~0 0)) (not (= (select |#valid| 1) 1)) (not (= 19 (select |#length| 2))) .cse8 (not (= ~token~0 0)) (not (= |#NULL.base| 0)) .cse9 .cse10 (not (= |old(~q_read_ev~0)| 2)) (not (= ~q_ev~0 0)) .cse11 .cse12 (not (= (select |#valid| 2) 1)) (not (= ~q_free~0 1)) (not (= ~m_i~0 0)) (not (= 2 |old(~q_write_ev~0)|)) (not (= ~c_last_read~0 ~p_last_write~0)) (and .cse13 (= ~q_read_ev~0 2)) (not (= ~p_last_write~0 0)) .cse14)) (or .cse15 .cse16 .cse0 .cse2 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse25 .cse14) (or .cse26 .cse16 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse28 (= ~q_write_ev~0 1)) .cse21 .cse29 (not .cse19) .cse8 .cse30 .cse9 .cse10 .cse23 .cse11 .cse12 .cse31 .cse25 .cse14) (or .cse15 .cse16 .cse27 .cse2 .cse3 .cse17 .cse5 .cse6 .cse18 .cse19 .cse7 .cse20 .cse21 .cse22 .cse8 .cse9 .cse10 .cse23 .cse11 .cse24 .cse12 .cse25 .cse14) (or .cse15 .cse26 .cse16 .cse27 .cse2 .cse3 .cse5 .cse6 .cse19 .cse7 .cse21 .cse22 .cse29 .cse8 .cse30 .cse9 .cse10 .cse23 .cse11 .cse12 .cse31 .cse25 .cse14)))) [2022-11-19 07:45:57,396 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-11-19 07:45:57,396 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-11-19 07:45:57,397 INFO L895 garLoopResultBuilder]: At program point reset_delta_events2ENTRY(lines 759 786) the Hoare annotation is: (let ((.cse18 (= ~m_st~0 0)) (.cse21 (= ~E_M~0 2))) (let ((.cse0 (not (= ~q_req_up~0 0))) (.cse2 (and .cse21 (= ~E_1~0 2))) (.cse3 (not (<= ~token~0 ~local~0))) (.cse4 (= ~q_read_ev~0 1)) (.cse6 (not (= 2 |old(~E_1~0)|))) (.cse13 (not (<= ~local~0 ~token~0))) (.cse15 (and (not (= ~m_st~0 |old(~E_M~0)|)) (not .cse18))) (.cse17 (= ~q_write_ev~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse7 (not (= 2 |old(~E_M~0)|))) (.cse20 (not (= ~p_num_write~0 0))) (.cse8 (not (= ~t1_i~0 1))) (.cse9 (not (= ~p_dw_pc~0 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= ~q_free~0 0))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 (not (= ~m_i~0 1)) .cse4 .cse5 .cse6 (not (= ~m_pc~0 0)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (= ~c_num_read~0 ~p_num_write~0)) .cse13 .cse14 .cse15 (not (= ~t1_st~0 0)) .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse18 .cse4 .cse19 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse1 .cse18 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 (not (<= 2 |old(~E_1~0)|)) (= ~m_pc~0 1) .cse11 .cse12 (and (= ~E_1~0 |old(~E_1~0)|) .cse21) .cse14 .cse16)))) [2022-11-19 07:45:57,400 INFO L444 BasicCegarLoop]: Path program histogram: [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] [2022-11-19 07:45:57,403 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:45:57,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:45:57 BoogieIcfgContainer [2022-11-19 07:45:57,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:45:57,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:45:57,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:45:57,565 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:45:57,565 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:55" (3/4) ... [2022-11-19 07:45:57,569 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 07:45:57,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-11-19 07:45:57,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-11-19 07:45:57,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-11-19 07:45:57,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-11-19 07:45:57,577 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-11-19 07:45:57,578 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-11-19 07:45:57,578 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-11-19 07:45:57,578 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-11-19 07:45:57,589 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 72 nodes and edges [2022-11-19 07:45:57,590 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2022-11-19 07:45:57,591 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-11-19 07:45:57,592 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 07:45:57,619 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || (((q_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(\old(q_ev) == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(m_pc == 0)) || !(E_1 == 2)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && (((((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up)) || (((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\old(q_req_up) == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(\old(q_req_up) == 1)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)))) || p_dw_st == 0) || !(m_st == 0)) [2022-11-19 07:45:57,621 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || \old(m_st) == 0) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && 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) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1)) [2022-11-19 07:45:57,624 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || (((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || (((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && c_last_read == p_last_write)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && q_free == 0) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) [2022-11-19 07:45:57,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) [2022-11-19 07:45:57,625 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) [2022-11-19 07:45:57,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 07:45:57,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:45:57,714 INFO L158 Benchmark]: Toolchain (without parser) took 484344.37ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 87.1MB in the beginning and 541.7MB in the end (delta: -454.7MB). Peak memory consumption was 807.2MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,715 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:45:57,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 443.55ms. Allocated memory is still 117.4MB. Free memory was 87.1MB in the beginning and 87.7MB in the end (delta: -682.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.12ms. Allocated memory is still 117.4MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,723 INFO L158 Benchmark]: Boogie Preprocessor took 94.66ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,724 INFO L158 Benchmark]: RCFGBuilder took 1234.83ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 82.4MB in the beginning and 110.8MB in the end (delta: -28.4MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,724 INFO L158 Benchmark]: TraceAbstraction took 482307.00ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.1MB in the beginning and 552.2MB in the end (delta: -442.1MB). Peak memory consumption was 873.2MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,725 INFO L158 Benchmark]: Witness Printer took 149.90ms. Allocated memory is still 1.4GB. Free memory was 552.2MB in the beginning and 541.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:45:57,726 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 117.4MB. Free memory was 70.3MB in the beginning and 70.2MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 443.55ms. Allocated memory is still 117.4MB. Free memory was 87.1MB in the beginning and 87.7MB in the end (delta: -682.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.12ms. Allocated memory is still 117.4MB. Free memory was 87.7MB in the beginning and 85.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.66ms. Allocated memory is still 117.4MB. Free memory was 85.2MB in the beginning and 82.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1234.83ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 82.4MB in the beginning and 110.8MB in the end (delta: -28.4MB). Peak memory consumption was 48.0MB. Max. memory is 16.1GB. * TraceAbstraction took 482307.00ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 110.1MB in the beginning and 552.2MB in the end (delta: -442.1MB). Peak memory consumption was 873.2MB. Max. memory is 16.1GB. * Witness Printer took 149.90ms. Allocated memory is still 1.4GB. Free memory was 552.2MB in the beginning and 541.7MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 496]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 28]: 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 15 procedures, 139 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 482.1s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 90.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 146.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17204 SdHoareTripleChecker+Valid, 28.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17096 mSDsluCounter, 21908 SdHoareTripleChecker+Invalid, 23.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16403 mSDsCounter, 8578 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28068 IncrementalHoareTripleChecker+Invalid, 36646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8578 mSolverCounterUnsat, 5505 mSDtfsCounter, 28068 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4725 GetRequests, 3420 SyntacticMatches, 63 SemanticMatches, 1242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91229 ImplicationChecksByTransitivity, 191.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2205occurred in iteration=20, InterpolantAutomatonStates: 745, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 9.0s AutomataMinimizationTime, 32 MinimizatonAttempts, 5919 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 73 LocationsWithAnnotation, 4064 PreInvPairs, 4445 NumberOfFragments, 18392 HoareAnnotationTreeSize, 4064 FomulaSimplifications, 87776 FormulaSimplificationTreeSizeReduction, 77.7s HoareSimplificationTime, 73 FomulaSimplificationsInter, 2861876 FormulaSimplificationTreeSizeReductionInter, 68.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 4692 NumberOfCodeBlocks, 4657 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 5685 ConstructedInterpolants, 0 QuantifiedInterpolants, 15995 SizeOfPredicates, 70 NumberOfNonLiveVariables, 7999 ConjunctsInSsa, 318 ConjunctsInUnsatCore, 60 InterpolantComputations, 25 PerfectInterpolantSequences, 3241/3707 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: OVERALL_TIME: 2.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 8, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 54, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 59, TOOLS_POST_TIME: 0.9s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.3s, TOOLS_POST_RETURN_APPLICATIONS: 18, TOOLS_POST_RETURN_TIME: 0.3s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 102, TOOLS_QUANTIFIERELIM_TIME: 1.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 162, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 21, DOMAIN_JOIN_TIME: 0.6s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 54, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 18, CALL_SUMMARIZER_CACHE_MISSES: 7, CALL_SUMMARIZER_OVERALL_TIME: 0.1s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.1s, DAG_COMPRESSION_PROCESSED_NODES: 888, DAG_COMPRESSION_RETAINED_NODES: 150, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 180]: Loop Invariant Derived loop invariant: ((m_st == 0 && tmp___1 == 1) && m_pc == 0) && ((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((q_req_up == 1 && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && 2 <= t1_st) && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) - InvariantResult [Line: 923]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 897]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2 - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(q_req_up == 0) || !(m_pc == t1_pc)) || !(E_M == 2)) || !(token <= local)) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(c_num_read + 1 == p_num_write)) || __retres1 == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_ev == 0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(m_i == 0)) || __retres1 == 0) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || (!(q_read_ev == 1) && __retres1 == 0)) || !(E_M == 2)) || !(token <= local)) || !(c_num_read < p_num_write + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || (q_read_ev == 1 && 1 <= __retres1)) || !(local <= token)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && m_st == 2) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) || (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 567]: Loop Invariant Derived loop invariant: (((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) && !(tmp == 0)) || (((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || (((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && !(m_pc == t1_pc)) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0))) || ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && (\result == 1 || !(t1_st == 0))) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && kernel_st == 0) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && q_ev == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && token <= local) && local <= token) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0 - InvariantResult [Line: 660]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 927]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 226]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || (((q_ev == \old(q_ev) && q_write_ev == \old(q_write_ev)) && q_read_ev == 2) && q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || !(\old(q_ev) == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_pc == \old(q_req_up))) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(\old(q_req_up) == 0)) || !(m_i == 0)) || !(2 == \old(q_write_ev))) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || ((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up))) || !(m_pc == 0)) || !(E_1 == 2)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || (\old(q_req_up) == 1 && q_free == 0)) || \old(q_write_ev) == 0) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i))) && (((((q_write_ev == \old(q_write_ev) && \old(q_read_ev) == q_read_ev) && q_req_up == \old(q_req_up)) || (((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\old(q_req_up) == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)) && ((((((((((((((((((((c_dr_st == 0 || (!(m_st == E_M) && !(m_st == 0))) || !(m_pc == t1_pc)) || \old(q_read_ev) == 1) || !(E_M == 2)) || !(\old(q_req_up) == 1)) || !(token <= local)) || !(p_num_write <= c_num_read + 1)) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || \old(q_write_ev) == 1) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || \old(q_read_ev) == 0) || !(1 == c_dr_i)))) || p_dw_st == 0) || !(m_st == 0)) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(q_read_ev == 1)) || !(E_M == 2)) || !(token <= local)) || __retres1 == 0) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) && ((((((((((((((((((((((!(q_req_up == 0) || !(m_pc == t1_pc)) || !(E_M == 2)) || (__retres1 == 0 && !(q_write_ev == 1))) || !(token <= local)) || (c_dr_st == 0 && !(q_write_ev == 1))) || !(p_num_write <= c_num_read + 1)) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || (1 <= __retres1 && q_write_ev == 1)) || !(1 == c_dr_i))) && ((((((((((((((((((((((((((((((((((((((((((!(a_t == 0) || !(p_dw_st == 0)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(M_E == 2)) || !(t1_i == 0)) || !(q_req_up == p_dw_pc)) || !(E_M == 2)) || !(2 == unknown-#length-unknown[1])) || !(token <= local)) || __retres1 == 0) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(c_dr_st == 0)) || !(\valid[3] == 1)) || !(m_pc == 0)) || !(p_num_write == 0)) || !(E_1 == 2)) || !(T1_E == 2)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(t1_pc == 0)) || !(c_num_read == 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(local <= token)) || !(token == 0)) || !(#NULL == 0)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || !(q_ev == 0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(t1_st == 0)) || !(\valid[2] == 1)) || !(q_free == 1)) || !(m_i == 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(p_last_write == 0)) || !(1 == c_dr_i))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(E_M == 2)) || !(token <= local)) || __retres1 == 0) || q_read_ev == 1) || !(m_pc == 0)) || !(E_1 == 2)) || (q_req_up == 1 && q_free == 0)) || !(p_last_write == q_buf_0)) || m_pc == 1) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(m_st == 0)) || q_write_ev == 0) || !(c_dr_pc == 1)) || q_read_ev == 0) || !(p_dw_i == 1)) || !(t1_st == 0)) || q_write_ev == 1) || !(1 == c_dr_i)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((!(p_dw_st == 0) && m_st == 0) && m_pc == 0) && ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && (m_st == E_M || m_st == 0)) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((((q_req_up == 1 && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && (m_st == E_M || m_st == 0)) && !(q_read_ev == 0)) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1))) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || (((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && (((((((((((((((!(p_dw_st == 0) || (((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1))) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || \old(m_st) == 0) || ((((((((((((c_dr_st == 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) && c_dr_pc == p_dw_pc) && c_dr_pc == 0) && c_last_read == p_last_write)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((((((((m_st == 0 || m_st == \old(m_st)) && t1_st == 0) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && __retres1 == 0) || !(\old(t1_st) == 0)) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || (((((((((((((c_dr_st == 0 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (m_st == 0 || m_st == \old(m_st))) && q_free == 0) && c_dr_pc == p_dw_pc) && ((0 == __retres1 && !(m_st == 0)) || \old(m_st) == 0)) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((q_req_up == 1 && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && (((((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((p_last_write == q_buf_0 && c_num_read + 1 == p_num_write) && m_pc == t1_pc) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2))) && m_pc == 0) || (((((((((((((((((((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && q_buf_0 <= 2147483647) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_last_read == 0) && 1 == c_dr_i) && q_free == 0) && tmp___1 == 1) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && 0 <= tmp + 2147483648) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && #NULL == 0) && E_M == 2) && a_t == 0) && kernel_st == 1) && token <= local) && local <= token) && q_write_ev == p_dw_st) && E_1 == 2) && M_E == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && p_last_write == 0) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && tmp___1 == 1) && q_req_up == 0) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && q_write_ev == 2) && p_dw_st == 1) && 0 <= tmp + 2147483648) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && #NULL == 0) && E_M == 2) && a_t == 0) && kernel_st == 1) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && M_E == 2) && 0 <= unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) || (((((!(p_dw_st == 0) && !(q_read_ev == 1)) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0) && (((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((!(tmp___1 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && ((p_dw_pc == 0 && m_pc == t1_pc) || (m_pc == t1_pc && p_dw_pc == 1))) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1))) - InvariantResult [Line: 962]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && unknown-#length-unknown[3] == 12) && c_num_read == 0) && c_num_read == p_num_write) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && c_last_read == 0) && 0 == c_dr_i) && q_free == 0) && 2 == unknown-#length-unknown[1]) && c_dr_pc == p_dw_pc) && \valid[3] == 1) && q_req_up == 0) && aux-__VERIFIER_nondet_int()-aux <= 2147483647) && t1_st == 0) && q_ev == 0) && p_dw_i == 0) && m_i == 0) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_write_ev == 0) && c_dr_pc == 0) && m_pc == 0) && \valid[0] == 0) && q_read_ev == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && token <= local) && local <= token) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) && 0 <= 2147483648 + aux-__VERIFIER_nondet_int()-aux - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: m_pc == t1_pc && !(m_pc == 1) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && E_M == 2) || (((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && (m_st == E_M || m_st == 0)) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) && m_st == 0) && m_pc == 0) || (((((((((((((((((((((q_req_up == 1 && c_num_read == 0) && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && t1_st == 0) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && E_M == 2) && token <= local) && local <= token) && q_write_ev == p_dw_st) && E_1 == 2)) || ((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_req_up == 0) && p_num_write <= c_num_read) && t1_st == 0) && q_write_ev == 2) && ((m_pc == t1_pc && c_dr_pc == 1) || (m_pc == t1_pc && c_dr_pc == p_dw_pc))) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && tmp___1 == 1) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && q_write_ev == 2) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && E_1 == 2) || (((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && m_st == 0) && (((((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && E_1 == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read < p_num_write) && (p_dw_pc == 1 || ((p_dw_pc == 0 && q_write_ev == 2) && q_read_ev == 2))) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && E_1 == 2) && p_num_write <= c_num_read + 1))) && !(q_read_ev == 0))) || (((((((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && tmp___1 == 1) && q_req_up == 0) && t1_st == 0) && tmp <= 2147483647) && m_i == 0) && q_write_ev == 2) && p_dw_st == 1) && 0 <= tmp + 2147483648) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && !(tmp == 0)) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && kernel_st == 1) && unknown-#memory_int-unknown[1][0] == 48) && token <= local) && local <= token) && q_req_up == p_dw_pc) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0)) || ((((((((((((((((((((((((((((((((((((((((((((((((((((((((m_i <= 0 && c_dr_st == 0) && T1_E <= 2) && 2 <= E_1) && 0 <= #NULL) && 0 <= m_i) && 0 <= q_free) && 1 <= c_dr_i) && p_last_write == q_buf_0) && c_num_read <= 0) && c_last_read <= 0) && p_dw_pc <= 0) && 0 <= t1_i) && 2 <= E_M) && c_dr_i <= 1) && 1 <= p_dw_st) && 1 <= tmp___1) && 1 <= q_req_up) && a_t <= 0) && kernel_st <= 1) && 2 <= M_E) && #NULL <= 0) && 2 <= T1_E) && t1_st == 0) && tmp <= 2147483647) && p_num_write <= 1) && local <= 0) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && 1 <= kernel_st) && 0 <= tmp + 2147483648) && q_req_up <= 1) && 0 <= token) && 0 <= a_t) && #NULL <= 0) && !(tmp == 0)) && q_read_ev == 2) && q_free <= 0) && t1_i <= 0) && c_dr_pc == 0) && tmp___1 <= 1) && m_pc == 0) && p_dw_i == 1) && M_E <= 2) && m_st <= 0) && p_last_write <= 2147483647) && p_dw_st <= 1) && token <= local) && 1 <= p_num_write) && 0 <= m_st) && E_1 <= 2) && 0 <= #NULL) && (((p_dw_pc == 0 && m_pc == t1_pc) && !(m_pc == 1)) || ((m_pc == t1_pc && !(m_pc == 1)) && p_dw_pc == 1))) && 0 <= unknown-#StackHeapBarrier-unknown) && E_M <= 2) && 0 <= c_num_read) && 0 <= c_last_read) - InvariantResult [Line: 519]: Loop Invariant Derived loop invariant: ((((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && local + 1 <= token) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && token < 2 + local) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0)) || ((((((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && !(q_read_ev == 1)) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && !(tmp == 0))) || ((((((((((((((((((((((c_dr_st == 0 && !(q_read_ev == 1)) && c_num_read == 0) && c_num_read == p_num_write) && t1_i == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 0) && c_dr_pc == p_dw_pc) && q_req_up == 0) && t1_st == 0) && m_i == 1) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && m_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && !(tmp == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(p_dw_st == 0) || !(E_M == 2)) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || !(m_i == 1)) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(E_1 == 1)) || ((((((((t1_i == 1 && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && m_st == \old(m_st)) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && ((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || \old(m_st) == 0) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(p_num_write == 0)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(token < 2 + local)) || !(c_num_read == 0)) || !(q_free == 0)) || !(local + 1 <= token)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && 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) && c_dr_pc == p_dw_pc) && 1 == __retres1) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1)) || !(E_M == 1))) && (((((((((((((((((((!(p_dw_st == 0) || m_st == E_M) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || !(t1_pc == 1)) || !(c_dr_st == 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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((((((((!(\old(t1_st) == 0) || !(q_req_up == 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((0 == __retres1 || \old(m_st) == 0) && m_st == \old(m_st)) && t1_st == 0)) || !(E_M == 2)) || !(token <= local)) || !(m_i == 1)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(c_dr_st == 0)) || !(m_pc == 0)) || !(E_1 == 2)) || !(t1_i == 1)) || !(p_dw_pc == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_num_read == p_num_write)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1)) && (((((((((((((((((((((!(q_req_up == 0) || !(p_dw_st == 0)) || (((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && c_num_read == 0) && t1_i == 1) && m_st == E_M) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(E_M == 2)) || \old(m_st) == 0) || !(token <= local)) || (!(\old(m_st) == 0) && !(E_M == \old(m_st)))) || q_read_ev == 1) || !(t1_pc == 1)) || !(c_dr_st == 0)) || !(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)) || !(local <= token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || q_write_ev == 1) || !(2 <= E_1))) && (((((((((((((((!(p_dw_st == 0) || \old(m_st) == 0) || !(t1_pc == 1)) || !(c_dr_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)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || (((((((((((((((t1_pc == 1 && c_dr_st == 0) && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && t1_i == 1) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && (0 == __retres1 || \old(m_st) == 0)) && !(m_pc == 1)) && q_free == 0) && c_dr_pc == p_dw_pc) && p_dw_st == 0) && !(m_st == 0)) && c_dr_pc == 0) && c_last_read == p_last_write)) || !(2 <= E_1)) || !(E_M == 1)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((((!(q_read_ev == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && !(q_read_ev == 1)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && q_free == 1) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) && m_st == 0) && m_pc == 0) - InvariantResult [Line: 424]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && token <= local) && local <= token) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0)) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((c_num_read == 0 && !(tmp___1 == 0)) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && m_st == 0) && q_free == 1) && 1 == c_dr_i) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && q_write_ev == 2) && p_dw_st == 0) && q_read_ev == 2) && m_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && E_M == 2) && token <= local) && local <= token) && q_req_up == p_dw_pc) && E_1 == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && m_pc == 0) && p_dw_i == 1) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) || ((((!(q_read_ev == 1) && m_st == 0) && (((((((((((((((((!(tmp___1 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && m_pc == t1_pc) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(q_write_ev == 0)) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1))) && !(q_read_ev == 0)) && m_pc == 0)) || ((((((((((((((((((((!(q_read_ev == 1) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && !(q_read_ev == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && (!(q_req_up == 1) || !(q_free == 0))) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((!(p_dw_st == 0) && !(q_read_ev == 1)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && m_st == 0) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && !(q_read_ev == 0)) && q_req_up == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && m_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((c_dr_st == 0 && q_req_up == 1) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && (!(tmp___1 == 0) || (q_req_up == 1 && !(q_free == 0)))) && m_st == 0) && 1 == c_dr_i) && q_free == 0) && t1_st == 0) && p_dw_pc == 1) && q_write_ev == 2) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && p_num_write == 1) && E_M == 2) && token <= local) && local <= token) && q_write_ev == p_dw_st) && E_1 == 2)) || (((((q_req_up == 1 && !(q_read_ev == 1)) && (((((((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1) || (((((((((((((((((p_last_write == q_buf_0 && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && !(c_dr_st == 0)) && 1 == c_dr_i) && q_free == 0) && c_dr_pc == 1) && t1_st == 0) && p_dw_pc == 1) && 2 == p_dw_st) && p_dw_i == 1) && !(q_write_ev == 1)) && E_M == 2) && token <= local) && local <= token) && E_1 == 2) && p_num_write <= c_num_read + 1))) && m_st == 0) && !(q_read_ev == 0)) && m_pc == 0)) || ((((((((((((((((((((((((((((((((((((((((c_dr_st == 0 && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && T1_E == 2) && m_st == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_req_up == 0) && t1_st == 0) && m_i == 0) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && local == 0) && token == 0) && q_read_ev == 2) && c_dr_pc == 0) && m_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && E_M == 2) && a_t == 0) && kernel_st == 1) && unknown-#memory_int-unknown[1][0] == 48) && q_req_up == p_dw_pc) && unknown-#memory_int-unknown[1][1] == 0) && E_1 == 2) && M_E == 2) && 0 < unknown-#StackHeapBarrier-unknown) && t1_i == 0) && #NULL == 0) RESULT: Ultimate proved your program to be correct! [2022-11-19 07:45:57,812 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5412c02-0b26-4a8d-afc8-8411da2bf1c3/bin/utaipan-I9t0OCRTmS/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