./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.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_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-2329fc7 [2022-12-13 11:48:58,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:48:58,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:48:58,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:48:58,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:48:58,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:48:58,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:48:58,271 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:48:58,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:48:58,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:48:58,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:48:58,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:48:58,276 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:48:58,277 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:48:58,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:48:58,279 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:48:58,280 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:48:58,281 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:48:58,283 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:48:58,285 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:48:58,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:48:58,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:48:58,289 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:48:58,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:48:58,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:48:58,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:48:58,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:48:58,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:48:58,295 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:48:58,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:48:58,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:48:58,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:48:58,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:48:58,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:48:58,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:48:58,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:48:58,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:48:58,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:48:58,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:48:58,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:48:58,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:48:58,303 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 11:48:58,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:48:58,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:48:58,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:48:58,324 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:48:58,325 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:48:58,325 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:48:58,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:48:58,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:48:58,327 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:48:58,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:48:58,327 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:48:58,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:48:58,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:48:58,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 11:48:58,329 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:48:58,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 11:48:58,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:48:58,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:48:58,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:48:58,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:48:58,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:48:58,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:48:58,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 11:48:58,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:48:58,331 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:48:58,332 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/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_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f24e14c02d3357f8669328b41c4b37af446f7269afa24af78cb772dc24fa0c01 [2022-12-13 11:48:58,516 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:48:58,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:48:58,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:48:58,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:48:58,537 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:48:58,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-12-13 11:49:01,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:49:01,294 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:49:01,295 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-12-13 11:49:01,304 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/data/93c58982b/afac49d0b2934527af882a5050003fca/FLAGf2c1005c6 [2022-12-13 11:49:01,318 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/data/93c58982b/afac49d0b2934527af882a5050003fca [2022-12-13 11:49:01,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:49:01,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:49:01,324 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:01,324 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:49:01,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:49:01,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1f02d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01, skipping insertion in model container [2022-12-13 11:49:01,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:49:01,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:49:01,478 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-12-13 11:49:01,522 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-12-13 11:49:01,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:01,562 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:49:01,571 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[914,927] [2022-12-13 11:49:01,591 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.01.cil-1.c[7115,7128] [2022-12-13 11:49:01,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:49:01,624 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:49:01,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01 WrapperNode [2022-12-13 11:49:01,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:49:01,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:01,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:49:01,626 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:49:01,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,640 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,667 INFO L138 Inliner]: procedures = 55, calls = 60, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 402 [2022-12-13 11:49:01,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:49:01,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:49:01,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:49:01,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:49:01,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,698 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:49:01,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:49:01,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:49:01,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:49:01,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (1/1) ... [2022-12-13 11:49:01,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:49:01,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:01,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:49:01,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:49:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:49:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-12-13 11:49:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-12-13 11:49:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-12-13 11:49:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-12-13 11:49:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-12-13 11:49:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-12-13 11:49:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-12-13 11:49:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-12-13 11:49:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-12-13 11:49:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-12-13 11:49:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-12-13 11:49:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-12-13 11:49:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:49:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:49:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-12-13 11:49:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-12-13 11:49:01,846 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:49:01,847 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:49:02,170 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:49:02,180 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:49:02,181 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-12-13 11:49:02,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:02 BoogieIcfgContainer [2022-12-13 11:49:02,183 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:49:02,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:49:02,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:49:02,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:49:02,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:49:01" (1/3) ... [2022-12-13 11:49:02,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a3b322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:02, skipping insertion in model container [2022-12-13 11:49:02,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:49:01" (2/3) ... [2022-12-13 11:49:02,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a3b322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:49:02, skipping insertion in model container [2022-12-13 11:49:02,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:02" (3/3) ... [2022-12-13 11:49:02,206 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.01.cil-1.c [2022-12-13 11:49:02,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:49:02,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 11:49:02,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:49:02,274 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@14be4f77, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:49:02,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-12-13 11:49:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 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-12-13 11:49:02,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 11:49:02,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:02,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:02,290 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:02,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1497674214, now seen corresponding path program 1 times [2022-12-13 11:49:02,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:02,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332678025] [2022-12-13 11:49:02,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:02,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:02,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:02,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:02,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332678025] [2022-12-13 11:49:02,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332678025] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:02,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:02,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:49:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709864964] [2022-12-13 11:49:02,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:02,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:02,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:02,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:49:02,682 INFO L87 Difference]: Start difference. First operand has 208 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 168 states have internal predecessors, (248), 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 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:03,316 INFO L93 Difference]: Finished difference Result 530 states and 790 transitions. [2022-12-13 11:49:03,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:49:03,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2022-12-13 11:49:03,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:03,329 INFO L225 Difference]: With dead ends: 530 [2022-12-13 11:49:03,329 INFO L226 Difference]: Without dead ends: 329 [2022-12-13 11:49:03,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:03,335 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 524 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:03,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 641 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:49:03,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-12-13 11:49:03,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2022-12-13 11:49:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 227 states have (on average 1.4317180616740088) internal successors, (325), 232 states have internal predecessors, (325), 39 states have call successors, (39), 20 states have call predecessors, (39), 20 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2022-12-13 11:49:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 404 transitions. [2022-12-13 11:49:03,408 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 404 transitions. Word has length 57 [2022-12-13 11:49:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:03,408 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 404 transitions. [2022-12-13 11:49:03,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 404 transitions. [2022-12-13 11:49:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 11:49:03,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:03,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:03,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:49:03,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:03,413 INFO L85 PathProgramCache]: Analyzing trace with hash -604187876, now seen corresponding path program 1 times [2022-12-13 11:49:03,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:03,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252630152] [2022-12-13 11:49:03,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:03,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:03,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:03,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:03,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252630152] [2022-12-13 11:49:03,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252630152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:03,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:03,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:03,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081058857] [2022-12-13 11:49:03,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:03,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:03,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:03,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:03,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:03,576 INFO L87 Difference]: Start difference. First operand 288 states and 404 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:04,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:04,206 INFO L93 Difference]: Finished difference Result 620 states and 878 transitions. [2022-12-13 11:49:04,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:49:04,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2022-12-13 11:49:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:04,209 INFO L225 Difference]: With dead ends: 620 [2022-12-13 11:49:04,209 INFO L226 Difference]: Without dead ends: 437 [2022-12-13 11:49:04,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:49:04,211 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 505 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:04,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 910 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:49:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2022-12-13 11:49:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 373. [2022-12-13 11:49:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.423728813559322) internal successors, (420), 301 states have internal predecessors, (420), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-12-13 11:49:04,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 521 transitions. [2022-12-13 11:49:04,256 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 521 transitions. Word has length 57 [2022-12-13 11:49:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:04,257 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 521 transitions. [2022-12-13 11:49:04,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:04,257 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 521 transitions. [2022-12-13 11:49:04,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 11:49:04,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:04,259 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:04,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:49:04,259 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:04,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:04,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1641391578, now seen corresponding path program 1 times [2022-12-13 11:49:04,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:04,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960725392] [2022-12-13 11:49:04,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:04,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960725392] [2022-12-13 11:49:04,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960725392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:04,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:04,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249799184] [2022-12-13 11:49:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:04,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:04,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:04,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:04,373 INFO L87 Difference]: Start difference. First operand 373 states and 521 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:04,777 INFO L93 Difference]: Finished difference Result 703 states and 997 transitions. [2022-12-13 11:49:04,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:49:04,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2022-12-13 11:49:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:04,780 INFO L225 Difference]: With dead ends: 703 [2022-12-13 11:49:04,780 INFO L226 Difference]: Without dead ends: 435 [2022-12-13 11:49:04,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:04,783 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 452 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:04,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 594 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-12-13 11:49:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 373. [2022-12-13 11:49:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 301 states have internal predecessors, (417), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-12-13 11:49:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 518 transitions. [2022-12-13 11:49:04,815 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 518 transitions. Word has length 57 [2022-12-13 11:49:04,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:04,815 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 518 transitions. [2022-12-13 11:49:04,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 518 transitions. [2022-12-13 11:49:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 11:49:04,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:04,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:04,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:49:04,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:04,818 INFO L85 PathProgramCache]: Analyzing trace with hash 743998300, now seen corresponding path program 1 times [2022-12-13 11:49:04,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:04,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57000319] [2022-12-13 11:49:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:04,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:04,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:04,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57000319] [2022-12-13 11:49:04,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57000319] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:04,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:04,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:04,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420136556] [2022-12-13 11:49:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:04,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:04,930 INFO L87 Difference]: Start difference. First operand 373 states and 518 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:05,438 INFO L93 Difference]: Finished difference Result 739 states and 1054 transitions. [2022-12-13 11:49:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:49:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2022-12-13 11:49:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:05,443 INFO L225 Difference]: With dead ends: 739 [2022-12-13 11:49:05,443 INFO L226 Difference]: Without dead ends: 472 [2022-12-13 11:49:05,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:49:05,446 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:05,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 834 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:49:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-13 11:49:05,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 382. [2022-12-13 11:49:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 304 states have (on average 1.4013157894736843) internal successors, (426), 310 states have internal predecessors, (426), 49 states have call successors, (49), 26 states have call predecessors, (49), 27 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2022-12-13 11:49:05,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 527 transitions. [2022-12-13 11:49:05,488 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 527 transitions. Word has length 57 [2022-12-13 11:49:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:05,489 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 527 transitions. [2022-12-13 11:49:05,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 527 transitions. [2022-12-13 11:49:05,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 11:49:05,490 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:05,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:05,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:49:05,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:05,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 671611742, now seen corresponding path program 1 times [2022-12-13 11:49:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:05,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594092690] [2022-12-13 11:49:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:05,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:05,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:05,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594092690] [2022-12-13 11:49:05,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594092690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:05,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:05,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:05,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357703336] [2022-12-13 11:49:05,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:05,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:05,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:05,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:05,617 INFO L87 Difference]: Start difference. First operand 382 states and 527 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:06,521 INFO L93 Difference]: Finished difference Result 1537 states and 2220 transitions. [2022-12-13 11:49:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:49:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 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 57 [2022-12-13 11:49:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:06,528 INFO L225 Difference]: With dead ends: 1537 [2022-12-13 11:49:06,528 INFO L226 Difference]: Without dead ends: 1261 [2022-12-13 11:49:06,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-12-13 11:49:06,530 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 960 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 930 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:06,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 800 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 930 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:49:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2022-12-13 11:49:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1090. [2022-12-13 11:49:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1090 states, 865 states have (on average 1.3734104046242774) internal successors, (1188), 886 states have internal predecessors, (1188), 136 states have call successors, (136), 80 states have call predecessors, (136), 87 states have return successors, (187), 126 states have call predecessors, (187), 134 states have call successors, (187) [2022-12-13 11:49:06,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1511 transitions. [2022-12-13 11:49:06,616 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1511 transitions. Word has length 57 [2022-12-13 11:49:06,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:06,616 INFO L495 AbstractCegarLoop]: Abstraction has 1090 states and 1511 transitions. [2022-12-13 11:49:06,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 11:49:06,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1511 transitions. [2022-12-13 11:49:06,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:06,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:06,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:06,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:49:06,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:06,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:06,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1385451018, now seen corresponding path program 1 times [2022-12-13 11:49:06,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:06,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105590649] [2022-12-13 11:49:06,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105590649] [2022-12-13 11:49:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105590649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:06,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:06,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:06,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331458147] [2022-12-13 11:49:06,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:06,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:06,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:06,708 INFO L87 Difference]: Start difference. First operand 1090 states and 1511 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:07,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:07,291 INFO L93 Difference]: Finished difference Result 1313 states and 1826 transitions. [2022-12-13 11:49:07,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 11:49:07,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 11:49:07,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:07,297 INFO L225 Difference]: With dead ends: 1313 [2022-12-13 11:49:07,297 INFO L226 Difference]: Without dead ends: 1225 [2022-12-13 11:49:07,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:07,299 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 545 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:07,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 798 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:49:07,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2022-12-13 11:49:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1186. [2022-12-13 11:49:07,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 941 states have (on average 1.3740701381509033) internal successors, (1293), 964 states have internal predecessors, (1293), 147 states have call successors, (147), 87 states have call predecessors, (147), 96 states have return successors, (203), 138 states have call predecessors, (203), 145 states have call successors, (203) [2022-12-13 11:49:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1643 transitions. [2022-12-13 11:49:07,415 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1643 transitions. Word has length 65 [2022-12-13 11:49:07,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:07,415 INFO L495 AbstractCegarLoop]: Abstraction has 1186 states and 1643 transitions. [2022-12-13 11:49:07,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:07,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1643 transitions. [2022-12-13 11:49:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:07,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:07,417 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:07,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:49:07,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:07,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:07,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1789236969, now seen corresponding path program 1 times [2022-12-13 11:49:07,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:07,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840798048] [2022-12-13 11:49:07,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:07,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:07,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:07,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:07,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840798048] [2022-12-13 11:49:07,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840798048] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:07,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:07,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:07,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929533089] [2022-12-13 11:49:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:07,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:07,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:07,538 INFO L87 Difference]: Start difference. First operand 1186 states and 1643 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:08,209 INFO L93 Difference]: Finished difference Result 1533 states and 2120 transitions. [2022-12-13 11:49:08,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:49:08,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 11:49:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:08,218 INFO L225 Difference]: With dead ends: 1533 [2022-12-13 11:49:08,218 INFO L226 Difference]: Without dead ends: 1356 [2022-12-13 11:49:08,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:49:08,220 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 712 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:08,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 929 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-12-13 11:49:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-12-13 11:49:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1282. [2022-12-13 11:49:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 1017 states have (on average 1.3736479842674534) internal successors, (1397), 1042 states have internal predecessors, (1397), 158 states have call successors, (158), 94 states have call predecessors, (158), 105 states have return successors, (222), 150 states have call predecessors, (222), 156 states have call successors, (222) [2022-12-13 11:49:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1777 transitions. [2022-12-13 11:49:08,296 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1777 transitions. Word has length 65 [2022-12-13 11:49:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:08,297 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1777 transitions. [2022-12-13 11:49:08,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1777 transitions. [2022-12-13 11:49:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:08,298 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:08,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:08,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:49:08,299 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -239349141, now seen corresponding path program 1 times [2022-12-13 11:49:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:08,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409508024] [2022-12-13 11:49:08,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:08,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:08,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:08,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409508024] [2022-12-13 11:49:08,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409508024] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:08,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:08,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:49:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309200875] [2022-12-13 11:49:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:08,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:49:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:49:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:49:08,410 INFO L87 Difference]: Start difference. First operand 1282 states and 1777 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:08,945 INFO L93 Difference]: Finished difference Result 1583 states and 2191 transitions. [2022-12-13 11:49:08,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:49:08,945 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-13 11:49:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:08,950 INFO L225 Difference]: With dead ends: 1583 [2022-12-13 11:49:08,950 INFO L226 Difference]: Without dead ends: 1316 [2022-12-13 11:49:08,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:49:08,951 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 312 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:08,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 991 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:49:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-12-13 11:49:09,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1287. [2022-12-13 11:49:09,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1021 states have (on average 1.3702252693437806) internal successors, (1399), 1046 states have internal predecessors, (1399), 158 states have call successors, (158), 94 states have call predecessors, (158), 106 states have return successors, (223), 151 states have call predecessors, (223), 156 states have call successors, (223) [2022-12-13 11:49:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1780 transitions. [2022-12-13 11:49:09,023 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1780 transitions. Word has length 65 [2022-12-13 11:49:09,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:09,023 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1780 transitions. [2022-12-13 11:49:09,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1780 transitions. [2022-12-13 11:49:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:09,025 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:09,026 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:09,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:49:09,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1268708439, now seen corresponding path program 1 times [2022-12-13 11:49:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:09,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439797509] [2022-12-13 11:49:09,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:09,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:09,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:09,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:09,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:09,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:09,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:09,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439797509] [2022-12-13 11:49:09,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439797509] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:09,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:09,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:49:09,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765219965] [2022-12-13 11:49:09,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:09,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:49:09,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:09,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:49:09,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:49:09,141 INFO L87 Difference]: Start difference. First operand 1287 states and 1780 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:49:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:10,479 INFO L93 Difference]: Finished difference Result 2949 states and 4052 transitions. [2022-12-13 11:49:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 11:49:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 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 65 [2022-12-13 11:49:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:10,489 INFO L225 Difference]: With dead ends: 2949 [2022-12-13 11:49:10,490 INFO L226 Difference]: Without dead ends: 2677 [2022-12-13 11:49:10,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2022-12-13 11:49:10,493 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 1366 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:10,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 1303 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 11:49:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2677 states. [2022-12-13 11:49:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2677 to 2427. [2022-12-13 11:49:10,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 1921 states have (on average 1.3430504945340969) internal successors, (2580), 1966 states have internal predecessors, (2580), 275 states have call successors, (275), 196 states have call predecessors, (275), 229 states have return successors, (409), 269 states have call predecessors, (409), 273 states have call successors, (409) [2022-12-13 11:49:10,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 3264 transitions. [2022-12-13 11:49:10,680 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 3264 transitions. Word has length 65 [2022-12-13 11:49:10,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:10,680 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 3264 transitions. [2022-12-13 11:49:10,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-13 11:49:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 3264 transitions. [2022-12-13 11:49:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:10,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:10,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:10,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:49:10,683 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:10,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -217259350, now seen corresponding path program 1 times [2022-12-13 11:49:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:10,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238410748] [2022-12-13 11:49:10,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:10,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:10,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238410748] [2022-12-13 11:49:10,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238410748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:10,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:10,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:49:10,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54932795] [2022-12-13 11:49:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:49:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:49:10,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:49:10,794 INFO L87 Difference]: Start difference. First operand 2427 states and 3264 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:11,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:11,421 INFO L93 Difference]: Finished difference Result 4028 states and 5388 transitions. [2022-12-13 11:49:11,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:49:11,421 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-12-13 11:49:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:11,436 INFO L225 Difference]: With dead ends: 4028 [2022-12-13 11:49:11,437 INFO L226 Difference]: Without dead ends: 2616 [2022-12-13 11:49:11,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:49:11,442 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 212 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:11,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1107 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:11,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2616 states. [2022-12-13 11:49:11,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2616 to 2472. [2022-12-13 11:49:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2472 states, 1957 states have (on average 1.3321410321921308) internal successors, (2607), 2002 states have internal predecessors, (2607), 275 states have call successors, (275), 196 states have call predecessors, (275), 238 states have return successors, (421), 278 states have call predecessors, (421), 273 states have call successors, (421) [2022-12-13 11:49:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3303 transitions. [2022-12-13 11:49:11,734 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3303 transitions. Word has length 65 [2022-12-13 11:49:11,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:11,735 INFO L495 AbstractCegarLoop]: Abstraction has 2472 states and 3303 transitions. [2022-12-13 11:49:11,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3303 transitions. [2022-12-13 11:49:11,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:11,737 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:11,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:11,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:49:11,737 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:11,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1168944044, now seen corresponding path program 1 times [2022-12-13 11:49:11,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:11,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442954452] [2022-12-13 11:49:11,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:11,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:11,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:11,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:11,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442954452] [2022-12-13 11:49:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442954452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:11,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:11,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:11,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585978787] [2022-12-13 11:49:11,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:11,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:11,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:11,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:11,853 INFO L87 Difference]: Start difference. First operand 2472 states and 3303 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:12,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:12,537 INFO L93 Difference]: Finished difference Result 3907 states and 5142 transitions. [2022-12-13 11:49:12,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:49:12,537 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 11:49:12,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:12,546 INFO L225 Difference]: With dead ends: 3907 [2022-12-13 11:49:12,546 INFO L226 Difference]: Without dead ends: 2670 [2022-12-13 11:49:12,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2022-12-13 11:49:12,548 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 685 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:12,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 702 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:49:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2022-12-13 11:49:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2450. [2022-12-13 11:49:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2450 states, 1943 states have (on average 1.3293875450334534) internal successors, (2583), 1982 states have internal predecessors, (2583), 275 states have call successors, (275), 196 states have call predecessors, (275), 230 states have return successors, (405), 276 states have call predecessors, (405), 273 states have call successors, (405) [2022-12-13 11:49:12,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 3263 transitions. [2022-12-13 11:49:12,733 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 3263 transitions. Word has length 65 [2022-12-13 11:49:12,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:12,733 INFO L495 AbstractCegarLoop]: Abstraction has 2450 states and 3263 transitions. [2022-12-13 11:49:12,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:12,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 3263 transitions. [2022-12-13 11:49:12,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-12-13 11:49:12,735 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:12,735 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:12,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:49:12,735 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1034930538, now seen corresponding path program 1 times [2022-12-13 11:49:12,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:12,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937238601] [2022-12-13 11:49:12,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:12,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:12,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:12,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:12,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937238601] [2022-12-13 11:49:12,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937238601] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:12,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:12,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:12,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014828571] [2022-12-13 11:49:12,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:12,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:12,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:12,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:12,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:12,803 INFO L87 Difference]: Start difference. First operand 2450 states and 3263 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:13,383 INFO L93 Difference]: Finished difference Result 5525 states and 7242 transitions. [2022-12-13 11:49:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 11:49:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-12-13 11:49:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:13,392 INFO L225 Difference]: With dead ends: 5525 [2022-12-13 11:49:13,392 INFO L226 Difference]: Without dead ends: 4093 [2022-12-13 11:49:13,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:49:13,395 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 659 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:13,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 566 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-12-13 11:49:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 3821. [2022-12-13 11:49:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3821 states, 3009 states have (on average 1.296111665004985) internal successors, (3900), 3069 states have internal predecessors, (3900), 427 states have call successors, (427), 319 states have call predecessors, (427), 383 states have return successors, (677), 440 states have call predecessors, (677), 425 states have call successors, (677) [2022-12-13 11:49:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5004 transitions. [2022-12-13 11:49:13,682 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5004 transitions. Word has length 65 [2022-12-13 11:49:13,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:13,682 INFO L495 AbstractCegarLoop]: Abstraction has 3821 states and 5004 transitions. [2022-12-13 11:49:13,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-12-13 11:49:13,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5004 transitions. [2022-12-13 11:49:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 11:49:13,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:13,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:13,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 11:49:13,684 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1593552473, now seen corresponding path program 1 times [2022-12-13 11:49:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:13,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553649598] [2022-12-13 11:49:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:13,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:13,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553649598] [2022-12-13 11:49:13,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553649598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:13,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:13,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:49:13,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479093279] [2022-12-13 11:49:13,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:13,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:13,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:13,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:13,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:49:13,738 INFO L87 Difference]: Start difference. First operand 3821 states and 5004 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:14,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:14,530 INFO L93 Difference]: Finished difference Result 8839 states and 11518 transitions. [2022-12-13 11:49:14,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 11:49:14,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 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 66 [2022-12-13 11:49:14,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:14,555 INFO L225 Difference]: With dead ends: 8839 [2022-12-13 11:49:14,555 INFO L226 Difference]: Without dead ends: 6015 [2022-12-13 11:49:14,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:14,563 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 388 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:14,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 678 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6015 states. [2022-12-13 11:49:14,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6015 to 5499. [2022-12-13 11:49:14,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5499 states, 4294 states have (on average 1.2808570097810899) internal successors, (5500), 4361 states have internal predecessors, (5500), 621 states have call successors, (621), 493 states have call predecessors, (621), 582 states have return successors, (998), 652 states have call predecessors, (998), 619 states have call successors, (998) [2022-12-13 11:49:14,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5499 states to 5499 states and 7119 transitions. [2022-12-13 11:49:14,981 INFO L78 Accepts]: Start accepts. Automaton has 5499 states and 7119 transitions. Word has length 66 [2022-12-13 11:49:14,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:14,982 INFO L495 AbstractCegarLoop]: Abstraction has 5499 states and 7119 transitions. [2022-12-13 11:49:14,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-12-13 11:49:14,982 INFO L276 IsEmpty]: Start isEmpty. Operand 5499 states and 7119 transitions. [2022-12-13 11:49:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 11:49:14,983 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:14,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:14,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 11:49:14,984 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:14,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:14,984 INFO L85 PathProgramCache]: Analyzing trace with hash -455119352, now seen corresponding path program 1 times [2022-12-13 11:49:14,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:14,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810208355] [2022-12-13 11:49:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:14,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:15,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:15,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:15,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810208355] [2022-12-13 11:49:15,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810208355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:15,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:15,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:15,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147453072] [2022-12-13 11:49:15,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:15,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:15,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:15,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:15,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:15,042 INFO L87 Difference]: Start difference. First operand 5499 states and 7119 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 11:49:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:15,865 INFO L93 Difference]: Finished difference Result 7129 states and 9121 transitions. [2022-12-13 11:49:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 11:49:15,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 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 73 [2022-12-13 11:49:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:15,885 INFO L225 Difference]: With dead ends: 7129 [2022-12-13 11:49:15,885 INFO L226 Difference]: Without dead ends: 7126 [2022-12-13 11:49:15,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-12-13 11:49:15,887 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 932 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:15,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 464 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:15,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2022-12-13 11:49:16,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 6553. [2022-12-13 11:49:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6553 states, 5097 states have (on average 1.2693741416519522) internal successors, (6470), 5173 states have internal predecessors, (6470), 747 states have call successors, (747), 607 states have call predecessors, (747), 707 states have return successors, (1191), 780 states have call predecessors, (1191), 746 states have call successors, (1191) [2022-12-13 11:49:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6553 states to 6553 states and 8408 transitions. [2022-12-13 11:49:16,366 INFO L78 Accepts]: Start accepts. Automaton has 6553 states and 8408 transitions. Word has length 73 [2022-12-13 11:49:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:16,366 INFO L495 AbstractCegarLoop]: Abstraction has 6553 states and 8408 transitions. [2022-12-13 11:49:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 11:49:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6553 states and 8408 transitions. [2022-12-13 11:49:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 11:49:16,368 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:16,368 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:16,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 11:49:16,369 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:16,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:16,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1224424688, now seen corresponding path program 1 times [2022-12-13 11:49:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:16,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026455917] [2022-12-13 11:49:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:16,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026455917] [2022-12-13 11:49:16,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026455917] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:16,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189914940] [2022-12-13 11:49:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:16,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:16,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:16,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:16,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:49:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:16,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:49:16,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:16,795 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:49:16,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:16,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189914940] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:49:16,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:49:16,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2022-12-13 11:49:16,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063532078] [2022-12-13 11:49:16,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:49:16,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 11:49:16,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:16,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 11:49:16,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:16,934 INFO L87 Difference]: Start difference. First operand 6553 states and 8408 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 11:49:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:19,239 INFO L93 Difference]: Finished difference Result 14199 states and 17936 transitions. [2022-12-13 11:49:19,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 11:49:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2022-12-13 11:49:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:19,270 INFO L225 Difference]: With dead ends: 14199 [2022-12-13 11:49:19,270 INFO L226 Difference]: Without dead ends: 14196 [2022-12-13 11:49:19,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2022-12-13 11:49:19,274 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 1209 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:19,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1267 Valid, 1094 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-13 11:49:19,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14196 states. [2022-12-13 11:49:20,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14196 to 11811. [2022-12-13 11:49:20,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11811 states, 9189 states have (on average 1.2600935901621504) internal successors, (11579), 9317 states have internal predecessors, (11579), 1313 states have call successors, (1313), 1097 states have call predecessors, (1313), 1307 states have return successors, (2130), 1404 states have call predecessors, (2130), 1312 states have call successors, (2130) [2022-12-13 11:49:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11811 states to 11811 states and 15022 transitions. [2022-12-13 11:49:20,301 INFO L78 Accepts]: Start accepts. Automaton has 11811 states and 15022 transitions. Word has length 74 [2022-12-13 11:49:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:20,302 INFO L495 AbstractCegarLoop]: Abstraction has 11811 states and 15022 transitions. [2022-12-13 11:49:20,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2022-12-13 11:49:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 11811 states and 15022 transitions. [2022-12-13 11:49:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 11:49:20,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:20,303 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:20,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:49:20,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:49:20,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash -499209592, now seen corresponding path program 2 times [2022-12-13 11:49:20,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:20,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41471826] [2022-12-13 11:49:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:49:20,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:20,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41471826] [2022-12-13 11:49:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41471826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:20,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:20,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:49:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258923567] [2022-12-13 11:49:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:20,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:20,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:20,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:20,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:49:20,551 INFO L87 Difference]: Start difference. First operand 11811 states and 15022 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 11:49:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:21,690 INFO L93 Difference]: Finished difference Result 18354 states and 23364 transitions. [2022-12-13 11:49:21,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:49:21,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 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 77 [2022-12-13 11:49:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:21,711 INFO L225 Difference]: With dead ends: 18354 [2022-12-13 11:49:21,711 INFO L226 Difference]: Without dead ends: 8416 [2022-12-13 11:49:21,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:21,729 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 432 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:21,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 671 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 11:49:21,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2022-12-13 11:49:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 7864. [2022-12-13 11:49:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7864 states, 6136 states have (on average 1.2416883963494132) internal successors, (7619), 6220 states have internal predecessors, (7619), 880 states have call successors, (880), 721 states have call predecessors, (880), 846 states have return successors, (1349), 930 states have call predecessors, (1349), 879 states have call successors, (1349) [2022-12-13 11:49:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7864 states to 7864 states and 9848 transitions. [2022-12-13 11:49:22,521 INFO L78 Accepts]: Start accepts. Automaton has 7864 states and 9848 transitions. Word has length 77 [2022-12-13 11:49:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:22,521 INFO L495 AbstractCegarLoop]: Abstraction has 7864 states and 9848 transitions. [2022-12-13 11:49:22,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-13 11:49:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 7864 states and 9848 transitions. [2022-12-13 11:49:22,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-12-13 11:49:22,525 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:22,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:22,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 11:49:22,526 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:22,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:22,526 INFO L85 PathProgramCache]: Analyzing trace with hash 867535010, now seen corresponding path program 1 times [2022-12-13 11:49:22,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:22,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344493019] [2022-12-13 11:49:22,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:22,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 11:49:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 11:49:22,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:22,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344493019] [2022-12-13 11:49:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344493019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:22,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:49:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558781922] [2022-12-13 11:49:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:49:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:49:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:22,623 INFO L87 Difference]: Start difference. First operand 7864 states and 9848 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 11:49:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:24,704 INFO L93 Difference]: Finished difference Result 21738 states and 27065 transitions. [2022-12-13 11:49:24,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 11:49:24,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2022-12-13 11:49:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:24,757 INFO L225 Difference]: With dead ends: 21738 [2022-12-13 11:49:24,757 INFO L226 Difference]: Without dead ends: 14895 [2022-12-13 11:49:24,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2022-12-13 11:49:24,773 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 775 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:24,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 937 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:49:24,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14895 states. [2022-12-13 11:49:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14895 to 14036. [2022-12-13 11:49:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14036 states, 10812 states have (on average 1.212171661117277) internal successors, (13106), 11002 states have internal predecessors, (13106), 1596 states have call successors, (1596), 1325 states have call predecessors, (1596), 1626 states have return successors, (2752), 1722 states have call predecessors, (2752), 1595 states have call successors, (2752) [2022-12-13 11:49:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14036 states to 14036 states and 17454 transitions. [2022-12-13 11:49:26,675 INFO L78 Accepts]: Start accepts. Automaton has 14036 states and 17454 transitions. Word has length 84 [2022-12-13 11:49:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:26,675 INFO L495 AbstractCegarLoop]: Abstraction has 14036 states and 17454 transitions. [2022-12-13 11:49:26,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 11:49:26,676 INFO L276 IsEmpty]: Start isEmpty. Operand 14036 states and 17454 transitions. [2022-12-13 11:49:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-12-13 11:49:26,679 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:26,679 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-13 11:49:26,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 11:49:26,679 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:26,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:26,679 INFO L85 PathProgramCache]: Analyzing trace with hash 260386383, now seen corresponding path program 1 times [2022-12-13 11:49:26,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:26,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469726733] [2022-12-13 11:49:26,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:26,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:49:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 11:49:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 11:49:26,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469726733] [2022-12-13 11:49:26,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469726733] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:26,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992701619] [2022-12-13 11:49:26,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:26,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:26,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:26,758 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:26,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:49:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:26,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 11:49:26,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:49:26,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:26,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992701619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:26,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:26,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 11:49:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257149073] [2022-12-13 11:49:26,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:26,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:26,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:26,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:26,842 INFO L87 Difference]: Start difference. First operand 14036 states and 17454 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:27,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:27,986 INFO L93 Difference]: Finished difference Result 15912 states and 20081 transitions. [2022-12-13 11:49:27,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:27,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 92 [2022-12-13 11:49:27,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:28,022 INFO L225 Difference]: With dead ends: 15912 [2022-12-13 11:49:28,022 INFO L226 Difference]: Without dead ends: 14282 [2022-12-13 11:49:28,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:28,030 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 113 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:28,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 624 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:28,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14282 states. [2022-12-13 11:49:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14282 to 14282. [2022-12-13 11:49:29,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14282 states, 11010 states have (on average 1.2143505903723888) internal successors, (13370), 11202 states have internal predecessors, (13370), 1624 states have call successors, (1624), 1343 states have call predecessors, (1624), 1646 states have return successors, (2794), 1750 states have call predecessors, (2794), 1623 states have call successors, (2794) [2022-12-13 11:49:29,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14282 states to 14282 states and 17788 transitions. [2022-12-13 11:49:29,472 INFO L78 Accepts]: Start accepts. Automaton has 14282 states and 17788 transitions. Word has length 92 [2022-12-13 11:49:29,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:29,472 INFO L495 AbstractCegarLoop]: Abstraction has 14282 states and 17788 transitions. [2022-12-13 11:49:29,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:29,473 INFO L276 IsEmpty]: Start isEmpty. Operand 14282 states and 17788 transitions. [2022-12-13 11:49:29,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-12-13 11:49:29,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:29,478 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:29,482 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:49:29,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 11:49:29,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1083636890, now seen corresponding path program 1 times [2022-12-13 11:49:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:29,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097517438] [2022-12-13 11:49:29,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-12-13 11:49:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 11:49:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:29,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097517438] [2022-12-13 11:49:29,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097517438] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:29,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:29,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 11:49:29,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061012495] [2022-12-13 11:49:29,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:29,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 11:49:29,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:29,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 11:49:29,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:49:29,811 INFO L87 Difference]: Start difference. First operand 14282 states and 17788 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 11:49:31,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:31,999 INFO L93 Difference]: Finished difference Result 25156 states and 31107 transitions. [2022-12-13 11:49:31,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:49:31,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2022-12-13 11:49:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:32,025 INFO L225 Difference]: With dead ends: 25156 [2022-12-13 11:49:32,026 INFO L226 Difference]: Without dead ends: 12757 [2022-12-13 11:49:32,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2022-12-13 11:49:32,040 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1538 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 984 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:32,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 805 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 984 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-12-13 11:49:32,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12757 states. [2022-12-13 11:49:32,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12757 to 11857. [2022-12-13 11:49:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11857 states, 9176 states have (on average 1.207606800348736) internal successors, (11081), 9335 states have internal predecessors, (11081), 1325 states have call successors, (1325), 1092 states have call predecessors, (1325), 1354 states have return successors, (2126), 1440 states have call predecessors, (2126), 1324 states have call successors, (2126) [2022-12-13 11:49:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11857 states to 11857 states and 14532 transitions. [2022-12-13 11:49:33,025 INFO L78 Accepts]: Start accepts. Automaton has 11857 states and 14532 transitions. Word has length 93 [2022-12-13 11:49:33,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:33,025 INFO L495 AbstractCegarLoop]: Abstraction has 11857 states and 14532 transitions. [2022-12-13 11:49:33,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-13 11:49:33,026 INFO L276 IsEmpty]: Start isEmpty. Operand 11857 states and 14532 transitions. [2022-12-13 11:49:33,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-12-13 11:49:33,034 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:33,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2022-12-13 11:49:33,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 11:49:33,035 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:33,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1789084765, now seen corresponding path program 1 times [2022-12-13 11:49:33,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:33,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409025085] [2022-12-13 11:49:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:33,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-12-13 11:49:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-12-13 11:49:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-12-13 11:49:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-12-13 11:49:33,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:33,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409025085] [2022-12-13 11:49:33,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409025085] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:33,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334313747] [2022-12-13 11:49:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:33,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:33,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:33,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:49:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:33,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 11:49:33,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-12-13 11:49:33,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:33,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334313747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:33,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:33,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-12-13 11:49:33,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809991458] [2022-12-13 11:49:33,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:33,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:33,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:33,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:33,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:33,291 INFO L87 Difference]: Start difference. First operand 11857 states and 14532 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 11:49:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:34,263 INFO L93 Difference]: Finished difference Result 13574 states and 16943 transitions. [2022-12-13 11:49:34,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 118 [2022-12-13 11:49:34,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:34,290 INFO L225 Difference]: With dead ends: 13574 [2022-12-13 11:49:34,290 INFO L226 Difference]: Without dead ends: 12576 [2022-12-13 11:49:34,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:34,296 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 196 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:34,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 406 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12576 states. [2022-12-13 11:49:35,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12576 to 12550. [2022-12-13 11:49:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12550 states, 9734 states have (on average 1.216046846106431) internal successors, (11837), 9902 states have internal predecessors, (11837), 1403 states have call successors, (1403), 1143 states have call predecessors, (1403), 1411 states have return successors, (2230), 1515 states have call predecessors, (2230), 1402 states have call successors, (2230) [2022-12-13 11:49:35,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12550 states to 12550 states and 15470 transitions. [2022-12-13 11:49:35,270 INFO L78 Accepts]: Start accepts. Automaton has 12550 states and 15470 transitions. Word has length 118 [2022-12-13 11:49:35,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:35,270 INFO L495 AbstractCegarLoop]: Abstraction has 12550 states and 15470 transitions. [2022-12-13 11:49:35,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-12-13 11:49:35,270 INFO L276 IsEmpty]: Start isEmpty. Operand 12550 states and 15470 transitions. [2022-12-13 11:49:35,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 11:49:35,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:35,276 INFO L195 NwaCegarLoop]: trace histogram [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, 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-12-13 11:49:35,280 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:49:35,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:35,477 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2070810004, now seen corresponding path program 1 times [2022-12-13 11:49:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:35,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146483875] [2022-12-13 11:49:35,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:35,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:35,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 11:49:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 11:49:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 11:49:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:35,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 11:49:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 11:49:35,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146483875] [2022-12-13 11:49:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146483875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020507462] [2022-12-13 11:49:35,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:35,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:35,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:35,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:35,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:49:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:35,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 11:49:35,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:35,678 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 11:49:35,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:35,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020507462] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:35,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:35,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 11:49:35,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554661161] [2022-12-13 11:49:35,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:35,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:35,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:35,680 INFO L87 Difference]: Start difference. First operand 12550 states and 15470 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 11:49:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:36,873 INFO L93 Difference]: Finished difference Result 14780 states and 18580 transitions. [2022-12-13 11:49:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:36,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 134 [2022-12-13 11:49:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:36,902 INFO L225 Difference]: With dead ends: 14780 [2022-12-13 11:49:36,902 INFO L226 Difference]: Without dead ends: 12856 [2022-12-13 11:49:36,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:36,912 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 247 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:36,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 294 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12856 states. [2022-12-13 11:49:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12856 to 12790. [2022-12-13 11:49:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12790 states, 9953 states have (on average 1.2065708831508088) internal successors, (12009), 10118 states have internal predecessors, (12009), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-12-13 11:49:37,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12790 states to 12790 states and 15636 transitions. [2022-12-13 11:49:37,953 INFO L78 Accepts]: Start accepts. Automaton has 12790 states and 15636 transitions. Word has length 134 [2022-12-13 11:49:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:37,953 INFO L495 AbstractCegarLoop]: Abstraction has 12790 states and 15636 transitions. [2022-12-13 11:49:37,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-12-13 11:49:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12790 states and 15636 transitions. [2022-12-13 11:49:37,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-12-13 11:49:37,958 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:37,958 INFO L195 NwaCegarLoop]: trace histogram [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, 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-12-13 11:49:37,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:49:38,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-12-13 11:49:38,160 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:38,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:38,161 INFO L85 PathProgramCache]: Analyzing trace with hash -931525195, now seen corresponding path program 1 times [2022-12-13 11:49:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:38,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62831933] [2022-12-13 11:49:38,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:38,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-12-13 11:49:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-12-13 11:49:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 11:49:38,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-12-13 11:49:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-12-13 11:49:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62831933] [2022-12-13 11:49:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62831933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079097097] [2022-12-13 11:49:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:38,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:38,269 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:38,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:49:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:38,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:49:38,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-12-13 11:49:38,362 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:38,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079097097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:38,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:38,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 11:49:38,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430192186] [2022-12-13 11:49:38,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:38,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:38,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:38,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:38,363 INFO L87 Difference]: Start difference. First operand 12790 states and 15636 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 11:49:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:39,398 INFO L93 Difference]: Finished difference Result 15003 states and 18535 transitions. [2022-12-13 11:49:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 134 [2022-12-13 11:49:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:39,420 INFO L225 Difference]: With dead ends: 15003 [2022-12-13 11:49:39,421 INFO L226 Difference]: Without dead ends: 12841 [2022-12-13 11:49:39,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:39,427 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 247 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:39,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 405 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12841 states. [2022-12-13 11:49:40,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12841 to 12772. [2022-12-13 11:49:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12772 states, 9935 states have (on average 1.2015098137896325) internal successors, (11937), 10100 states have internal predecessors, (11937), 1403 states have call successors, (1403), 1161 states have call predecessors, (1403), 1432 states have return successors, (2224), 1521 states have call predecessors, (2224), 1402 states have call successors, (2224) [2022-12-13 11:49:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12772 states to 12772 states and 15564 transitions. [2022-12-13 11:49:40,546 INFO L78 Accepts]: Start accepts. Automaton has 12772 states and 15564 transitions. Word has length 134 [2022-12-13 11:49:40,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:40,547 INFO L495 AbstractCegarLoop]: Abstraction has 12772 states and 15564 transitions. [2022-12-13 11:49:40,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 11:49:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 12772 states and 15564 transitions. [2022-12-13 11:49:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-12-13 11:49:40,555 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:40,556 INFO L195 NwaCegarLoop]: trace histogram [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, 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-12-13 11:49:40,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:49:40,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:40,757 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -564892461, now seen corresponding path program 1 times [2022-12-13 11:49:40,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782252488] [2022-12-13 11:49:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:40,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:40,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:40,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:49:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:40,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:49:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-12-13 11:49:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-12-13 11:49:40,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782252488] [2022-12-13 11:49:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782252488] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681865005] [2022-12-13 11:49:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:40,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:40,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:40,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:49:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:40,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 11:49:40,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:41,001 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 11:49:41,001 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:41,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681865005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:41,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:41,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 11:49:41,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386040506] [2022-12-13 11:49:41,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:41,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:41,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:41,003 INFO L87 Difference]: Start difference. First operand 12772 states and 15564 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 11:49:41,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:41,978 INFO L93 Difference]: Finished difference Result 13697 states and 16818 transitions. [2022-12-13 11:49:41,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:41,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 135 [2022-12-13 11:49:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:41,998 INFO L225 Difference]: With dead ends: 13697 [2022-12-13 11:49:41,998 INFO L226 Difference]: Without dead ends: 12606 [2022-12-13 11:49:42,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:42,002 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 75 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:42,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 623 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12606 states. [2022-12-13 11:49:43,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12606 to 12568. [2022-12-13 11:49:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12568 states, 9773 states have (on average 1.1971758927657832) internal successors, (11700), 9936 states have internal predecessors, (11700), 1381 states have call successors, (1381), 1146 states have call predecessors, (1381), 1412 states have return successors, (2184), 1496 states have call predecessors, (2184), 1380 states have call successors, (2184) [2022-12-13 11:49:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12568 states to 12568 states and 15265 transitions. [2022-12-13 11:49:43,081 INFO L78 Accepts]: Start accepts. Automaton has 12568 states and 15265 transitions. Word has length 135 [2022-12-13 11:49:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:43,082 INFO L495 AbstractCegarLoop]: Abstraction has 12568 states and 15265 transitions. [2022-12-13 11:49:43,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-12-13 11:49:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 12568 states and 15265 transitions. [2022-12-13 11:49:43,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 11:49:43,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:43,087 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:43,091 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-13 11:49:43,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:43,289 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:43,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:43,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1386105035, now seen corresponding path program 1 times [2022-12-13 11:49:43,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:43,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367730560] [2022-12-13 11:49:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:43,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:43,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:49:43,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:49:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:49:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,380 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 11:49:43,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367730560] [2022-12-13 11:49:43,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367730560] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:43,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223415507] [2022-12-13 11:49:43,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:43,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:43,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:43,381 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:43,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:49:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:43,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:49:43,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:43,513 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 11:49:43,513 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:43,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223415507] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:43,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:43,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 11:49:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696030255] [2022-12-13 11:49:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:43,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:43,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:43,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:43,515 INFO L87 Difference]: Start difference. First operand 12568 states and 15265 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:45,202 INFO L93 Difference]: Finished difference Result 13904 states and 16977 transitions. [2022-12-13 11:49:45,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:49:45,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-12-13 11:49:45,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:45,222 INFO L225 Difference]: With dead ends: 13904 [2022-12-13 11:49:45,222 INFO L226 Difference]: Without dead ends: 12561 [2022-12-13 11:49:45,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:49:45,227 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 300 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:45,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 394 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:49:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12561 states. [2022-12-13 11:49:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12561 to 12002. [2022-12-13 11:49:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12002 states, 9315 states have (on average 1.191196994095545) internal successors, (11096), 9468 states have internal predecessors, (11096), 1323 states have call successors, (1323), 1103 states have call predecessors, (1323), 1362 states have return successors, (2092), 1440 states have call predecessors, (2092), 1322 states have call successors, (2092) [2022-12-13 11:49:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12002 states to 12002 states and 14511 transitions. [2022-12-13 11:49:46,268 INFO L78 Accepts]: Start accepts. Automaton has 12002 states and 14511 transitions. Word has length 136 [2022-12-13 11:49:46,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:46,269 INFO L495 AbstractCegarLoop]: Abstraction has 12002 states and 14511 transitions. [2022-12-13 11:49:46,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 12002 states and 14511 transitions. [2022-12-13 11:49:46,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 11:49:46,274 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:46,274 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:46,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:49:46,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 11:49:46,476 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:46,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:46,477 INFO L85 PathProgramCache]: Analyzing trace with hash 78962637, now seen corresponding path program 1 times [2022-12-13 11:49:46,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:46,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403804685] [2022-12-13 11:49:46,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:46,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:49:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:46,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:49:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:49:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 11:49:46,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:46,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403804685] [2022-12-13 11:49:46,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403804685] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:46,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137006072] [2022-12-13 11:49:46,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:46,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:46,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:46,585 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:46,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:49:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:46,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 11:49:46,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-12-13 11:49:46,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:46,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137006072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:46,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:46,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 11:49:46,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301620244] [2022-12-13 11:49:46,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:46,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:46,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:46,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:46,700 INFO L87 Difference]: Start difference. First operand 12002 states and 14511 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:47,843 INFO L93 Difference]: Finished difference Result 13122 states and 15882 transitions. [2022-12-13 11:49:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:49:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-12-13 11:49:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:47,860 INFO L225 Difference]: With dead ends: 13122 [2022-12-13 11:49:47,861 INFO L226 Difference]: Without dead ends: 11748 [2022-12-13 11:49:47,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:49:47,865 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 322 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:47,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 390 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:49:47,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2022-12-13 11:49:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11726. [2022-12-13 11:49:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9097 states have (on average 1.1854457513465977) internal successors, (10784), 9246 states have internal predecessors, (10784), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-12-13 11:49:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14112 transitions. [2022-12-13 11:49:48,912 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14112 transitions. Word has length 136 [2022-12-13 11:49:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:48,912 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14112 transitions. [2022-12-13 11:49:48,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14112 transitions. [2022-12-13 11:49:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 11:49:48,918 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:48,918 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:48,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:49:49,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 11:49:49,120 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1976459403, now seen corresponding path program 1 times [2022-12-13 11:49:49,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:49,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323038502] [2022-12-13 11:49:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:49,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:49,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:49,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:49:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:49:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:49:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-12-13 11:49:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323038502] [2022-12-13 11:49:49,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323038502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:49,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704409300] [2022-12-13 11:49:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:49,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:49,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:49,247 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:49,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:49:49,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:49,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 11:49:49,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 11:49:49,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:49,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704409300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:49,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:49,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-12-13 11:49:49,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827491182] [2022-12-13 11:49:49,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:49,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:49:49,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:49,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:49:49,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:49,349 INFO L87 Difference]: Start difference. First operand 11726 states and 14112 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:50,369 INFO L93 Difference]: Finished difference Result 12853 states and 15487 transitions. [2022-12-13 11:49:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:49:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 136 [2022-12-13 11:49:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:50,387 INFO L225 Difference]: With dead ends: 12853 [2022-12-13 11:49:50,387 INFO L226 Difference]: Without dead ends: 11754 [2022-12-13 11:49:50,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-12-13 11:49:50,390 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:50,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1043 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11754 states. [2022-12-13 11:49:51,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11754 to 11738. [2022-12-13 11:49:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11738 states, 9109 states have (on average 1.1828960368865957) internal successors, (10775), 9258 states have internal predecessors, (10775), 1285 states have call successors, (1285), 1081 states have call predecessors, (1285), 1342 states have return successors, (2043), 1408 states have call predecessors, (2043), 1284 states have call successors, (2043) [2022-12-13 11:49:51,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11738 states to 11738 states and 14103 transitions. [2022-12-13 11:49:51,436 INFO L78 Accepts]: Start accepts. Automaton has 11738 states and 14103 transitions. Word has length 136 [2022-12-13 11:49:51,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:51,436 INFO L495 AbstractCegarLoop]: Abstraction has 11738 states and 14103 transitions. [2022-12-13 11:49:51,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-12-13 11:49:51,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11738 states and 14103 transitions. [2022-12-13 11:49:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-12-13 11:49:51,441 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:51,441 INFO L195 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:51,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:49:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 11:49:51,643 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:51,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1219164295, now seen corresponding path program 1 times [2022-12-13 11:49:51,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:51,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906226796] [2022-12-13 11:49:51,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:49:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:49:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:49:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:49:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:49:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:49:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:49:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-12-13 11:49:51,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:51,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906226796] [2022-12-13 11:49:51,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906226796] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:51,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:51,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:49:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757542701] [2022-12-13 11:49:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:51,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:49:51,744 INFO L87 Difference]: Start difference. First operand 11738 states and 14103 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 11:49:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:53,488 INFO L93 Difference]: Finished difference Result 12713 states and 15200 transitions. [2022-12-13 11:49:53,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:49:53,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 136 [2022-12-13 11:49:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:53,507 INFO L225 Difference]: With dead ends: 12713 [2022-12-13 11:49:53,507 INFO L226 Difference]: Without dead ends: 12711 [2022-12-13 11:49:53,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:49:53,510 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 700 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:53,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 670 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:49:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12711 states. [2022-12-13 11:49:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12711 to 12442. [2022-12-13 11:49:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12442 states, 9689 states have (on average 1.1791722571988854) internal successors, (11425), 9844 states have internal predecessors, (11425), 1353 states have call successors, (1353), 1129 states have call predecessors, (1353), 1398 states have return successors, (2122), 1478 states have call predecessors, (2122), 1352 states have call successors, (2122) [2022-12-13 11:49:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12442 states to 12442 states and 14900 transitions. [2022-12-13 11:49:54,680 INFO L78 Accepts]: Start accepts. Automaton has 12442 states and 14900 transitions. Word has length 136 [2022-12-13 11:49:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:54,680 INFO L495 AbstractCegarLoop]: Abstraction has 12442 states and 14900 transitions. [2022-12-13 11:49:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 4 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-12-13 11:49:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12442 states and 14900 transitions. [2022-12-13 11:49:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-12-13 11:49:54,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:54,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 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-12-13 11:49:54,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 11:49:54,686 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:54,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:54,687 INFO L85 PathProgramCache]: Analyzing trace with hash 114815496, now seen corresponding path program 1 times [2022-12-13 11:49:54,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:54,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131157462] [2022-12-13 11:49:54,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:54,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 11:49:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:49:54,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-12-13 11:49:54,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-12-13 11:49:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:54,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-12-13 11:49:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 11:49:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-12-13 11:49:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-12-13 11:49:54,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131157462] [2022-12-13 11:49:54,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131157462] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194797263] [2022-12-13 11:49:54,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:54,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:54,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:54,793 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:54,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:49:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:54,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 11:49:54,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:54,897 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-13 11:49:54,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:54,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194797263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:54,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:54,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-12-13 11:49:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626750177] [2022-12-13 11:49:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:54,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:49:54,898 INFO L87 Difference]: Start difference. First operand 12442 states and 14900 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 11:49:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:55,624 INFO L93 Difference]: Finished difference Result 17590 states and 21120 transitions. [2022-12-13 11:49:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:49:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2022-12-13 11:49:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:55,635 INFO L225 Difference]: With dead ends: 17590 [2022-12-13 11:49:55,636 INFO L226 Difference]: Without dead ends: 7008 [2022-12-13 11:49:55,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:49:55,643 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 34 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:55,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1280 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:55,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7008 states. [2022-12-13 11:49:56,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7008 to 6566. [2022-12-13 11:49:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6566 states, 5254 states have (on average 1.159307194518462) internal successors, (6091), 5307 states have internal predecessors, (6091), 655 states have call successors, (655), 523 states have call predecessors, (655), 655 states have return successors, (962), 736 states have call predecessors, (962), 654 states have call successors, (962) [2022-12-13 11:49:56,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6566 states to 6566 states and 7708 transitions. [2022-12-13 11:49:56,262 INFO L78 Accepts]: Start accepts. Automaton has 6566 states and 7708 transitions. Word has length 145 [2022-12-13 11:49:56,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:56,263 INFO L495 AbstractCegarLoop]: Abstraction has 6566 states and 7708 transitions. [2022-12-13 11:49:56,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2022-12-13 11:49:56,263 INFO L276 IsEmpty]: Start isEmpty. Operand 6566 states and 7708 transitions. [2022-12-13 11:49:56,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-12-13 11:49:56,267 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:56,267 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:56,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-12-13 11:49:56,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 11:49:56,468 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:56,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:56,469 INFO L85 PathProgramCache]: Analyzing trace with hash 62040612, now seen corresponding path program 1 times [2022-12-13 11:49:56,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:56,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187160563] [2022-12-13 11:49:56,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:56,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:56,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-12-13 11:49:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-12-13 11:49:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-12-13 11:49:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-12-13 11:49:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 11:49:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 11:49:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-12-13 11:49:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-12-13 11:49:56,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:56,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187160563] [2022-12-13 11:49:56,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187160563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:56,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:56,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:49:56,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389137053] [2022-12-13 11:49:56,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:49:56,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:56,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:49:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:49:56,548 INFO L87 Difference]: Start difference. First operand 6566 states and 7708 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 11:49:57,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:57,306 INFO L93 Difference]: Finished difference Result 7114 states and 8326 transitions. [2022-12-13 11:49:57,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:49:57,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 147 [2022-12-13 11:49:57,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:57,315 INFO L225 Difference]: With dead ends: 7114 [2022-12-13 11:49:57,315 INFO L226 Difference]: Without dead ends: 6365 [2022-12-13 11:49:57,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:49:57,317 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 392 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:57,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 455 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:49:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6365 states. [2022-12-13 11:49:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6365 to 6141. [2022-12-13 11:49:57,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6141 states, 4925 states have (on average 1.1595939086294416) internal successors, (5711), 4975 states have internal predecessors, (5711), 609 states have call successors, (609), 483 states have call predecessors, (609), 605 states have return successors, (898), 683 states have call predecessors, (898), 608 states have call successors, (898) [2022-12-13 11:49:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6141 states to 6141 states and 7218 transitions. [2022-12-13 11:49:57,901 INFO L78 Accepts]: Start accepts. Automaton has 6141 states and 7218 transitions. Word has length 147 [2022-12-13 11:49:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:57,901 INFO L495 AbstractCegarLoop]: Abstraction has 6141 states and 7218 transitions. [2022-12-13 11:49:57,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-12-13 11:49:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6141 states and 7218 transitions. [2022-12-13 11:49:57,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-12-13 11:49:57,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:57,906 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:57,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 11:49:57,906 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:57,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:57,906 INFO L85 PathProgramCache]: Analyzing trace with hash -818503781, now seen corresponding path program 1 times [2022-12-13 11:49:57,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:57,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534351714] [2022-12-13 11:49:57,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:57,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:49:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:49:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:49:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:49:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-12-13 11:49:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-12-13 11:49:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-12-13 11:49:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-12-13 11:49:57,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-12-13 11:49:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 11:49:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-12-13 11:49:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-12-13 11:49:57,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534351714] [2022-12-13 11:49:57,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534351714] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:49:57,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754001786] [2022-12-13 11:49:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:57,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:57,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:49:57,970 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:49:57,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:49:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:58,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 11:49:58,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:49:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-12-13 11:49:58,118 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:49:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754001786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:58,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:49:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-12-13 11:49:58,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13792202] [2022-12-13 11:49:58,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:58,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:49:58,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:58,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:49:58,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:58,120 INFO L87 Difference]: Start difference. First operand 6141 states and 7218 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-12-13 11:49:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:49:58,628 INFO L93 Difference]: Finished difference Result 7977 states and 9378 transitions. [2022-12-13 11:49:58,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:49:58,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 158 [2022-12-13 11:49:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:49:58,634 INFO L225 Difference]: With dead ends: 7977 [2022-12-13 11:49:58,634 INFO L226 Difference]: Without dead ends: 3937 [2022-12-13 11:49:58,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:49:58,638 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 171 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:49:58,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 372 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:49:58,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2022-12-13 11:49:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3937. [2022-12-13 11:49:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3937 states, 3191 states have (on average 1.144468818552178) internal successors, (3652), 3225 states have internal predecessors, (3652), 380 states have call successors, (380), 295 states have call predecessors, (380), 364 states have return successors, (516), 417 states have call predecessors, (516), 379 states have call successors, (516) [2022-12-13 11:49:59,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 4548 transitions. [2022-12-13 11:49:59,035 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 4548 transitions. Word has length 158 [2022-12-13 11:49:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:49:59,035 INFO L495 AbstractCegarLoop]: Abstraction has 3937 states and 4548 transitions. [2022-12-13 11:49:59,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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-12-13 11:49:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 4548 transitions. [2022-12-13 11:49:59,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-12-13 11:49:59,037 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:49:59,037 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:49:59,042 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 11:49:59,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:49:59,238 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:49:59,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:49:59,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1011844634, now seen corresponding path program 1 times [2022-12-13 11:49:59,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:49:59,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207420562] [2022-12-13 11:49:59,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:49:59,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:49:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:49:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:49:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:49:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:49:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:49:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 11:49:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 11:49:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-12-13 11:49:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-12-13 11:49:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:49:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:49:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-12-13 11:49:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-12-13 11:49:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 11:49:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:49:59,311 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-12-13 11:49:59,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:49:59,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207420562] [2022-12-13 11:49:59,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207420562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:49:59,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:49:59,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 11:49:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395408479] [2022-12-13 11:49:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:49:59,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:49:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:49:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:49:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:49:59,312 INFO L87 Difference]: Start difference. First operand 3937 states and 4548 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 11:50:00,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:00,004 INFO L93 Difference]: Finished difference Result 5801 states and 6758 transitions. [2022-12-13 11:50:00,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 11:50:00,004 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 159 [2022-12-13 11:50:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:00,010 INFO L225 Difference]: With dead ends: 5801 [2022-12-13 11:50:00,010 INFO L226 Difference]: Without dead ends: 4040 [2022-12-13 11:50:00,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:50:00,012 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 316 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:00,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 708 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:50:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2022-12-13 11:50:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3496. [2022-12-13 11:50:00,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 2842 states have (on average 1.145320197044335) internal successors, (3255), 2875 states have internal predecessors, (3255), 336 states have call successors, (336), 259 states have call predecessors, (336), 316 states have return successors, (448), 362 states have call predecessors, (448), 335 states have call successors, (448) [2022-12-13 11:50:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4039 transitions. [2022-12-13 11:50:00,388 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4039 transitions. Word has length 159 [2022-12-13 11:50:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:00,388 INFO L495 AbstractCegarLoop]: Abstraction has 3496 states and 4039 transitions. [2022-12-13 11:50:00,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 4 states have internal predecessors, (94), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-12-13 11:50:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4039 transitions. [2022-12-13 11:50:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-12-13 11:50:00,390 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:00,390 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:00,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 11:50:00,390 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:00,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:00,391 INFO L85 PathProgramCache]: Analyzing trace with hash 978764957, now seen corresponding path program 1 times [2022-12-13 11:50:00,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:00,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701139246] [2022-12-13 11:50:00,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:00,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:50:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:50:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:50:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:50:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:50:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 11:50:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 11:50:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 11:50:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 11:50:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:50:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-12-13 11:50:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-12-13 11:50:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,516 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 19 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-12-13 11:50:00,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701139246] [2022-12-13 11:50:00,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701139246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:50:00,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93678680] [2022-12-13 11:50:00,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:00,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:00,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:50:00,517 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:50:00,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:50:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:00,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 11:50:00,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:50:00,688 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-12-13 11:50:00,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:50:00,872 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-12-13 11:50:00,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93678680] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:50:00,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:50:00,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-12-13 11:50:00,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473918718] [2022-12-13 11:50:00,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:50:00,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 11:50:00,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:00,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 11:50:00,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:50:00,875 INFO L87 Difference]: Start difference. First operand 3496 states and 4039 transitions. Second operand has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-12-13 11:50:02,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:02,174 INFO L93 Difference]: Finished difference Result 5531 states and 6517 transitions. [2022-12-13 11:50:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:50:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 162 [2022-12-13 11:50:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:02,180 INFO L225 Difference]: With dead ends: 5531 [2022-12-13 11:50:02,180 INFO L226 Difference]: Without dead ends: 3783 [2022-12-13 11:50:02,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 353 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2022-12-13 11:50:02,183 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1042 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:02,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 925 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-12-13 11:50:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2022-12-13 11:50:02,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3583. [2022-12-13 11:50:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 2887 states have (on average 1.1323172843782474) internal successors, (3269), 2925 states have internal predecessors, (3269), 358 states have call successors, (358), 283 states have call predecessors, (358), 336 states have return successors, (499), 375 states have call predecessors, (499), 357 states have call successors, (499) [2022-12-13 11:50:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4126 transitions. [2022-12-13 11:50:02,617 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4126 transitions. Word has length 162 [2022-12-13 11:50:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:02,617 INFO L495 AbstractCegarLoop]: Abstraction has 3583 states and 4126 transitions. [2022-12-13 11:50:02,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.571428571428573) internal successors, (246), 12 states have internal predecessors, (246), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2022-12-13 11:50:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4126 transitions. [2022-12-13 11:50:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-12-13 11:50:02,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:02,620 INFO L195 NwaCegarLoop]: trace histogram [4, 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, 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] [2022-12-13 11:50:02,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-13 11:50:02,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:02,821 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:02,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1575925759, now seen corresponding path program 2 times [2022-12-13 11:50:02,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:02,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607866765] [2022-12-13 11:50:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:02,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:50:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 11:50:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 11:50:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-12-13 11:50:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:50:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-12-13 11:50:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-12-13 11:50:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:50:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-12-13 11:50:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:50:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-12-13 11:50:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-12-13 11:50:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-12-13 11:50:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-12-13 11:50:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:02,920 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-12-13 11:50:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:02,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607866765] [2022-12-13 11:50:02,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607866765] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:02,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:50:02,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:50:02,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029212951] [2022-12-13 11:50:02,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:02,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:50:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:02,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:50:02,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:50:02,922 INFO L87 Difference]: Start difference. First operand 3583 states and 4126 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 11:50:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:03,781 INFO L93 Difference]: Finished difference Result 5452 states and 6270 transitions. [2022-12-13 11:50:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:50:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 175 [2022-12-13 11:50:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:03,784 INFO L225 Difference]: With dead ends: 5452 [2022-12-13 11:50:03,785 INFO L226 Difference]: Without dead ends: 1760 [2022-12-13 11:50:03,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-12-13 11:50:03,788 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 802 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:03,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 611 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 11:50:03,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2022-12-13 11:50:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1760. [2022-12-13 11:50:03,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1387 states have (on average 1.1391492429704397) internal successors, (1580), 1408 states have internal predecessors, (1580), 180 states have call successors, (180), 156 states have call predecessors, (180), 192 states have return successors, (286), 195 states have call predecessors, (286), 179 states have call successors, (286) [2022-12-13 11:50:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2046 transitions. [2022-12-13 11:50:03,983 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2046 transitions. Word has length 175 [2022-12-13 11:50:03,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:03,984 INFO L495 AbstractCegarLoop]: Abstraction has 1760 states and 2046 transitions. [2022-12-13 11:50:03,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 4 states have internal predecessors, (92), 5 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-12-13 11:50:03,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2046 transitions. [2022-12-13 11:50:03,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-12-13 11:50:03,985 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:03,985 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:50:03,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-12-13 11:50:03,986 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:03,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -61354190, now seen corresponding path program 1 times [2022-12-13 11:50:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:03,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175410638] [2022-12-13 11:50:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:50:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 11:50:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-12-13 11:50:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-12-13 11:50:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-12-13 11:50:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-12-13 11:50:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-12-13 11:50:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-12-13 11:50:04,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-12-13 11:50:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-12-13 11:50:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-12-13 11:50:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-12-13 11:50:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-12-13 11:50:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-12-13 11:50:04,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175410638] [2022-12-13 11:50:04,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175410638] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:50:04,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594754007] [2022-12-13 11:50:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:04,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:04,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:50:04,058 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:50:04,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:50:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:50:04,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:50:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2022-12-13 11:50:04,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:50:04,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594754007] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:50:04,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:50:04,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-13 11:50:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136983392] [2022-12-13 11:50:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:50:04,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:50:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:50:04,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 11:50:04,160 INFO L87 Difference]: Start difference. First operand 1760 states and 2046 transitions. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 11:50:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:04,470 INFO L93 Difference]: Finished difference Result 3405 states and 3969 transitions. [2022-12-13 11:50:04,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:50:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 179 [2022-12-13 11:50:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:04,473 INFO L225 Difference]: With dead ends: 3405 [2022-12-13 11:50:04,473 INFO L226 Difference]: Without dead ends: 1477 [2022-12-13 11:50:04,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-12-13 11:50:04,475 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:04,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 228 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:50:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2022-12-13 11:50:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1440. [2022-12-13 11:50:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1440 states, 1143 states have (on average 1.1286089238845145) internal successors, (1290), 1155 states have internal predecessors, (1290), 145 states have call successors, (145), 124 states have call predecessors, (145), 151 states have return successors, (214), 160 states have call predecessors, (214), 144 states have call successors, (214) [2022-12-13 11:50:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1649 transitions. [2022-12-13 11:50:04,640 INFO L78 Accepts]: Start accepts. Automaton has 1440 states and 1649 transitions. Word has length 179 [2022-12-13 11:50:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:04,640 INFO L495 AbstractCegarLoop]: Abstraction has 1440 states and 1649 transitions. [2022-12-13 11:50:04,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2022-12-13 11:50:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 1440 states and 1649 transitions. [2022-12-13 11:50:04,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2022-12-13 11:50:04,642 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:50:04,642 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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, 2, 2, 2, 2, 2, 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] [2022-12-13 11:50:04,647 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-12-13 11:50:04,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:04,843 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 11:50:04,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:50:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1658574142, now seen corresponding path program 1 times [2022-12-13 11:50:04,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:50:04,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963873924] [2022-12-13 11:50:04,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:04,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:50:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-12-13 11:50:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-12-13 11:50:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-12-13 11:50:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:04,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-12-13 11:50:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-12-13 11:50:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-12-13 11:50:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-12-13 11:50:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-12-13 11:50:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-12-13 11:50:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-12-13 11:50:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-12-13 11:50:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-12-13 11:50:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-12-13 11:50:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-12-13 11:50:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-12-13 11:50:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-12-13 11:50:04,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-12-13 11:50:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-12-13 11:50:04,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-12-13 11:50:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-12-13 11:50:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-12-13 11:50:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 75 proven. 16 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-12-13 11:50:04,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:50:04,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963873924] [2022-12-13 11:50:04,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963873924] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:50:04,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007909862] [2022-12-13 11:50:04,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:50:04,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:04,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:50:04,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:50:04,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:50:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:50:05,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 11:50:05,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:50:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 256 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 11:50:05,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:50:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-12-13 11:50:05,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007909862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:50:05,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:50:05,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-12-13 11:50:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710847238] [2022-12-13 11:50:05,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:50:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:50:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:50:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:50:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:50:05,273 INFO L87 Difference]: Start difference. First operand 1440 states and 1649 transitions. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 11:50:05,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:50:05,693 INFO L93 Difference]: Finished difference Result 1743 states and 1984 transitions. [2022-12-13 11:50:05,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 11:50:05,693 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 253 [2022-12-13 11:50:05,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:50:05,694 INFO L225 Difference]: With dead ends: 1743 [2022-12-13 11:50:05,694 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 11:50:05,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 574 GetRequests, 549 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-12-13 11:50:05,695 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 331 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:50:05,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 362 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 11:50:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 11:50:05,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 11:50:05,696 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-12-13 11:50:05,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 11:50:05,696 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 253 [2022-12-13 11:50:05,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:50:05,696 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 11:50:05,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 8 states have internal predecessors, (228), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2022-12-13 11:50:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 11:50:05,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 11:50:05,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-12-13 11:50:05,698 INFO L805 garLoopResultBuilder]: Registering result SAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-12-13 11:50:05,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 11:50:05,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:50:05,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 11:51:13,078 INFO L899 garLoopResultBuilder]: For program point immediate_notifyEXIT(lines 812 822) no Hoare annotation was computed. [2022-12-13 11:51:13,079 INFO L899 garLoopResultBuilder]: For program point immediate_notifyFINAL(lines 812 822) no Hoare annotation was computed. [2022-12-13 11:51:13,079 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 812 822) the Hoare annotation is: (let ((.cse13 (not (<= 2 |old(~m_st~0)|))) (.cse16 (= ~E_M~0 0)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse14 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse15 (= |old(~t1_st~0)| 0)) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~c_num_read~0 0))) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 (not (<= ~t1_pc~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse13 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse16 .cse7 .cse8 (not (< ~local~0 ~token~0)) .cse10 .cse11 (not (<= 2 ~E_1~0)) (not (<= ~token~0 (+ ~local~0 1)))) (let ((.cse17 (<= ~m_pc~0 0))) (or .cse1 (and (or (not (<= ~t1_pc~0 1)) (<= ~m_pc~0 1)) (not .cse17)) .cse13 .cse3 .cse4 .cse5 .cse6 .cse16 .cse7 .cse8 .cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) (and (not (<= 1 ~t1_pc~0)) .cse17) .cse11)) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2022-12-13 11:51:13,079 INFO L899 garLoopResultBuilder]: For program point update_channels1EXIT(lines 226 240) no Hoare annotation was computed. [2022-12-13 11:51:13,079 INFO L899 garLoopResultBuilder]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2022-12-13 11:51:13,080 INFO L895 garLoopResultBuilder]: At program point update_fifo_q_returnLabel#1(lines 39 58) the Hoare annotation is: (let ((.cse1 (not (<= ~c_dr_pc~0 0))) (.cse27 (<= ~q_req_up~0 0)) (.cse24 (not (= |old(~q_req_up~0)| 1))) (.cse14 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse15 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (not (= ~q_free~0 0))) (.cse19 (not (= |old(~q_read_ev~0)| 2))) (.cse28 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse0 (= ~c_dr_st~0 0)) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse3 (not (= ~M_E~0 2))) (.cse25 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse26 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (<= |old(~q_req_up~0)| 0))) (.cse8 (= ~p_dw_st~0 0)) (.cse18 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse23 (not (<= 2 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 (= |old(~q_write_ev~0)| 0) .cse12 .cse13) (or .cse1 .cse2 (not .cse8) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 (not (= ~p_num_write~0 0)) .cse5 (not (= ~c_num_read~0 0)) .cse7 .cse17 .cse18 .cse9 .cse10 .cse19 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 (not (<= 1 |old(~q_read_ev~0)|)) .cse24 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse8 .cse9 .cse10 .cse23 (and .cse27 .cse28) .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 (and .cse27 (= ~q_read_ev~0 2)) .cse2 .cse3 .cse24 .cse14 .cse4 .cse15 .cse5 .cse6 .cse7 .cse16 .cse8 .cse18 .cse9 .cse10 .cse23 .cse19 .cse20 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse28 .cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse25 .cse4 .cse5 .cse26 .cse7 .cse16 .cse17 .cse8 .cse18 .cse9 .cse10 .cse23 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13))) [2022-12-13 11:51:13,080 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 226 240) the Hoare annotation is: (let ((.cse38 (= ~q_read_ev~0 2)) (.cse39 (= ~T1_E~0 ~M_E~0)) (.cse36 (= ~q_ev~0 |old(~q_ev~0)|)) (.cse40 (= ~p_last_write~0 ~q_buf_0~0)) (.cse44 (= ~m_pc~0 ~t1_pc~0)) (.cse49 (<= 1 ~c_dr_pc~0)) (.cse48 (= ~q_free~0 1)) (.cse46 (<= ~c_dr_pc~0 1)) (.cse45 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse32 (<= ~m_pc~0 1)) (.cse31 (<= ~m_pc~0 0)) (.cse34 (= ~E_M~0 0)) (.cse37 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse41 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse42 (= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse47 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (= ~M_E~0 2)) (.cse51 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (let ((.cse23 (and .cse39 .cse36 .cse40 .cse44 .cse49 .cse48 .cse46 .cse45 .cse50 (or (not .cse32) .cse31) (not .cse34) .cse37 .cse41 .cse42 .cse47 .cse43 .cse51)) (.cse29 (not (= ~p_num_write~0 0))) (.cse30 (not (= ~c_num_read~0 0))) (.cse4 (and .cse36 .cse37 .cse42 .cse38)) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse20 (not .cse51)) (.cse21 (not .cse50)) (.cse35 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse24 (not .cse49)) (.cse25 (not .cse48)) (.cse26 (not .cse47)) (.cse27 (not (= |old(~q_req_up~0)| 1))) (.cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse6 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse10 (not .cse46)) (.cse13 (not .cse45)) (.cse22 (not (<= 2 |old(~q_write_ev~0)|))) (.cse16 (not (= |old(~q_read_ev~0)| 2))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse2 (not .cse43)) (.cse33 (and .cse36 .cse37 .cse41 .cse42)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse7 (not .cse40)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse12 (= ~p_dw_st~0 0)) (.cse14 (not .cse39)) (.cse15 (not (= ~m_st~0 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |old(~q_write_ev~0)| 0) .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (not (<= 1 |old(~q_read_ev~0)|)) .cse27 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse22 .cse23 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse28 .cse1 (not .cse12) .cse2 .cse4 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse5 .cse29 .cse7 .cse30 .cse9 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 (and (not .cse31) .cse32) .cse33 .cse29 .cse7 .cse34 .cse30 .cse12 .cse13 .cse35 .cse14 .cse25 .cse26) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse33 .cse20 .cse5 .cse7 .cse21 .cse9 .cse10 .cse12 .cse35 .cse14 .cse15 .cse22 .cse24 .cse17 .cse25 .cse26 .cse18 .cse19) (or .cse0 .cse1 .cse2 .cse27 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (and (= ~q_req_up~0 1) .cse36 .cse37 .cse38) .cse13 .cse14 .cse15 .cse22 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse28 .cse1 .cse2 .cse33 .cse5 .cse7 .cse8 .cse9 .cse12 .cse14 .cse15 .cse17 .cse18 .cse19)))) [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 42 57) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L230-1(lines 226 240) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L803-2(lines 787 811) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L795(lines 795 799) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L601(lines 601 606) no Hoare annotation was computed. [2022-12-13 11:51:13,081 INFO L899 garLoopResultBuilder]: For program point L795-2(lines 795 799) no Hoare annotation was computed. [2022-12-13 11:51:13,082 INFO L895 garLoopResultBuilder]: At program point L630(lines 618 632) the Hoare annotation is: (let ((.cse44 (<= ~p_dw_pc~0 0)) (.cse45 (<= ~p_dw_pc~0 1)) (.cse21 (= ~E_M~0 0)) (.cse47 (<= ~m_pc~0 1)) (.cse46 (<= ~m_pc~0 0))) (let ((.cse30 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse31 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse37 (= ~p_num_write~0 0)) (.cse35 (= ~c_num_read~0 0)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= |old(~t1_st~0)| ~t1_st~0)) (.cse38 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse29 (= ~m_st~0 |old(~m_st~0)|)) (.cse34 (= ~q_free~0 0)) (.cse39 (<= 2 ~m_st~0)) (.cse33 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse40 (or (not .cse47) .cse46)) (.cse41 (not .cse21)) (.cse42 (= ~p_dw_st~0 0)) (.cse32 (= ~c_last_read~0 ~p_last_write~0)) (.cse43 (or .cse44 (not .cse45))) (.cse48 (= ~M_E~0 2))) (let ((.cse6 (not (<= ~t1_pc~0 0))) (.cse17 (not .cse48)) (.cse18 (and (= ~T1_E~0 ~M_E~0) .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43 .cse48)) (.cse22 (and .cse30 .cse31)) (.cse27 (not (= |old(~m_st~0)| 0))) (.cse26 (and (not .cse46) .cse47)) (.cse23 (and (not .cse44) .cse45)) (.cse11 (not (<= 2 ~E_M~0))) (.cse16 (not (= ~token~0 ~local~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse42)) (.cse2 (and .cse37 .cse35 .cse36 .cse28 .cse38 .cse29 .cse34 .cse39 .cse33 .cse40 .cse41 .cse42 .cse32 .cse43)) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse19 (not (= ~t1_pc~0 1))) (.cse5 (not .cse38)) (.cse7 (not .cse37)) (.cse20 (= |old(~t1_st~0)| 0)) (.cse8 (not .cse36)) (.cse9 (not .cse35)) (.cse10 (not .cse34)) (.cse24 (not (< ~local~0 ~token~0))) (.cse12 (not .cse33)) (.cse13 (and .cse28 .cse29 .cse30 .cse31)) (.cse14 (not .cse32)) (.cse15 (not (<= 2 ~E_1~0))) (.cse25 (not (<= ~token~0 (+ ~local~0 1))))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse22 .cse12 .cse23 .cse14 .cse15 .cse25) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse26 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse22 .cse12 .cse27 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse17 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse22 .cse12 .cse23 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse1 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse24 .cse12 .cse13 .cse27 .cse14 .cse15 .cse25) (or .cse1 .cse2 .cse26 .cse3 .cse5 .cse7 .cse8 .cse21 .cse9 .cse10 .cse12 .cse23 .cse14) (or .cse0 .cse1 .cse4 (and .cse28 .cse29) .cse19 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse16) (or .cse0 .cse1 .cse2 (and (= ~m_st~0 0) .cse30 .cse31 (not (= ~t1_st~0 0))) .cse3 .cse4 .cse19 .cse5 .cse7 .cse20 .cse8 .cse21 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse15 .cse25))))) [2022-12-13 11:51:13,082 INFO L899 garLoopResultBuilder]: For program point L620(lines 620 625) no Hoare annotation was computed. [2022-12-13 11:51:13,082 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 787 811) the Hoare annotation is: (let ((.cse18 (not (< ~local~0 ~token~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse17 (= ~E_M~0 0)) (.cse14 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~E_1~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 ~T1_E~0))) (.cse3 (and (= |old(~t1_st~0)| ~t1_st~0) (= ~m_st~0 |old(~m_st~0)|))) (.cse15 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse6 (not (= ~p_num_write~0 0))) (.cse16 (= |old(~t1_st~0)| 0)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse9 (not (= ~q_free~0 0))) (.cse10 (not (<= 2 ~E_M~0))) (.cse11 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse17 .cse8 .cse9 .cse18 .cse11 .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse18 .cse11 (not (= |old(~m_st~0)| 0)) .cse12 .cse19 .cse20) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19) (or .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse14 .cse3 .cse4 .cse6 .cse7 .cse17 .cse8 .cse9 .cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse12) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse6 .cse16 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-13 11:51:13,083 INFO L895 garLoopResultBuilder]: At program point is_transmit1_triggered_returnLabel#1(lines 615 633) the Hoare annotation is: (let ((.cse46 (<= ~p_dw_pc~0 0)) (.cse47 (<= ~p_dw_pc~0 1)) (.cse10 (= ~E_M~0 0)) (.cse49 (<= ~m_pc~0 1)) (.cse48 (<= ~m_pc~0 0))) (let ((.cse23 (<= |activate_threads2_is_transmit1_triggered_~__retres1~5#1| 0)) (.cse24 (<= 0 |activate_threads2_is_transmit1_triggered_~__retres1~5#1|)) (.cse25 (<= |activate_threads2_is_transmit1_triggered_#res#1| 0)) (.cse26 (<= 0 |activate_threads2_is_transmit1_triggered_#res#1|)) (.cse39 (= ~p_num_write~0 0)) (.cse37 (= ~c_num_read~0 0)) (.cse38 (= ~p_last_write~0 ~q_buf_0~0)) (.cse32 (= |old(~t1_st~0)| ~t1_st~0)) (.cse40 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse33 (= ~m_st~0 |old(~m_st~0)|)) (.cse36 (= ~q_free~0 0)) (.cse41 (<= 2 ~m_st~0)) (.cse35 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse42 (or (not .cse49) .cse48)) (.cse43 (not .cse10)) (.cse44 (= ~p_dw_st~0 0)) (.cse34 (= ~c_last_read~0 ~p_last_write~0)) (.cse45 (or .cse46 (not .cse47))) (.cse50 (= ~M_E~0 2))) (let ((.cse2 (not .cse50)) (.cse3 (and (= ~T1_E~0 ~M_E~0) .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45 .cse50)) (.cse18 (and .cse23 .cse24 .cse25 .cse26)) (.cse30 (and (not .cse48) .cse49)) (.cse15 (and (not .cse46) .cse47)) (.cse22 (not (< ~local~0 ~token~0))) (.cse31 (not (= |old(~m_st~0)| 0))) (.cse28 (not (<= ~token~0 (+ ~local~0 1)))) (.cse21 (= |old(~t1_st~0)| 0)) (.cse29 (not (<= ~t1_pc~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse44)) (.cse20 (and .cse39 .cse37 .cse38 .cse32 .cse40 .cse33 .cse36 .cse41 .cse35 .cse42 .cse43 .cse44 .cse34 .cse45)) (.cse4 (not (<= 2 |old(~m_st~0)|))) (.cse5 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not .cse40)) (.cse8 (not .cse39)) (.cse9 (not .cse38)) (.cse11 (not .cse37)) (.cse12 (not .cse36)) (.cse13 (not (<= 2 ~E_M~0))) (.cse14 (not .cse35)) (.cse27 (and .cse32 .cse33 .cse23 .cse24 .cse25 .cse26)) (.cse16 (not .cse34)) (.cse17 (not (<= 2 ~E_1~0))) (.cse19 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 (and (= ~m_st~0 0) .cse23 .cse24 .cse25 (not (= ~t1_st~0 0)) .cse26) .cse14 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse10 .cse11 .cse12 .cse22 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18) (or .cse0 .cse1 .cse30 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse31 .cse16 .cse17 .cse18 .cse19) (or .cse1 .cse20 .cse30 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse22 .cse14 .cse31 .cse27 .cse16 .cse17 .cse28) (or .cse0 .cse1 .cse5 (and .cse32 .cse33) .cse6 .cse7 .cse8 .cse21 .cse9 .cse11 .cse12 .cse13 .cse14 .cse16 .cse19) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse5 .cse7 .cse29 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse19) (or .cse0 .cse1 .cse20 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse27 .cse16 .cse17 .cse19))))) [2022-12-13 11:51:13,083 INFO L899 garLoopResultBuilder]: For program point activate_threads2EXIT(lines 787 811) no Hoare annotation was computed. [2022-12-13 11:51:13,083 INFO L899 garLoopResultBuilder]: For program point L600(lines 600 609) no Hoare annotation was computed. [2022-12-13 11:51:13,083 INFO L899 garLoopResultBuilder]: For program point L600-2(lines 600 609) no Hoare annotation was computed. [2022-12-13 11:51:13,083 INFO L895 garLoopResultBuilder]: At program point is_master_triggered_returnLabel#1(lines 596 614) the Hoare annotation is: (let ((.cse4 (= |old(~t1_st~0)| ~t1_st~0)) (.cse5 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse11 (= ~E_M~0 0)) (.cse14 (not (< ~local~0 ~token~0))) (.cse18 (not (<= ~token~0 (+ ~local~0 1)))) (.cse20 (not (<= ~t1_pc~0 0))) (.cse22 (not (= ~token~0 ~local~0))) (.cse19 (and (<= |activate_threads2_is_master_triggered_#res#1| 0) .cse4 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse5 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0) (<= 0 |activate_threads2_is_master_triggered_#res#1|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (not (<= 2 |old(~m_st~0)|))) (.cse3 (not (<= 2 ~T1_E~0))) (.cse6 (not (= ~t1_pc~0 1))) (.cse7 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse8 (not (= ~p_num_write~0 0))) (.cse9 (= |old(~t1_st~0)| 0)) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (= ~q_free~0 0))) (.cse21 (not (<= 2 ~E_M~0))) (.cse15 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (<= 2 ~E_1~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse15 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse14 .cse15 (not (= |old(~m_st~0)| 0)) .cse16 .cse17 .cse18) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17 .cse22) (or .cse19 .cse0 .cse1 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse3 .cse7 .cse20 .cse8 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse22) (or .cse19 .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse21 .cse15 .cse16 .cse17)))) [2022-12-13 11:51:13,083 INFO L899 garLoopResultBuilder]: For program point L619(lines 619 628) no Hoare annotation was computed. [2022-12-13 11:51:13,083 INFO L899 garLoopResultBuilder]: For program point L619-2(lines 619 628) no Hoare annotation was computed. [2022-12-13 11:51:13,084 INFO L895 garLoopResultBuilder]: At program point L611(lines 599 613) the Hoare annotation is: (let ((.cse17 (= |old(~t1_st~0)| ~t1_st~0)) (.cse18 (= ~m_st~0 |old(~m_st~0)|))) (let ((.cse16 (= ~E_M~0 0)) (.cse21 (not (<= ~t1_pc~0 0))) (.cse3 (not (<= 2 |old(~m_st~0)|))) (.cse19 (not (< ~local~0 ~token~0))) (.cse15 (not (<= 2 ~E_1~0))) (.cse20 (not (<= ~token~0 (+ ~local~0 1)))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (and .cse17 (<= 0 |activate_threads2_is_master_triggered_~__retres1~4#1|) .cse18 (<= |activate_threads2_is_master_triggered_~__retres1~4#1| 0))) (.cse4 (not (<= 2 ~T1_E~0))) (.cse5 (not (= ~t1_pc~0 1))) (.cse6 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse7 (not (= ~p_num_write~0 0))) (.cse8 (= |old(~t1_st~0)| 0)) (.cse9 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (not (= ~q_free~0 0))) (.cse12 (not (<= 2 ~E_M~0))) (.cse13 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse22 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse3 .cse6 .cse7 .cse9 .cse16 .cse10 .cse11 .cse13 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse14) (or .cse0 .cse1 .cse3 .cse4 (and .cse17 .cse18) .cse5 .cse6 .cse7 .cse8 .cse9 .cse16 .cse10 .cse11 .cse19 .cse13 .cse14 .cse15 .cse20) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse2 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse22) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse19 .cse13 (not (= |old(~m_st~0)| 0)) .cse14 .cse15 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse22)))) [2022-12-13 11:51:13,084 INFO L899 garLoopResultBuilder]: For program point L803(lines 803 807) no Hoare annotation was computed. [2022-12-13 11:51:13,084 INFO L895 garLoopResultBuilder]: At program point L321(line 321) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-12-13 11:51:13,084 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 327) the Hoare annotation is: (let ((.cse3 (= |old(~p_dw_st~0)| 0)) (.cse40 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse39 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse32 (<= activate_threads1_~tmp~1 0)) (.cse33 (< 0 (+ activate_threads1_~tmp~1 1))) (.cse16 (= ~p_dw_st~0 0))) (let ((.cse31 (not .cse16)) (.cse35 (and .cse40 .cse39 .cse32 .cse33)) (.cse26 (not (<= ~q_req_up~0 0))) (.cse38 (not .cse3)) (.cse15 (not (= ~c_dr_st~0 0))) (.cse30 (not (= ~q_free~0 0))) (.cse4 (and .cse40 .cse39)) (.cse17 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse21 (not (<= ~c_dr_pc~0 1))) (.cse23 (not (<= 2 ~q_write_ev~0))) (.cse24 (not (<= 1 ~c_dr_pc~0))) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse7 (= ~E_M~0 0)) (.cse10 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse29 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse37 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= ~c_num_read~0 0))) (.cse20 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse22 (not (= ~m_st~0 0))) (.cse36 (and .cse32 .cse33)) (.cse25 (not (= ~p_dw_i~0 1))) (.cse12 (not (= ~q_free~0 1))) (.cse13 (= |old(~c_dr_st~0)| 0)) (.cse34 (not (= ~q_read_ev~0 2))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse27 (not (<= 2 ~E_1~0))) (.cse28 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 (and (= ~q_read_ev~0 1) .cse15 .cse16) .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse26 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 (and .cse31 .cse32 .cse33) .cse25 .cse13 .cse34 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse35 .cse18 .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 .cse23 .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse31 .cse1 .cse3 .cse18 .cse6 .cse30 .cse20 .cse10 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse26 .cse34 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse25 .cse12 .cse38 .cse26 .cse34 .cse14 .cse27 (and .cse39 .cse32 .cse16 .cse33) .cse28) (or .cse0 .cse1 .cse3 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse3 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse35 .cse18 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse30 .cse20 .cse21 .cse9 .cse11 .cse22 (= ~q_write_ev~0 0) .cse25 .cse13 .cse26 .cse34 .cse27 .cse28) (or .cse29 .cse0 .cse1 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 (and .cse39 .cse16) .cse25 .cse12 .cse13 .cse38 .cse14 .cse27 .cse28) (or .cse29 .cse0 .cse1 (and .cse15 .cse16) .cse3 .cse4 .cse18 .cse6 .cse30 .cse20 .cse11 .cse22 .cse25 .cse13 .cse27 .cse28) (or .cse0 .cse1 .cse3 .cse4 .cse17 .cse18 .cse6 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse25 .cse12 .cse13 .cse14 .cse27 .cse28) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse36 .cse12 .cse13 .cse34 .cse14) (or .cse29 .cse0 .cse1 .cse37 .cse18 .cse5 .cse6 .cse8 .cse20 .cse9 .cse11 .cse22 .cse36 .cse25 .cse12 .cse13 .cse34 .cse14 .cse27 .cse28)))) [2022-12-13 11:51:13,084 INFO L899 garLoopResultBuilder]: For program point L321-1(line 321) no Hoare annotation was computed. [2022-12-13 11:51:13,084 INFO L899 garLoopResultBuilder]: For program point activate_threads1EXIT(lines 315 339) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L331(lines 331 335) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 315 339) the Hoare annotation is: (let ((.cse2 (= |old(~p_dw_st~0)| 0)) (.cse30 (= ~c_dr_st~0 |old(~c_dr_st~0)|))) (let ((.cse27 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (= ~p_num_write~0 0))) (.cse6 (not (= ~c_num_read~0 0))) (.cse28 (and .cse30 (= ~p_dw_st~0 0))) (.cse29 (not .cse2)) (.cse13 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (not (= ~m_pc~0 ~t1_pc~0))) (.cse1 (not (= ~M_E~0 2))) (.cse3 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) .cse30)) (.cse14 (not (<= ~t1_pc~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse25 (not (= ~q_free~0 0))) (.cse16 (not (<= 2 ~E_M~0))) (.cse17 (not (<= ~c_dr_pc~0 1))) (.cse7 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse18 (not (= ~m_st~0 0))) (.cse19 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= ~p_dw_i~0 1))) (.cse11 (= |old(~c_dr_st~0)| 0)) (.cse22 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse23 (not (<= 2 ~E_1~0))) (.cse24 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse2 .cse3 .cse4 .cse5 (= ~E_M~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse22 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 .cse14 (not (< ~c_num_read~0 ~p_num_write~0)) .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 (= ~q_write_ev~0 0) .cse21 .cse11 .cse22 .cse26 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse9 .cse18 .cse21 .cse11 .cse23 .cse24) (or .cse27 .cse0 .cse1 .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse11 .cse29 .cse12 .cse23 .cse24) (or .cse27 .cse0 .cse1 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse14 .cse4 .cse5 .cse6 .cse16 .cse7 .cse9 .cse18 .cse28 .cse21 .cse10 .cse29 .cse22 .cse26 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse13 .cse14 .cse5 .cse15 .cse16 .cse17 .cse8 .cse9 .cse18 .cse19 .cse20 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse25 .cse16 .cse17 .cse7 .cse9 .cse18 .cse19 .cse21 .cse11 .cse22 .cse26 .cse23 .cse24)))) [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L329(line 329) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L331-2(lines 315 339) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L323(lines 323 327) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point update_channels2EXIT(lines 634 641) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L902 garLoopResultBuilder]: At program point update_channels2FINAL(lines 634 641) the Hoare annotation is: true [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L735-1(lines 734 757) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L750-1(lines 731 758) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 731 758) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L745-1(lines 734 757) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point fire_delta_events2EXIT(lines 731 758) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L740-1(lines 734 757) no Hoare annotation was computed. [2022-12-13 11:51:13,085 INFO L899 garLoopResultBuilder]: For program point L288-1(lines 279 296) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point L283-1(lines 282 295) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 279 296) the Hoare annotation is: (let ((.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse19 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse8 (not (<= ~c_dr_pc~0 1))) (.cse21 (not (<= 2 |old(~q_write_ev~0)|))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse20 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse0 (= ~c_dr_st~0 0)) (.cse5 (and .cse29 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse6 (not (= ~q_free~0 0))) (.cse26 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse9 (= ~p_dw_st~0 0)) (.cse2 (not (= ~M_E~0 2))) (.cse3 (not (<= ~t1_pc~0 0))) (.cse27 (not (= ~p_num_write~0 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse28 (not (= ~c_num_read~0 0))) (.cse7 (not (<= 2 ~E_M~0))) (.cse10 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse11 (not (= ~T1_E~0 ~M_E~0))) (.cse12 (not (= ~m_st~0 0))) (.cse13 (not (= |old(~q_read_ev~0)| 2))) (.cse14 (not (= ~p_dw_i~0 1))) (.cse23 (not (= ~q_free~0 1))) (.cse15 (not (<= ~q_req_up~0 0))) (.cse24 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (not (<= 2 ~E_1~0))) (.cse25 (and .cse29 (= ~q_read_ev~0 2))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse3 (not (< ~c_num_read~0 ~p_num_write~0)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse20 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse25 .cse17) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse27 .cse4 .cse5 .cse28 .cse7 .cse10 .cse11 .cse12 .cse14 .cse23 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 .cse18 .cse3 .cse4 .cse19 .cse5 .cse7 .cse8 .cse9 .cse11 .cse12 .cse21 .cse22 .cse14 .cse23 .cse15 .cse24 .cse16 .cse17) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse27 .cse4 (= ~E_M~0 0) .cse5 .cse28 .cse9 .cse10 .cse20 .cse11 .cse23 .cse24) (or .cse0 .cse26 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11 .cse12 .cse14 .cse16 .cse17) (or .cse26 .cse1 (not .cse9) .cse2 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse3 .cse27 .cse4 .cse28 .cse7 .cse10 .cse11 .cse12 .cse13 .cse14 .cse23 .cse15 .cse24 .cse16 .cse25 .cse17)))) [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point fire_delta_events1EXIT(lines 279 296) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 98) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 101) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point L92-2(lines 92 101) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredFINAL(lines 88 106) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 88 106) the Hoare annotation is: true [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point is_do_read_c_triggeredEXIT(lines 88 106) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L895 garLoopResultBuilder]: At program point L103(lines 91 105) the Hoare annotation is: (let ((.cse33 (= ~T1_E~0 ~M_E~0)) (.cse37 (= ~m_pc~0 ~t1_pc~0)) (.cse39 (<= ~c_dr_pc~0 1)) (.cse31 (<= is_do_read_c_triggered_~__retres1~1 0)) (.cse38 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse35 (<= ~m_pc~0 1)) (.cse34 (<= ~m_pc~0 0)) (.cse7 (= ~E_M~0 0)) (.cse32 (<= 0 is_do_read_c_triggered_~__retres1~1)) (.cse36 (= ~M_E~0 2)) (.cse40 (<= 1 ~c_dr_pc~0))) (let ((.cse24 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse8 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse16 (not .cse40)) (.cse22 (and .cse33 .cse37 .cse40 .cse39 .cse31 .cse38 (or (not .cse35) .cse34) (not .cse7) .cse32 .cse36)) (.cse10 (not .cse39)) (.cse11 (= ~p_dw_st~0 0)) (.cse26 (not (= ~p_num_write~0 0))) (.cse27 (not (= ~c_num_read~0 0))) (.cse12 (not .cse38)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (<= ~q_req_up~0 0))) (.cse30 (not (= ~q_read_ev~0 2))) (.cse20 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse28 (not (<= ~c_dr_pc~0 0))) (.cse1 (not .cse37)) (.cse2 (not .cse36)) (.cse3 (and (not .cse34) .cse35)) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse29 (not (= ~q_free~0 0))) (.cse9 (not (<= 2 ~E_M~0))) (.cse13 (not .cse33)) (.cse14 (not (= ~m_st~0 0))) (.cse25 (and .cse31 .cse32)) (.cse17 (not (= ~p_dw_i~0 1))) (.cse21 (not (<= 2 ~E_1~0))) (.cse23 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse24 .cse13 .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse6 .cse7 .cse27 .cse11 .cse12 .cse24 .cse13 .cse25 .cse18 .cse20) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse26 .cse6 .cse7 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse20 .cse21 .cse23) (or .cse0 .cse1 .cse2 .cse5 .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse0 .cse1 (not (= ~q_read_ev~0 1)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse5 (< 0 ~q_write_ev~0) (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~q_write_ev~0 0) .cse25 .cse17 .cse19 .cse30 .cse21 .cse23) (or .cse28 .cse1 (not .cse11) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse5 .cse26 .cse6 .cse27 .cse9 .cse12 .cse13 .cse14 .cse25 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse23) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse29 .cse9 .cse13 .cse14 .cse25 .cse17 .cse21 .cse23)))) [2022-12-13 11:51:13,086 INFO L899 garLoopResultBuilder]: For program point L960(lines 960 966) no Hoare annotation was computed. [2022-12-13 11:51:13,086 INFO L895 garLoopResultBuilder]: At program point main1_returnLabel#1(lines 473 484) the Hoare annotation is: (= ~M_E~0 2) [2022-12-13 11:51:13,087 INFO L895 garLoopResultBuilder]: At program point L927(line 927) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L927-1(line 927) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L895 garLoopResultBuilder]: At program point transmit1_T1_WAIT#1(lines 563 594) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 (<= 2 ~E_M~0) .cse4 .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (= ~token~0 ~local~0)))) [2022-12-13 11:51:13,087 INFO L895 garLoopResultBuilder]: At program point L250-1(lines 241 258) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L696(lines 686 724) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L564(lines 564 572) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L878(lines 878 883) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L713(lines 713 720) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L350(line 350) no Hoare annotation was computed. [2022-12-13 11:51:13,087 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 132 171) the Hoare annotation is: (let ((.cse13 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~q_req_up~0 1)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse7 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse8 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse16 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse12 (= ~p_dw_i~0 1)) (.cse14 (= ~token~0 ~local~0)) (.cse15 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~c_num_read~0 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~p_num_write~0 1) (<= 1 ~q_read_ev~0) .cse12 .cse13 (<= 1 ~p_num_write~0) .cse14 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse16 .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 (= ~q_read_ev~0 2) .cse12 .cse14 .cse15 (<= ~p_num_write~0 (+ ~c_num_read~0 1))))) [2022-12-13 11:51:13,087 INFO L899 garLoopResultBuilder]: For program point L532(line 532) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L895 garLoopResultBuilder]: At program point L400(line 400) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-12-13 11:51:13,088 INFO L895 garLoopResultBuilder]: At program point L912(line 912) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L400-1(line 400) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L912-1(line 912) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L846-1(lines 835 858) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 144) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L962(lines 962 965) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L895 garLoopResultBuilder]: At program point L897(line 897) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L352(lines 352 356) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L897-1(line 897) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L352-1(lines 347 387) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L699(lines 699 706) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L899 garLoopResultBuilder]: For program point L567(lines 567 571) no Hoare annotation was computed. [2022-12-13 11:51:13,088 INFO L895 garLoopResultBuilder]: At program point L435(line 435) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-12-13 11:51:13,089 INFO L899 garLoopResultBuilder]: For program point L435-1(line 435) no Hoare annotation was computed. [2022-12-13 11:51:13,089 INFO L899 garLoopResultBuilder]: For program point L402(lines 402 407) no Hoare annotation was computed. [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point transmit1_returnLabel#1(lines 560 595) the Hoare annotation is: (let ((.cse3 (<= ~m_pc~0 0))) (let ((.cse6 (<= 2 ~m_st~0)) (.cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3)) (.cse11 (= ~t1_pc~0 1)) (.cse12 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~m_st~0 0)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 .cse5 .cse7 .cse14 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)) (and .cse11 .cse12 .cse0 .cse1 .cse2 .cse13 .cse4 .cse17 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse16 (< ~local~0 ~token~0))))) [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point init_model2_returnLabel#1(lines 860 869) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 11:51:13,089 INFO L899 garLoopResultBuilder]: For program point L139(lines 139 143) no Hoare annotation was computed. [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point L651-1(lines 642 659) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point L585(line 585) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (<= 2 ~m_st~0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse3 (<= ~m_pc~0 0))) (and .cse0 .cse1 .cse2 (or (<= 1 ~t1_pc~0) (not .cse3)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (and (<= ~t1_pc~0 1) (not (<= ~m_pc~0 1))) .cse3) (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))))) (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) .cse0 .cse1 .cse2 .cse4 (<= ~token~0 (+ ~local~0 1)) .cse5 .cse6 .cse7 (<= 2 ~T1_E~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)))) [2022-12-13 11:51:13,089 INFO L899 garLoopResultBuilder]: For program point L585-1(line 585) no Hoare annotation was computed. [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point L420(line 420) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 11:51:13,089 INFO L899 garLoopResultBuilder]: For program point L420-1(line 420) no Hoare annotation was computed. [2022-12-13 11:51:13,089 INFO L895 garLoopResultBuilder]: At program point L899(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-12-13 11:51:13,090 INFO L895 garLoopResultBuilder]: At program point do_read_c_DR_WAIT_WRITE#1(lines 176 224) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (< ~c_num_read~0 ~p_num_write~0) (<= 2 ~E_M~0) (<= 1 ~c_dr_pc~0) (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|) (= ~m_st~0 0) (<= 2 ~q_write_ev~0) (<= ~c_dr_pc~0 1) (not (= ~c_dr_st~0 0)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (<= 1 ~q_read_ev~0) (= ~p_dw_i~0 1) (= ~token~0 ~local~0) (= ~M_E~0 2) (<= ~p_num_write~0 (+ ~c_num_read~0 1))) [2022-12-13 11:51:13,090 INFO L895 garLoopResultBuilder]: At program point L899-1(line 899) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-12-13 11:51:13,090 INFO L899 garLoopResultBuilder]: For program point L189(lines 188 219) no Hoare annotation was computed. [2022-12-13 11:51:13,090 INFO L895 garLoopResultBuilder]: At program point L916(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,090 INFO L895 garLoopResultBuilder]: At program point L916-1(line 916) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,090 INFO L902 garLoopResultBuilder]: At program point start_simulation2_returnLabel#1(lines 889 947) the Hoare annotation is: true [2022-12-13 11:51:13,090 INFO L899 garLoopResultBuilder]: For program point L206(lines 206 218) no Hoare annotation was computed. [2022-12-13 11:51:13,091 INFO L899 garLoopResultBuilder]: For program point L520(lines 520 528) no Hoare annotation was computed. [2022-12-13 11:51:13,091 INFO L895 garLoopResultBuilder]: At program point L900(line 900) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~m_st~0) .cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 (<= 2 ~E_1~0) .cse1 .cse2 .cse3 .cse4 (<= 2 ~E_M~0) .cse5 (= ~m_st~0 0) .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) .cse10))) [2022-12-13 11:51:13,091 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 11:51:13,091 INFO L895 garLoopResultBuilder]: At program point master_returnLabel#1(lines 516 559) the Hoare annotation is: (let ((.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (<= 2 ~m_st~0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse9 (<= 2 ~T1_E~0)) (.cse10 (= ~p_dw_st~0 0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse13 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~t1_pc~0 0) .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2022-12-13 11:51:13,091 INFO L899 garLoopResultBuilder]: For program point L190-1(lines 190 200) no Hoare annotation was computed. [2022-12-13 11:51:13,091 INFO L895 garLoopResultBuilder]: At program point stop_simulation2_returnLabel#1(lines 870 888) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,092 INFO L895 garLoopResultBuilder]: At program point L537(line 537) the Hoare annotation is: (let ((.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~E_M~0)) (.cse4 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse7 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse11 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse3 .cse4 .cse5 .cse6 (<= ~t1_pc~0 0) .cse7 .cse8 .cse9 .cse10 .cse11) (and (= ~t1_pc~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= ~t1_st~0 0)) .cse11))) [2022-12-13 11:51:13,092 INFO L899 garLoopResultBuilder]: For program point L537-1(line 537) no Hoare annotation was computed. [2022-12-13 11:51:13,092 INFO L895 garLoopResultBuilder]: At program point fire_time_events2_returnLabel#1(lines 823 831) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,092 INFO L895 garLoopResultBuilder]: At program point L917(line 917) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,093 INFO L895 garLoopResultBuilder]: At program point L372(lines 347 387) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-12-13 11:51:13,093 INFO L895 garLoopResultBuilder]: At program point L851-1(lines 832 859) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,093 INFO L899 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2022-12-13 11:51:13,093 INFO L895 garLoopResultBuilder]: At program point L422(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-12-13 11:51:13,093 INFO L895 garLoopResultBuilder]: At program point L422-1(line 422) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-12-13 11:51:13,094 INFO L895 garLoopResultBuilder]: At program point L439(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse19 .cse7 .cse20 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse13 .cse14 .cse5 .cse16 .cse22 .cse17 .cse19 .cse7 .cse20 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-12-13 11:51:13,094 INFO L895 garLoopResultBuilder]: At program point L439-1(line 439) the Hoare annotation is: (let ((.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse21 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse13 (<= ~c_dr_pc~0 1)) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse11 (<= 2 ~E_M~0)) (.cse12 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_free~0 0)) (.cse15 (<= ~t1_pc~0 0)) (.cse18 (= ~p_dw_i~0 1)) (.cse19 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) (< ~c_num_read~0 ~p_num_write~0) .cse11 .cse12 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse20 .cse13 .cse5 .cse14 .cse6 .cse15 .cse16 .cse17 .cse18 .cse19 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse18 .cse7 .cse19 .cse8 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse21 .cse12 .cse4 .cse20 .cse13 .cse5 .cse15 .cse22 .cse16 .cse18 .cse7 .cse19 .cse9 .cse23) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse5 .cse14 .cse15 .cse18 (<= ~c_dr_pc~0 0) .cse19 .cse9))) [2022-12-13 11:51:13,094 INFO L895 garLoopResultBuilder]: At program point start_simulation1_returnLabel#1(lines 413 455) the Hoare annotation is: (= ~M_E~0 2) [2022-12-13 11:51:13,094 INFO L895 garLoopResultBuilder]: At program point L918(line 918) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,095 INFO L895 garLoopResultBuilder]: At program point L885(lines 874 887) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,095 INFO L895 garLoopResultBuilder]: At program point L687(line 687) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,095 INFO L895 garLoopResultBuilder]: At program point L423(line 423) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_st~0 0))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse11 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse6 (= ~q_free~0 1)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= ~t1_pc~0 0)) (.cse2 (= ~p_dw_st~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0)) (.cse10 (= ~M_E~0 2))) (or (and .cse0 .cse1 (not .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 .cse13 .cse6 .cse7 .cse8 .cse14 .cse15 .cse9 .cse16 .cse17 .cse10) (and .cse0 .cse11 .cse1 .cse3 .cse4 .cse5 .cse12 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse6 .cse8 .cse14 (<= ~q_req_up~0 0) .cse2 (= ~q_read_ev~0 2) .cse15 .cse9 .cse16 .cse17 .cse10))) [2022-12-13 11:51:13,095 INFO L899 garLoopResultBuilder]: For program point L357(lines 347 387) no Hoare annotation was computed. [2022-12-13 11:51:13,095 INFO L899 garLoopResultBuilder]: For program point L836(lines 836 840) no Hoare annotation was computed. [2022-12-13 11:51:13,096 INFO L899 garLoopResultBuilder]: For program point L836-2(lines 835 858) no Hoare annotation was computed. [2022-12-13 11:51:13,096 INFO L895 garLoopResultBuilder]: At program point L440(line 440) the Hoare annotation is: (let ((.cse24 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (< ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse12 (< 0 ~q_write_ev~0)) (.cse14 (= ~q_read_ev~0 2)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse2 (not (= ~p_dw_st~0 0))) (.cse18 (<= 1 ~c_dr_pc~0)) (.cse19 (= ~q_free~0 1)) (.cse20 (<= 2 ~q_write_ev~0)) (.cse7 (<= ~c_dr_pc~0 1)) (.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (<= ~q_req_up~0 0)) (.cse22 (= ~c_last_read~0 ~p_last_write~0)) (.cse23 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (= ~m_st~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_free~0 0)) (.cse11 (<= ~t1_pc~0 0)) (.cse15 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 (= ~q_read_ev~0 1) .cse20 .cse7 .cse8 .cse10 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 (= ~p_num_write~0 0) .cse2 (= ~c_num_read~0 0) .cse3 .cse4 .cse19 .cse8 .cse10 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse22 .cse24 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~q_write_ev~0 0)) .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse15 .cse22 .cse16 .cse24 .cse17 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse25 .cse5 .cse18 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse19 .cse20 .cse7 .cse8 .cse11 .cse21 .cse13 .cse15 .cse22 .cse16 .cse17 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse11 .cse15 (<= ~c_dr_pc~0 0) .cse16 .cse17))) [2022-12-13 11:51:13,096 INFO L899 garLoopResultBuilder]: For program point L523(lines 523 527) no Hoare annotation was computed. [2022-12-13 11:51:13,096 INFO L895 garLoopResultBuilder]: At program point error2_returnLabel#1(lines 492 499) the Hoare annotation is: false [2022-12-13 11:51:13,096 INFO L899 garLoopResultBuilder]: For program point L936(lines 936 940) no Hoare annotation was computed. [2022-12-13 11:51:13,096 INFO L895 garLoopResultBuilder]: At program point eval2_returnLabel#1(lines 680 730) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,097 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 11:51:13,097 INFO L899 garLoopResultBuilder]: For program point L441(line 441) no Hoare annotation was computed. [2022-12-13 11:51:13,097 INFO L899 garLoopResultBuilder]: For program point L177(lines 177 185) no Hoare annotation was computed. [2022-12-13 11:51:13,097 INFO L899 garLoopResultBuilder]: For program point L689(line 689) no Hoare annotation was computed. [2022-12-13 11:51:13,097 INFO L895 garLoopResultBuilder]: At program point init_model1_returnLabel#1(lines 456 472) the Hoare annotation is: (and (= ~T1_E~0 ~M_E~0) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~m_pc~0 ~t1_pc~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~m_st~0 0) (= ~q_free~0 1) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= ~t1_pc~0 0) (<= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (= ~token~0 ~local~0) (= ~M_E~0 2)) [2022-12-13 11:51:13,097 INFO L895 garLoopResultBuilder]: At program point L904-1(lines 904 941) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,097 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 173 225) the Hoare annotation is: (let ((.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse13 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (<= 1 ~c_dr_pc~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse8 (= ~q_free~0 1)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (<= ~c_dr_pc~0 1)) (.cse11 (not (= ~c_dr_st~0 0))) (.cse12 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse15 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~q_req_up~0 0) .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse0 (= ~q_req_up~0 1) .cse1 (not .cse13) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 ~c_num_read~0) (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-12-13 11:51:13,098 INFO L895 garLoopResultBuilder]: At program point L409(lines 398 411) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-12-13 11:51:13,098 INFO L899 garLoopResultBuilder]: For program point L921(line 921) no Hoare annotation was computed. [2022-12-13 11:51:13,098 INFO L899 garLoopResultBuilder]: For program point L376(lines 376 383) no Hoare annotation was computed. [2022-12-13 11:51:13,098 INFO L895 garLoopResultBuilder]: At program point L211(line 211) the Hoare annotation is: false [2022-12-13 11:51:13,098 INFO L895 garLoopResultBuilder]: At program point stop_simulation1_returnLabel#1(lines 394 412) the Hoare annotation is: (let ((.cse11 (< ~c_num_read~0 ~p_num_write~0)) (.cse21 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (= ~q_read_ev~0 2)) (.cse8 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse23 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse14 (<= ~c_dr_pc~0 1)) (.cse24 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~q_req_up~0 0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse10 (<= 2 ~E_1~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse12 (<= 2 ~E_M~0)) (.cse13 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse16 (<= ~t1_pc~0 0)) (.cse19 (= ~p_dw_i~0 1)) (.cse20 (= ~token~0 ~local~0)) (.cse9 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse11 .cse12 .cse13 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse13 .cse22 .cse14 .cse5 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse11 .cse12 .cse23 .cse13 .cse22 .cse14 .cse15 .cse6 .cse16 .cse17 .cse18 .cse19 .cse20 .cse9 .cse21) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse6 .cse16 .cse24 .cse17 .cse18 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse19 .cse7 .cse20 .cse8 .cse9 .cse25) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse12 .cse23 .cse13 .cse4 .cse22 .cse14 .cse5 .cse16 .cse24 .cse17 .cse19 .cse7 .cse20 .cse9 .cse25) (and .cse0 .cse10 .cse2 .cse3 .cse12 .cse13 .cse5 .cse15 .cse16 .cse19 (<= ~c_dr_pc~0 0) .cse20 .cse9))) [2022-12-13 11:51:13,098 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L905(line 905) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L895 garLoopResultBuilder]: At program point L575-1(lines 575 588) the Hoare annotation is: (let ((.cse5 (<= 2 ~m_st~0)) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse13 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse14 (<= 2 ~T1_E~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse14 .cse9 .cse10 .cse15 .cse16) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 (= ~token~0 ~local~0)))) [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L245(lines 245 249) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L245-2(lines 244 257) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L691(lines 691 695) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L691-1(lines 686 724) no Hoare annotation was computed. [2022-12-13 11:51:13,099 INFO L895 garLoopResultBuilder]: At program point L427-1(lines 427 449) the Hoare annotation is: (let ((.cse29 (= ~p_dw_st~0 0))) (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse1 (= ~p_num_write~0 0)) (.cse3 (= ~c_num_read~0 0)) (.cse8 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse2 (not .cse29)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse6 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (<= ~q_req_up~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse25 (<= ~c_dr_pc~0 0)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse15 .cse24 .cse16 .cse7 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse7 .cse8 .cse18 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse13 .cse14 .cse26 .cse15 .cse24 .cse16 .cse17 .cse8 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse8 .cse18 .cse27 .cse19 .cse20 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse3 .cse4 .cse5 .cse14 .cse15 .cse6 .cse24 .cse8 .cse18 .cse19 .cse29 .cse20 .cse21 .cse9 .cse25 .cse22 .cse11) (and .cse0 .cse12 .cse2 .cse4 .cse5 .cse14 .cse26 .cse15 .cse6 .cse24 .cse16 .cse7 .cse18 .cse27 .cse19 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse4 .cse5 .cse14 .cse15 .cse7 .cse17 .cse18 .cse21 .cse25 .cse22 .cse11)))) [2022-12-13 11:51:13,099 INFO L899 garLoopResultBuilder]: For program point L361(lines 361 368) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L895 garLoopResultBuilder]: At program point eval1_returnLabel#1(lines 340 393) the Hoare annotation is: (let ((.cse13 (< ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_read_ev~0 2)) (.cse23 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse19 (<= ~q_req_up~0 0)) (.cse10 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse25 (= ~q_req_up~0 1)) (.cse26 (<= 1 ~c_dr_pc~0)) (.cse4 (= ~q_free~0 1)) (.cse24 (<= 2 ~q_write_ev~0)) (.cse16 (<= ~c_dr_pc~0 1)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse27 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse8 (not (= ~E_M~0 0))) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse12 (<= 2 ~E_1~0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~m_pc~0 ~t1_pc~0)) (.cse14 (<= 2 ~E_M~0)) (.cse15 (= ~m_st~0 0)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_free~0 0)) (.cse18 (<= ~t1_pc~0 0)) (.cse21 (= ~p_dw_i~0 1)) (.cse22 (= ~token~0 ~local~0)) (.cse11 (= ~M_E~0 2))) (or (and .cse0 (= ~p_num_write~0 0) .cse1 (= ~c_num_read~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse1 .cse2 .cse3 (not (= ~q_write_ev~0 0)) .cse13 .cse14 .cse15 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse19 .cse20 .cse21 .cse22 .cse11) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse13 .cse14 .cse15 .cse24 .cse16 .cse5 .cse17 .cse6 .cse18 .cse20 .cse21 .cse22 .cse11 .cse23) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse19 .cse7 .cse8 .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse18 .cse27 .cse21 .cse9 .cse22 .cse10 .cse11 .cse28) (and .cse0 .cse25 .cse12 .cse1 .cse2 .cse3 .cse14 .cse26 .cse15 .cse4 .cse24 .cse16 .cse5 .cse6 .cse18 .cse27 .cse7 .cse8 (<= 1 ~q_read_ev~0) .cse21 .cse9 .cse22 .cse11 .cse28) (and .cse0 .cse12 .cse1 .cse2 .cse3 .cse14 .cse15 .cse5 .cse17 .cse18 .cse21 (<= ~c_dr_pc~0 0) .cse22 .cse11))) [2022-12-13 11:51:13,100 INFO L899 garLoopResultBuilder]: For program point L576(line 576) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L899 garLoopResultBuilder]: For program point L444(lines 444 448) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L899 garLoopResultBuilder]: For program point L923(lines 923 932) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L899 garLoopResultBuilder]: For program point L923-2(lines 923 932) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L899 garLoopResultBuilder]: For program point L180(lines 180 184) no Hoare annotation was computed. [2022-12-13 11:51:13,100 INFO L895 garLoopResultBuilder]: At program point L147-1(lines 147 165) the Hoare annotation is: (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse20 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse21 (= ~q_free~0 1)) (.cse22 (<= ~q_req_up~0 0)) (.cse1 (= ~q_req_up~0 1)) (.cse24 (<= 1 ~c_dr_pc~0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse25 (<= ~c_dr_pc~0 1)) (.cse26 (= ~q_read_ev~0 2)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse11 (= ~q_free~0 0)) (.cse12 (<= ~t1_pc~0 0)) (.cse13 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse14 (not (= ~E_M~0 0))) (.cse16 (= ~p_dw_i~0 1)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~p_num_write~0 1) .cse13 .cse14 .cse15 .cse16 .cse17 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse10 .cse12 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse21 .cse23 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse2 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse24 .cse8 .cse9 .cse21 .cse10 .cse25 .cse23 .cse12 .cse22 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 (< ~c_num_read~0 ~p_num_write~0) .cse7 .cse24 .cse8 .cse9 .cse10 .cse25 .cse23 .cse11 .cse12 .cse13 .cse14 .cse26 .cse16 .cse18 .cse19 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (and .cse0 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19))) [2022-12-13 11:51:13,101 INFO L899 garLoopResultBuilder]: For program point L428(line 428) no Hoare annotation was computed. [2022-12-13 11:51:13,101 INFO L899 garLoopResultBuilder]: For program point L841-1(lines 835 858) no Hoare annotation was computed. [2022-12-13 11:51:13,101 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 11:51:13,101 INFO L902 garLoopResultBuilder]: At program point main2_returnLabel#1(lines 948 959) the Hoare annotation is: true [2022-12-13 11:51:13,101 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 496) no Hoare annotation was computed. [2022-12-13 11:51:13,101 INFO L899 garLoopResultBuilder]: For program point L148(lines 147 165) no Hoare annotation was computed. [2022-12-13 11:51:13,101 INFO L895 garLoopResultBuilder]: At program point L710(lines 686 724) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,101 INFO L895 garLoopResultBuilder]: At program point $Ultimate##101(lines 545 551) the Hoare annotation is: (and (= ~t1_pc~0 1) (<= 2 ~E_1~0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~E_M~0) (= ~q_write_ev~0 ~q_read_ev~0) (<= ~token~0 (+ ~local~0 1)) (= ~q_free~0 0) (= ~c_dr_pc~0 ~p_dw_pc~0) (<= 2 ~T1_E~0) (= ~p_dw_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (<= ~c_dr_pc~0 0) (not (= ~t1_st~0 0)) (< ~local~0 ~token~0)) [2022-12-13 11:51:13,102 INFO L895 garLoopResultBuilder]: At program point L545-1(lines 531 552) the Hoare annotation is: (let ((.cse12 (= ~t1_pc~0 1)) (.cse0 (<= 2 ~E_1~0)) (.cse1 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~E_M~0)) (.cse5 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse8 (<= 2 ~T1_E~0)) (.cse9 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~c_dr_pc~0 0)) (.cse13 (not (= ~t1_st~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~m_pc~0 ~t1_pc~0) .cse4 .cse5 .cse6 .cse7 (<= ~t1_pc~0 0) .cse8 .cse9 .cse10 .cse11 (= ~token~0 ~local~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~token~0 (+ ~local~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 (< ~local~0 ~token~0)) (and .cse12 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) .cse9 .cse10 .cse11 .cse13))) [2022-12-13 11:51:13,102 INFO L895 garLoopResultBuilder]: At program point L149(lines 149 157) the Hoare annotation is: (let ((.cse2 (= ~p_num_write~0 0)) (.cse4 (= ~c_num_read~0 0)) (.cse12 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse13 (not (= ~E_M~0 0))) (.cse15 (<= ~c_dr_pc~0 0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse1 (<= 2 ~E_1~0)) (.cse3 (not (= ~p_dw_st~0 0))) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~m_pc~0 ~t1_pc~0)) (.cse7 (<= 2 ~E_M~0)) (.cse8 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse9 (= ~m_st~0 0)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse18 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse14 (= ~p_dw_i~0 1)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 .cse13 (<= 1 ~q_read_ev~0) .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse18 (= ~q_free~0 0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (and .cse0 .cse1 .cse3 .cse5 .cse6 .cse7 (<= 1 ~c_dr_pc~0) .cse8 .cse9 .cse10 (<= ~c_dr_pc~0 1) .cse18 .cse11 (<= ~p_num_write~0 ~c_num_read~0) (= ~q_read_ev~0 2) .cse14 .cse16 .cse17 (< ~c_num_read~0 (+ ~p_num_write~0 1))))) [2022-12-13 11:51:13,102 INFO L899 garLoopResultBuilder]: For program point L496(line 496) no Hoare annotation was computed. [2022-12-13 11:51:13,102 INFO L895 garLoopResultBuilder]: At program point L876(line 876) the Hoare annotation is: (let ((.cse7 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse5 (<= 2 ~m_st~0)) (.cse10 (= ~t1_pc~0 1)) (.cse15 (not (= ~t1_st~0 0))) (.cse11 (<= 2 ~E_1~0)) (.cse0 (= ~p_num_write~0 0)) (.cse1 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= 2 ~E_M~0)) (.cse3 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse16 (= ~m_st~0 0)) (.cse4 (= ~q_free~0 0)) (.cse6 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse18 (<= ~t1_pc~0 0)) (.cse13 (<= 2 ~T1_E~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse17 (= ~token~0 ~local~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~E_M~0 0)) .cse8 .cse9 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 .cse4 .cse6 .cse13 .cse7 .cse8 .cse9 .cse14 .cse15 .cse17) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse5 .cse6 .cse13 .cse8 .cse9 .cse14 .cse17) (and .cse10 .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse16 (<= ~token~0 (+ ~local~0 1)) .cse4 .cse6 .cse13 .cse8 .cse9 .cse14 .cse15 (< ~local~0 ~token~0)) (and .cse11 .cse0 .cse1 .cse2 (= ~m_pc~0 ~t1_pc~0) .cse12 .cse3 .cse16 .cse4 .cse6 .cse18 .cse13 .cse8 .cse9 .cse14 .cse17))) [2022-12-13 11:51:13,102 INFO L899 garLoopResultBuilder]: For program point L876-1(line 876) no Hoare annotation was computed. [2022-12-13 11:51:13,103 INFO L895 garLoopResultBuilder]: At program point L348(line 348) the Hoare annotation is: (let ((.cse32 (= ~p_dw_st~0 0))) (let ((.cse15 (<= 1 ~q_read_ev~0)) (.cse30 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse1 (= ~q_req_up~0 1)) (.cse21 (< ~c_num_read~0 ~p_num_write~0)) (.cse26 (<= ~p_num_write~0 (+ ~c_num_read~0 1))) (.cse29 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1)))) (.cse27 (= ~p_num_write~0 0)) (.cse28 (= ~c_num_read~0 0)) (.cse23 (= ~c_dr_pc~0 ~p_dw_pc~0)) (.cse25 (= ~q_read_ev~0 2)) (.cse3 (not .cse32)) (.cse7 (<= 1 ~c_dr_pc~0)) (.cse9 (= ~q_free~0 1)) (.cse10 (<= 2 ~q_write_ev~0)) (.cse11 (<= ~c_dr_pc~0 1)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse17 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse2 (<= 2 ~E_1~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~m_pc~0 ~t1_pc~0)) (.cse6 (<= 2 ~E_M~0)) (.cse8 (= ~m_st~0 0)) (.cse12 (not (= ~c_dr_st~0 0))) (.cse22 (= ~q_free~0 0)) (.cse13 (<= ~t1_pc~0 0)) (.cse16 (= ~p_dw_i~0 1)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse18 (= ~token~0 ~local~0)) (.cse19 (= ~M_E~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 (not (= ~q_write_ev~0 0)) .cse21 .cse6 .cse7 .cse8 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse27 .cse3 .cse28 .cse4 .cse5 .cse9 .cse12 .cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0)) (not (= ~E_M~0 0)) .cse17 .cse29 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse30 .cse8 .cse10 .cse22 .cse13 (<= ~p_num_write~0 1) .cse15 .cse16 .cse31 (<= 1 ~p_num_write~0) .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse12 .cse23 .cse13 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse22 .cse23 .cse13 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse7 .cse8 .cse10 .cse11 .cse22 .cse23 .cse13 .cse24 .cse25 .cse16 .cse18 .cse19 .cse26) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse24 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse29 .cse19 .cse20) (and .cse0 .cse2 .cse27 .cse28 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse23 .cse13 .cse24 .cse32 .cse25 .cse16 .cse17 .cse31 .cse18 .cse19) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse24 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse2 .cse4 .cse5 .cse6 .cse8 .cse12 .cse22 .cse13 .cse16 .cse31 .cse18 .cse19)))) [2022-12-13 11:51:13,103 INFO L895 garLoopResultBuilder]: At program point L216(line 216) the Hoare annotation is: false [2022-12-13 11:51:13,103 INFO L895 garLoopResultBuilder]: At program point L216-1(lines 188 219) the Hoare annotation is: (let ((.cse12 (= ~p_dw_st~0 0))) (let ((.cse8 (= ~q_free~0 1)) (.cse14 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (= ~T1_E~0 ~M_E~0)) (.cse19 (= ~q_req_up~0 1)) (.cse1 (<= 2 ~E_1~0)) (.cse20 (not .cse12)) (.cse2 (= ~c_num_read~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~m_pc~0 ~t1_pc~0)) (.cse5 (<= 2 ~E_M~0)) (.cse6 (<= 1 |ULTIMATE.start_eval1_~tmp___1~0#1|)) (.cse7 (= ~m_st~0 0)) (.cse9 (<= 2 ~q_write_ev~0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse11 (<= ~t1_pc~0 0)) (.cse23 (or (not (<= ~m_pc~0 1)) (<= ~m_pc~0 0))) (.cse24 (not (= ~E_M~0 0))) (.cse18 (<= 1 ~q_read_ev~0)) (.cse13 (= ~p_dw_i~0 1)) (.cse15 (<= ~c_dr_pc~0 0)) (.cse16 (= ~token~0 ~local~0)) (.cse17 (= ~M_E~0 2))) (or (and .cse0 .cse1 (= ~p_num_write~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ~q_req_up~0 0) .cse12 (= ~q_read_ev~0 2) .cse13 .cse14 .cse15 .cse16 (or (<= ~p_dw_pc~0 0) (not (<= ~p_dw_pc~0 1))) .cse17) (and .cse18 (let ((.cse21 (<= ~p_num_write~0 ~c_num_read~0)) (.cse22 (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (or (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ~c_dr_pc~0 1) .cse10 (= ~c_dr_pc~0 ~p_dw_pc~0) .cse11 .cse21 .cse13 .cse14 .cse16 .cse17 .cse22) (and .cse0 .cse19 .cse1 .cse20 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse21 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse22)))) (and .cse0 .cse19 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (= ~q_free~0 0) .cse11 (<= ~p_num_write~0 1) .cse23 .cse24 .cse18 .cse13 .cse15 (<= 1 ~p_num_write~0) .cse16 .cse17)))) [2022-12-13 11:51:13,103 INFO L899 garLoopResultBuilder]: For program point L646(lines 646 650) no Hoare annotation was computed. [2022-12-13 11:51:13,103 INFO L899 garLoopResultBuilder]: For program point L646-2(lines 645 658) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L895 garLoopResultBuilder]: At program point L84(lines 72 86) the Hoare annotation is: (let ((.cse22 (not (= ~p_num_write~0 0))) (.cse23 (not (= ~c_num_read~0 0))) (.cse3 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse7 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse15 (not (<= 1 ~c_dr_pc~0))) (.cse17 (not (= ~q_free~0 1))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse11 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse21 (not (<= ~c_dr_pc~0 0))) (.cse14 (not (<= 2 ~q_write_ev~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse1 (not (= ~m_pc~0 ~t1_pc~0))) (.cse2 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse5 (and (<= is_do_write_p_triggered_~__retres1~0 0) (<= 0 is_do_write_p_triggered_~__retres1~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse27 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (<= ~c_dr_pc~0 1))) (.cse10 (= ~p_dw_st~0 0)) (.cse24 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse12 (not (= ~T1_E~0 ~M_E~0))) (.cse13 (not (= ~m_st~0 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse25 (not (<= ~q_req_up~0 0))) (.cse26 (not (= ~q_read_ev~0 2))) (.cse19 (not (<= 2 ~E_1~0))) (.cse20 (not (= ~token~0 ~local~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 .cse21 .cse1 (not .cse10) .cse2 (not (= ~q_write_ev~0 ~q_read_ev~0)) .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse25 .cse26 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse22 .cse5 .cse6 .cse23 .cse8 .cse24 .cse12 .cse13 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse0 .cse1 .cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse22 .cse5 .cse6 (= ~E_M~0 0) .cse23 .cse10 .cse24 .cse11 .cse12 .cse17 .cse18) (or .cse0 .cse1 .cse2 (= ~q_read_ev~0 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse25 .cse18 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse11 .cse12 .cse13 .cse16 .cse19 .cse20) (or .cse0 .cse21 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse10 .cse12 .cse13 .cse16 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 .cse14 .cse16 .cse25 .cse26 .cse19 .cse20) (or .cse0 .cse1 .cse2 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse4 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse27 .cse8 .cse9 .cse10 .cse24 .cse12 .cse13 (= ~q_write_ev~0 0) .cse16 .cse25 .cse26 .cse19 .cse20))) [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredFINAL(lines 69 87) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point is_do_write_p_triggeredEXIT(lines 69 87) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 79) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 69 87) the Hoare annotation is: true [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 82) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 73 82) no Hoare annotation was computed. [2022-12-13 11:51:13,104 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1FINAL(lines 259 278) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L895 garLoopResultBuilder]: At program point L275(lines 262 277) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 0)) (.cse27 (= ~q_read_ev~0 2)) (.cse26 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~p_num_write~0 0))) (.cse3 (not .cse26)) (.cse18 (not (= ~q_free~0 1))) (.cse19 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not (<= ~c_dr_pc~0 1))) (.cse17 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse22 (not (<= 1 ~c_dr_pc~0))) (.cse23 (not (<= ~q_req_up~0 0))) (.cse24 (not .cse27)) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse4 (not (= ~M_E~0 2))) (.cse5 (not (<= ~t1_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~c_num_read~0 0))) (.cse7 (not (= ~q_free~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse21 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse12 (<= 1 exists_runnable_thread1_~__retres1~2)) (.cse25 (not .cse0)) (.cse13 (not (<= 2 ~E_1~0))) (.cse14 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse11 .cse18 .cse12 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse20 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse16 .cse8 .cse17 .cse9 .cse10 .cse21 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse0 .cse2 .cse3 .cse4 (not (< ~c_num_read~0 (+ ~p_num_write~0 1))) .cse5 .cse6 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse20 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse18 .cse12 .cse23 .cse24 .cse19 .cse13 .cse14) (or .cse2 .cse4 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1))) .cse25 .cse5 (not (< ~c_num_read~0 ~p_num_write~0)) .cse6 .cse7 .cse8 .cse20 .cse26 .cse17 .cse9 .cse10 .cse21 .cse22 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14) (or .cse1 .cse2 .cse4 (not (= ~q_req_up~0 1)) .cse5 .cse6 .cse16 .cse7 .cse8 .cse26 .cse9 .cse10 .cse21 .cse11 .cse12 (not (<= 1 ~p_num_write~0)) (not (<= 1 ~q_read_ev~0)) (and .cse25 .cse27) .cse13 (not (<= ~p_num_write~0 1)) .cse14)))) [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point L267(lines 267 272) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 259 278) the Hoare annotation is: true [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point L263(lines 263 273) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread1EXIT(lines 259 278) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 24 31) the Hoare annotation is: true [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point error1Err0ASSERT_VIOLATIONERROR_FUNCTION(line 28) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point error1FINAL(lines 24 31) no Hoare annotation was computed. [2022-12-13 11:51:13,105 INFO L899 garLoopResultBuilder]: For program point error1EXIT(lines 24 31) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point L668(lines 668 673) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2FINAL(lines 660 679) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point L664(lines 664 674) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 660 679) the Hoare annotation is: true [2022-12-13 11:51:13,106 INFO L902 garLoopResultBuilder]: At program point L676(lines 663 678) the Hoare annotation is: true [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point exists_runnable_thread2EXIT(lines 660 679) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L899 garLoopResultBuilder]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2022-12-13 11:51:13,106 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 297 314) the Hoare annotation is: (let ((.cse32 (= ~q_write_ev~0 |old(~q_write_ev~0)|))) (let ((.cse18 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1))) (.cse14 (not (< ~c_num_read~0 (+ ~p_num_write~0 1)))) (.cse15 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse19 (not (<= 2 |old(~q_write_ev~0)|))) (.cse28 (not (< 0 |old(~q_write_ev~0)|))) (.cse20 (not (<= 1 ~c_dr_pc~0))) (.cse0 (= ~c_dr_st~0 0)) (.cse30 (not (<= ~p_num_write~0 (+ ~c_num_read~0 1)))) (.cse31 (not (< ~c_num_read~0 ~p_num_write~0))) (.cse6 (and .cse32 (= |old(~q_read_ev~0)| ~q_read_ev~0))) (.cse7 (not (= ~q_free~0 0))) (.cse16 (not (<= ~c_dr_pc~0 1))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= ~m_pc~0 ~t1_pc~0))) (.cse17 (= ~p_dw_st~0 0)) (.cse3 (not (= ~M_E~0 2))) (.cse4 (not (<= ~t1_pc~0 0))) (.cse23 (not (= ~p_num_write~0 0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~c_num_read~0 0))) (.cse8 (not (<= 2 ~E_M~0))) (.cse25 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse9 (not (= ~T1_E~0 ~M_E~0))) (.cse10 (not (= ~m_st~0 0))) (.cse27 (not (= |old(~q_read_ev~0)| 2))) (.cse11 (not (= ~p_dw_i~0 1))) (.cse21 (not (= ~q_free~0 1))) (.cse26 (not (<= ~q_req_up~0 0))) (.cse22 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse12 (not (<= 2 ~E_1~0))) (.cse29 (and .cse32 (= ~q_read_ev~0 2))) (.cse13 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse18 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse23 .cse5 .cse6 .cse24 .cse8 .cse25 .cse9 .cse10 .cse11 .cse21 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse17 .cse9 .cse10 .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1)) .cse23 .cse5 (= ~E_M~0 0) .cse6 .cse24 .cse17 .cse25 .cse18 .cse9 .cse21 .cse22) (or .cse0 .cse2 .cse3 .cse14 .cse4 .cse5 .cse15 .cse6 .cse8 .cse16 .cse25 .cse9 .cse10 (not (= |old(~q_read_ev~0)| 1)) .cse19 .cse20 .cse11 .cse21 .cse26 .cse22 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse11 .cse26 .cse12 .cse29 .cse13) (or .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse28 .cse20 .cse11 .cse26 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse30 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse16 .cse17 .cse25 .cse9 .cse10 .cse27 .cse11 (= |old(~q_write_ev~0)| 0) .cse26 .cse12 .cse13) (or .cse1 .cse2 (not .cse17) .cse3 (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|)) .cse4 .cse23 .cse5 .cse24 .cse8 .cse25 .cse9 .cse10 .cse27 .cse11 .cse21 .cse26 .cse22 .cse12 .cse29 .cse13)))) [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point reset_delta_events1EXIT(lines 297 314) no Hoare annotation was computed. [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point L768-1(lines 762 785) no Hoare annotation was computed. [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point L763-1(lines 762 785) no Hoare annotation was computed. [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point reset_delta_events2EXIT(lines 759 786) no Hoare annotation was computed. [2022-12-13 11:51:13,107 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 759 786) the Hoare annotation is: (let ((.cse15 (not (= ~m_st~0 0))) (.cse7 (= ~t1_st~0 0)) (.cse2 (and (not (<= ~m_pc~0 0)) (<= ~m_pc~0 1))) (.cse18 (not (<= ~t1_pc~0 0))) (.cse19 (not (<= 2 ~m_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~t1_pc~0 1))) (.cse4 (not (= ~q_write_ev~0 ~q_read_ev~0))) (.cse5 (not (= ~p_num_write~0 0))) (.cse6 (not (<= 2 |old(~T1_E~0)|))) (.cse8 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse9 (not (<= 2 |old(~E_1~0)|))) (.cse10 (not (= ~c_num_read~0 0))) (.cse11 (and (= ~M_E~0 |old(~M_E~0)|) (= |old(~T1_E~0)| ~T1_E~0) (= ~E_M~0 |old(~E_M~0)|) (= ~E_1~0 |old(~E_1~0)|))) (.cse12 (not (= ~q_free~0 0))) (.cse13 (not (<= 2 |old(~E_M~0)|))) (.cse14 (not (= ~c_dr_pc~0 ~p_dw_pc~0))) (.cse16 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= ~token~0 ~local~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (not (= ~m_pc~0 ~t1_pc~0)) .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (not (< ~local~0 ~token~0)) .cse13 .cse14 .cse15 .cse16 (not (<= ~token~0 (+ ~local~0 1)))) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16) (or .cse19 .cse1 (= |old(~E_M~0)| 0) .cse2 .cse4 .cse5 .cse8 .cse10 .cse11 .cse12 .cse14 (and (not (<= ~p_dw_pc~0 0)) (<= ~p_dw_pc~0 1)) .cse16) (or .cse19 .cse0 .cse1 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17) (or .cse19 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17))) [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point L778-1(lines 759 786) no Hoare annotation was computed. [2022-12-13 11:51:13,107 INFO L899 garLoopResultBuilder]: For program point L773-1(lines 762 785) no Hoare annotation was computed. [2022-12-13 11:51:13,110 INFO L445 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, 1, 1, 1] [2022-12-13 11:51:13,112 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:51:13,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:51:13 BoogieIcfgContainer [2022-12-13 11:51:13,202 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:51:13,202 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:51:13,202 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:51:13,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:51:13,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:49:02" (3/4) ... [2022-12-13 11:51:13,205 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels1 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads2 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads1 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels2 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events2 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events1 [2022-12-13 11:51:13,209 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_read_c_triggered [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure is_do_write_p_triggered [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread1 [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error1 [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread2 [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events1 [2022-12-13 11:51:13,210 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events2 [2022-12-13 11:51:13,218 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2022-12-13 11:51:13,219 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 11:51:13,219 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 11:51:13,220 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 11:51:13,240 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-12-13 11:51:13,240 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) [2022-12-13 11:51:13,241 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) [2022-12-13 11:51:13,242 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) [2022-12-13 11:51:13,243 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) [2022-12-13 11:51:13,284 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:51:13,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:51:13,284 INFO L158 Benchmark]: Toolchain (without parser) took 131961.72ms. Allocated memory was 132.1MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 97.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 838.3MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,284 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 132.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:51:13,284 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.09ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 80.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.99ms. Allocated memory is still 132.1MB. Free memory was 80.7MB in the beginning and 78.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,285 INFO L158 Benchmark]: Boogie Preprocessor took 35.84ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,285 INFO L158 Benchmark]: RCFGBuilder took 478.84ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 49.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,285 INFO L158 Benchmark]: TraceAbstraction took 131001.39ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 141.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2022-12-13 11:51:13,286 INFO L158 Benchmark]: Witness Printer took 81.76ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 11:51:13,287 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.13ms. Allocated memory is still 132.1MB. Free memory is still 72.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.09ms. Allocated memory is still 132.1MB. Free memory was 97.6MB in the beginning and 80.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.99ms. Allocated memory is still 132.1MB. Free memory was 80.7MB in the beginning and 78.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.84ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 76.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.84ms. Allocated memory is still 132.1MB. Free memory was 76.0MB in the beginning and 49.9MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 131001.39ms. Allocated memory was 169.9MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 141.0MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 81.76ms. Allocated memory is still 2.3GB. Free memory was 1.5GB in the beginning and 1.5GB 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, 208 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 130.9s, OverallIterations: 35, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 34.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 67.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18380 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 17927 mSDsluCounter, 24614 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17186 mSDsCounter, 4138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18138 IncrementalHoareTripleChecker+Invalid, 22276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4138 mSolverCounterUnsat, 7428 mSDtfsCounter, 18138 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3749 GetRequests, 3273 SyntacticMatches, 16 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14282occurred in iteration=18, InterpolantAutomatonStates: 403, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.8s AutomataMinimizationTime, 35 MinimizatonAttempts, 9753 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 84 LocationsWithAnnotation, 16053 PreInvPairs, 18024 NumberOfFragments, 28642 HoareAnnotationTreeSize, 16053 FomulaSimplifications, 13096 FormulaSimplificationTreeSizeReduction, 16.1s HoareSimplificationTime, 84 FomulaSimplificationsInter, 574773 FormulaSimplificationTreeSizeReductionInter, 50.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 5734 NumberOfCodeBlocks, 5734 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 6171 ConstructedInterpolants, 0 QuantifiedInterpolants, 11614 SizeOfPredicates, 7 NumberOfNonLiveVariables, 6631 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 52 InterpolantComputations, 32 PerfectInterpolantSequences, 3229/3363 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 686]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 642]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 560]: Loop Invariant Derived loop invariant: ((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token) - InvariantResult [Line: 575]: Loop Invariant Derived loop invariant: (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || \old(q_read_ev) == q_read_ev) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || \old(q_write_ev) == 0) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(\old(q_read_ev) == \old(q_write_ev))) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(\old(q_req_up) <= 0)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(\old(q_read_ev) == 2)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(1 <= \old(q_read_ev))) || !(\old(q_req_up) == 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || (q_req_up <= 0 && q_write_ev == \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || (q_req_up <= 0 && q_read_ev == 2)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(\old(q_req_up) == 1)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(\old(q_read_ev) == 2)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || q_write_ev == \old(q_write_ev)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(\old(q_req_up) <= 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= \old(q_write_ev))) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 473]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 615]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (((((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && !(t1_st == 0)) && 0 <= \result)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((__retres1 <= 0 && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(token == local))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1) && \result <= 0) && 0 <= \result)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || q_read_ev == 1) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 545]: Loop Invariant Derived loop invariant: ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token - InvariantResult [Line: 176]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && 1 <= q_read_ev) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 413]: Loop Invariant Derived loop invariant: M_E == 2 - InvariantResult [Line: 948]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 516]: Loop Invariant Derived loop invariant: ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 596]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((\result <= 0 && \old(t1_st) == t1_st) && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= \result) || !(c_dr_pc <= 0)) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) - InvariantResult [Line: 870]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local)) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(T1_E == M_E)) || (__retres1 <= 0 && 0 <= __retres1)) || !(q_free == 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(q_read_ev == 1)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || (((((((((T1_E == M_E && m_pc == t1_pc) && 1 <= c_dr_pc) && c_dr_pc <= 1) && __retres1 <= 0) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 0 <= __retres1) && M_E == 2)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(t1_pc <= 0)) || 0 < q_write_ev) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || q_write_ev == 0) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(q_free == 1)) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(M_E == 2)) || (!(m_pc <= 0) && m_pc <= 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || (__retres1 <= 0 && 0 <= __retres1)) || !(p_dw_i == 1)) || !(2 <= E_1)) || !(token == local)) - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 563]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && (1 <= t1_pc || !(m_pc <= 0))) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && ((t1_pc <= 1 && !(m_pc <= 1)) || m_pc <= 0)) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 860]: Loop Invariant Derived loop invariant: (((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 832]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 456]: Loop Invariant Derived loop invariant: ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2 - InvariantResult [Line: 398]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local)) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(M_E == 2)) || (((((((((((((((T1_E == M_E && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || (__retres1 <= 0 && 0 <= __retres1)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((!(p_dw_st == 0) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && \old(t1_st) == t1_st) && q_write_ev == q_read_ev) && m_st == \old(m_st)) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1)))) || (((m_st == 0 && __retres1 <= 0) && 0 <= __retres1) && !(t1_st == 0))) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || (((\old(t1_st) == t1_st && m_st == \old(m_st)) && __retres1 <= 0) && 0 <= __retres1)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1)) - InvariantResult [Line: 492]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) - InvariantResult [Line: 680]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: ((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 1) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 904]: Loop Invariant Derived loop invariant: ((((((((((((((((p_num_write == 0 && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_st == 0) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0))) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && token == local)) || ((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && 2 <= m_st) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local)) || ((((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && m_st == 0) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (1 <= q_read_ev && (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || (((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)))) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 531]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= E_1 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) || (((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && token <= local + 1) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) && local < token)) || ((((((((((((((t1_pc == 1 && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && 2 <= E_M) && q_write_ev == q_read_ev) && q_free == 0) && c_dr_pc == p_dw_pc) && 2 <= T1_E) && (!(m_pc <= 1) || m_pc <= 0)) && p_dw_st == 0) && c_last_read == p_last_write) && c_dr_pc <= 0) && !(t1_st == 0)) - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) && ((((((((((((!(p_dw_st == 0) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || (!(m_pc <= 0) && m_pc <= 1)) || !(2 <= \old(m_st))) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(c_dr_pc == p_dw_pc)) || (!(p_dw_pc <= 0) && p_dw_pc <= 1)) || !(c_last_read == p_last_write))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || (\old(t1_st) == t1_st && m_st == \old(m_st))) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || E_M == 0) || !(c_num_read == 0)) || !(q_free == 0)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(q_write_ev == q_read_ev)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= \old(m_st))) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(local < token)) || !(c_dr_pc == p_dw_pc)) || !(\old(m_st) == 0)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token <= local + 1))) && ((((((((((((((!(c_dr_pc <= 0) || !(p_dw_st == 0)) || (((\old(t1_st) == t1_st && 0 <= __retres1) && m_st == \old(m_st)) && __retres1 <= 0)) || !(2 <= T1_E)) || !(t1_pc == 1)) || !(q_write_ev == q_read_ev)) || !(p_num_write == 0)) || \old(t1_st) == 0) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(c_last_read == p_last_write)) || !(token == local)) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2) || ((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 262]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(2 <= E_1)) || !(token == local)) && ((((((((((((((((((c_dr_st == 0 || !(c_dr_pc <= 0)) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(t1_pc <= 0)) || !(p_num_write == 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(2 <= E_M)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((((c_dr_st == 0 || !(m_pc == t1_pc)) || !(p_dw_st == 0)) || !(M_E == 2)) || !(c_num_read < p_num_write + 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || !(q_free == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(c_last_read == p_last_write)) || !(2 <= E_1)) || !(token == local))) && (((((((((((((((((((((!(m_pc == t1_pc) || !(M_E == 2)) || !(p_num_write <= c_num_read + 1)) || !(c_dr_st == 0)) || !(t1_pc <= 0)) || !(c_num_read < p_num_write)) || !(p_last_write == q_buf_0)) || !(q_free == 0)) || !(2 <= E_M)) || !(c_dr_pc <= 1)) || p_dw_st == 0) || !(c_dr_pc == p_dw_pc)) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(1 <= c_dr_pc)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(q_read_ev == 2)) || !(2 <= E_1)) || !(token == local))) && ((((((((((((((((((((!(c_dr_pc <= 0) || !(m_pc == t1_pc)) || !(M_E == 2)) || !(q_req_up == 1)) || !(t1_pc <= 0)) || !(p_last_write == q_buf_0)) || !(c_num_read == 0)) || !(q_free == 0)) || !(2 <= E_M)) || p_dw_st == 0) || !(T1_E == M_E)) || !(m_st == 0)) || !(2 <= q_write_ev)) || !(p_dw_i == 1)) || 1 <= __retres1) || !(1 <= p_num_write)) || !(1 <= q_read_ev)) || (!(c_dr_st == 0) && q_read_ev == 2)) || !(2 <= E_1)) || !(p_num_write <= 1)) || !(token == local)) - InvariantResult [Line: 427]: Loop Invariant Derived loop invariant: (((((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && 1 <= q_read_ev) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= tmp___1) && m_st == 0) && 2 <= q_write_ev) && q_free == 0) && t1_pc <= 0) && p_num_write <= 1) && 1 <= q_read_ev) && p_dw_i == 1) && c_dr_pc <= 0) && 1 <= p_num_write) && token == local) && M_E == 2)) || ((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && 1 <= tmp___1) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2)) || ((((((((((((((((((((T1_E == M_E && q_req_up == 1) && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && c_dr_pc <= 0) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((T1_E == M_E && p_num_write == 0) && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && m_pc == t1_pc) && q_free == 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && (!(m_pc <= 1) || m_pc <= 0)) && !(E_M == 0)) && c_last_read == p_last_write) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && !(q_write_ev == 0)) && c_num_read < p_num_write) && 2 <= E_M) && m_st == 0) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || (((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && c_num_read < p_num_write) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && 2 <= q_write_ev) && c_dr_pc <= 1) && q_free == 0) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && token == local) && M_E == 2) && p_num_write <= c_num_read + 1)) || ((((((((((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && c_dr_pc == p_dw_pc) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && q_read_ev == 2) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && (p_dw_pc <= 0 || !(p_dw_pc <= 1))) && M_E == 2) && c_num_read < p_num_write + 1)) || (((((((((((((((((((T1_E == M_E && 2 <= E_1) && !(p_dw_st == 0)) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && 1 <= c_dr_pc) && m_st == 0) && q_free == 1) && 2 <= q_write_ev) && c_dr_pc <= 1) && !(c_dr_st == 0)) && t1_pc <= 0) && p_num_write <= c_num_read) && q_req_up <= 0) && p_dw_i == 1) && c_last_read == p_last_write) && token == local) && M_E == 2) && c_num_read < p_num_write + 1)) || ((((((((((((T1_E == M_E && 2 <= E_1) && p_last_write == q_buf_0) && m_pc == t1_pc) && 2 <= E_M) && m_st == 0) && !(c_dr_st == 0)) && q_free == 0) && t1_pc <= 0) && p_dw_i == 1) && c_dr_pc <= 0) && token == local) && M_E == 2) RESULT: Ultimate proved your program to be correct! [2022-12-13 11:51:13,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_efb9e2a5-9cf2-4bb8-b937-05e744ee31ba/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE