./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8e1c903 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX --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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-f8e1c90 [2021-11-09 09:35:02,915 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-09 09:35:02,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-09 09:35:02,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-09 09:35:02,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-09 09:35:02,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-09 09:35:02,982 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-09 09:35:02,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-09 09:35:02,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-09 09:35:02,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-09 09:35:02,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-09 09:35:02,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-09 09:35:02,999 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-09 09:35:03,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-09 09:35:03,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-09 09:35:03,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-09 09:35:03,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-09 09:35:03,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-09 09:35:03,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-09 09:35:03,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-09 09:35:03,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-09 09:35:03,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-09 09:35:03,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-09 09:35:03,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-09 09:35:03,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-09 09:35:03,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-09 09:35:03,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-09 09:35:03,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-09 09:35:03,052 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-09 09:35:03,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-09 09:35:03,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-09 09:35:03,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-09 09:35:03,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-09 09:35:03,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-09 09:35:03,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-09 09:35:03,060 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-09 09:35:03,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-09 09:35:03,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-09 09:35:03,062 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-09 09:35:03,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-09 09:35:03,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-09 09:35:03,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-11-09 09:35:03,104 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-09 09:35:03,105 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-09 09:35:03,105 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-09 09:35:03,106 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-09 09:35:03,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-09 09:35:03,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-09 09:35:03,114 INFO L138 SettingsManager]: * Use SBE=true [2021-11-09 09:35:03,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-09 09:35:03,115 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-09 09:35:03,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-09 09:35:03,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-09 09:35:03,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-09 09:35:03,117 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-09 09:35:03,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-09 09:35:03,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-09 09:35:03,117 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-09 09:35:03,118 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-09 09:35:03,118 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-09 09:35:03,118 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-09 09:35:03,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-09 09:35:03,119 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-09 09:35:03,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-09 09:35:03,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:35:03,119 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-09 09:35:03,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-09 09:35:03,120 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-09 09:35:03,120 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-09 09:35:03,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-09 09:35:03,120 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-09 09:35:03,123 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-11-09 09:35:03,123 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-09 09:35:03,123 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-09 09:35:03,124 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_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/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_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2021-11-09 09:35:03,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-09 09:35:03,410 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-09 09:35:03,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-09 09:35:03,414 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-09 09:35:03,415 INFO L275 PluginConnector]: CDTParser initialized [2021-11-09 09:35:03,416 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-11-09 09:35:03,491 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/data/40fc1a7eb/d39ebadab24a4bcdbd90dbf66c49e587/FLAG5af819d6a [2021-11-09 09:35:04,069 INFO L306 CDTParser]: Found 1 translation units. [2021-11-09 09:35:04,069 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-11-09 09:35:04,084 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/data/40fc1a7eb/d39ebadab24a4bcdbd90dbf66c49e587/FLAG5af819d6a [2021-11-09 09:35:04,406 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/data/40fc1a7eb/d39ebadab24a4bcdbd90dbf66c49e587 [2021-11-09 09:35:04,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-09 09:35:04,412 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-09 09:35:04,417 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-09 09:35:04,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-09 09:35:04,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-09 09:35:04,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@347bf430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04, skipping insertion in model container [2021-11-09 09:35:04,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-09 09:35:04,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-09 09:35:04,686 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_14be459a-df0d-496d-ab1b-f23622de43c2/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-11-09 09:35:04,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:35:04,742 INFO L203 MainTranslator]: Completed pre-run [2021-11-09 09:35:04,754 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_14be459a-df0d-496d-ab1b-f23622de43c2/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2021-11-09 09:35:04,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-09 09:35:04,788 INFO L208 MainTranslator]: Completed translation [2021-11-09 09:35:04,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04 WrapperNode [2021-11-09 09:35:04,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-09 09:35:04,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-09 09:35:04,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-09 09:35:04,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-09 09:35:04,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,836 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-09 09:35:04,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-09 09:35:04,837 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-09 09:35:04,837 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-09 09:35:04,846 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,863 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-09 09:35:04,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-09 09:35:04,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-09 09:35:04,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-09 09:35:04,876 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (1/1) ... [2021-11-09 09:35:04,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-09 09:35:04,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:35:04,923 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-09 09:35:04,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-09 09:35:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-09 09:35:04,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-09 09:35:04,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-09 09:35:04,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-09 09:35:05,393 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-09 09:35:05,393 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-11-09 09:35:05,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:05 BoogieIcfgContainer [2021-11-09 09:35:05,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-09 09:35:05,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-09 09:35:05,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-09 09:35:05,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-09 09:35:05,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:35:04" (1/3) ... [2021-11-09 09:35:05,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe4793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:35:05, skipping insertion in model container [2021-11-09 09:35:05,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:35:04" (2/3) ... [2021-11-09 09:35:05,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe4793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:35:05, skipping insertion in model container [2021-11-09 09:35:05,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:05" (3/3) ... [2021-11-09 09:35:05,417 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-11-09 09:35:05,422 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-09 09:35:05,423 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-09 09:35:05,490 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-09 09:35:05,496 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-09 09:35:05,496 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-09 09:35:05,514 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-11-09 09:35:05,521 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:05,522 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:05,523 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:05,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:05,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2021-11-09 09:35:05,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:05,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431237554] [2021-11-09 09:35:05,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:05,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:05,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:05,857 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431237554] [2021-11-09 09:35:05,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431237554] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:05,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:05,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:05,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730588552] [2021-11-09 09:35:05,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:05,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:05,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:05,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:05,885 INFO L87 Difference]: Start difference. First operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:06,013 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2021-11-09 09:35:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:06,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-11-09 09:35:06,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:06,027 INFO L225 Difference]: With dead ends: 214 [2021-11-09 09:35:06,028 INFO L226 Difference]: Without dead ends: 135 [2021-11-09 09:35:06,031 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-11-09 09:35:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2021-11-09 09:35:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 113 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2021-11-09 09:35:06,107 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2021-11-09 09:35:06,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:06,108 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2021-11-09 09:35:06,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,108 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2021-11-09 09:35:06,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 09:35:06,110 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:06,111 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:06,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-09 09:35:06,111 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:06,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:06,112 INFO L85 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2021-11-09 09:35:06,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:06,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698891598] [2021-11-09 09:35:06,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:06,113 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:06,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:06,176 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698891598] [2021-11-09 09:35:06,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698891598] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:06,176 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:06,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:06,177 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949788691] [2021-11-09 09:35:06,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:06,178 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:06,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,180 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:06,223 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2021-11-09 09:35:06,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:06,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-11-09 09:35:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:06,227 INFO L225 Difference]: With dead ends: 323 [2021-11-09 09:35:06,227 INFO L226 Difference]: Without dead ends: 215 [2021-11-09 09:35:06,228 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-11-09 09:35:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2021-11-09 09:35:06,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3971291866028708) internal successors, (292), 210 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2021-11-09 09:35:06,256 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2021-11-09 09:35:06,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:06,256 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2021-11-09 09:35:06,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2021-11-09 09:35:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-11-09 09:35:06,259 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:06,259 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:06,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-09 09:35:06,260 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:06,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2021-11-09 09:35:06,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:06,261 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779645882] [2021-11-09 09:35:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:06,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:06,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:06,336 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779645882] [2021-11-09 09:35:06,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779645882] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:06,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:06,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:06,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049207798] [2021-11-09 09:35:06,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:06,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:06,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:06,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,339 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:06,418 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2021-11-09 09:35:06,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:06,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-11-09 09:35:06,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:06,425 INFO L225 Difference]: With dead ends: 526 [2021-11-09 09:35:06,426 INFO L226 Difference]: Without dead ends: 321 [2021-11-09 09:35:06,429 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-11-09 09:35:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2021-11-09 09:35:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 295 states have (on average 1.383050847457627) internal successors, (408), 296 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2021-11-09 09:35:06,496 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2021-11-09 09:35:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:06,497 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2021-11-09 09:35:06,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2021-11-09 09:35:06,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-09 09:35:06,503 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:06,503 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:06,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-09 09:35:06,504 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:06,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2021-11-09 09:35:06,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:06,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270831956] [2021-11-09 09:35:06,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:06,507 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:06,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:06,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270831956] [2021-11-09 09:35:06,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270831956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:06,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:06,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:06,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495523891] [2021-11-09 09:35:06,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:06,584 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:06,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:06,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,585 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:06,628 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2021-11-09 09:35:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:06,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2021-11-09 09:35:06,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:06,632 INFO L225 Difference]: With dead ends: 740 [2021-11-09 09:35:06,633 INFO L226 Difference]: Without dead ends: 449 [2021-11-09 09:35:06,633 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2021-11-09 09:35:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2021-11-09 09:35:06,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 447 states have (on average 1.3243847874720358) internal successors, (592), 448 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2021-11-09 09:35:06,661 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2021-11-09 09:35:06,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:06,662 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2021-11-09 09:35:06,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,662 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2021-11-09 09:35:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-11-09 09:35:06,666 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:06,666 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:06,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-09 09:35:06,667 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:06,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:06,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2021-11-09 09:35:06,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:06,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571682983] [2021-11-09 09:35:06,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:06,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:06,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:06,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571682983] [2021-11-09 09:35:06,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571682983] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:06,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:06,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:06,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122987393] [2021-11-09 09:35:06,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:06,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:06,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,747 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:06,791 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2021-11-09 09:35:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:06,791 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-11-09 09:35:06,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:06,795 INFO L225 Difference]: With dead ends: 914 [2021-11-09 09:35:06,795 INFO L226 Difference]: Without dead ends: 555 [2021-11-09 09:35:06,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-11-09 09:35:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-11-09 09:35:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 1.298372513562387) internal successors, (718), 554 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2021-11-09 09:35:06,835 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2021-11-09 09:35:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:06,837 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2021-11-09 09:35:06,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2021-11-09 09:35:06,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:35:06,840 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:06,841 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:06,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-09 09:35:06,841 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:06,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2021-11-09 09:35:06,843 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:06,844 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775850106] [2021-11-09 09:35:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:06,844 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:06,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:06,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:06,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775850106] [2021-11-09 09:35:06,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775850106] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:06,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:06,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:35:06,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497837745] [2021-11-09 09:35:06,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:35:06,928 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:06,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:35:06,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:06,929 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:07,021 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2021-11-09 09:35:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:35:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2021-11-09 09:35:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:07,029 INFO L225 Difference]: With dead ends: 1620 [2021-11-09 09:35:07,029 INFO L226 Difference]: Without dead ends: 1203 [2021-11-09 09:35:07,030 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:35:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-11-09 09:35:07,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2021-11-09 09:35:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 577 states have (on average 1.2790294627383016) internal successors, (738), 578 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2021-11-09 09:35:07,072 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2021-11-09 09:35:07,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:07,073 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2021-11-09 09:35:07,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2021-11-09 09:35:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:35:07,075 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:07,075 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:07,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-09 09:35:07,076 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:07,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1443121595, now seen corresponding path program 1 times [2021-11-09 09:35:07,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:07,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204245073] [2021-11-09 09:35:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,083 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:07,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:07,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204245073] [2021-11-09 09:35:07,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204245073] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:07,184 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:07,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-09 09:35:07,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421646964] [2021-11-09 09:35:07,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-09 09:35:07,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:07,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-09 09:35:07,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:07,186 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:07,304 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2021-11-09 09:35:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:35:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2021-11-09 09:35:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:07,310 INFO L225 Difference]: With dead ends: 1356 [2021-11-09 09:35:07,311 INFO L226 Difference]: Without dead ends: 866 [2021-11-09 09:35:07,312 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-11-09 09:35:07,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2021-11-09 09:35:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2021-11-09 09:35:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 478 states have (on average 1.2761506276150627) internal successors, (610), 479 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2021-11-09 09:35:07,356 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2021-11-09 09:35:07,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:07,356 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2021-11-09 09:35:07,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2021-11-09 09:35:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:35:07,358 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:07,358 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:07,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-09 09:35:07,359 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:07,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:07,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1577075519, now seen corresponding path program 1 times [2021-11-09 09:35:07,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:07,360 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406724401] [2021-11-09 09:35:07,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,361 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 09:35:07,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:07,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406724401] [2021-11-09 09:35:07,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406724401] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:07,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:07,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:07,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962830778] [2021-11-09 09:35:07,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:07,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:07,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:07,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:07,420 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:07,465 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2021-11-09 09:35:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 53 [2021-11-09 09:35:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:07,468 INFO L225 Difference]: With dead ends: 862 [2021-11-09 09:35:07,469 INFO L226 Difference]: Without dead ends: 478 [2021-11-09 09:35:07,470 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-11-09 09:35:07,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2021-11-09 09:35:07,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 1.2505747126436781) internal successors, (544), 436 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2021-11-09 09:35:07,500 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2021-11-09 09:35:07,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:07,501 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2021-11-09 09:35:07,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,501 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2021-11-09 09:35:07,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-11-09 09:35:07,502 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:07,503 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:07,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-09 09:35:07,503 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:07,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2021-11-09 09:35:07,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:07,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569281119] [2021-11-09 09:35:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,504 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:07,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:07,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569281119] [2021-11-09 09:35:07,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569281119] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:07,544 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:07,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:07,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280616437] [2021-11-09 09:35:07,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:07,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:07,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:07,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:07,546 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:07,594 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2021-11-09 09:35:07,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-11-09 09:35:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:07,601 INFO L225 Difference]: With dead ends: 481 [2021-11-09 09:35:07,601 INFO L226 Difference]: Without dead ends: 479 [2021-11-09 09:35:07,601 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:07,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-11-09 09:35:07,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2021-11-09 09:35:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.2465437788018434) internal successors, (541), 434 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2021-11-09 09:35:07,635 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2021-11-09 09:35:07,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:07,635 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2021-11-09 09:35:07,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2021-11-09 09:35:07,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-11-09 09:35:07,637 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:07,637 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:07,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-09 09:35:07,637 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:07,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:07,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2021-11-09 09:35:07,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:07,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507633793] [2021-11-09 09:35:07,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:07,729 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:07,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507633793] [2021-11-09 09:35:07,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507633793] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:35:07,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207587064] [2021-11-09 09:35:07,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:07,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-09 09:35:07,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 [2021-11-09 09:35:07,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-09 09:35:07,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-09 09:35:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:07,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2021-11-09 09:35:07,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-09 09:35:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:08,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207587064] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-09 09:35:08,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-11-09 09:35:08,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-11-09 09:35:08,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495623762] [2021-11-09 09:35:08,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-09 09:35:08,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-09 09:35:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:35:08,521 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:08,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:08,685 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2021-11-09 09:35:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-09 09:35:08,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-11-09 09:35:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:08,704 INFO L225 Difference]: With dead ends: 781 [2021-11-09 09:35:08,704 INFO L226 Difference]: Without dead ends: 779 [2021-11-09 09:35:08,705 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-09 09:35:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2021-11-09 09:35:08,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2021-11-09 09:35:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.2563291139240507) internal successors, (794), 632 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2021-11-09 09:35:08,775 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2021-11-09 09:35:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:08,775 INFO L470 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2021-11-09 09:35:08,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2021-11-09 09:35:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-11-09 09:35:08,777 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:08,777 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:08,815 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-11-09 09:35:09,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-11-09 09:35:09,003 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2021-11-09 09:35:09,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,004 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392025486] [2021-11-09 09:35:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-09 09:35:09,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,055 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392025486] [2021-11-09 09:35:09,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392025486] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,056 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:09,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433385123] [2021-11-09 09:35:09,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:09,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:09,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,058 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,132 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2021-11-09 09:35:09,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:09,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2021-11-09 09:35:09,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,136 INFO L225 Difference]: With dead ends: 966 [2021-11-09 09:35:09,136 INFO L226 Difference]: Without dead ends: 629 [2021-11-09 09:35:09,138 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2021-11-09 09:35:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2021-11-09 09:35:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.241796200345423) internal successors, (719), 579 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2021-11-09 09:35:09,193 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2021-11-09 09:35:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,193 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2021-11-09 09:35:09,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2021-11-09 09:35:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-11-09 09:35:09,201 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,201 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:09,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-09 09:35:09,204 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,205 INFO L85 PathProgramCache]: Analyzing trace with hash -630281229, now seen corresponding path program 1 times [2021-11-09 09:35:09,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,208 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971028678] [2021-11-09 09:35:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,255 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 09:35:09,255 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971028678] [2021-11-09 09:35:09,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971028678] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:09,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613056179] [2021-11-09 09:35:09,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:09,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:09,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,259 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,333 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2021-11-09 09:35:09,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:09,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 80 [2021-11-09 09:35:09,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,339 INFO L225 Difference]: With dead ends: 1172 [2021-11-09 09:35:09,340 INFO L226 Difference]: Without dead ends: 598 [2021-11-09 09:35:09,341 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2021-11-09 09:35:09,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2021-11-09 09:35:09,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 579 states have (on average 1.2072538860103628) internal successors, (699), 579 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2021-11-09 09:35:09,400 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2021-11-09 09:35:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,401 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2021-11-09 09:35:09,401 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2021-11-09 09:35:09,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-11-09 09:35:09,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,403 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-09 09:35:09,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-09 09:35:09,404 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2021-11-09 09:35:09,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785706036] [2021-11-09 09:35:09,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 09:35:09,445 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785706036] [2021-11-09 09:35:09,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785706036] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:09,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082392811] [2021-11-09 09:35:09,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:09,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,447 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,495 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2021-11-09 09:35:09,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 81 [2021-11-09 09:35:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,497 INFO L225 Difference]: With dead ends: 911 [2021-11-09 09:35:09,497 INFO L226 Difference]: Without dead ends: 284 [2021-11-09 09:35:09,498 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2021-11-09 09:35:09,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2021-11-09 09:35:09,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.1387900355871887) internal successors, (320), 281 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2021-11-09 09:35:09,521 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2021-11-09 09:35:09,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,521 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2021-11-09 09:35:09,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,521 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2021-11-09 09:35:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-11-09 09:35:09,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,523 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-09 09:35:09,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-09 09:35:09,523 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2021-11-09 09:35:09,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364232921] [2021-11-09 09:35:09,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 09:35:09,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,559 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364232921] [2021-11-09 09:35:09,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364232921] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,559 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:09,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348104047] [2021-11-09 09:35:09,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:09,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:09,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,561 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,592 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2021-11-09 09:35:09,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:09,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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 101 [2021-11-09 09:35:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,595 INFO L225 Difference]: With dead ends: 401 [2021-11-09 09:35:09,595 INFO L226 Difference]: Without dead ends: 279 [2021-11-09 09:35:09,596 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-11-09 09:35:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2021-11-09 09:35:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 1.1330935251798562) internal successors, (315), 278 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2021-11-09 09:35:09,627 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2021-11-09 09:35:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,628 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2021-11-09 09:35:09,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2021-11-09 09:35:09,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-09 09:35:09,630 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,630 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:09,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-09 09:35:09,631 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2021-11-09 09:35:09,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,632 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750842944] [2021-11-09 09:35:09,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-09 09:35:09,686 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,686 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750842944] [2021-11-09 09:35:09,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750842944] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,687 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:09,687 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228072023] [2021-11-09 09:35:09,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:09,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:09,689 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,732 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2021-11-09 09:35:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-09 09:35:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 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-11-09 09:35:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,735 INFO L225 Difference]: With dead ends: 395 [2021-11-09 09:35:09,735 INFO L226 Difference]: Without dead ends: 270 [2021-11-09 09:35:09,735 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-09 09:35:09,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2021-11-09 09:35:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2021-11-09 09:35:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 1.1152416356877324) internal successors, (300), 269 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2021-11-09 09:35:09,759 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2021-11-09 09:35:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,759 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2021-11-09 09:35:09,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2021-11-09 09:35:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-11-09 09:35:09,761 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,762 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:09,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-09 09:35:09,762 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,763 INFO L85 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2021-11-09 09:35:09,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506808459] [2021-11-09 09:35:09,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,763 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-09 09:35:09,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506808459] [2021-11-09 09:35:09,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506808459] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-09 09:35:09,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794214806] [2021-11-09 09:35:09,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-09 09:35:09,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-09 09:35:09,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,800 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,833 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2021-11-09 09:35:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-09 09:35:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-11-09 09:35:09,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,835 INFO L225 Difference]: With dead ends: 400 [2021-11-09 09:35:09,835 INFO L226 Difference]: Without dead ends: 259 [2021-11-09 09:35:09,836 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-09 09:35:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2021-11-09 09:35:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2021-11-09 09:35:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 1.0883534136546185) internal successors, (271), 249 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2021-11-09 09:35:09,858 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2021-11-09 09:35:09,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,858 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2021-11-09 09:35:09,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2021-11-09 09:35:09,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-11-09 09:35:09,860 INFO L505 BasicCegarLoop]: Found error trace [2021-11-09 09:35:09,860 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-09 09:35:09,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-09 09:35:09,861 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-09 09:35:09,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-09 09:35:09,861 INFO L85 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2021-11-09 09:35:09,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-09 09:35:09,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182246406] [2021-11-09 09:35:09,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-09 09:35:09,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-09 09:35:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-09 09:35:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-09 09:35:09,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-09 09:35:09,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182246406] [2021-11-09 09:35:09,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182246406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-09 09:35:09,929 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-09 09:35:09,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-09 09:35:09,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177623462] [2021-11-09 09:35:09,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-09 09:35:09,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-09 09:35:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-09 09:35:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:09,931 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-11-09 09:35:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-09 09:35:09,963 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2021-11-09 09:35:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-09 09:35:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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 103 [2021-11-09 09:35:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-09 09:35:09,964 INFO L225 Difference]: With dead ends: 250 [2021-11-09 09:35:09,964 INFO L226 Difference]: Without dead ends: 0 [2021-11-09 09:35:09,965 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-09 09:35:09,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-11-09 09:35:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-11-09 09:35:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-09 09:35:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-11-09 09:35:09,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2021-11-09 09:35:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-09 09:35:09,973 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-11-09 09:35:09,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 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-11-09 09:35:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-11-09 09:35:09,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-11-09 09:35:09,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:09,976 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-09 09:35:09,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-09 09:35:09,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-11-09 09:35:09,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,283 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,286 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,607 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:10,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,047 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,195 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,205 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:11,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-11-09 09:35:17,812 INFO L857 garLoopResultBuilder]: For program point L152(lines 152 156) no Hoare annotation was computed. [2021-11-09 09:35:17,813 INFO L853 garLoopResultBuilder]: At program point L119(lines 105 142) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 0)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse5 (= ~q_read_ev~0 2)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (= ~c_dr_st~0 2)) (.cse6 (= ~c_dr_pc~0 0))) (or (and .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse6) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse8 .cse2 .cse4 .cse9 (= ~p_dw_pc~0 1) .cse5 .cse7 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (and .cse0 .cse8 .cse6))) [2021-11-09 09:35:17,813 INFO L853 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse12 (+ ~c_num_read~0 1))) (let ((.cse0 (= ~c_dr_st~0 2)) (.cse4 (= ~c_dr_pc~0 1)) (.cse9 (= ~p_dw_pc~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 0)) (.cse10 (<= ~p_num_write~0 1)) (.cse5 (= ~q_read_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse6 (<= .cse12 ~p_num_write~0)) (.cse11 (<= 1 ~p_num_write~0)) (.cse7 (<= ~p_num_write~0 .cse12))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= ~p_dw_pc~0 1) .cse5 .cse6 .cse7) (and .cse0 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse8) (and .cse9 .cse0 .cse2 .cse8) (and .cse9 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse7) (and .cse9 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse10 .cse5 .cse8 .cse6 .cse11 .cse7)))) [2021-11-09 09:35:17,813 INFO L853 garLoopResultBuilder]: At program point L53-1(lines 41 55) the Hoare annotation is: (let ((.cse5 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse6 (= ~c_num_read~0 1)) (.cse7 (<= ~p_num_write~0 1)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= 2 ~p_dw_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse6 .cse7 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse8) (and .cse0 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse1 .cse6 .cse7 .cse2 .cse3 .cse4 .cse8))) [2021-11-09 09:35:17,814 INFO L853 garLoopResultBuilder]: At program point L20-1(lines 148 200) the Hoare annotation is: (let ((.cse1 (= ~p_dw_pc~0 1)) (.cse10 (< ~c_num_read~0 (+ ~p_num_write~0 1))) (.cse3 (= 2 ~p_dw_st~0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse12 (= ~c_num_read~0 0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~q_free~0 1)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse8 (= ~p_dw_st~0 0)) (.cse2 (= ~q_read_ev~0 2)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (not (= ~q_write_ev~0 1)))) (or (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse0 (= ~q_free~0 0) (<= ~p_num_write~0 1) .cse1 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 (<= .cse5 ~p_num_write~0) (<= 1 ~p_num_write~0) (<= ~p_num_write~0 .cse5))) (and .cse0 .cse6 .cse7 .cse1 .cse8 .cse2 .cse9 .cse4 .cse10) (and .cse0 .cse6 .cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse1 .cse3 .cse9 .cse10) (and .cse11 (= ~p_num_write~0 0) .cse12 .cse0 .cse6 .cse3 .cse9) (and .cse11 .cse12 .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse6 .cse7 .cse8 .cse2 .cse9 .cse4))) [2021-11-09 09:35:17,814 INFO L857 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2021-11-09 09:35:17,814 INFO L857 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2021-11-09 09:35:17,814 INFO L853 garLoopResultBuilder]: At program point L153(lines 148 200) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 1) (= ~p_dw_pc~0 1) (= ~q_read_ev~0 2) (= 2 ~p_dw_st~0) (not (= ~q_write_ev~0 1)) (<= .cse0 ~p_num_write~0) (<= ~p_num_write~0 .cse0))) [2021-11-09 09:35:17,814 INFO L853 garLoopResultBuilder]: At program point L54(lines 38 56) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse4 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse6 (= ~q_free~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse3 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse11 (<= ~p_num_write~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse9 (<= .cse13 ~p_num_write~0)) (.cse12 (<= 1 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse2 .cse6 .cse7 .cse3 (= ~p_dw_pc~0 1) .cse8 .cse9 .cse10) (and .cse0 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse3 .cse11 .cse8 .cse4 .cse9 .cse12 .cse10) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse6 .cse7 .cse3 .cse11 .cse8 .cse9 .cse12 .cse10)))) [2021-11-09 09:35:17,815 INFO L853 garLoopResultBuilder]: At program point L54-1(lines 38 56) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse6 (= ~c_num_read~0 1)) (.cse7 (<= ~p_num_write~0 1)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= 2 ~p_dw_st~0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (not (= ~q_write_ev~0 1))) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse6 .cse7 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse6 .cse7 .cse2 (= ~c_dr_pc~0 0) .cse3 .cse4 .cse5 .cse8))) [2021-11-09 09:35:17,815 INFO L860 garLoopResultBuilder]: At program point L368(lines 359 370) the Hoare annotation is: true [2021-11-09 09:35:17,815 INFO L857 garLoopResultBuilder]: For program point L302(lines 302 307) no Hoare annotation was computed. [2021-11-09 09:35:17,815 INFO L853 garLoopResultBuilder]: At program point L236(lines 223 238) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,815 INFO L853 garLoopResultBuilder]: At program point L236-1(lines 223 238) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,816 INFO L860 garLoopResultBuilder]: At program point L336(lines 313 341) the Hoare annotation is: true [2021-11-09 09:35:17,816 INFO L853 garLoopResultBuilder]: At program point L237(lines 220 239) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,816 INFO L853 garLoopResultBuilder]: At program point L237-1(lines 220 239) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,817 INFO L853 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse9 (= ~c_dr_pc~0 0)) (.cse3 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse6 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (<= ~p_num_write~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse10 (<= .cse16 ~p_num_write~0)) (.cse11 (<= 1 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse16))) (or (and .cse0 (= ~c_dr_st~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse3 .cse9) (and .cse13 .cse1 .cse4 .cse14 .cse15 .cse8 .cse10 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse13 .cse1 .cse3 .cse4 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12)))) [2021-11-09 09:35:17,817 INFO L853 garLoopResultBuilder]: At program point L72-1(lines 60 74) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse1 (<= ~c_num_read~0 ~p_num_write~0)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~q_free~0 1)) (.cse12 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse5 (<= ~p_num_write~0 1)) (.cse6 (= ~p_dw_pc~0 1)) (.cse13 (= 2 ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse11 .cse6 .cse13 .cse8 .cse9) (and .cse0 .cse3 .cse12 (= ~c_num_read~0 1) .cse5 .cse6 .cse13 .cse8 .cse10))) [2021-11-09 09:35:17,817 INFO L857 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2021-11-09 09:35:17,817 INFO L853 garLoopResultBuilder]: At program point L73(lines 57 75) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse4 (= ~p_dw_pc~0 1)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (= ~c_dr_pc~0 0)) (.cse11 (= ~p_dw_pc~0 0)) (.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse3 (= ~q_free~0 0)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse14 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (<= ~p_num_write~0 1)) (.cse7 (= ~q_read_ev~0 2)) (.cse8 (<= .cse17 ~p_num_write~0)) (.cse16 (<= 1 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse17))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4 .cse7 .cse8 .cse9) (and .cse0 .cse2 .cse5 .cse10) (and .cse11 .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse14 .cse5) (and .cse11 (= ~c_dr_st~0 0) .cse1 .cse12 .cse2 .cse3 .cse13 .cse14 .cse15 .cse5 .cse7 .cse10 .cse8 .cse16 .cse9) (and .cse11 .cse0 .cse1 .cse12 .cse3 .cse13 .cse6 .cse14 .cse15 .cse7 .cse8 .cse16 .cse9)))) [2021-11-09 09:35:17,817 INFO L853 garLoopResultBuilder]: At program point L73-1(lines 57 75) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0)) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse13 (= ~c_dr_pc~0 1)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse9 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse3 (= ~c_num_read~0 1)) (.cse4 (<= ~p_num_write~0 1)) (.cse5 (= ~p_dw_pc~0 1)) (.cse15 (= 2 ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse13 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse11 .cse1 .cse2 .cse12 .cse14 .cse13 .cse5 .cse6 .cse15 .cse8 .cse9) (and .cse0 .cse2 .cse14 .cse3 .cse4 .cse5 .cse15 .cse8 .cse10))) [2021-11-09 09:35:17,818 INFO L853 garLoopResultBuilder]: At program point L288(lines 240 293) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,818 INFO L853 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,818 INFO L857 garLoopResultBuilder]: For program point L206(lines 206 210) no Hoare annotation was computed. [2021-11-09 09:35:17,818 INFO L857 garLoopResultBuilder]: For program point L206-2(lines 205 218) no Hoare annotation was computed. [2021-11-09 09:35:17,818 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-11-09 09:35:17,821 INFO L857 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2021-11-09 09:35:17,822 INFO L857 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2021-11-09 09:35:17,822 INFO L857 garLoopResultBuilder]: For program point L42-3(lines 42 51) no Hoare annotation was computed. [2021-11-09 09:35:17,823 INFO L857 garLoopResultBuilder]: For program point L42-5(lines 42 51) no Hoare annotation was computed. [2021-11-09 09:35:17,823 INFO L853 garLoopResultBuilder]: At program point L356(lines 342 358) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~c_num_read~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= ~c_num_read~0 ~p_num_write~0) (= ~q_free~0 1) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~q_read_ev~0 2) (= ~c_dr_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~q_write_ev~0 1))) [2021-11-09 09:35:17,828 INFO L853 garLoopResultBuilder]: At program point L323-1(lines 202 335) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,828 INFO L853 garLoopResultBuilder]: At program point L257(lines 247 287) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,828 INFO L857 garLoopResultBuilder]: For program point L224(lines 224 234) no Hoare annotation was computed. [2021-11-09 09:35:17,828 INFO L857 garLoopResultBuilder]: For program point L224-1(lines 224 234) no Hoare annotation was computed. [2021-11-09 09:35:17,829 INFO L857 garLoopResultBuilder]: For program point L92(lines 92 96) no Hoare annotation was computed. [2021-11-09 09:35:17,829 INFO L853 garLoopResultBuilder]: At program point L92-2(lines 76 100) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse10 (= ~p_dw_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse16 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse17 (= ~c_dr_pc~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse8 (= ~c_dr_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse4 (= ~q_free~0 0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse7 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (<= ~p_num_write~0 1)) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (<= .cse19 ~p_num_write~0)) (.cse18 (<= 1 ~p_num_write~0)) (.cse13 (<= ~p_num_write~0 .cse19))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 .cse4 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse11 .cse17 .cse12 .cse18 .cse13) (and .cse1 .cse14 .cse6 .cse16 .cse17) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11 .cse12 .cse18 .cse13)))) [2021-11-09 09:35:17,829 INFO L857 garLoopResultBuilder]: For program point L92-3(lines 92 96) no Hoare annotation was computed. [2021-11-09 09:35:17,829 INFO L853 garLoopResultBuilder]: At program point L92-5(lines 76 100) the Hoare annotation is: (let ((.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 ~c_num_read~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse5 (= ~p_dw_st~0 0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse11 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse2 (= ~c_num_read~0 1)) (.cse3 (<= ~p_num_write~0 1)) (.cse4 (= ~p_dw_pc~0 1)) (.cse13 (= 2 ~p_dw_st~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse10 .cse11 .cse12 .cse4 .cse13 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse10 .cse12 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse11 .cse2 .cse3 .cse4 .cse13 .cse6 .cse8))) [2021-11-09 09:35:17,829 INFO L857 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2021-11-09 09:35:17,830 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2021-11-09 09:35:17,830 INFO L857 garLoopResultBuilder]: For program point L43-1(lines 43 48) no Hoare annotation was computed. [2021-11-09 09:35:17,830 INFO L857 garLoopResultBuilder]: For program point L324(line 324) no Hoare annotation was computed. [2021-11-09 09:35:17,830 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2021-11-09 09:35:17,830 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-11-09 09:35:17,831 INFO L857 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2021-11-09 09:35:17,831 INFO L857 garLoopResultBuilder]: For program point L61-3(lines 61 70) no Hoare annotation was computed. [2021-11-09 09:35:17,831 INFO L857 garLoopResultBuilder]: For program point L61-5(lines 61 70) no Hoare annotation was computed. [2021-11-09 09:35:17,832 INFO L853 garLoopResultBuilder]: At program point L309(lines 298 311) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,832 INFO L857 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2021-11-09 09:35:17,832 INFO L857 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2021-11-09 09:35:17,832 INFO L857 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2021-11-09 09:35:17,835 INFO L857 garLoopResultBuilder]: For program point L62-1(lines 62 67) no Hoare annotation was computed. [2021-11-09 09:35:17,835 INFO L853 garLoopResultBuilder]: At program point L310(lines 294 312) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse12 (= ~p_num_write~0 0)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse7 (= ~p_dw_st~0 0)) (.cse10 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse13 (= ~c_dr_st~0 2)) (.cse5 (= ~q_free~0 1)) (.cse9 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= ~q_free~0 0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (= ~q_read_ev~0 2)) (.cse14 (= 2 ~p_dw_st~0)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse13 .cse3 .cse5 .cse14 .cse10) (and .cse3 (or (and .cse13 .cse5 .cse15 .cse7) (and .cse13 .cse16 .cse15 .cse7)) .cse4 .cse6 .cse17 .cse8 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse9 .cse14 .cse10) (and .cse13 .cse18 .cse16 .cse19 .cse9) (and .cse3 (or (and .cse13 .cse5 .cse15) (and .cse13 .cse16 .cse15)) .cse14) (and .cse0 .cse2 .cse13 .cse3 .cse4 .cse5 .cse6 .cse17 .cse7 .cse8 .cse10 .cse11) (and .cse1 .cse3 .cse18 .cse20 .cse16 (<= ~p_num_write~0 1) .cse15 .cse19 .cse8 .cse9 .cse14 .cse11 .cse21 (<= 1 ~p_num_write~0) .cse22) (and .cse0 .cse13 .cse5 .cse9) (and .cse1 .cse3 .cse20 .cse17 .cse15 .cse8 .cse14 .cse11 .cse21 .cse22)))) [2021-11-09 09:35:17,835 INFO L857 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2021-11-09 09:35:17,835 INFO L857 garLoopResultBuilder]: For program point L228(lines 228 233) no Hoare annotation was computed. [2021-11-09 09:35:17,836 INFO L857 garLoopResultBuilder]: For program point L228-1(lines 228 233) no Hoare annotation was computed. [2021-11-09 09:35:17,837 INFO L857 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2021-11-09 09:35:17,837 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point L248(line 248) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2021-11-09 09:35:17,838 INFO L857 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2021-11-09 09:35:17,839 INFO L857 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2021-11-09 09:35:17,839 INFO L853 garLoopResultBuilder]: At program point L117-1(lines 105 142) the Hoare annotation is: (let ((.cse22 (+ ~c_num_read~0 1))) (let ((.cse5 (<= ~p_num_write~0 1)) (.cse9 (<= 1 ~p_num_write~0)) (.cse8 (<= .cse22 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse22)) (.cse3 (= ~q_free~0 0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_dr_pc~0 1)) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse13 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse17 (= ~c_num_read~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse18 (<= ~c_num_read~0 ~p_num_write~0)) (.cse20 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (= ~q_read_ev~0 2)) (.cse21 (= ~c_last_read~0 ~p_last_write~0)) (.cse7 (not (= ~q_write_ev~0 1))) (.cse0 (= ~p_dw_pc~0 0)) (.cse15 (= ~c_dr_st~0 2)) (.cse19 (= ~q_free~0 1)) (.cse14 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse12 .cse5 .cse13 .cse6 .cse14 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse15 .cse2 .cse3 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse16 .cse6 .cse7 .cse8 .cse10) (and .cse15 .cse2 .cse3 .cse12 .cse16) (and .cse0 .cse17 .cse15 .cse2 .cse18 .cse19 .cse20 .cse4 .cse6 .cse21 .cse7) (and .cse15 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse17 .cse2 .cse18 .cse19 .cse20 .cse6 .cse14 .cse21 .cse7) (and .cse0 .cse15 .cse19 .cse14)))) [2021-11-09 09:35:17,839 INFO L857 garLoopResultBuilder]: For program point L84-2(lines 84 88) no Hoare annotation was computed. [2021-11-09 09:35:17,839 INFO L857 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2021-11-09 09:35:17,839 INFO L857 garLoopResultBuilder]: For program point L84-5(lines 84 88) no Hoare annotation was computed. [2021-11-09 09:35:17,845 INFO L731 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-09 09:35:17,847 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-09 09:35:17,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 09:35:17 BoogieIcfgContainer [2021-11-09 09:35:17,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-09 09:35:17,964 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-09 09:35:17,964 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-09 09:35:17,965 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-09 09:35:17,965 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:35:05" (3/4) ... [2021-11-09 09:35:17,968 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-11-09 09:35:17,981 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-11-09 09:35:17,982 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-11-09 09:35:17,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 09:35:17,983 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-11-09 09:35:18,008 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,008 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,009 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,009 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,009 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,010 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,010 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,010 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,010 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,011 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,011 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0)) || ((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || ((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0) [2021-11-09 09:35:18,011 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) [2021-11-09 09:35:18,012 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,013 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) || (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,013 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && 0 == \result) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) [2021-11-09 09:35:18,013 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,014 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1) && \result == 0) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,014 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) [2021-11-09 09:35:18,014 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) || (((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || (((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) [2021-11-09 09:35:18,044 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/witness.graphml [2021-11-09 09:35:18,045 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-09 09:35:18,046 INFO L168 Benchmark]: Toolchain (without parser) took 13633.44 ms. Allocated memory was 100.7 MB in the beginning and 146.8 MB in the end (delta: 46.1 MB). Free memory was 60.5 MB in the beginning and 110.6 MB in the end (delta: -50.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:35:18,047 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 100.7 MB. Free memory was 76.6 MB in the beginning and 76.6 MB in the end (delta: 51.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-09 09:35:18,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 373.10 ms. Allocated memory is still 100.7 MB. Free memory was 60.3 MB in the beginning and 73.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,047 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 71.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,048 INFO L168 Benchmark]: Boogie Preprocessor took 30.64 ms. Allocated memory is still 100.7 MB. Free memory was 71.7 MB in the beginning and 70.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,048 INFO L168 Benchmark]: RCFGBuilder took 527.37 ms. Allocated memory is still 100.7 MB. Free memory was 70.1 MB in the beginning and 55.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,049 INFO L168 Benchmark]: TraceAbstraction took 12566.73 ms. Allocated memory was 100.7 MB in the beginning and 146.8 MB in the end (delta: 46.1 MB). Free memory was 54.6 MB in the beginning and 117.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 71.6 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,049 INFO L168 Benchmark]: Witness Printer took 80.67 ms. Allocated memory is still 146.8 MB. Free memory was 117.9 MB in the beginning and 110.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-09 09:35:18,051 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 100.7 MB. Free memory was 76.6 MB in the beginning and 76.6 MB in the end (delta: 51.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 373.10 ms. Allocated memory is still 100.7 MB. Free memory was 60.3 MB in the beginning and 73.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 45.60 ms. Allocated memory is still 100.7 MB. Free memory was 73.9 MB in the beginning and 71.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.64 ms. Allocated memory is still 100.7 MB. Free memory was 71.7 MB in the beginning and 70.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 527.37 ms. Allocated memory is still 100.7 MB. Free memory was 70.1 MB in the beginning and 55.2 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12566.73 ms. Allocated memory was 100.7 MB in the beginning and 146.8 MB in the end (delta: 46.1 MB). Free memory was 54.6 MB in the beginning and 117.9 MB in the end (delta: -63.3 MB). Peak memory consumption was 71.6 MB. Max. memory is 16.1 GB. * Witness Printer took 80.67 ms. Allocated memory is still 146.8 MB. Free memory was 117.9 MB in the beginning and 110.6 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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, 76 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1685 SDslu, 2247 SDs, 0 SdLazy, 211 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5192 HoareAnnotationTreeSize, 27 FomulaSimplifications, 66262 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 27 FomulaSimplificationsInter, 14930 FormulaSimplificationTreeSizeReductionInter, 6.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 2840 SizeOfPredicates, 2 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 18 InterpolantComputations, 16 PerfectInterpolantSequences, 280/284 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: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) || (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && p_num_write <= 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 294]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 359]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || ((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && __retres1 == 0) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && \result == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((((((((((((p_last_write == q_buf_0 && q_free == 0) && p_num_write <= 1) && p_dw_pc == 1) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((((((((p_last_write == q_buf_0 && q_free == 1) && p_num_write <= c_num_read) && p_dw_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || (((((((p_last_write == q_buf_0 && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && c_num_read < p_num_write + 1)) || ((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || (((((((((p_dw_pc == 0 && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1)) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read < p_num_write + 1)) || ((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1) - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && 0 == \result) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 105]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0)) || ((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || ((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write)) || ((((((((p_last_write == q_buf_0 && __retres1 == 0) && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: (((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) || (((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && tmp___0 == 0) && p_dw_pc == 1)) || (((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && tmp___0 == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: ((((((((((p_last_write == q_buf_0 && q_free == 1) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) && 1 <= p_num_write) || (((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && tmp == 0) && c_dr_pc == 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_pc == 1) && p_dw_st == 0) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((p_last_write == q_buf_0 && q_free == 1) && tmp == 0) && c_num_read == 1) && p_num_write <= 1) && p_dw_pc == 1) && 2 == p_dw_st) && c_last_read == p_last_write) && 1 <= p_num_write) - InvariantResult [Line: 223]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && c_num_read == 0) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && p_dw_st == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_last_read == p_last_write) && !(q_write_ev == 1)) || (((((((p_dw_pc == 0 && p_num_write == 0) && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && q_free == 1) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((((p_last_write == q_buf_0 && ((((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) && p_dw_st == 0) || (((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1) && p_dw_st == 0))) && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_read_ev == 2) && !(q_write_ev == 1))) || ((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && c_num_read == 0) && p_last_write == q_buf_0) && q_free == 1) && c_dr_pc == 0) && 2 == p_dw_st) && c_last_read == p_last_write)) || ((((c_dr_st == 2 && __retres1 == 0) && tmp___0 == 0) && \result == 0) && c_dr_pc == 0)) || ((p_last_write == q_buf_0 && (((c_dr_st == 2 && q_free == 1) && p_dw_pc == 1) || ((c_dr_st == 2 && tmp___0 == 0) && p_dw_pc == 1))) && 2 == p_dw_st)) || (((((((((((p_dw_pc == 0 && c_num_read == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && p_dw_st == 0) && q_read_ev == 2) && c_last_read == p_last_write) && !(q_write_ev == 1))) || ((((((((((((((c_dr_st == 0 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp___0 == 0) && p_num_write <= 1) && p_dw_pc == 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && q_free == 1) && c_dr_pc == 0)) || (((((((((c_dr_st == 0 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && 2 == p_dw_st) && !(q_write_ev == 1)) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1) && \result == 0) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && \result == 0) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) || ((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || (((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && q_free == 0) && tmp == 0) && 0 == \result)) || ((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_dw_pc == 1)) || ((((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && tmp == 0) && c_dr_pc == 1) && 0 == \result) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_dw_pc == 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0)) || ((((((((((p_dw_pc == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && c_dr_pc == 1) && p_num_write <= 1) && q_read_ev == 2) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1)) || ((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_last_write == q_buf_0) && __retres1 == 0) && q_free == 0) && p_num_write <= 1) && q_read_ev == 2) && c_dr_pc == 0) && c_num_read + 1 <= p_num_write) && 1 <= p_num_write) && p_num_write <= c_num_read + 1) RESULT: Ultimate proved your program to be correct! [2021-11-09 09:35:18,125 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_14be459a-df0d-496d-ab1b-f23622de43c2/bin/uautomizer-IVEQpCNsaX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE