./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg --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 85d7ea3d2182aa17a738320c0246a5e7547613d1bb6a9595c98b2de6cf449e5f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 09:11:01,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 09:11:01,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 09:11:01,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 09:11:01,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 09:11:01,290 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 09:11:01,292 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 09:11:01,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 09:11:01,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 09:11:01,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 09:11:01,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 09:11:01,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 09:11:01,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 09:11:01,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 09:11:01,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 09:11:01,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 09:11:01,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 09:11:01,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 09:11:01,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 09:11:01,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 09:11:01,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 09:11:01,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 09:11:01,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 09:11:01,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 09:11:01,358 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 09:11:01,359 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 09:11:01,359 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 09:11:01,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 09:11:01,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 09:11:01,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 09:11:01,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 09:11:01,366 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 09:11:01,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 09:11:01,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 09:11:01,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 09:11:01,373 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 09:11:01,374 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 09:11:01,374 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 09:11:01,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 09:11:01,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 09:11:01,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 09:11:01,377 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 09:11:01,424 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 09:11:01,425 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 09:11:01,426 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 09:11:01,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 09:11:01,428 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 09:11:01,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 09:11:01,429 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 09:11:01,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 09:11:01,429 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 09:11:01,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 09:11:01,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 09:11:01,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 09:11:01,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 09:11:01,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 09:11:01,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 09:11:01,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 09:11:01,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 09:11:01,433 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 09:11:01,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 09:11:01,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 09:11:01,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 09:11:01,434 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 09:11:01,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:11:01,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 09:11:01,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 09:11:01,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 09:11:01,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 09:11:01,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 09:11:01,436 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 09:11:01,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 09:11:01,439 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 09:11:01,439 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 09:11:01,439 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/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_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg 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 -> 85d7ea3d2182aa17a738320c0246a5e7547613d1bb6a9595c98b2de6cf449e5f [2021-10-28 09:11:01,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 09:11:01,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 09:11:01,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 09:11:01,826 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 09:11:01,827 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 09:11:01,828 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-28 09:11:01,927 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/data/47fb37a9e/da837c9e1b5f49ed8f15393f094737cf/FLAGeda85048b [2021-10-28 09:11:02,501 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 09:11:02,501 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-28 09:11:02,513 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/data/47fb37a9e/da837c9e1b5f49ed8f15393f094737cf/FLAGeda85048b [2021-10-28 09:11:02,836 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/data/47fb37a9e/da837c9e1b5f49ed8f15393f094737cf [2021-10-28 09:11:02,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 09:11:02,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 09:11:02,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 09:11:02,848 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 09:11:02,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 09:11:02,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:11:02" (1/1) ... [2021-10-28 09:11:02,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a150d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:02, skipping insertion in model container [2021-10-28 09:11:02,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:11:02" (1/1) ... [2021-10-28 09:11:02,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 09:11:02,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 09:11:03,171 WARN L228 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_2047eb40-acf7-40b2-88a0-70b77f412cff/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-28 09:11:03,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:11:03,303 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 09:11:03,320 WARN L228 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_2047eb40-acf7-40b2-88a0-70b77f412cff/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-28 09:11:03,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 09:11:03,412 INFO L208 MainTranslator]: Completed translation [2021-10-28 09:11:03,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03 WrapperNode [2021-10-28 09:11:03,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 09:11:03,416 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 09:11:03,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 09:11:03,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 09:11:03,426 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 09:11:03,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 09:11:03,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 09:11:03,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 09:11:03,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,552 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 09:11:03,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 09:11:03,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 09:11:03,567 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 09:11:03,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (1/1) ... [2021-10-28 09:11:03,585 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 09:11:03,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:11:03,628 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 09:11:03,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 09:11:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 09:11:03,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 09:11:03,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 09:11:03,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 09:11:04,155 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 09:11:04,155 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-10-28 09:11:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:04 BoogieIcfgContainer [2021-10-28 09:11:04,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 09:11:04,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 09:11:04,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 09:11:04,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 09:11:04,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 09:11:02" (1/3) ... [2021-10-28 09:11:04,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f64fbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:11:04, skipping insertion in model container [2021-10-28 09:11:04,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:11:03" (2/3) ... [2021-10-28 09:11:04,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f64fbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 09:11:04, skipping insertion in model container [2021-10-28 09:11:04,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:04" (3/3) ... [2021-10-28 09:11:04,169 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-10-28 09:11:04,176 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 09:11:04,190 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 09:11:04,310 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 09:11:04,327 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 09:11:04,329 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 09:11:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 93 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:11:04,371 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:04,372 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:04,373 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2021-10-28 09:11:04,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:04,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834965241] [2021-10-28 09:11:04,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:04,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:04,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:04,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834965241] [2021-10-28 09:11:04,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834965241] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:04,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:04,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:04,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588616315] [2021-10-28 09:11:04,760 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:04,760 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:04,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:04,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:04,790 INFO L87 Difference]: Start difference. First operand has 94 states, 91 states have (on average 1.6263736263736264) internal successors, (148), 93 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:04,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:04,982 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2021-10-28 09:11:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:04,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:11:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:05,002 INFO L225 Difference]: With dead ends: 266 [2021-10-28 09:11:05,002 INFO L226 Difference]: Without dead ends: 174 [2021-10-28 09:11:05,007 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:05,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-28 09:11:05,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2021-10-28 09:11:05,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 168 states have (on average 1.494047619047619) internal successors, (251), 169 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2021-10-28 09:11:05,140 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2021-10-28 09:11:05,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:05,141 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2021-10-28 09:11:05,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,142 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2021-10-28 09:11:05,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:11:05,147 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:05,147 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:05,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 09:11:05,148 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2021-10-28 09:11:05,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:05,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517647991] [2021-10-28 09:11:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:05,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:05,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:05,288 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517647991] [2021-10-28 09:11:05,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517647991] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:05,289 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:05,289 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:11:05,289 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573585457] [2021-10-28 09:11:05,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:11:05,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:05,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:11:05,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:05,293 INFO L87 Difference]: Start difference. First operand 170 states and 251 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:05,463 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2021-10-28 09:11:05,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:11:05,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:11:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:05,470 INFO L225 Difference]: With dead ends: 540 [2021-10-28 09:11:05,471 INFO L226 Difference]: Without dead ends: 400 [2021-10-28 09:11:05,473 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:11:05,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-10-28 09:11:05,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 176. [2021-10-28 09:11:05,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.4655172413793103) internal successors, (255), 175 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2021-10-28 09:11:05,520 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 39 [2021-10-28 09:11:05,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:05,521 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2021-10-28 09:11:05,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2021-10-28 09:11:05,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:11:05,524 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:05,524 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:05,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 09:11:05,525 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:05,525 INFO L85 PathProgramCache]: Analyzing trace with hash 94160760, now seen corresponding path program 1 times [2021-10-28 09:11:05,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:05,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442477334] [2021-10-28 09:11:05,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:05,526 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:05,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:05,610 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442477334] [2021-10-28 09:11:05,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442477334] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:05,613 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:05,614 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:11:05,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946694430] [2021-10-28 09:11:05,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:11:05,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:05,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:11:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:11:05,619 INFO L87 Difference]: Start difference. First operand 176 states and 255 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:05,767 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2021-10-28 09:11:05,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:11:05,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:11:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:05,772 INFO L225 Difference]: With dead ends: 466 [2021-10-28 09:11:05,772 INFO L226 Difference]: Without dead ends: 331 [2021-10-28 09:11:05,777 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-28 09:11:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 246. [2021-10-28 09:11:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 244 states have (on average 1.4057377049180328) internal successors, (343), 245 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2021-10-28 09:11:05,826 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 39 [2021-10-28 09:11:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:05,827 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2021-10-28 09:11:05,827 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,827 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2021-10-28 09:11:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-28 09:11:05,838 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:05,838 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:05,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 09:11:05,839 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:05,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:05,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1899983946, now seen corresponding path program 1 times [2021-10-28 09:11:05,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:05,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418112670] [2021-10-28 09:11:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:05,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:05,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:05,904 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418112670] [2021-10-28 09:11:05,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418112670] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:05,905 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:05,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:05,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287156408] [2021-10-28 09:11:05,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:05,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:05,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:05,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:05,907 INFO L87 Difference]: Start difference. First operand 246 states and 343 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:05,955 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2021-10-28 09:11:05,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:05,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-10-28 09:11:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:05,959 INFO L225 Difference]: With dead ends: 626 [2021-10-28 09:11:05,959 INFO L226 Difference]: Without dead ends: 466 [2021-10-28 09:11:05,960 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-10-28 09:11:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2021-10-28 09:11:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 460 states have (on average 1.3804347826086956) internal successors, (635), 461 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 635 transitions. [2021-10-28 09:11:05,988 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 635 transitions. Word has length 39 [2021-10-28 09:11:05,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:05,989 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 635 transitions. [2021-10-28 09:11:05,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 635 transitions. [2021-10-28 09:11:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:11:05,991 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:05,991 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:05,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 09:11:05,992 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:05,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:05,993 INFO L85 PathProgramCache]: Analyzing trace with hash -909810741, now seen corresponding path program 1 times [2021-10-28 09:11:05,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:05,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135091687] [2021-10-28 09:11:05,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:05,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:06,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:06,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135091687] [2021-10-28 09:11:06,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135091687] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:06,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:06,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:06,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337303802] [2021-10-28 09:11:06,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:06,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:06,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:06,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,087 INFO L87 Difference]: Start difference. First operand 462 states and 635 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:06,167 INFO L93 Difference]: Finished difference Result 1090 states and 1499 transitions. [2021-10-28 09:11:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-28 09:11:06,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:06,178 INFO L225 Difference]: With dead ends: 1090 [2021-10-28 09:11:06,178 INFO L226 Difference]: Without dead ends: 738 [2021-10-28 09:11:06,180 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-10-28 09:11:06,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 714. [2021-10-28 09:11:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 712 states have (on average 1.3469101123595506) internal successors, (959), 713 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 959 transitions. [2021-10-28 09:11:06,228 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 959 transitions. Word has length 40 [2021-10-28 09:11:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:06,229 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 959 transitions. [2021-10-28 09:11:06,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 959 transitions. [2021-10-28 09:11:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-28 09:11:06,232 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:06,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:06,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 09:11:06,233 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash -956850730, now seen corresponding path program 1 times [2021-10-28 09:11:06,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:06,235 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433277887] [2021-10-28 09:11:06,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:06,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:06,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:06,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:06,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433277887] [2021-10-28 09:11:06,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433277887] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:06,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:06,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:06,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636489809] [2021-10-28 09:11:06,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:06,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:06,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:06,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,362 INFO L87 Difference]: Start difference. First operand 714 states and 959 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:06,485 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2021-10-28 09:11:06,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:06,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-10-28 09:11:06,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:06,502 INFO L225 Difference]: With dead ends: 1966 [2021-10-28 09:11:06,503 INFO L226 Difference]: Without dead ends: 1257 [2021-10-28 09:11:06,505 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2021-10-28 09:11:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1237. [2021-10-28 09:11:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1235 states have (on average 1.334412955465587) internal successors, (1648), 1236 states have internal predecessors, (1648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2021-10-28 09:11:06,631 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 40 [2021-10-28 09:11:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:06,633 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2021-10-28 09:11:06,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2021-10-28 09:11:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-28 09:11:06,638 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:06,638 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:06,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 09:11:06,639 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1951308106, now seen corresponding path program 1 times [2021-10-28 09:11:06,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:06,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941076944] [2021-10-28 09:11:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:06,647 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:06,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:06,744 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941076944] [2021-10-28 09:11:06,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941076944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:06,745 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:06,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:06,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853929945] [2021-10-28 09:11:06,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:06,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:06,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:06,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,751 INFO L87 Difference]: Start difference. First operand 1237 states and 1648 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:06,913 INFO L93 Difference]: Finished difference Result 2929 states and 3880 transitions. [2021-10-28 09:11:06,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-10-28 09:11:06,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:06,929 INFO L225 Difference]: With dead ends: 2929 [2021-10-28 09:11:06,929 INFO L226 Difference]: Without dead ends: 1729 [2021-10-28 09:11:06,932 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2021-10-28 09:11:07,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1705. [2021-10-28 09:11:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1703 states have (on average 1.3129770992366412) internal successors, (2236), 1704 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:07,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2236 transitions. [2021-10-28 09:11:07,109 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2236 transitions. Word has length 45 [2021-10-28 09:11:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:07,109 INFO L470 AbstractCegarLoop]: Abstraction has 1705 states and 2236 transitions. [2021-10-28 09:11:07,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2236 transitions. [2021-10-28 09:11:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-28 09:11:07,111 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:07,112 INFO L513 BasicCegarLoop]: 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] [2021-10-28 09:11:07,112 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 09:11:07,112 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:07,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:07,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1660743978, now seen corresponding path program 1 times [2021-10-28 09:11:07,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:07,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996482849] [2021-10-28 09:11:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:07,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:07,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:07,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:07,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996482849] [2021-10-28 09:11:07,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996482849] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:07,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:07,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:11:07,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057357155] [2021-10-28 09:11:07,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:11:07,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:07,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:11:07,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:11:07,208 INFO L87 Difference]: Start difference. First operand 1705 states and 2236 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:07,345 INFO L93 Difference]: Finished difference Result 1993 states and 2618 transitions. [2021-10-28 09:11:07,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 09:11:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-10-28 09:11:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:07,362 INFO L225 Difference]: With dead ends: 1993 [2021-10-28 09:11:07,362 INFO L226 Difference]: Without dead ends: 1991 [2021-10-28 09:11:07,364 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2021-10-28 09:11:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1703. [2021-10-28 09:11:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1703 states, 1702 states have (on average 1.308460634547591) internal successors, (2227), 1702 states have internal predecessors, (2227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2227 transitions. [2021-10-28 09:11:07,509 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2227 transitions. Word has length 46 [2021-10-28 09:11:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:07,510 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 2227 transitions. [2021-10-28 09:11:07,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2227 transitions. [2021-10-28 09:11:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-28 09:11:07,512 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:07,512 INFO L513 BasicCegarLoop]: 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] [2021-10-28 09:11:07,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 09:11:07,512 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:07,513 INFO L85 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2021-10-28 09:11:07,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:07,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493861369] [2021-10-28 09:11:07,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:07,514 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:07,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:07,663 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493861369] [2021-10-28 09:11:07,663 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493861369] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:11:07,664 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306573210] [2021-10-28 09:11:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:07,664 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:11:07,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:11:07,670 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:11:07,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-28 09:11:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:07,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 09:11:07,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:11:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:08,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306573210] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:11:08,377 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:11:08,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-28 09:11:08,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641093388] [2021-10-28 09:11:08,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:11:08,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:08,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:11:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:11:08,384 INFO L87 Difference]: Start difference. First operand 1703 states and 2227 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:08,750 INFO L93 Difference]: Finished difference Result 3615 states and 4764 transitions. [2021-10-28 09:11:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:11:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-10-28 09:11:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:08,779 INFO L225 Difference]: With dead ends: 3615 [2021-10-28 09:11:08,779 INFO L226 Difference]: Without dead ends: 3613 [2021-10-28 09:11:08,780 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:11:08,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2021-10-28 09:11:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3021. [2021-10-28 09:11:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 3020 states have (on average 1.3149006622516557) internal successors, (3971), 3020 states have internal predecessors, (3971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3971 transitions. [2021-10-28 09:11:09,078 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3971 transitions. Word has length 47 [2021-10-28 09:11:09,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:09,080 INFO L470 AbstractCegarLoop]: Abstraction has 3021 states and 3971 transitions. [2021-10-28 09:11:09,080 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3971 transitions. [2021-10-28 09:11:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 09:11:09,083 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:09,083 INFO L513 BasicCegarLoop]: 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] [2021-10-28 09:11:09,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-28 09:11:09,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2021-10-28 09:11:09,303 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:09,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2021-10-28 09:11:09,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:09,304 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870690632] [2021-10-28 09:11:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:09,304 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:09,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:09,365 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870690632] [2021-10-28 09:11:09,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870690632] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:09,366 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:09,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:09,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580407971] [2021-10-28 09:11:09,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:09,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:09,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:09,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:09,368 INFO L87 Difference]: Start difference. First operand 3021 states and 3971 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:09,622 INFO L93 Difference]: Finished difference Result 4413 states and 5844 transitions. [2021-10-28 09:11:09,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:09,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-28 09:11:09,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:09,640 INFO L225 Difference]: With dead ends: 4413 [2021-10-28 09:11:09,640 INFO L226 Difference]: Without dead ends: 2271 [2021-10-28 09:11:09,648 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2021-10-28 09:11:09,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2261. [2021-10-28 09:11:09,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.2960176991150443) internal successors, (2929), 2260 states have internal predecessors, (2929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:09,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2929 transitions. [2021-10-28 09:11:09,837 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2929 transitions. Word has length 50 [2021-10-28 09:11:09,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:09,838 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 2929 transitions. [2021-10-28 09:11:09,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2929 transitions. [2021-10-28 09:11:09,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-28 09:11:09,841 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:09,841 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:09,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 09:11:09,842 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:09,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:09,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2021-10-28 09:11:09,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:09,843 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153455223] [2021-10-28 09:11:09,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:09,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 09:11:09,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:09,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153455223] [2021-10-28 09:11:09,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153455223] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:09,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:09,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:11:09,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344901787] [2021-10-28 09:11:09,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:11:09,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:09,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:11:09,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:11:09,913 INFO L87 Difference]: Start difference. First operand 2261 states and 2929 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:10,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:10,272 INFO L93 Difference]: Finished difference Result 6497 states and 8385 transitions. [2021-10-28 09:11:10,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:11:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-10-28 09:11:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:10,302 INFO L225 Difference]: With dead ends: 6497 [2021-10-28 09:11:10,302 INFO L226 Difference]: Without dead ends: 4369 [2021-10-28 09:11:10,307 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:10,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2021-10-28 09:11:10,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4335. [2021-10-28 09:11:10,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4335 states, 4334 states have (on average 1.2738809413936318) internal successors, (5521), 4334 states have internal predecessors, (5521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:10,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5521 transitions. [2021-10-28 09:11:10,666 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5521 transitions. Word has length 54 [2021-10-28 09:11:10,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:10,667 INFO L470 AbstractCegarLoop]: Abstraction has 4335 states and 5521 transitions. [2021-10-28 09:11:10,667 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:10,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5521 transitions. [2021-10-28 09:11:10,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-28 09:11:10,673 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:10,673 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:10,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 09:11:10,674 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:10,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -133219174, now seen corresponding path program 1 times [2021-10-28 09:11:10,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:10,675 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111617080] [2021-10-28 09:11:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:10,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 09:11:10,751 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:10,751 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111617080] [2021-10-28 09:11:10,751 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111617080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:10,751 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:10,751 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:11:10,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109491588] [2021-10-28 09:11:10,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:11:10,752 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:11:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:11:10,753 INFO L87 Difference]: Start difference. First operand 4335 states and 5521 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:11,233 INFO L93 Difference]: Finished difference Result 7753 states and 9875 transitions. [2021-10-28 09:11:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:11:11,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-10-28 09:11:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:11,266 INFO L225 Difference]: With dead ends: 7753 [2021-10-28 09:11:11,266 INFO L226 Difference]: Without dead ends: 4373 [2021-10-28 09:11:11,272 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2021-10-28 09:11:11,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4099. [2021-10-28 09:11:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4099 states, 4098 states have (on average 1.2520741825280626) internal successors, (5131), 4098 states have internal predecessors, (5131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5131 transitions. [2021-10-28 09:11:11,620 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5131 transitions. Word has length 62 [2021-10-28 09:11:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:11,620 INFO L470 AbstractCegarLoop]: Abstraction has 4099 states and 5131 transitions. [2021-10-28 09:11:11,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5131 transitions. [2021-10-28 09:11:11,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-28 09:11:11,627 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:11,627 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:11,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 09:11:11,628 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:11,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:11,629 INFO L85 PathProgramCache]: Analyzing trace with hash 192048362, now seen corresponding path program 1 times [2021-10-28 09:11:11,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:11,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667156351] [2021-10-28 09:11:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:11,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:11,700 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-10-28 09:11:11,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:11,700 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667156351] [2021-10-28 09:11:11,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667156351] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:11,701 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:11,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-28 09:11:11,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726370624] [2021-10-28 09:11:11,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-28 09:11:11,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:11,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-28 09:11:11,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-28 09:11:11,704 INFO L87 Difference]: Start difference. First operand 4099 states and 5131 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:12,121 INFO L93 Difference]: Finished difference Result 6541 states and 8149 transitions. [2021-10-28 09:11:12,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-28 09:11:12,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-10-28 09:11:12,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:12,139 INFO L225 Difference]: With dead ends: 6541 [2021-10-28 09:11:12,139 INFO L226 Difference]: Without dead ends: 2561 [2021-10-28 09:11:12,146 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-28 09:11:12,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2021-10-28 09:11:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2056. [2021-10-28 09:11:12,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 2055 states have (on average 1.235036496350365) internal successors, (2538), 2055 states have internal predecessors, (2538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2538 transitions. [2021-10-28 09:11:12,389 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2538 transitions. Word has length 89 [2021-10-28 09:11:12,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:12,390 INFO L470 AbstractCegarLoop]: Abstraction has 2056 states and 2538 transitions. [2021-10-28 09:11:12,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2538 transitions. [2021-10-28 09:11:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-28 09:11:12,401 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:12,401 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:12,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 09:11:12,402 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash -2062407350, now seen corresponding path program 1 times [2021-10-28 09:11:12,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:12,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468342619] [2021-10-28 09:11:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:12,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:12,433 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-10-28 09:11:12,433 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:12,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468342619] [2021-10-28 09:11:12,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468342619] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:12,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:12,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:12,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114083143] [2021-10-28 09:11:12,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:12,436 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:12,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:12,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:12,437 INFO L87 Difference]: Start difference. First operand 2056 states and 2538 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:12,559 INFO L93 Difference]: Finished difference Result 2058 states and 2539 transitions. [2021-10-28 09:11:12,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:12,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-10-28 09:11:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:12,571 INFO L225 Difference]: With dead ends: 2058 [2021-10-28 09:11:12,571 INFO L226 Difference]: Without dead ends: 1569 [2021-10-28 09:11:12,572 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:12,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2021-10-28 09:11:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2021-10-28 09:11:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.2417091836734695) internal successors, (1947), 1568 states have internal predecessors, (1947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1947 transitions. [2021-10-28 09:11:12,752 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1947 transitions. Word has length 91 [2021-10-28 09:11:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:12,752 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 1947 transitions. [2021-10-28 09:11:12,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1947 transitions. [2021-10-28 09:11:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-28 09:11:12,756 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:12,756 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:12,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 09:11:12,756 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:12,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:12,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1584127351, now seen corresponding path program 1 times [2021-10-28 09:11:12,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:12,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481053968] [2021-10-28 09:11:12,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:12,758 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-28 09:11:12,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:12,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481053968] [2021-10-28 09:11:12,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481053968] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:12,797 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:12,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:12,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600951288] [2021-10-28 09:11:12,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:12,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:12,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:12,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:12,800 INFO L87 Difference]: Start difference. First operand 1569 states and 1947 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:12,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:12,918 INFO L93 Difference]: Finished difference Result 2545 states and 3158 transitions. [2021-10-28 09:11:12,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:12,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-10-28 09:11:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:12,927 INFO L225 Difference]: With dead ends: 2545 [2021-10-28 09:11:12,927 INFO L226 Difference]: Without dead ends: 1095 [2021-10-28 09:11:12,930 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-10-28 09:11:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1026. [2021-10-28 09:11:13,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 1025 states have (on average 1.224390243902439) internal successors, (1255), 1025 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1255 transitions. [2021-10-28 09:11:13,022 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1255 transitions. Word has length 102 [2021-10-28 09:11:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:13,023 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1255 transitions. [2021-10-28 09:11:13,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1255 transitions. [2021-10-28 09:11:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-28 09:11:13,027 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:13,027 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:13,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 09:11:13,028 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:13,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:13,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1991347350, now seen corresponding path program 1 times [2021-10-28 09:11:13,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:13,029 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959062609] [2021-10-28 09:11:13,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:13,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-28 09:11:13,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:13,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959062609] [2021-10-28 09:11:13,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959062609] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:13,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:13,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 09:11:13,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236017823] [2021-10-28 09:11:13,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 09:11:13,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 09:11:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 09:11:13,080 INFO L87 Difference]: Start difference. First operand 1026 states and 1255 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:13,206 INFO L93 Difference]: Finished difference Result 1967 states and 2397 transitions. [2021-10-28 09:11:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 09:11:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-10-28 09:11:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:13,214 INFO L225 Difference]: With dead ends: 1967 [2021-10-28 09:11:13,214 INFO L226 Difference]: Without dead ends: 979 [2021-10-28 09:11:13,216 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-10-28 09:11:13,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 958. [2021-10-28 09:11:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 957 states have (on average 1.206896551724138) internal successors, (1155), 957 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1155 transitions. [2021-10-28 09:11:13,325 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1155 transitions. Word has length 104 [2021-10-28 09:11:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:13,326 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1155 transitions. [2021-10-28 09:11:13,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1155 transitions. [2021-10-28 09:11:13,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-28 09:11:13,330 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:13,330 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:13,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 09:11:13,331 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:13,331 INFO L85 PathProgramCache]: Analyzing trace with hash 2042293350, now seen corresponding path program 1 times [2021-10-28 09:11:13,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:13,332 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257062709] [2021-10-28 09:11:13,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:13,333 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-28 09:11:13,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:13,396 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257062709] [2021-10-28 09:11:13,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257062709] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:13,396 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:13,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:13,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819512841] [2021-10-28 09:11:13,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:13,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:13,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:13,399 INFO L87 Difference]: Start difference. First operand 958 states and 1155 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:13,521 INFO L93 Difference]: Finished difference Result 1681 states and 2044 transitions. [2021-10-28 09:11:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:13,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-10-28 09:11:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:13,527 INFO L225 Difference]: With dead ends: 1681 [2021-10-28 09:11:13,527 INFO L226 Difference]: Without dead ends: 949 [2021-10-28 09:11:13,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:13,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-10-28 09:11:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 872. [2021-10-28 09:11:13,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 871 states have (on average 1.1859931113662456) internal successors, (1033), 871 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1033 transitions. [2021-10-28 09:11:13,633 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1033 transitions. Word has length 104 [2021-10-28 09:11:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:13,633 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1033 transitions. [2021-10-28 09:11:13,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1033 transitions. [2021-10-28 09:11:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-28 09:11:13,636 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:13,637 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:13,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 09:11:13,638 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:13,638 INFO L85 PathProgramCache]: Analyzing trace with hash 795979083, now seen corresponding path program 1 times [2021-10-28 09:11:13,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:13,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285469329] [2021-10-28 09:11:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:13,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:13,695 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-10-28 09:11:13,695 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:13,696 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285469329] [2021-10-28 09:11:13,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285469329] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:13,696 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:13,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 09:11:13,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403376706] [2021-10-28 09:11:13,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 09:11:13,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:13,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 09:11:13,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 09:11:13,699 INFO L87 Difference]: Start difference. First operand 872 states and 1033 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:13,850 INFO L93 Difference]: Finished difference Result 2004 states and 2354 transitions. [2021-10-28 09:11:13,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 09:11:13,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2021-10-28 09:11:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:13,854 INFO L225 Difference]: With dead ends: 2004 [2021-10-28 09:11:13,854 INFO L226 Difference]: Without dead ends: 861 [2021-10-28 09:11:13,856 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 09:11:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-10-28 09:11:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 571. [2021-10-28 09:11:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 1.1543859649122807) internal successors, (658), 570 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 658 transitions. [2021-10-28 09:11:13,917 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 658 transitions. Word has length 105 [2021-10-28 09:11:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:13,917 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 658 transitions. [2021-10-28 09:11:13,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 658 transitions. [2021-10-28 09:11:13,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-28 09:11:13,921 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:13,921 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:13,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 09:11:13,922 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:13,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:13,923 INFO L85 PathProgramCache]: Analyzing trace with hash 231071671, now seen corresponding path program 1 times [2021-10-28 09:11:13,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:13,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424856750] [2021-10-28 09:11:13,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:13,924 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-10-28 09:11:13,976 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:13,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424856750] [2021-10-28 09:11:13,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424856750] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:13,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:13,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:13,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636959646] [2021-10-28 09:11:13,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:13,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:13,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:13,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:13,980 INFO L87 Difference]: Start difference. First operand 571 states and 658 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:14,037 INFO L93 Difference]: Finished difference Result 743 states and 849 transitions. [2021-10-28 09:11:14,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:14,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2021-10-28 09:11:14,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:14,039 INFO L225 Difference]: With dead ends: 743 [2021-10-28 09:11:14,040 INFO L226 Difference]: Without dead ends: 290 [2021-10-28 09:11:14,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-28 09:11:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-10-28 09:11:14,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 1.0865051903114187) internal successors, (314), 289 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2021-10-28 09:11:14,072 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 158 [2021-10-28 09:11:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:14,073 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2021-10-28 09:11:14,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2021-10-28 09:11:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-28 09:11:14,076 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:14,077 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:14,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 09:11:14,077 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:14,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1337877945, now seen corresponding path program 1 times [2021-10-28 09:11:14,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:14,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287759853] [2021-10-28 09:11:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:14,079 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2021-10-28 09:11:14,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:14,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287759853] [2021-10-28 09:11:14,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287759853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 09:11:14,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 09:11:14,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 09:11:14,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585348261] [2021-10-28 09:11:14,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 09:11:14,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 09:11:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:14,137 INFO L87 Difference]: Start difference. First operand 290 states and 314 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:14,182 INFO L93 Difference]: Finished difference Result 487 states and 529 transitions. [2021-10-28 09:11:14,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 09:11:14,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2021-10-28 09:11:14,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:14,184 INFO L225 Difference]: With dead ends: 487 [2021-10-28 09:11:14,185 INFO L226 Difference]: Without dead ends: 288 [2021-10-28 09:11:14,185 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 09:11:14,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-28 09:11:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-10-28 09:11:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 1.0696864111498259) internal successors, (307), 287 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2021-10-28 09:11:14,218 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 159 [2021-10-28 09:11:14,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:14,218 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2021-10-28 09:11:14,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2021-10-28 09:11:14,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-28 09:11:14,222 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 09:11:14,222 INFO L513 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:14,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 09:11:14,223 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 09:11:14,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 09:11:14,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1976533731, now seen corresponding path program 1 times [2021-10-28 09:11:14,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 09:11:14,224 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427713695] [2021-10-28 09:11:14,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:14,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 09:11:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 46 proven. 59 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-10-28 09:11:14,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 09:11:14,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427713695] [2021-10-28 09:11:14,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427713695] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:11:14,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054416118] [2021-10-28 09:11:14,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 09:11:14,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:11:14,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 09:11:14,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-28 09:11:14,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-28 09:11:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 09:11:14,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-28 09:11:14,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 09:11:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-10-28 09:11:16,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054416118] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-28 09:11:16,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-28 09:11:16,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2021-10-28 09:11:16,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157957739] [2021-10-28 09:11:16,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-28 09:11:16,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 09:11:16,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-28 09:11:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:11:16,042 INFO L87 Difference]: Start difference. First operand 288 states and 307 transitions. Second operand has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:16,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 09:11:16,167 INFO L93 Difference]: Finished difference Result 539 states and 577 transitions. [2021-10-28 09:11:16,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-28 09:11:16,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2021-10-28 09:11:16,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 09:11:16,169 INFO L225 Difference]: With dead ends: 539 [2021-10-28 09:11:16,169 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 09:11:16,170 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-28 09:11:16,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 09:11:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 09:11:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 09:11:16,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2021-10-28 09:11:16,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 09:11:16,172 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 09:11:16,172 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.22222222222222) internal successors, (299), 9 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-28 09:11:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 09:11:16,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 09:11:16,175 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:11:16,176 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 09:11:16,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-28 09:11:16,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-28 09:11:16,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 09:11:16,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,886 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:16,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,112 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,179 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,240 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,326 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,341 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,431 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,504 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:17,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,115 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,313 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,375 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,571 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:18,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 09:11:31,292 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-28 09:11:31,292 INFO L857 garLoopResultBuilder]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2021-10-28 09:11:31,293 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 267 271) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,293 INFO L857 garLoopResultBuilder]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2021-10-28 09:11:31,293 INFO L857 garLoopResultBuilder]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2021-10-28 09:11:31,293 INFO L853 garLoopResultBuilder]: At program point L69(lines 53 71) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,294 INFO L853 garLoopResultBuilder]: At program point L69-1(lines 53 71) the Hoare annotation is: (let ((.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse13 (= ~q_free~0 1)) (.cse17 (= ~q_read_ev~0 1)) (.cse7 (= ~c_dr_pc~0 1)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~q_req_up~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse13 .cse4 .cse6 .cse14 .cse7 .cse8 .cse15 .cse10 .cse11) (let ((.cse16 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9 .cse10 (<= .cse16 ~p_num_write~0) (<= ~p_num_write~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse12 .cse13 .cse17 .cse4 .cse6 .cse14 .cse7 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse17 .cse4 .cse6 .cse7 .cse8 .cse10 .cse11) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 .cse5 .cse6 .cse8 (<= ~p_num_write~0 1) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse9 (= ~c_dr_pc~0 0) .cse10 (<= 1 ~p_num_write~0)))) [2021-10-28 09:11:31,294 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 09:11:31,294 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 256) no Hoare annotation was computed. [2021-10-28 09:11:31,295 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2021-10-28 09:11:31,295 INFO L860 garLoopResultBuilder]: At program point L466(lines 457 468) the Hoare annotation is: true [2021-10-28 09:11:31,295 INFO L857 garLoopResultBuilder]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2021-10-28 09:11:31,295 INFO L857 garLoopResultBuilder]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2021-10-28 09:11:31,296 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 128) no Hoare annotation was computed. [2021-10-28 09:11:31,296 INFO L853 garLoopResultBuilder]: At program point L87(lines 75 89) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ULTIMATE.start_activate_threads_~tmp~1 0)) [2021-10-28 09:11:31,296 INFO L853 garLoopResultBuilder]: At program point L87-1(lines 75 89) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= ~q_read_ev~0 1)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse0 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse6 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ~p_dw_pc~0 1)) (.cse17 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse6 .cse7 .cse12 .cse8 .cse13 .cse9 .cse10) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse14 .cse2 .cse3 .cse6 .cse15 .cse7 .cse16 (<= ~p_num_write~0 1) .cse17 (= ~c_dr_pc~0 0) .cse9 .cse18 (<= 1 ~p_num_write~0)) (and .cse3 (or (and .cse0 .cse1 .cse14 .cse2 .cse4 .cse6 .cse7 .cse8 .cse16 .cse17 .cse9 .cse18 .cse10) (and .cse0 .cse1 .cse14 .cse2 .cse6 .cse15 .cse7 .cse8 .cse16 .cse17 .cse9 .cse18 .cse10))) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse12 .cse8 .cse13 .cse19 .cse9 .cse10) (let ((.cse20 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse14 .cse2 .cse6 .cse15 .cse7 .cse8 .cse16 .cse13 .cse17 .cse9 .cse18 (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20)))))) [2021-10-28 09:11:31,297 INFO L860 garLoopResultBuilder]: At program point L434(lines 397 439) the Hoare annotation is: true [2021-10-28 09:11:31,297 INFO L853 garLoopResultBuilder]: At program point L88(lines 72 90) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ULTIMATE.start_activate_threads_~tmp~1 0)) [2021-10-28 09:11:31,297 INFO L853 garLoopResultBuilder]: At program point L88-1(lines 72 90) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse21)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (= ~q_read_ev~0 2)) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse14 (= ~q_free~0 1)) (.cse19 (= ~q_read_ev~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse16 (= ~c_dr_pc~0 1)) (.cse17 (= ~p_dw_pc~0 1)) (.cse9 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse18 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (<= ~p_num_write~0 1) .cse9 .cse10 (= ~c_dr_pc~0 0) .cse11 .cse12 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse3 .cse13 .cse4 .cse14 .cse5 .cse7 .cse15 .cse16 .cse17 .cse9 .cse11 .cse18) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse19 .cse5 .cse7 .cse16 .cse9 .cse11 .cse18) (let ((.cse20 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse8 .cse17 .cse10 .cse11 .cse12 (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20))) (and .cse4 (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse16 .cse8 .cse10 .cse11 .cse12 .cse18)) .cse9) (and .cse1 .cse3 .cse13 .cse4 .cse14 .cse19 .cse5 .cse15 .cse16 .cse17 .cse9 .cse21 .cse11 .cse18)))) [2021-10-28 09:11:31,298 INFO L857 garLoopResultBuilder]: For program point L336(lines 336 340) no Hoare annotation was computed. [2021-10-28 09:11:31,298 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2021-10-28 09:11:31,298 INFO L857 garLoopResultBuilder]: For program point L386(lines 386 391) no Hoare annotation was computed. [2021-10-28 09:11:31,298 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 127) no Hoare annotation was computed. [2021-10-28 09:11:31,299 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 66) no Hoare annotation was computed. [2021-10-28 09:11:31,299 INFO L857 garLoopResultBuilder]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2021-10-28 09:11:31,299 INFO L857 garLoopResultBuilder]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2021-10-28 09:11:31,299 INFO L857 garLoopResultBuilder]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2021-10-28 09:11:31,299 INFO L853 garLoopResultBuilder]: At program point L272-1(lines 263 280) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,300 INFO L857 garLoopResultBuilder]: For program point L173(lines 172 203) no Hoare annotation was computed. [2021-10-28 09:11:31,300 INFO L853 garLoopResultBuilder]: At program point L272-3(lines 263 280) the Hoare annotation is: (let ((.cse10 (= ~q_free~0 1)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (<= ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse3 .cse4 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse5 (<= ~p_num_write~0 1) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse7 (= ~c_dr_pc~0 0) .cse8 (<= 1 ~p_num_write~0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 (<= .cse12 ~p_num_write~0) (<= ~p_num_write~0 .cse12))))) [2021-10-28 09:11:31,300 INFO L853 garLoopResultBuilder]: At program point L454(lines 440 456) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,301 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 09:11:31,301 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-10-28 09:11:31,301 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 63) no Hoare annotation was computed. [2021-10-28 09:11:31,301 INFO L857 garLoopResultBuilder]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2021-10-28 09:11:31,302 INFO L853 garLoopResultBuilder]: At program point L372(lines 324 377) the Hoare annotation is: (let ((.cse12 (= ~c_num_read~0 0)) (.cse5 (= ~q_free~0 0)) (.cse15 (<= ~p_num_write~0 1)) (.cse17 (= ~c_dr_pc~0 0)) (.cse18 (<= 1 ~p_num_write~0)) (.cse8 (= ~q_read_ev~0 2)) (.cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse19 (= ~q_req_up~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse21 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse22 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~p_dw_pc~0 1)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1)))) (or (let ((.cse11 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= .cse11 ~p_num_write~0) (<= ~p_num_write~0 .cse11))) (and .cse0 .cse1 .cse12 .cse2 (= ~q_write_ev~0 ~q_read_ev~0) .cse13 .cse4 .cse5 .cse14 .cse15 .cse16 .cse8 .cse17 .cse9 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse19 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse12 .cse2 .cse3 .cse13 .cse4 .cse5 .cse14 .cse19 .cse15 .cse16 .cse8 .cse17 .cse9 .cse10 .cse18) (and .cse1 .cse2 .cse3 .cse20 .cse4 .cse19 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse21 .cse13 .cse20 .cse4 .cse14 .cse19 .cse22 .cse6 .cse7 .cse16 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse21 .cse20 .cse4 .cse22 .cse6 .cse7 .cse9 .cse10))) [2021-10-28 09:11:31,302 INFO L857 garLoopResultBuilder]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2021-10-28 09:11:31,302 INFO L853 garLoopResultBuilder]: At program point L356(lines 331 371) the Hoare annotation is: (let ((.cse30 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse17 (<= ~p_num_write~0 1)) (.cse20 (<= 1 ~p_num_write~0)) (.cse22 (= ~p_dw_pc~0 0)) (.cse23 (= ~p_num_write~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~q_req_up~0 0)) (.cse11 (<= .cse31 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse31)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse30)) (.cse13 (= ~c_num_read~0 0)) (.cse14 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse19 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse24 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse25 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse26 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse8 .cse19 .cse9 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse13 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse21 .cse17 .cse18 .cse8 .cse19 .cse9 .cse10 .cse20) (and .cse22 .cse23 .cse13 .cse2 .cse24 .cse14 .cse15 .cse25 .cse4 .cse26 .cse16 .cse21 .cse6 .cse18 .cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0)) .cse9 .cse27) (and .cse1 .cse2 .cse3 .cse25 .cse4 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse28 .cse15 .cse25 .cse4 .cse16 .cse21 .cse29 .cse6 .cse7 .cse18 .cse9 .cse10) (and .cse22 .cse23 .cse13 .cse2 .cse14 .cse15 .cse25 .cse16 .cse21 .cse18 .cse30 .cse8 .cse19 .cse9 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse25 .cse4 .cse29 .cse6 .cse7 .cse9 .cse10) (and .cse7 (or (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse26 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse21 .cse6 .cse8 .cse9 .cse10)) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse24 .cse14 .cse15 .cse5 .cse26 .cse16 .cse7 .cse18 .cse8 .cse19 .cse9 (= ~p_num_write~0 1)) (and .cse2 .cse3 .cse28 .cse24 .cse25 .cse4 .cse26 .cse29 .cse6 .cse7 .cse30 .cse8 .cse9 .cse10)))) [2021-10-28 09:11:31,303 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-10-28 09:11:31,303 INFO L853 garLoopResultBuilder]: At program point L290-3(lines 281 298) the Hoare annotation is: (let ((.cse18 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse18)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~q_req_up~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse13 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse6 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 1)) (.cse8 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~p_dw_i~0 1)) (.cse11 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ~p_num_write~0 1) .cse8 .cse9 (= ~c_dr_pc~0 0) .cse10 .cse11 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse7 .cse14 .cse15 .cse16 .cse8 .cse10 .cse11) (and .cse6 (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse13 .cse4 .cse7 .cse15 .cse9 .cse10 .cse11))) (let ((.cse17 (+ ~c_num_read~0 1))) (and (or (and .cse0 .cse1 .cse2 .cse13 .cse7 .cse15 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse5 .cse7 .cse15 .cse9 .cse10 .cse11)) .cse16 (<= .cse17 ~p_num_write~0) (<= ~p_num_write~0 .cse17))) (and .cse1 .cse2 .cse12 .cse3 .cse13 .cse4 .cse6 .cse14 .cse15 .cse16 .cse8 .cse18 .cse9 .cse10 .cse11)))) [2021-10-28 09:11:31,303 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2021-10-28 09:11:31,304 INFO L857 garLoopResultBuilder]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2021-10-28 09:11:31,304 INFO L857 garLoopResultBuilder]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2021-10-28 09:11:31,304 INFO L857 garLoopResultBuilder]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2021-10-28 09:11:31,304 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 85) no Hoare annotation was computed. [2021-10-28 09:11:31,304 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2021-10-28 09:11:31,305 INFO L857 garLoopResultBuilder]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2021-10-28 09:11:31,305 INFO L857 garLoopResultBuilder]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2021-10-28 09:11:31,305 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2021-10-28 09:11:31,305 INFO L857 garLoopResultBuilder]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2021-10-28 09:11:31,305 INFO L857 garLoopResultBuilder]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2021-10-28 09:11:31,306 INFO L857 garLoopResultBuilder]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2021-10-28 09:11:31,306 INFO L853 garLoopResultBuilder]: At program point L341(lines 331 371) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0)) (.cse32 (+ ~c_num_read~0 1))) (let ((.cse26 (<= .cse32 ~p_num_write~0)) (.cse27 (<= ~p_num_write~0 .cse32)) (.cse29 (<= ~p_num_write~0 1)) (.cse31 (<= 1 ~p_num_write~0)) (.cse11 (= ~q_req_up~0 1)) (.cse25 (= ~q_free~0 0)) (.cse15 (= ~p_dw_pc~0 0)) (.cse16 (= ~p_num_write~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse18 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse19 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse21 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse7 (= ~q_read_ev~0 2)) (.cse30 (= ~c_dr_pc~0 0)) (.cse24 (= ~c_last_read~0 ~p_last_write~0)) (.cse0 (not .cse28)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse12 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse5 (= ~q_req_up~0 0)) (.cse13 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse14 (= ~p_dw_pc~0 1)) (.cse23 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse3 .cse4 .cse13 .cse6 .cse14 .cse8 .cse9 .cse10) (and .cse15 .cse16 .cse17 .cse1 .cse18 .cse19 .cse20 .cse3 .cse4 .cse21 .cse22 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse24) (and .cse11 .cse0 .cse1 .cse2 .cse4 .cse25 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse4 .cse25 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse12 .cse18 .cse3 .cse4 .cse21 .cse13 .cse6 .cse14 .cse28 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse17 .cse1 .cse2 .cse20 .cse4 .cse25 .cse22 .cse5 .cse29 .cse23 .cse7 .cse30 .cse8 .cse9 .cse10 .cse31) (and (or (and .cse0 .cse1 .cse2 .cse18 .cse3 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse18 .cse25 .cse21 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) .cse14 .cse26 .cse27) (and .cse11 .cse0 .cse17 .cse1 .cse19 .cse20 .cse4 .cse25 .cse22 .cse29 .cse23 .cse7 .cse30 .cse8 .cse9 .cse31) (and .cse11 .cse0 .cse17 .cse1 .cse18 .cse19 .cse20 .cse25 .cse21 .cse22 .cse14 .cse23 .cse7 .cse30 .cse8 .cse9 (= ~p_num_write~0 1)) (and .cse15 .cse16 .cse17 .cse1 .cse18 .cse19 .cse20 .cse3 .cse21 .cse22 .cse5 .cse23 .cse28 .cse7 .cse30 .cse8 .cse9 .cse24) (and .cse0 .cse1 .cse2 .cse12 .cse20 .cse3 .cse4 .cse22 .cse5 .cse13 .cse6 .cse14 .cse23 .cse8 .cse9 .cse10)))) [2021-10-28 09:11:31,306 INFO L857 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-10-28 09:11:31,307 INFO L857 garLoopResultBuilder]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2021-10-28 09:11:31,307 INFO L853 garLoopResultBuilder]: At program point L259(lines 246 261) the Hoare annotation is: (let ((.cse30 (+ ~c_num_read~0 1)) (.cse26 (= ~p_dw_st~0 0))) (let ((.cse17 (<= ~p_num_write~0 1)) (.cse20 (<= 1 ~p_num_write~0)) (.cse19 (= ~c_dr_pc~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse24 (= ~p_dw_pc~0 0)) (.cse25 (= ~p_num_write~0 0)) (.cse13 (= ~c_num_read~0 0)) (.cse14 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~q_free~0 0)) (.cse1 (not .cse26)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse22 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse23 (= ~q_free~0 1)) (.cse21 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse7 (= ~p_dw_pc~0 1)) (.cse11 (<= .cse30 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse30))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse8 .cse19 .cse9 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse13 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse21 .cse17 .cse18 .cse8 .cse19 .cse9 .cse10 .cse20) (and .cse0 .cse1 .cse13 .cse2 .cse22 .cse14 .cse15 .cse5 .cse16 .cse7 .cse18 .cse8 .cse19 .cse9 (= ~p_num_write~0 1)) (and .cse1 .cse2 .cse3 .cse23 .cse4 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse24 .cse25 .cse13 .cse2 .cse22 .cse14 .cse15 .cse23 .cse16 .cse21 .cse18 .cse26 .cse8 .cse19 .cse9 .cse27) (and .cse1 .cse2 .cse3 .cse28 .cse15 .cse23 .cse4 .cse16 .cse21 .cse29 .cse6 .cse7 .cse18 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse23 .cse4 .cse29 .cse6 .cse7 .cse9 .cse10) (and .cse2 .cse3 .cse28 .cse22 .cse23 .cse4 .cse29 .cse6 .cse7 .cse26 .cse8 .cse9 .cse10) (and .cse24 .cse25 .cse13 .cse2 .cse22 .cse14 .cse15 .cse23 .cse4 .cse16 .cse21 .cse6 .cse18 .cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0)) .cse9 .cse27) (and (or (and .cse1 .cse2 .cse3 .cse22 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse22 .cse23 .cse21 .cse6 .cse8 .cse9 .cse10)) .cse7 .cse11 .cse12)))) [2021-10-28 09:11:31,308 INFO L853 garLoopResultBuilder]: At program point L259-1(lines 246 261) the Hoare annotation is: (let ((.cse18 (= ~p_dw_st~0 0))) (let ((.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~q_free~0 0)) (.cse0 (not .cse18)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse17 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ~q_free~0 1)) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse16 (= ~p_dw_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse10 .cse3 .cse4 .cse11 .cse5 (<= ~p_num_write~0 1) .cse12 .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse14 .cse10 .cse13 .cse3 .cse11 .cse5 .cse15 .cse6 .cse16 .cse12 .cse8 .cse9) (and .cse1 .cse2 .cse14 .cse17 .cse10 .cse13 .cse3 .cse11 .cse15 .cse6 .cse16 .cse12 .cse18 .cse7 .cse8 .cse9) (let ((.cse19 (+ ~c_num_read~0 1))) (and (or (and .cse0 .cse1 .cse2 .cse17 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse17 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse16 (<= .cse19 ~p_num_write~0) (<= ~p_num_write~0 .cse19)))))) [2021-10-28 09:11:31,308 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 09:11:31,308 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-28 09:11:31,308 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-28 09:11:31,309 INFO L853 garLoopResultBuilder]: At program point L260(lines 243 262) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0)) (.cse31 (+ ~c_num_read~0 1))) (let ((.cse17 (<= ~p_num_write~0 1)) (.cse20 (<= 1 ~p_num_write~0)) (.cse22 (= ~p_dw_pc~0 0)) (.cse23 (= ~p_num_write~0 0)) (.cse27 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= ~q_req_up~0 0)) (.cse11 (<= .cse31 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse31)) (.cse0 (= ~q_req_up~0 1)) (.cse1 (not .cse28)) (.cse13 (= ~c_num_read~0 0)) (.cse14 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= ~q_free~0 0)) (.cse16 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse19 (= ~c_dr_pc~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse29 (<= ~c_num_read~0 ~p_num_write~0)) (.cse24 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse25 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse26 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse30 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse14 .cse15 .cse4 .cse5 .cse16 .cse17 .cse18 .cse8 .cse19 .cse9 .cse20) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse13 .cse2 .cse3 .cse15 .cse4 .cse5 .cse16 .cse21 .cse17 .cse18 .cse8 .cse19 .cse9 .cse10 .cse20) (and .cse22 .cse23 .cse13 .cse2 .cse24 .cse14 .cse15 .cse25 .cse4 .cse26 .cse16 .cse21 .cse6 .cse18 .cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0)) .cse9 .cse27) (and .cse22 .cse23 .cse13 .cse2 .cse24 .cse14 .cse15 .cse25 .cse26 .cse16 .cse21 .cse18 .cse28 .cse8 .cse19 .cse9 .cse27) (and .cse1 .cse2 .cse3 .cse25 .cse4 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse29 .cse15 .cse25 .cse4 .cse16 .cse21 .cse30 .cse6 .cse7 .cse18 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse29 .cse25 .cse4 .cse30 .cse6 .cse7 .cse9 .cse10) (and .cse7 (or (and .cse1 .cse2 .cse3 .cse24 .cse5 .cse26 .cse21 .cse6 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse24 .cse25 .cse26 .cse21 .cse6 .cse8 .cse9 .cse10)) .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse2 .cse24 .cse14 .cse15 .cse5 .cse26 .cse16 .cse7 .cse18 .cse8 .cse19 .cse9 (= ~p_num_write~0 1)) (and .cse2 .cse3 .cse29 .cse24 .cse25 .cse4 .cse26 .cse30 .cse6 .cse7 .cse28 .cse8 .cse9 .cse10)))) [2021-10-28 09:11:31,309 INFO L853 garLoopResultBuilder]: At program point L260-1(lines 243 262) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse15 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~p_dw_pc~0 1)) (.cse4 (= ~q_free~0 0)) (.cse0 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse11 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ~q_free~0 1)) (.cse14 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse19 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse12 .cse3 .cse4 .cse15 .cse5 (<= ~p_num_write~0 1) .cse18 .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 .cse3 .cse15 .cse5 .cse16 .cse6 .cse17 .cse18 .cse8 .cse9) (let ((.cse20 (+ ~c_num_read~0 1))) (and .cse17 (or (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)) (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20)))))) [2021-10-28 09:11:31,309 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 169) no Hoare annotation was computed. [2021-10-28 09:11:31,310 INFO L853 garLoopResultBuilder]: At program point L13-1(lines 160 208) the Hoare annotation is: (let ((.cse16 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse16)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse7 (= ~p_dw_pc~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse11 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= ~q_free~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse15 (= ~q_read_ev~0 2)) (.cse8 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse9 (= ~p_dw_i~0 1))) (or (and (= ~q_req_up~0 1) .cse0 .cse1 .cse2 (<= ~c_num_read~0 ~p_num_write~0) .cse3 .cse4 .cse5 .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse3 .cse12 .cse5 (= ~q_free~0 0) .cse6 .cse13 .cse7 .cse14 .cse15 .cse8 .cse9 (= ~p_num_write~0 1) .cse10) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) .cse11 .cse1 .cse3 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse4 .cse5 .cse6 .cse13 (= ~q_req_up~0 0) .cse14 .cse16 .cse15 .cse8 .cse9 (= ~c_last_read~0 ~p_last_write~0))))) [2021-10-28 09:11:31,310 INFO L853 garLoopResultBuilder]: At program point L393(lines 382 395) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse15 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~p_dw_pc~0 1)) (.cse4 (= ~q_free~0 0)) (.cse0 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse11 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ~q_free~0 1)) (.cse14 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse19 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse12 .cse3 .cse4 .cse15 .cse5 (<= ~p_num_write~0 1) .cse18 .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 .cse3 .cse15 .cse5 .cse16 .cse6 .cse17 .cse18 .cse8 .cse9) (let ((.cse20 (+ ~c_num_read~0 1))) (and .cse17 (or (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)) (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20)))))) [2021-10-28 09:11:31,310 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 367) no Hoare annotation was computed. [2021-10-28 09:11:31,311 INFO L853 garLoopResultBuilder]: At program point L394(lines 378 396) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse15 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~p_dw_pc~0 1)) (.cse4 (= ~q_free~0 0)) (.cse0 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse11 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ~q_free~0 1)) (.cse14 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse19 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse12 .cse3 .cse4 .cse15 .cse5 (<= ~p_num_write~0 1) .cse18 .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 .cse3 .cse15 .cse5 .cse16 .cse6 .cse17 .cse18 .cse8 .cse9) (let ((.cse20 (+ ~c_num_read~0 1))) (and .cse17 (or (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)) (<= .cse20 ~p_num_write~0) (<= ~p_num_write~0 .cse20)))))) [2021-10-28 09:11:31,311 INFO L857 garLoopResultBuilder]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2021-10-28 09:11:31,311 INFO L853 garLoopResultBuilder]: At program point L411-1(lines 281 433) the Hoare annotation is: (let ((.cse19 (= ~p_dw_st~0 0))) (let ((.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse20 (= ~c_num_read~0 0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse18 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse21 (= ~c_dr_pc~0 0)) (.cse17 (= ~p_dw_pc~0 1)) (.cse4 (= ~q_free~0 0)) (.cse0 (not .cse19)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse11 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse13 (= ~q_free~0 1)) (.cse14 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse2 .cse10 .cse11 .cse12 .cse13 .cse3 .cse14 .cse15 .cse16 .cse6 .cse17 .cse18 .cse19 .cse7 .cse8 .cse9) (and .cse0 .cse20 .cse1 .cse2 .cse12 .cse3 .cse4 .cse15 .cse5 (<= ~p_num_write~0 1) .cse18 .cse7 .cse21 .cse8 .cse9 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse12 .cse13 .cse3 .cse15 .cse5 .cse16 .cse6 .cse17 .cse18 .cse8 .cse9) (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) .cse20 .cse1 (= ~q_write_ev~0 ~q_read_ev~0) .cse12 .cse13 .cse15 .cse5 .cse18 .cse19 .cse7 .cse21 .cse8 (= ~c_last_read~0 ~p_last_write~0)) (let ((.cse22 (+ ~c_num_read~0 1))) (and .cse17 (or (and .cse0 .cse1 .cse2 .cse11 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse11 .cse13 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9)) (<= .cse22 ~p_num_write~0) (<= ~p_num_write~0 .cse22)))))) [2021-10-28 09:11:31,312 INFO L857 garLoopResultBuilder]: For program point L345(lines 345 352) no Hoare annotation was computed. [2021-10-28 09:11:31,312 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-10-28 09:11:31,312 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 168) no Hoare annotation was computed. [2021-10-28 09:11:31,313 INFO L853 garLoopResultBuilder]: At program point L131-1(lines 119 154) the Hoare annotation is: (let ((.cse22 (= ~c_dr_pc~0 0)) (.cse0 (= ~q_req_up~0 1)) (.cse23 (= ~p_num_write~0 1)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse6 (= ~q_free~0 0)) (.cse12 (not (= ~q_write_ev~0 1))) (.cse14 (= ~p_num_write~0 0)) (.cse1 (not (= ~p_dw_st~0 0))) (.cse15 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse18 (= ~q_free~0 1)) (.cse5 (not (= ~c_dr_st~0 0))) (.cse7 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse19 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse20 (= ~q_req_up~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse21 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse11 (= ~p_dw_i~0 1))) (or (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~p_dw_pc~0 1) .cse9 .cse10 .cse11 .cse12 (<= .cse13 ~p_num_write~0) (<= ~p_num_write~0 .cse13))) (and .cse14 .cse1 .cse15 .cse2 .cse4 .cse16 .cse17 .cse18 .cse7 .cse19 .cse20 .cse21 .cse9 .cse22 .cse10 .cse11) (and .cse0 .cse1 .cse15 .cse2 .cse4 .cse16 .cse17 .cse6 .cse7 .cse19 .cse21 .cse9 .cse22 .cse10 .cse11 .cse23) (and .cse0 .cse1 .cse15 .cse2 .cse4 .cse16 .cse17 .cse5 .cse6 .cse7 .cse19 .cse8 .cse21 .cse9 .cse10 .cse11 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse14 .cse1 .cse15 .cse2 .cse4 .cse16 .cse17 .cse18 .cse5 .cse7 .cse19 .cse20 .cse8 .cse21 .cse9 .cse10 .cse11))) [2021-10-28 09:11:31,313 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 09:11:31,313 INFO L857 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2021-10-28 09:11:31,313 INFO L857 garLoopResultBuilder]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2021-10-28 09:11:31,313 INFO L857 garLoopResultBuilder]: For program point L412(line 412) no Hoare annotation was computed. [2021-10-28 09:11:31,314 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-28 09:11:31,314 INFO L857 garLoopResultBuilder]: For program point L247(lines 247 257) no Hoare annotation was computed. [2021-10-28 09:11:31,314 INFO L857 garLoopResultBuilder]: For program point L214(lines 214 220) no Hoare annotation was computed. [2021-10-28 09:11:31,314 INFO L857 garLoopResultBuilder]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2021-10-28 09:11:31,315 INFO L853 garLoopResultBuilder]: At program point L214-1(lines 229 233) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,315 INFO L857 garLoopResultBuilder]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2021-10-28 09:11:31,315 INFO L853 garLoopResultBuilder]: At program point L214-3(lines 210 224) the Hoare annotation is: (let ((.cse2 (not (= ~q_write_ev~0 0))) (.cse10 (= ~q_free~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (not (= ~c_dr_st~0 0))) (.cse4 (= ~q_free~0 0)) (.cse5 (= ~q_req_up~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (= ~p_dw_pc~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (<= ~c_num_read~0 ~p_num_write~0) .cse10 .cse3 .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse6 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_num_read~0 0) .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse3 .cse4 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse5 (<= ~p_num_write~0 1) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse7 (= ~c_dr_pc~0 0) .cse8 .cse9 (<= 1 ~p_num_write~0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8 .cse9 (<= .cse12 ~p_num_write~0) (<= ~p_num_write~0 .cse12))))) [2021-10-28 09:11:31,315 INFO L853 garLoopResultBuilder]: At program point L165(lines 160 208) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (not (= ~p_dw_st~0 0)) (= ~p_last_write~0 ~q_buf_0~0) (not (= ~q_write_ev~0 0)) (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0)) (not (= ~c_dr_st~0 0)) (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0)) (= ~c_dr_pc~0 1) (= ~p_dw_pc~0 1) (not (= ULTIMATE.start_eval_~tmp___1~0 0)) (= ~p_dw_i~0 1) (not (= ~q_write_ev~0 1)) (<= .cse0 ~p_num_write~0) (<= ~p_num_write~0 .cse0))) [2021-10-28 09:11:31,316 INFO L857 garLoopResultBuilder]: For program point L132(lines 131 149) no Hoare annotation was computed. [2021-10-28 09:11:31,316 INFO L853 garLoopResultBuilder]: At program point L133(lines 119 154) the Hoare annotation is: (let ((.cse3 (not (= ~c_dr_st~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_num_write~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse10 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 0))) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (not (= |ULTIMATE.start_exists_runnable_thread_#res| 0))) (.cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (= ~q_req_up~0 0)) (.cse15 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (not (= ULTIMATE.start_eval_~tmp___1~0 0))) (.cse8 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 (not (= ~q_write_ev~0 0)) (<= ~c_num_read~0 ~p_num_write~0) .cse2 .cse3 .cse4 (<= ~p_num_write~0 ~c_num_read~0) .cse5 (= ~p_dw_pc~0 1) .cse6 .cse7 .cse8 (not (= ~q_write_ev~0 1))) (and .cse9 .cse0 .cse10 .cse1 .cse2 .cse11 .cse12 .cse3 .cse4 .cse13 .cse14 .cse5 .cse15 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse1 .cse2 .cse11 .cse12 .cse4 .cse13 .cse14 .cse15 .cse6 (= ~c_dr_pc~0 0) .cse7 .cse8))) [2021-10-28 09:11:31,316 INFO L857 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-10-28 09:11:31,317 INFO L853 garLoopResultBuilder]: At program point L315-2(lines 285 289) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ~q_free~0 1) (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ~q_req_up~0 0) (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0) (= ULTIMATE.start_activate_threads_~tmp~1 0)) [2021-10-28 09:11:31,317 INFO L857 garLoopResultBuilder]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2021-10-28 09:11:31,317 INFO L853 garLoopResultBuilder]: At program point L315-5(lines 285 289) the Hoare annotation is: (let ((.cse22 (= ~p_dw_st~0 0))) (let ((.cse0 (not .cse22)) (.cse16 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse20 (= ~q_free~0 0)) (.cse8 (= ~q_req_up~0 0)) (.cse17 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse18 (= ~q_read_ev~0 2)) (.cse19 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~q_write_ev~0 0))) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (= ~q_free~0 1)) (.cse5 (= ~q_read_ev~0 1)) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse11 (= ~p_dw_i~0 1)) (.cse12 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse13 .cse3 .cse4 .cse6 .cse7 .cse8 .cse14 .cse9 .cse15 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse16 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse17 .cse10 .cse18 .cse11 .cse19 .cse12) (let ((.cse21 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse16 .cse2 .cse20 .cse8 .cse9 .cse17 .cse15 .cse18 .cse11 .cse19 (<= .cse21 ~p_num_write~0) (<= ~p_num_write~0 .cse21))) (and .cse0 .cse1 .cse16 .cse2 .cse6 .cse20 .cse7 .cse8 .cse9 .cse17 .cse18 .cse11 .cse19) (and .cse0 (= ~c_num_read~0 0) .cse1 .cse16 .cse2 .cse3 .cse6 .cse20 .cse7 .cse8 .cse17 (<= ~p_num_write~0 1) .cse10 .cse18 (= ~c_dr_pc~0 0) .cse11 .cse19 (<= 1 ~p_num_write~0)) (and .cse1 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse9 .cse15 .cse10 .cse22 .cse11 .cse12)))) [2021-10-28 09:11:31,317 INFO L857 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-10-28 09:11:31,318 INFO L853 garLoopResultBuilder]: At program point L68(lines 56 70) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~p_num_write~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_free~0 1) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (= ~c_last_read~0 ~p_last_write~0)) [2021-10-28 09:11:31,318 INFO L853 garLoopResultBuilder]: At program point L68-1(lines 56 70) the Hoare annotation is: (let ((.cse12 (= ~q_read_ev~0 1)) (.cse5 (= ~q_free~0 0)) (.cse7 (= ~q_read_ev~0 2)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (not (= ~q_write_ev~0 0))) (.cse13 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~q_free~0 1)) (.cse4 (not (= ~c_dr_st~0 0))) (.cse6 (= ~q_req_up~0 0)) (.cse14 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse10 (not (= ~q_write_ev~0 1)))) (or (and .cse0 (= ~c_num_read~0 0) .cse1 .cse2 .cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) .cse4 .cse5 .cse6 (<= ~p_num_write~0 1) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse7 (= ~c_dr_pc~0 0) .cse8 (<= 1 ~p_num_write~0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse12 .cse4 .cse6 .cse9 .cse8 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10) (and .cse0 .cse1 .cse3 .cse13 .cse11 .cse12 .cse4 .cse6 .cse14 .cse9 .cse15 .cse8 .cse10) (let ((.cse16 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse15 .cse7 .cse8 (<= .cse16 ~p_num_write~0) (<= ~p_num_write~0 .cse16))) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse11 .cse4 .cse6 .cse14 .cse9 .cse15 .cse8 .cse10))) [2021-10-28 09:11:31,322 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-28 09:11:31,324 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 09:11:31,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 09:11:31 BoogieIcfgContainer [2021-10-28 09:11:31,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 09:11:31,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 09:11:31,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 09:11:31,433 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 09:11:31,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:11:04" (3/4) ... [2021-10-28 09:11:31,437 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 09:11:31,453 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-28 09:11:31,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-28 09:11:31,454 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:11:31,455 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 09:11:31,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && 0 == \result) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write [2021-10-28 09:11:31,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && q_req_up == 0) && 0 == \result) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 [2021-10-28 09:11:31,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && q_req_up == 0) && 0 == \result) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 [2021-10-28 09:11:31,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && 0 == \result) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 [2021-10-28 09:11:31,487 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,488 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,489 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && 1 <= p_num_write)) || ((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write) [2021-10-28 09:11:31,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || ((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) [2021-10-28 09:11:31,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1)) || ((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) [2021-10-28 09:11:31,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1) && !(q_write_ev == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write) [2021-10-28 09:11:31,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && !(\result == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1 [2021-10-28 09:11:31,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write)) || (__retres1 == 0 && (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1))))) || ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((__retres1 == 0 && (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)))) && \result == 0)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && \result == 0) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0)) || (((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,494 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (tmp___0 == 0 && ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) [2021-10-28 09:11:31,494 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,495 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-10-28 09:11:31,538 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 09:11:31,538 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 09:11:31,540 INFO L168 Benchmark]: Toolchain (without parser) took 28696.98 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 93.3 MB in the beginning and 179.2 MB in the end (delta: -86.0 MB). Peak memory consumption was 216.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,541 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 130.0 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 09:11:31,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 566.81 ms. Allocated memory is still 130.0 MB. Free memory was 93.0 MB in the beginning and 103.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.92 ms. Allocated memory is still 130.0 MB. Free memory was 103.6 MB in the beginning and 101.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,543 INFO L168 Benchmark]: Boogie Preprocessor took 65.36 ms. Allocated memory is still 130.0 MB. Free memory was 101.3 MB in the beginning and 99.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,543 INFO L168 Benchmark]: RCFGBuilder took 591.64 ms. Allocated memory is still 130.0 MB. Free memory was 99.5 MB in the beginning and 83.1 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,544 INFO L168 Benchmark]: TraceAbstraction took 27270.90 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 82.8 MB in the beginning and 186.6 MB in the end (delta: -103.8 MB). Peak memory consumption was 246.1 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,544 INFO L168 Benchmark]: Witness Printer took 106.48 ms. Allocated memory is still 432.0 MB. Free memory was 186.6 MB in the beginning and 179.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 09:11:31,547 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.39 ms. Allocated memory is still 130.0 MB. Free memory is still 110.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 566.81 ms. Allocated memory is still 130.0 MB. Free memory was 93.0 MB in the beginning and 103.6 MB in the end (delta: -10.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 83.92 ms. Allocated memory is still 130.0 MB. Free memory was 103.6 MB in the beginning and 101.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.36 ms. Allocated memory is still 130.0 MB. Free memory was 101.3 MB in the beginning and 99.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 591.64 ms. Allocated memory is still 130.0 MB. Free memory was 99.5 MB in the beginning and 83.1 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 27270.90 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 82.8 MB in the beginning and 186.6 MB in the end (delta: -103.8 MB). Peak memory consumption was 246.1 MB. Max. memory is 16.1 GB. * Witness Printer took 106.48 ms. Allocated memory is still 432.0 MB. Free memory was 186.6 MB in the beginning and 179.2 MB in the end (delta: 7.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * 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: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: 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 1 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 14.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3203 SDtfs, 3718 SDslu, 4621 SDs, 0 SdLazy, 461 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4335occurred in iteration=11, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 2545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 405 NumberOfFragments, 7882 HoareAnnotationTreeSize, 33 FomulaSimplifications, 387019 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 33 FomulaSimplificationsInter, 59821 FormulaSimplificationTreeSizeReductionInter, 12.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1819 NumberOfCodeBlocks, 1819 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1796 ConstructedInterpolants, 0 QuantifiedInterpolants, 4968 SizeOfPredicates, 4 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 535/705 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: 246]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 440]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && \result == 0) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0)) || (((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write)) || (__retres1 == 0 && (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1))))) || ((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 263]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (tmp___0 == 0 && ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1)) || ((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1) && !(q_write_ev == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && !(\result == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 285]: Loop Invariant Derived loop invariant: ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && 0 == \result) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 - InvariantResult [Line: 378]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && 0 == \result) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && tmp == 0) && 1 <= p_num_write) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((__retres1 == 0 && (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && tmp == 0) && !(q_write_ev == 1)))) && \result == 0)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 382]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 267]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 75]: Loop Invariant Derived loop invariant: ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && q_req_up == 0) && 0 == \result) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && 1 <= p_num_write)) || ((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && q_free == 1) && q_req_up == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) && p_dw_pc == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: (((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && q_req_up == 0) && 0 == \result) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write) && tmp == 0 - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && q_free == 1) && q_read_ev == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && __retres1 == 0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: (((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || ((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && p_num_write == 1)) || ((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && !(c_dr_st == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((((p_num_write == 0 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: (((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 243]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && c_dr_pc == 1) && \result == 0) && q_read_ev == 2) && !(tmp___1 == 0)) && p_dw_i == 1) && c_last_read == p_last_write)) || ((((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && !(\result == 0)) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((q_req_up == 1 && !(p_dw_st == 0)) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && q_free == 1) && !(c_dr_st == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_i == 1) && !(q_write_ev == 1))) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((((((q_req_up == 1 && !(p_dw_st == 0)) && c_num_read == 0) && p_last_write == q_buf_0) && !(__retres1 == 0)) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 0) && !(\result == 0)) && tmp___0 == 0) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && p_num_write == 1)) || (((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(c_dr_st == 0)) && q_free == 0) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((((((((p_last_write == q_buf_0 && !(q_write_ev == 0)) && c_num_read <= p_num_write) && !(__retres1 == 0)) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && !(\result == 0)) && tmp___0 == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || (((((((((((((((!(p_dw_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && __retres1 == 0) && !(c_dr_st == 0)) && q_free == 0) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && !(q_write_ev == 1)) && 1 <= p_num_write)) || (((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && q_free == 1) && !(c_dr_st == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && !(c_dr_st == 0)) && tmp___0 == 0) && q_req_up == 0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_i == 1) && !(q_write_ev == 1))) || ((((((((((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_write_ev == q_read_ev) && __retres1 == 0) && q_free == 1) && tmp___0 == 0) && q_req_up == 0) && \result == 0) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && p_dw_i == 1) && c_last_read == p_last_write)) || (((p_dw_pc == 1 && (((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 0) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)) || ((((((((((!(p_dw_st == 0) && p_last_write == q_buf_0) && !(q_write_ev == 0)) && !(__retres1 == 0)) && q_free == 1) && !(\result == 0)) && q_req_up == 0) && c_dr_pc == 1) && q_read_ev == 2) && p_dw_i == 1) && !(q_write_ev == 1)))) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) RESULT: Ultimate proved your program to be correct! [2021-10-28 09:11:31,655 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2047eb40-acf7-40b2-88a0-70b77f412cff/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...