./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 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/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_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt --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 e6d225bacde2ff4b43f974edb4824451ea41bcc5 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 01:02:41,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 01:02:41,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 01:02:41,182 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 01:02:41,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 01:02:41,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 01:02:41,196 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 01:02:41,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 01:02:41,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 01:02:41,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 01:02:41,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 01:02:41,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 01:02:41,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 01:02:41,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 01:02:41,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 01:02:41,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 01:02:41,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 01:02:41,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 01:02:41,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 01:02:41,237 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 01:02:41,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 01:02:41,245 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 01:02:41,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 01:02:41,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 01:02:41,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 01:02:41,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 01:02:41,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 01:02:41,252 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 01:02:41,253 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 01:02:41,254 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 01:02:41,254 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 01:02:41,255 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 01:02:41,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 01:02:41,256 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 01:02:41,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 01:02:41,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 01:02:41,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 01:02:41,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 01:02:41,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 01:02:41,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 01:02:41,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 01:02:41,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-13 01:02:41,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 01:02:41,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 01:02:41,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-13 01:02:41,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-13 01:02:41,312 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 01:02:41,312 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 01:02:41,312 INFO L138 SettingsManager]: * Use SBE=true [2021-10-13 01:02:41,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 01:02:41,313 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 01:02:41,313 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 01:02:41,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 01:02:41,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 01:02:41,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 01:02:41,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 01:02:41,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 01:02:41,315 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 01:02:41,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 01:02:41,316 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 01:02:41,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 01:02:41,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 01:02:41,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 01:02:41,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 01:02:41,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:02:41,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 01:02:41,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 01:02:41,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 01:02:41,318 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-13 01:02:41,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 01:02:41,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 01:02:41,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 01:02:41,320 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_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/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_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt 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 -> e6d225bacde2ff4b43f974edb4824451ea41bcc5 [2021-10-13 01:02:41,586 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 01:02:41,613 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 01:02:41,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 01:02:41,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 01:02:41,618 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 01:02:41,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/../../sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 01:02:41,706 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/data/a703c2816/f97f63895f5a4928b343ecc6393d2871/FLAG614aff1fa [2021-10-13 01:02:42,167 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 01:02:42,168 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2021-10-13 01:02:42,177 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/data/a703c2816/f97f63895f5a4928b343ecc6393d2871/FLAG614aff1fa [2021-10-13 01:02:42,536 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/data/a703c2816/f97f63895f5a4928b343ecc6393d2871 [2021-10-13 01:02:42,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 01:02:42,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 01:02:42,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 01:02:42,541 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 01:02:42,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 01:02:42,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:42,546 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@288eba8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42, skipping insertion in model container [2021-10-13 01:02:42,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:42,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 01:02:42,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 01:02:42,715 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_6a6f5652-3706-476d-b0be-e262232bb5d1/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 01:02:42,800 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:02:42,808 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 01:02:42,837 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_6a6f5652-3706-476d-b0be-e262232bb5d1/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[338,351] [2021-10-13 01:02:42,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 01:02:42,900 INFO L208 MainTranslator]: Completed translation [2021-10-13 01:02:42,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42 WrapperNode [2021-10-13 01:02:42,900 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 01:02:42,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 01:02:42,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 01:02:42,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 01:02:42,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:42,938 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:42,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 01:02:42,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 01:02:42,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 01:02:42,979 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 01:02:42,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:42,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,031 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 01:02:43,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 01:02:43,035 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 01:02:43,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 01:02:43,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (1/1) ... [2021-10-13 01:02:43,053 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 01:02:43,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:43,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 01:02:43,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 01:02:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 01:02:43,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 01:02:43,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 01:02:43,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 01:02:43,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 01:02:43,563 INFO L299 CfgBuilder]: Removed 58 assume(true) statements. [2021-10-13 01:02:43,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:43 BoogieIcfgContainer [2021-10-13 01:02:43,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 01:02:43,567 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 01:02:43,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 01:02:43,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 01:02:43,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:02:42" (1/3) ... [2021-10-13 01:02:43,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:02:43, skipping insertion in model container [2021-10-13 01:02:43,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:02:42" (2/3) ... [2021-10-13 01:02:43,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:02:43, skipping insertion in model container [2021-10-13 01:02:43,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:43" (3/3) ... [2021-10-13 01:02:43,574 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2021-10-13 01:02:43,579 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 01:02:43,580 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 01:02:43,625 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 01:02:43,631 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, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 01:02:43,632 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 01:02:43,650 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-13 01:02:43,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:02:43,658 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:43,659 INFO L512 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-13 01:02:43,660 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:43,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1850595671, now seen corresponding path program 1 times [2021-10-13 01:02:43,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:43,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376599885] [2021-10-13 01:02:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:43,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:43,855 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-13 01:02:43,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:43,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376599885] [2021-10-13 01:02:43,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376599885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:43,857 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:43,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:43,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649896534] [2021-10-13 01:02:43,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:43,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:43,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:43,878 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-13 01:02:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:44,015 INFO L93 Difference]: Finished difference Result 266 states and 419 transitions. [2021-10-13 01:02:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:44,018 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-13 01:02:44,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:44,033 INFO L225 Difference]: With dead ends: 266 [2021-10-13 01:02:44,033 INFO L226 Difference]: Without dead ends: 174 [2021-10-13 01:02:44,037 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-10-13 01:02:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2021-10-13 01:02:44,119 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-13 01:02:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 251 transitions. [2021-10-13 01:02:44,129 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 251 transitions. Word has length 39 [2021-10-13 01:02:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:44,130 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 251 transitions. [2021-10-13 01:02:44,131 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-13 01:02:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 251 transitions. [2021-10-13 01:02:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:02:44,136 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:44,136 INFO L512 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-13 01:02:44,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 01:02:44,137 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 32121146, now seen corresponding path program 1 times [2021-10-13 01:02:44,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:44,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567681994] [2021-10-13 01:02:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:44,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:44,220 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-13 01:02:44,220 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:44,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567681994] [2021-10-13 01:02:44,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567681994] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:44,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:44,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:02:44,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914395969] [2021-10-13 01:02:44,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:44,223 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:44,225 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-13 01:02:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:44,318 INFO L93 Difference]: Finished difference Result 540 states and 799 transitions. [2021-10-13 01:02:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:02:44,319 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-13 01:02:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:44,323 INFO L225 Difference]: With dead ends: 540 [2021-10-13 01:02:44,327 INFO L226 Difference]: Without dead ends: 400 [2021-10-13 01:02:44,328 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:02:44,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-10-13 01:02:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 176. [2021-10-13 01:02:44,363 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-13 01:02:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 255 transitions. [2021-10-13 01:02:44,366 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 255 transitions. Word has length 39 [2021-10-13 01:02:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:44,367 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 255 transitions. [2021-10-13 01:02:44,367 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-13 01:02:44,367 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 255 transitions. [2021-10-13 01:02:44,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:02:44,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:44,376 INFO L512 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-13 01:02:44,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 01:02:44,377 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:44,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:44,379 INFO L82 PathProgramCache]: Analyzing trace with hash 94160760, now seen corresponding path program 1 times [2021-10-13 01:02:44,380 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:44,380 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563281957] [2021-10-13 01:02:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:44,381 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:44,514 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-13 01:02:44,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:44,515 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563281957] [2021-10-13 01:02:44,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563281957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:44,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:44,519 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:44,519 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899166267] [2021-10-13 01:02:44,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:44,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:44,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:44,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:44,523 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-13 01:02:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:44,680 INFO L93 Difference]: Finished difference Result 466 states and 666 transitions. [2021-10-13 01:02:44,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:44,687 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-13 01:02:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:44,690 INFO L225 Difference]: With dead ends: 466 [2021-10-13 01:02:44,690 INFO L226 Difference]: Without dead ends: 331 [2021-10-13 01:02:44,693 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2021-10-13 01:02:44,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 246. [2021-10-13 01:02:44,732 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-13 01:02:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 343 transitions. [2021-10-13 01:02:44,733 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 343 transitions. Word has length 39 [2021-10-13 01:02:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:44,734 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 343 transitions. [2021-10-13 01:02:44,734 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-13 01:02:44,735 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 343 transitions. [2021-10-13 01:02:44,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-13 01:02:44,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:44,738 INFO L512 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-13 01:02:44,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 01:02:44,738 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:44,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1899983946, now seen corresponding path program 1 times [2021-10-13 01:02:44,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:44,740 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759549830] [2021-10-13 01:02:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:44,740 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:44,840 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-13 01:02:44,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:44,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759549830] [2021-10-13 01:02:44,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759549830] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:44,844 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:44,844 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:44,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479449489] [2021-10-13 01:02:44,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:44,845 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:44,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:44,847 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-13 01:02:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:44,893 INFO L93 Difference]: Finished difference Result 626 states and 868 transitions. [2021-10-13 01:02:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:44,893 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-13 01:02:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:44,897 INFO L225 Difference]: With dead ends: 626 [2021-10-13 01:02:44,897 INFO L226 Difference]: Without dead ends: 466 [2021-10-13 01:02:44,899 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-10-13 01:02:44,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2021-10-13 01:02:44,924 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-13 01:02:44,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 635 transitions. [2021-10-13 01:02:44,926 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 635 transitions. Word has length 39 [2021-10-13 01:02:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:44,927 INFO L470 AbstractCegarLoop]: Abstraction has 462 states and 635 transitions. [2021-10-13 01:02:44,927 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-13 01:02:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 635 transitions. [2021-10-13 01:02:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 01:02:44,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:44,929 INFO L512 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-13 01:02:44,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 01:02:44,929 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -909810741, now seen corresponding path program 1 times [2021-10-13 01:02:44,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:44,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762166318] [2021-10-13 01:02:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:44,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:44,995 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-13 01:02:44,995 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:44,995 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762166318] [2021-10-13 01:02:44,995 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762166318] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:44,996 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:44,996 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:44,996 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19036435] [2021-10-13 01:02:44,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:44,997 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:44,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:44,998 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-13 01:02:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:45,047 INFO L93 Difference]: Finished difference Result 1090 states and 1499 transitions. [2021-10-13 01:02:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:45,048 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-13 01:02:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:45,053 INFO L225 Difference]: With dead ends: 1090 [2021-10-13 01:02:45,053 INFO L226 Difference]: Without dead ends: 738 [2021-10-13 01:02:45,054 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2021-10-13 01:02:45,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 714. [2021-10-13 01:02:45,090 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-13 01:02:45,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 959 transitions. [2021-10-13 01:02:45,094 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 959 transitions. Word has length 40 [2021-10-13 01:02:45,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:45,095 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 959 transitions. [2021-10-13 01:02:45,095 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-13 01:02:45,095 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 959 transitions. [2021-10-13 01:02:45,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-13 01:02:45,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:45,097 INFO L512 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-13 01:02:45,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 01:02:45,097 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:45,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash -956850730, now seen corresponding path program 1 times [2021-10-13 01:02:45,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:45,098 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363404911] [2021-10-13 01:02:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:45,099 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:45,155 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-13 01:02:45,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:45,156 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363404911] [2021-10-13 01:02:45,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363404911] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:45,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:45,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:45,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572705794] [2021-10-13 01:02:45,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:45,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:45,158 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-13 01:02:45,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:45,241 INFO L93 Difference]: Finished difference Result 1966 states and 2646 transitions. [2021-10-13 01:02:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:45,242 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-13 01:02:45,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:45,250 INFO L225 Difference]: With dead ends: 1966 [2021-10-13 01:02:45,250 INFO L226 Difference]: Without dead ends: 1257 [2021-10-13 01:02:45,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2021-10-13 01:02:45,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1237. [2021-10-13 01:02:45,317 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-13 01:02:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1648 transitions. [2021-10-13 01:02:45,322 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1648 transitions. Word has length 40 [2021-10-13 01:02:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:45,323 INFO L470 AbstractCegarLoop]: Abstraction has 1237 states and 1648 transitions. [2021-10-13 01:02:45,323 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-13 01:02:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1648 transitions. [2021-10-13 01:02:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-10-13 01:02:45,325 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:45,325 INFO L512 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-13 01:02:45,325 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 01:02:45,325 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1951308106, now seen corresponding path program 1 times [2021-10-13 01:02:45,326 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:45,326 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111370913] [2021-10-13 01:02:45,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:45,327 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:45,359 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-13 01:02:45,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:45,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111370913] [2021-10-13 01:02:45,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111370913] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:45,360 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:45,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:45,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742731674] [2021-10-13 01:02:45,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:45,361 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:45,362 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-13 01:02:45,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:45,503 INFO L93 Difference]: Finished difference Result 2929 states and 3880 transitions. [2021-10-13 01:02:45,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:45,504 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-13 01:02:45,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:45,516 INFO L225 Difference]: With dead ends: 2929 [2021-10-13 01:02:45,516 INFO L226 Difference]: Without dead ends: 1729 [2021-10-13 01:02:45,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2021-10-13 01:02:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1705. [2021-10-13 01:02:45,630 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-13 01:02:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2236 transitions. [2021-10-13 01:02:45,637 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2236 transitions. Word has length 45 [2021-10-13 01:02:45,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:45,638 INFO L470 AbstractCegarLoop]: Abstraction has 1705 states and 2236 transitions. [2021-10-13 01:02:45,638 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-13 01:02:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2236 transitions. [2021-10-13 01:02:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-13 01:02:45,639 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:45,640 INFO L512 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-13 01:02:45,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 01:02:45,640 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:45,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:45,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1660743978, now seen corresponding path program 1 times [2021-10-13 01:02:45,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:45,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344283625] [2021-10-13 01:02:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:45,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:45,676 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-13 01:02:45,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:45,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344283625] [2021-10-13 01:02:45,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344283625] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:45,677 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:45,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:45,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591980358] [2021-10-13 01:02:45,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:45,678 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:45,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:45,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:45,679 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-13 01:02:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:45,805 INFO L93 Difference]: Finished difference Result 1993 states and 2618 transitions. [2021-10-13 01:02:45,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 01:02:45,806 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-13 01:02:45,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:45,817 INFO L225 Difference]: With dead ends: 1993 [2021-10-13 01:02:45,817 INFO L226 Difference]: Without dead ends: 1991 [2021-10-13 01:02:45,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2021-10-13 01:02:45,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1703. [2021-10-13 01:02:45,919 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-13 01:02:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2227 transitions. [2021-10-13 01:02:45,927 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2227 transitions. Word has length 46 [2021-10-13 01:02:45,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:45,927 INFO L470 AbstractCegarLoop]: Abstraction has 1703 states and 2227 transitions. [2021-10-13 01:02:45,927 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-13 01:02:45,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2227 transitions. [2021-10-13 01:02:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-13 01:02:45,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:45,929 INFO L512 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-13 01:02:45,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 01:02:45,930 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:45,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:45,930 INFO L82 PathProgramCache]: Analyzing trace with hash -56555803, now seen corresponding path program 1 times [2021-10-13 01:02:45,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:45,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389719216] [2021-10-13 01:02:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:45,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:46,054 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-13 01:02:46,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:46,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389719216] [2021-10-13 01:02:46,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389719216] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:46,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483862605] [2021-10-13 01:02:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:46,055 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:46,056 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:46,059 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:46,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 01:02:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:46,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 01:02:46,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:46,631 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-13 01:02:46,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483862605] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:46,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:46,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-10-13 01:02:46,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413614695] [2021-10-13 01:02:46,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:02:46,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:46,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:02:46,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:46,634 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-13 01:02:46,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:46,948 INFO L93 Difference]: Finished difference Result 3615 states and 4764 transitions. [2021-10-13 01:02:46,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:02:46,948 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-13 01:02:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:46,968 INFO L225 Difference]: With dead ends: 3615 [2021-10-13 01:02:46,968 INFO L226 Difference]: Without dead ends: 3613 [2021-10-13 01:02:46,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3613 states. [2021-10-13 01:02:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3613 to 3021. [2021-10-13 01:02:47,227 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-13 01:02:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 3971 transitions. [2021-10-13 01:02:47,241 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 3971 transitions. Word has length 47 [2021-10-13 01:02:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:47,241 INFO L470 AbstractCegarLoop]: Abstraction has 3021 states and 3971 transitions. [2021-10-13 01:02:47,241 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-13 01:02:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 3971 transitions. [2021-10-13 01:02:47,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-13 01:02:47,243 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:47,244 INFO L512 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-13 01:02:47,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:47,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:47,461 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:47,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:47,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2073247729, now seen corresponding path program 2 times [2021-10-13 01:02:47,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:47,462 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647640607] [2021-10-13 01:02:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:47,462 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:47,487 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-13 01:02:47,488 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:47,488 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647640607] [2021-10-13 01:02:47,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647640607] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:47,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:47,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:47,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787708973] [2021-10-13 01:02:47,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:47,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:47,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:47,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:47,490 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-13 01:02:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:47,692 INFO L93 Difference]: Finished difference Result 4413 states and 5844 transitions. [2021-10-13 01:02:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:47,693 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-13 01:02:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:47,706 INFO L225 Difference]: With dead ends: 4413 [2021-10-13 01:02:47,706 INFO L226 Difference]: Without dead ends: 2271 [2021-10-13 01:02:47,712 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2271 states. [2021-10-13 01:02:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2271 to 2261. [2021-10-13 01:02:47,886 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-13 01:02:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2929 transitions. [2021-10-13 01:02:47,897 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2929 transitions. Word has length 50 [2021-10-13 01:02:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:47,897 INFO L470 AbstractCegarLoop]: Abstraction has 2261 states and 2929 transitions. [2021-10-13 01:02:47,898 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-13 01:02:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2929 transitions. [2021-10-13 01:02:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 01:02:47,900 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:47,900 INFO L512 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-13 01:02:47,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 01:02:47,901 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:47,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1744624096, now seen corresponding path program 1 times [2021-10-13 01:02:47,902 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:47,902 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110753835] [2021-10-13 01:02:47,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:47,902 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:47,959 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-13 01:02:47,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:47,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110753835] [2021-10-13 01:02:47,960 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110753835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:47,960 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:47,960 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:47,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061363625] [2021-10-13 01:02:47,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:47,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:47,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:47,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:47,962 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-13 01:02:48,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:48,336 INFO L93 Difference]: Finished difference Result 6497 states and 8385 transitions. [2021-10-13 01:02:48,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:48,336 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-13 01:02:48,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:48,361 INFO L225 Difference]: With dead ends: 6497 [2021-10-13 01:02:48,361 INFO L226 Difference]: Without dead ends: 4369 [2021-10-13 01:02:48,365 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:48,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4369 states. [2021-10-13 01:02:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4369 to 4335. [2021-10-13 01:02:48,663 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-13 01:02:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 5521 transitions. [2021-10-13 01:02:48,682 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 5521 transitions. Word has length 54 [2021-10-13 01:02:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:48,682 INFO L470 AbstractCegarLoop]: Abstraction has 4335 states and 5521 transitions. [2021-10-13 01:02:48,683 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-13 01:02:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 5521 transitions. [2021-10-13 01:02:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-10-13 01:02:48,687 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:48,687 INFO L512 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-13 01:02:48,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 01:02:48,687 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:48,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:48,688 INFO L82 PathProgramCache]: Analyzing trace with hash -133219174, now seen corresponding path program 1 times [2021-10-13 01:02:48,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:48,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772449150] [2021-10-13 01:02:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:48,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:48,727 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-13 01:02:48,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:48,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772449150] [2021-10-13 01:02:48,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772449150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:48,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:48,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:48,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258719591] [2021-10-13 01:02:48,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:48,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:48,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:48,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:48,730 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-13 01:02:49,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:49,071 INFO L93 Difference]: Finished difference Result 7753 states and 9875 transitions. [2021-10-13 01:02:49,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:49,072 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-13 01:02:49,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:49,095 INFO L225 Difference]: With dead ends: 7753 [2021-10-13 01:02:49,095 INFO L226 Difference]: Without dead ends: 4373 [2021-10-13 01:02:49,100 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2021-10-13 01:02:49,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4099. [2021-10-13 01:02:49,380 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-13 01:02:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 5131 transitions. [2021-10-13 01:02:49,394 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 5131 transitions. Word has length 62 [2021-10-13 01:02:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:49,395 INFO L470 AbstractCegarLoop]: Abstraction has 4099 states and 5131 transitions. [2021-10-13 01:02:49,395 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-13 01:02:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 5131 transitions. [2021-10-13 01:02:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-13 01:02:49,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:49,401 INFO L512 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-13 01:02:49,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 01:02:49,402 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash 192048362, now seen corresponding path program 1 times [2021-10-13 01:02:49,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:49,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995102963] [2021-10-13 01:02:49,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:49,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:49,452 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-13 01:02:49,452 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:49,453 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995102963] [2021-10-13 01:02:49,453 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995102963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:49,453 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:49,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 01:02:49,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774177627] [2021-10-13 01:02:49,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 01:02:49,454 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:49,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 01:02:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-10-13 01:02:49,456 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-13 01:02:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:49,821 INFO L93 Difference]: Finished difference Result 6541 states and 8149 transitions. [2021-10-13 01:02:49,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 01:02:49,821 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-13 01:02:49,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:49,835 INFO L225 Difference]: With dead ends: 6541 [2021-10-13 01:02:49,835 INFO L226 Difference]: Without dead ends: 2561 [2021-10-13 01:02:49,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 73.6ms TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2021-10-13 01:02:49,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2021-10-13 01:02:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 2056. [2021-10-13 01:02:50,027 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-13 01:02:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2538 transitions. [2021-10-13 01:02:50,039 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2538 transitions. Word has length 89 [2021-10-13 01:02:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:50,040 INFO L470 AbstractCegarLoop]: Abstraction has 2056 states and 2538 transitions. [2021-10-13 01:02:50,040 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-13 01:02:50,040 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2538 transitions. [2021-10-13 01:02:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-13 01:02:50,046 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:50,046 INFO L512 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-13 01:02:50,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 01:02:50,047 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2062407350, now seen corresponding path program 1 times [2021-10-13 01:02:50,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:50,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239782713] [2021-10-13 01:02:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:50,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:50,073 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-13 01:02:50,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:50,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239782713] [2021-10-13 01:02:50,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239782713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:50,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:50,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:50,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320413693] [2021-10-13 01:02:50,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:50,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:50,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,076 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-13 01:02:50,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:50,174 INFO L93 Difference]: Finished difference Result 2058 states and 2539 transitions. [2021-10-13 01:02:50,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:50,174 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-13 01:02:50,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:50,182 INFO L225 Difference]: With dead ends: 2058 [2021-10-13 01:02:50,182 INFO L226 Difference]: Without dead ends: 1569 [2021-10-13 01:02:50,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2021-10-13 01:02:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2021-10-13 01:02:50,303 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-13 01:02:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 1947 transitions. [2021-10-13 01:02:50,306 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 1947 transitions. Word has length 91 [2021-10-13 01:02:50,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:50,306 INFO L470 AbstractCegarLoop]: Abstraction has 1569 states and 1947 transitions. [2021-10-13 01:02:50,306 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-13 01:02:50,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 1947 transitions. [2021-10-13 01:02:50,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-10-13 01:02:50,309 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:50,309 INFO L512 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-13 01:02:50,309 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 01:02:50,310 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:50,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:50,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1584127351, now seen corresponding path program 1 times [2021-10-13 01:02:50,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:50,310 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027319593] [2021-10-13 01:02:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:50,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:50,340 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-13 01:02:50,341 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:50,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027319593] [2021-10-13 01:02:50,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027319593] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:50,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:50,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:50,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998812718] [2021-10-13 01:02:50,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:50,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:50,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:50,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,345 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-13 01:02:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:50,453 INFO L93 Difference]: Finished difference Result 2545 states and 3158 transitions. [2021-10-13 01:02:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:50,453 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-13 01:02:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:50,468 INFO L225 Difference]: With dead ends: 2545 [2021-10-13 01:02:50,474 INFO L226 Difference]: Without dead ends: 1095 [2021-10-13 01:02:50,476 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2021-10-13 01:02:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1026. [2021-10-13 01:02:50,555 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-13 01:02:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1255 transitions. [2021-10-13 01:02:50,557 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1255 transitions. Word has length 102 [2021-10-13 01:02:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:50,558 INFO L470 AbstractCegarLoop]: Abstraction has 1026 states and 1255 transitions. [2021-10-13 01:02:50,558 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-13 01:02:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1255 transitions. [2021-10-13 01:02:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 01:02:50,560 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:50,560 INFO L512 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-13 01:02:50,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 01:02:50,561 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:50,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:50,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1991347350, now seen corresponding path program 1 times [2021-10-13 01:02:50,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:50,562 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533279167] [2021-10-13 01:02:50,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:50,562 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:50,608 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-13 01:02:50,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:50,608 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533279167] [2021-10-13 01:02:50,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533279167] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:50,609 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:50,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 01:02:50,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515130004] [2021-10-13 01:02:50,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 01:02:50,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 01:02:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 01:02:50,613 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-13 01:02:50,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:50,719 INFO L93 Difference]: Finished difference Result 1967 states and 2397 transitions. [2021-10-13 01:02:50,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 01:02:50,720 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-13 01:02:50,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:50,730 INFO L225 Difference]: With dead ends: 1967 [2021-10-13 01:02:50,730 INFO L226 Difference]: Without dead ends: 979 [2021-10-13 01:02:50,732 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2021-10-13 01:02:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 958. [2021-10-13 01:02:50,804 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-13 01:02:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1155 transitions. [2021-10-13 01:02:50,806 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1155 transitions. Word has length 104 [2021-10-13 01:02:50,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:50,810 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1155 transitions. [2021-10-13 01:02:50,810 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-13 01:02:50,810 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1155 transitions. [2021-10-13 01:02:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-10-13 01:02:50,813 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:50,814 INFO L512 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-13 01:02:50,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 01:02:50,814 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:50,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:50,815 INFO L82 PathProgramCache]: Analyzing trace with hash 2042293350, now seen corresponding path program 1 times [2021-10-13 01:02:50,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:50,815 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897413459] [2021-10-13 01:02:50,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:50,815 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:50,851 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-13 01:02:50,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:50,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897413459] [2021-10-13 01:02:50,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897413459] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:50,852 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:50,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:50,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996872645] [2021-10-13 01:02:50,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:50,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,854 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-13 01:02:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:50,947 INFO L93 Difference]: Finished difference Result 1681 states and 2044 transitions. [2021-10-13 01:02:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:50,948 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-13 01:02:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:50,951 INFO L225 Difference]: With dead ends: 1681 [2021-10-13 01:02:50,951 INFO L226 Difference]: Without dead ends: 949 [2021-10-13 01:02:50,953 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-10-13 01:02:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 872. [2021-10-13 01:02:51,026 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-13 01:02:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1033 transitions. [2021-10-13 01:02:51,028 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1033 transitions. Word has length 104 [2021-10-13 01:02:51,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:51,029 INFO L470 AbstractCegarLoop]: Abstraction has 872 states and 1033 transitions. [2021-10-13 01:02:51,029 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-13 01:02:51,029 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1033 transitions. [2021-10-13 01:02:51,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-10-13 01:02:51,031 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:51,031 INFO L512 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-13 01:02:51,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 01:02:51,032 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:51,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:51,032 INFO L82 PathProgramCache]: Analyzing trace with hash 795979083, now seen corresponding path program 1 times [2021-10-13 01:02:51,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:51,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353569615] [2021-10-13 01:02:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:51,033 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:51,073 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-13 01:02:51,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:51,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353569615] [2021-10-13 01:02:51,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353569615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:51,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:51,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 01:02:51,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677392920] [2021-10-13 01:02:51,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 01:02:51,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:51,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 01:02:51,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 01:02:51,076 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-13 01:02:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:51,224 INFO L93 Difference]: Finished difference Result 2004 states and 2354 transitions. [2021-10-13 01:02:51,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 01:02:51,225 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-13 01:02:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:51,227 INFO L225 Difference]: With dead ends: 2004 [2021-10-13 01:02:51,228 INFO L226 Difference]: Without dead ends: 861 [2021-10-13 01:02:51,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 01:02:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2021-10-13 01:02:51,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 571. [2021-10-13 01:02:51,300 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-13 01:02:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 658 transitions. [2021-10-13 01:02:51,301 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 658 transitions. Word has length 105 [2021-10-13 01:02:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:51,302 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 658 transitions. [2021-10-13 01:02:51,302 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-13 01:02:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 658 transitions. [2021-10-13 01:02:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-10-13 01:02:51,305 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:51,305 INFO L512 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-13 01:02:51,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 01:02:51,306 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:51,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash 231071671, now seen corresponding path program 1 times [2021-10-13 01:02:51,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:51,306 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647016292] [2021-10-13 01:02:51,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:51,307 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:51,358 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-13 01:02:51,358 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:51,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647016292] [2021-10-13 01:02:51,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647016292] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:51,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:51,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:51,359 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771144673] [2021-10-13 01:02:51,360 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:51,360 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:51,361 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-13 01:02:51,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:51,407 INFO L93 Difference]: Finished difference Result 743 states and 849 transitions. [2021-10-13 01:02:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:51,408 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-13 01:02:51,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:51,408 INFO L225 Difference]: With dead ends: 743 [2021-10-13 01:02:51,409 INFO L226 Difference]: Without dead ends: 290 [2021-10-13 01:02:51,409 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2021-10-13 01:02:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2021-10-13 01:02:51,458 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-13 01:02:51,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 314 transitions. [2021-10-13 01:02:51,459 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 314 transitions. Word has length 158 [2021-10-13 01:02:51,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:51,459 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 314 transitions. [2021-10-13 01:02:51,459 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-13 01:02:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 314 transitions. [2021-10-13 01:02:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2021-10-13 01:02:51,462 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:51,462 INFO L512 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-13 01:02:51,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 01:02:51,462 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:51,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:51,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1337877945, now seen corresponding path program 1 times [2021-10-13 01:02:51,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:51,463 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952500226] [2021-10-13 01:02:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:51,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:51,515 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-13 01:02:51,516 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:51,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952500226] [2021-10-13 01:02:51,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952500226] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 01:02:51,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 01:02:51,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 01:02:51,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416868521] [2021-10-13 01:02:51,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 01:02:51,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 01:02:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:51,520 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-13 01:02:51,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:51,568 INFO L93 Difference]: Finished difference Result 487 states and 529 transitions. [2021-10-13 01:02:51,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 01:02:51,568 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-13 01:02:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:51,570 INFO L225 Difference]: With dead ends: 487 [2021-10-13 01:02:51,570 INFO L226 Difference]: Without dead ends: 288 [2021-10-13 01:02:51,570 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 01:02:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2021-10-13 01:02:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2021-10-13 01:02:51,607 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-13 01:02:51,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 307 transitions. [2021-10-13 01:02:51,608 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 307 transitions. Word has length 159 [2021-10-13 01:02:51,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:51,609 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 307 transitions. [2021-10-13 01:02:51,609 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-13 01:02:51,609 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 307 transitions. [2021-10-13 01:02:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-10-13 01:02:51,611 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 01:02:51,612 INFO L512 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-13 01:02:51,612 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-13 01:02:51,612 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 01:02:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 01:02:51,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1976533731, now seen corresponding path program 1 times [2021-10-13 01:02:51,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-13 01:02:51,614 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361244394] [2021-10-13 01:02:51,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:51,614 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 01:02:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:51,749 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-13 01:02:51,750 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-13 01:02:51,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361244394] [2021-10-13 01:02:51,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361244394] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:51,750 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978711322] [2021-10-13 01:02:51,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 01:02:51,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:51,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 [2021-10-13 01:02:51,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 01:02:51,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-13 01:02:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 01:02:51,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 13 conjunts are in the unsatisfiable core [2021-10-13 01:02:51,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 01:02:52,859 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-13 01:02:52,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978711322] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 01:02:52,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-13 01:02:52,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2021-10-13 01:02:52,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283041186] [2021-10-13 01:02:52,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-13 01:02:52,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-13 01:02:52,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-13 01:02:52,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:02:52,863 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-13 01:02:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 01:02:52,959 INFO L93 Difference]: Finished difference Result 539 states and 577 transitions. [2021-10-13 01:02:52,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 01:02:52,961 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-13 01:02:52,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 01:02:52,962 INFO L225 Difference]: With dead ends: 539 [2021-10-13 01:02:52,962 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 01:02:52,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 44.9ms TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-13 01:02:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 01:02:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 01:02:52,964 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-13 01:02:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 01:02:52,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 160 [2021-10-13 01:02:52,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 01:02:52,964 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 01:02:52,964 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-13 01:02:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 01:02:52,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 01:02:52,967 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:02:52,968 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 01:02:53,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-13 01:02:53,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 01:02:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 01:02:53,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,560 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,703 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,832 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,975 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:53,978 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,251 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,491 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,861 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:54,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:02:55,120 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 01:03:04,384 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:03:04,385 INFO L857 garLoopResultBuilder]: For program point L267-1(lines 266 279) no Hoare annotation was computed. [2021-10-13 01:03:04,385 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-13 01:03:04,385 INFO L857 garLoopResultBuilder]: For program point L267-2(lines 267 271) no Hoare annotation was computed. [2021-10-13 01:03:04,385 INFO L857 garLoopResultBuilder]: For program point L267-4(lines 266 279) no Hoare annotation was computed. [2021-10-13 01:03:04,385 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-13 01:03:04,386 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-13 01:03:04,386 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 01:03:04,386 INFO L857 garLoopResultBuilder]: For program point L251(lines 251 256) no Hoare annotation was computed. [2021-10-13 01:03:04,386 INFO L857 garLoopResultBuilder]: For program point L251-1(lines 251 256) no Hoare annotation was computed. [2021-10-13 01:03:04,386 INFO L860 garLoopResultBuilder]: At program point L466(lines 457 468) the Hoare annotation is: true [2021-10-13 01:03:04,387 INFO L857 garLoopResultBuilder]: For program point L285-1(lines 284 297) no Hoare annotation was computed. [2021-10-13 01:03:04,387 INFO L857 garLoopResultBuilder]: For program point L285-3(lines 284 297) no Hoare annotation was computed. [2021-10-13 01:03:04,387 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 128) no Hoare annotation was computed. [2021-10-13 01:03:04,387 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-13 01:03:04,388 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-13 01:03:04,388 INFO L860 garLoopResultBuilder]: At program point L434(lines 397 439) the Hoare annotation is: true [2021-10-13 01:03:04,388 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-13 01:03:04,388 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-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L336(lines 336 340) no Hoare annotation was computed. [2021-10-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L336-1(lines 331 371) no Hoare annotation was computed. [2021-10-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L386(lines 386 391) no Hoare annotation was computed. [2021-10-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 127) no Hoare annotation was computed. [2021-10-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L57(lines 57 66) no Hoare annotation was computed. [2021-10-13 01:03:04,389 INFO L857 garLoopResultBuilder]: For program point L57-2(lines 57 66) no Hoare annotation was computed. [2021-10-13 01:03:04,390 INFO L857 garLoopResultBuilder]: For program point L57-3(lines 57 66) no Hoare annotation was computed. [2021-10-13 01:03:04,390 INFO L857 garLoopResultBuilder]: For program point L57-5(lines 57 66) no Hoare annotation was computed. [2021-10-13 01:03:04,390 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-13 01:03:04,390 INFO L857 garLoopResultBuilder]: For program point L173(lines 172 203) no Hoare annotation was computed. [2021-10-13 01:03:04,390 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-13 01:03:04,391 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-13 01:03:04,391 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 01:03:04,391 INFO L857 garLoopResultBuilder]: For program point L190(lines 190 202) no Hoare annotation was computed. [2021-10-13 01:03:04,391 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 63) no Hoare annotation was computed. [2021-10-13 01:03:04,391 INFO L857 garLoopResultBuilder]: For program point L58-1(lines 58 63) no Hoare annotation was computed. [2021-10-13 01:03:04,392 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-13 01:03:04,392 INFO L857 garLoopResultBuilder]: For program point L174-1(lines 174 184) no Hoare annotation was computed. [2021-10-13 01:03:04,392 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-13 01:03:04,393 INFO L857 garLoopResultBuilder]: For program point L191(lines 191 197) no Hoare annotation was computed. [2021-10-13 01:03:04,393 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-13 01:03:04,393 INFO L857 garLoopResultBuilder]: For program point L307(lines 307 311) no Hoare annotation was computed. [2021-10-13 01:03:04,393 INFO L857 garLoopResultBuilder]: For program point L307-2(lines 307 311) no Hoare annotation was computed. [2021-10-13 01:03:04,393 INFO L857 garLoopResultBuilder]: For program point L307-3(lines 307 311) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L307-5(lines 307 311) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 85) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 85) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L76-3(lines 76 85) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L76-5(lines 76 85) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2021-10-13 01:03:04,394 INFO L857 garLoopResultBuilder]: For program point L27-2(lines 26 41) no Hoare annotation was computed. [2021-10-13 01:03:04,395 INFO L857 garLoopResultBuilder]: For program point L27-3(lines 27 31) no Hoare annotation was computed. [2021-10-13 01:03:04,395 INFO L857 garLoopResultBuilder]: For program point L27-5(lines 26 41) no Hoare annotation was computed. [2021-10-13 01:03:04,395 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-13 01:03:04,396 INFO L857 garLoopResultBuilder]: For program point L77(lines 77 82) no Hoare annotation was computed. [2021-10-13 01:03:04,396 INFO L857 garLoopResultBuilder]: For program point L77-1(lines 77 82) no Hoare annotation was computed. [2021-10-13 01:03:04,396 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-13 01:03:04,397 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-13 01:03:04,397 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 01:03:04,397 INFO L857 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2021-10-13 01:03:04,397 INFO L857 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2021-10-13 01:03:04,398 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-13 01:03:04,398 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-13 01:03:04,398 INFO L857 garLoopResultBuilder]: For program point L161(lines 161 169) no Hoare annotation was computed. [2021-10-13 01:03:04,398 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-13 01:03:04,399 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-13 01:03:04,399 INFO L857 garLoopResultBuilder]: For program point L360(lines 360 367) no Hoare annotation was computed. [2021-10-13 01:03:04,399 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-13 01:03:04,400 INFO L857 garLoopResultBuilder]: For program point L229-1(lines 228 241) no Hoare annotation was computed. [2021-10-13 01:03:04,400 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-13 01:03:04,400 INFO L857 garLoopResultBuilder]: For program point L345(lines 345 352) no Hoare annotation was computed. [2021-10-13 01:03:04,400 INFO L857 garLoopResultBuilder]: For program point L428(lines 428 432) no Hoare annotation was computed. [2021-10-13 01:03:04,400 INFO L857 garLoopResultBuilder]: For program point L164(lines 164 168) no Hoare annotation was computed. [2021-10-13 01:03:04,401 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-13 01:03:04,401 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 01:03:04,401 INFO L857 garLoopResultBuilder]: For program point L32-1(lines 32 36) no Hoare annotation was computed. [2021-10-13 01:03:04,401 INFO L857 garLoopResultBuilder]: For program point L32-3(lines 32 36) no Hoare annotation was computed. [2021-10-13 01:03:04,401 INFO L857 garLoopResultBuilder]: For program point L412(line 412) no Hoare annotation was computed. [2021-10-13 01:03:04,402 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2021-10-13 01:03:04,402 INFO L857 garLoopResultBuilder]: For program point L247(lines 247 257) no Hoare annotation was computed. [2021-10-13 01:03:04,402 INFO L857 garLoopResultBuilder]: For program point L214(lines 214 220) no Hoare annotation was computed. [2021-10-13 01:03:04,402 INFO L857 garLoopResultBuilder]: For program point L247-1(lines 247 257) no Hoare annotation was computed. [2021-10-13 01:03:04,402 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-13 01:03:04,402 INFO L857 garLoopResultBuilder]: For program point L214-2(lines 214 220) no Hoare annotation was computed. [2021-10-13 01:03:04,403 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-13 01:03:04,403 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-13 01:03:04,403 INFO L857 garLoopResultBuilder]: For program point L132(lines 131 149) no Hoare annotation was computed. [2021-10-13 01:03:04,403 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-13 01:03:04,404 INFO L857 garLoopResultBuilder]: For program point L315(lines 315 319) no Hoare annotation was computed. [2021-10-13 01:03:04,404 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-13 01:03:04,404 INFO L857 garLoopResultBuilder]: For program point L315-3(lines 315 319) no Hoare annotation was computed. [2021-10-13 01:03:04,404 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-13 01:03:04,404 INFO L857 garLoopResultBuilder]: For program point L332(line 332) no Hoare annotation was computed. [2021-10-13 01:03:04,405 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-13 01:03:04,405 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-13 01:03:04,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 01:03:04,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:03:04 BoogieIcfgContainer [2021-10-13 01:03:04,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 01:03:04,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 01:03:04,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 01:03:04,507 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 01:03:04,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:02:43" (3/4) ... [2021-10-13 01:03:04,510 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 01:03:04,523 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 01:03:04,524 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 01:03:04,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:03:04,525 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 01:03:04,549 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-13 01:03:04,550 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-13 01:03:04,550 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-13 01:03:04,550 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-13 01:03:04,550 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-13 01:03:04,551 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-13 01:03:04,551 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-13 01:03:04,551 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-13 01:03:04,552 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-13 01:03:04,552 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-13 01:03:04,552 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-13 01:03:04,553 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-13 01:03:04,553 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-13 01:03:04,553 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-13 01:03:04,554 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-13 01:03:04,554 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-13 01:03:04,554 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-13 01:03:04,554 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-13 01:03:04,555 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-13 01:03:04,555 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-13 01:03:04,555 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-13 01:03:04,556 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-13 01:03:04,556 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-13 01:03:04,556 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-13 01:03:04,557 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-13 01:03:04,557 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-13 01:03:04,596 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/witness.graphml [2021-10-13 01:03:04,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 01:03:04,598 INFO L168 Benchmark]: Toolchain (without parser) took 22057.38 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 96.1 MB in the beginning and 165.2 MB in the end (delta: -69.0 MB). Peak memory consumption was 233.2 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,598 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.9 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 01:03:04,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.71 ms. Allocated memory is still 130.0 MB. Free memory was 96.1 MB in the beginning and 104.4 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 130.0 MB. Free memory was 104.4 MB in the beginning and 102.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,600 INFO L168 Benchmark]: Boogie Preprocessor took 55.07 ms. Allocated memory is still 130.0 MB. Free memory was 102.3 MB in the beginning and 100.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,600 INFO L168 Benchmark]: RCFGBuilder took 530.83 ms. Allocated memory is still 130.0 MB. Free memory was 100.9 MB in the beginning and 84.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,601 INFO L168 Benchmark]: TraceAbstraction took 20939.08 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 84.0 MB in the beginning and 172.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 246.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,601 INFO L168 Benchmark]: Witness Printer took 90.07 ms. Allocated memory is still 432.0 MB. Free memory was 172.6 MB in the beginning and 165.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 01:03:04,603 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.21 ms. Allocated memory is still 81.8 MB. Free memory was 52.9 MB in the beginning and 52.9 MB in the end (delta: 29.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 359.71 ms. Allocated memory is still 130.0 MB. Free memory was 96.1 MB in the beginning and 104.4 MB in the end (delta: -8.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.05 ms. Allocated memory is still 130.0 MB. Free memory was 104.4 MB in the beginning and 102.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.07 ms. Allocated memory is still 130.0 MB. Free memory was 102.3 MB in the beginning and 100.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 530.83 ms. Allocated memory is still 130.0 MB. Free memory was 100.9 MB in the beginning and 84.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20939.08 ms. Allocated memory was 130.0 MB in the beginning and 432.0 MB in the end (delta: 302.0 MB). Free memory was 84.0 MB in the beginning and 172.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 246.4 MB. Max. memory is 16.1 GB. * Witness Printer took 90.07 ms. Allocated memory is still 432.0 MB. Free memory was 172.6 MB in the beginning and 165.2 MB in the end (delta: 7.4 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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: 20786.4ms, OverallIterations: 21, TraceHistogramMax: 5, EmptinessCheckTime: 68.4ms, AutomataDifference: 3488.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 11193.1ms, InitialAbstractionConstructionTime: 13.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3203 SDtfs, 3718 SDslu, 4621 SDs, 0 SdLazy, 461 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 445.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 256 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 251.5ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 2289.1ms AutomataMinimizationTime, 21 MinimizatonAttempts, 2545 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 405 NumberOfFragments, 7882 HoareAnnotationTreeSize, 33 FomulaSimplifications, 387019 FormulaSimplificationTreeSizeReduction, 1998.4ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 59821 FormulaSimplificationTreeSizeReductionInter, 9171.7ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 138.5ms SsaConstructionTime, 385.0ms SatisfiabilityAnalysisTime, 2300.2ms 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-13 01:03:04,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6a6f5652-3706-476d-b0be-e262232bb5d1/bin/uautomizer-WNIpwEf4Nt/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...