./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer --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 a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 23:40:06,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:40:06,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:40:06,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:40:06,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:40:06,351 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:40:06,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:40:06,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:40:06,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:40:06,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:40:06,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:40:06,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:40:06,379 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:40:06,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:40:06,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:40:06,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:40:06,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:40:06,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:40:06,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:40:06,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:40:06,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:40:06,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:40:06,421 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:40:06,422 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:40:06,434 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:40:06,435 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:40:06,435 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:40:06,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:40:06,439 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:40:06,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:40:06,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:40:06,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:40:06,447 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:40:06,448 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:40:06,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:40:06,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:40:06,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:40:06,453 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:40:06,453 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:40:06,455 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:40:06,456 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:40:06,461 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 23:40:06,513 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:40:06,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:40:06,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:40:06,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:40:06,517 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:40:06,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:40:06,518 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:40:06,518 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:40:06,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:40:06,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:40:06,521 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:40:06,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:40:06,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:40:06,522 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:40:06,522 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:40:06,522 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:40:06,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:40:06,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:40:06,523 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:40:06,524 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:40:06,524 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:40:06,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:40:06,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:40:06,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:40:06,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:40:06,526 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:40:06,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:40:06,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:40:06,527 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:40:06,527 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-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/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-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2020-11-29 23:40:07,026 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:40:07,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:40:07,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:40:07,072 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:40:07,074 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:40:07,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-11-29 23:40:07,168 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/data/e1285b735/298caccd42b047a58731b52f5ea73f69/FLAG68381c3e3 [2020-11-29 23:40:07,889 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:40:07,890 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2020-11-29 23:40:07,915 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/data/e1285b735/298caccd42b047a58731b52f5ea73f69/FLAG68381c3e3 [2020-11-29 23:40:08,202 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/data/e1285b735/298caccd42b047a58731b52f5ea73f69 [2020-11-29 23:40:08,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:40:08,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:40:08,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:40:08,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:40:08,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:40:08,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372caedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08, skipping insertion in model container [2020-11-29 23:40:08,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:40:08,298 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:40:08,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:40:08,569 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:40:08,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:40:08,670 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:40:08,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08 WrapperNode [2020-11-29 23:40:08,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:40:08,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:40:08,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:40:08,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:40:08,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,711 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:40:08,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:40:08,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:40:08,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:40:08,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... [2020-11-29 23:40:08,853 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:40:08,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:40:08,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:40:08,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:40:08,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:40:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:40:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:40:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:40:08,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:40:09,966 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:40:09,967 INFO L298 CfgBuilder]: Removed 46 assume(true) statements. [2020-11-29 23:40:09,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:40:09 BoogieIcfgContainer [2020-11-29 23:40:09,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:40:09,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:40:09,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:40:09,977 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:40:09,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:40:08" (1/3) ... [2020-11-29 23:40:09,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b75b06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:40:09, skipping insertion in model container [2020-11-29 23:40:09,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:40:08" (2/3) ... [2020-11-29 23:40:09,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b75b06a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:40:09, skipping insertion in model container [2020-11-29 23:40:09,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:40:09" (3/3) ... [2020-11-29 23:40:09,982 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-11-29 23:40:09,997 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:40:10,004 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 23:40:10,020 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 23:40:10,054 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:40:10,054 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:40:10,055 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:40:10,055 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:40:10,055 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:40:10,055 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:40:10,055 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:40:10,056 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:40:10,076 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2020-11-29 23:40:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-29 23:40:10,085 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:10,086 INFO L422 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] [2020-11-29 23:40:10,087 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:10,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:10,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512772, now seen corresponding path program 1 times [2020-11-29 23:40:10,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:10,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616090844] [2020-11-29 23:40:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:10,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616090844] [2020-11-29 23:40:10,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:10,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:10,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861133901] [2020-11-29 23:40:10,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:10,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:10,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:10,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:10,479 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 3 states. [2020-11-29 23:40:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:10,672 INFO L93 Difference]: Finished difference Result 216 states and 328 transitions. [2020-11-29 23:40:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:10,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2020-11-29 23:40:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:10,713 INFO L225 Difference]: With dead ends: 216 [2020-11-29 23:40:10,713 INFO L226 Difference]: Without dead ends: 135 [2020-11-29 23:40:10,718 INFO L677 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 [2020-11-29 23:40:10,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-11-29 23:40:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2020-11-29 23:40:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-29 23:40:10,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2020-11-29 23:40:10,829 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2020-11-29 23:40:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:10,830 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2020-11-29 23:40:10,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2020-11-29 23:40:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 23:40:10,836 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:10,836 INFO L422 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] [2020-11-29 23:40:10,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:40:10,837 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:10,838 INFO L82 PathProgramCache]: Analyzing trace with hash 317140169, now seen corresponding path program 1 times [2020-11-29 23:40:10,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:10,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750813434] [2020-11-29 23:40:10,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:10,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:10,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750813434] [2020-11-29 23:40:10,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:10,964 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:10,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144793333] [2020-11-29 23:40:10,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:10,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:10,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:10,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:10,968 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand 3 states. [2020-11-29 23:40:11,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:11,103 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2020-11-29 23:40:11,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:11,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-29 23:40:11,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:11,109 INFO L225 Difference]: With dead ends: 323 [2020-11-29 23:40:11,111 INFO L226 Difference]: Without dead ends: 215 [2020-11-29 23:40:11,113 INFO L677 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 [2020-11-29 23:40:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-11-29 23:40:11,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2020-11-29 23:40:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-11-29 23:40:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2020-11-29 23:40:11,144 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2020-11-29 23:40:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2020-11-29 23:40:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2020-11-29 23:40:11,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-29 23:40:11,149 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:11,149 INFO L422 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] [2020-11-29 23:40:11,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:40:11,150 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:11,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:11,151 INFO L82 PathProgramCache]: Analyzing trace with hash -658420749, now seen corresponding path program 1 times [2020-11-29 23:40:11,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:11,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975871176] [2020-11-29 23:40:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:11,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:11,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975871176] [2020-11-29 23:40:11,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:11,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:11,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28719295] [2020-11-29 23:40:11,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:11,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:11,247 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand 3 states. [2020-11-29 23:40:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:11,333 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2020-11-29 23:40:11,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:11,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2020-11-29 23:40:11,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:11,344 INFO L225 Difference]: With dead ends: 526 [2020-11-29 23:40:11,345 INFO L226 Difference]: Without dead ends: 321 [2020-11-29 23:40:11,347 INFO L677 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 [2020-11-29 23:40:11,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2020-11-29 23:40:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2020-11-29 23:40:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2020-11-29 23:40:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2020-11-29 23:40:11,418 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2020-11-29 23:40:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:11,419 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2020-11-29 23:40:11,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2020-11-29 23:40:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-29 23:40:11,423 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:11,423 INFO L422 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] [2020-11-29 23:40:11,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:40:11,424 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921099, now seen corresponding path program 1 times [2020-11-29 23:40:11,428 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:11,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597187939] [2020-11-29 23:40:11,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:11,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597187939] [2020-11-29 23:40:11,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:11,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:11,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267318287] [2020-11-29 23:40:11,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:11,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:11,550 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand 3 states. [2020-11-29 23:40:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:11,670 INFO L93 Difference]: Finished difference Result 740 states and 1007 transitions. [2020-11-29 23:40:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:11,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-29 23:40:11,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:11,675 INFO L225 Difference]: With dead ends: 740 [2020-11-29 23:40:11,675 INFO L226 Difference]: Without dead ends: 449 [2020-11-29 23:40:11,682 INFO L677 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 [2020-11-29 23:40:11,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2020-11-29 23:40:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2020-11-29 23:40:11,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2020-11-29 23:40:11,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2020-11-29 23:40:11,740 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2020-11-29 23:40:11,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:11,740 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2020-11-29 23:40:11,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2020-11-29 23:40:11,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 23:40:11,751 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:11,751 INFO L422 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] [2020-11-29 23:40:11,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:40:11,753 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870078, now seen corresponding path program 1 times [2020-11-29 23:40:11,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:11,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870781082] [2020-11-29 23:40:11,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:11,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870781082] [2020-11-29 23:40:11,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:11,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:11,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88436363] [2020-11-29 23:40:11,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:11,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:11,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:11,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:11,892 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand 3 states. [2020-11-29 23:40:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:11,987 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2020-11-29 23:40:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:11,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-29 23:40:11,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:11,997 INFO L225 Difference]: With dead ends: 914 [2020-11-29 23:40:11,997 INFO L226 Difference]: Without dead ends: 555 [2020-11-29 23:40:11,999 INFO L677 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 [2020-11-29 23:40:12,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2020-11-29 23:40:12,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2020-11-29 23:40:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2020-11-29 23:40:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2020-11-29 23:40:12,039 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2020-11-29 23:40:12,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:12,041 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2020-11-29 23:40:12,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2020-11-29 23:40:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:40:12,047 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:12,047 INFO L422 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] [2020-11-29 23:40:12,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:40:12,048 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726775, now seen corresponding path program 1 times [2020-11-29 23:40:12,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:12,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546201941] [2020-11-29 23:40:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:12,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546201941] [2020-11-29 23:40:12,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:12,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:40:12,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099479099] [2020-11-29 23:40:12,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:40:12,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:40:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:40:12,187 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand 5 states. [2020-11-29 23:40:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:12,425 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2020-11-29 23:40:12,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:40:12,426 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-29 23:40:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:12,435 INFO L225 Difference]: With dead ends: 1620 [2020-11-29 23:40:12,436 INFO L226 Difference]: Without dead ends: 1203 [2020-11-29 23:40:12,437 INFO L677 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 [2020-11-29 23:40:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-11-29 23:40:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2020-11-29 23:40:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2020-11-29 23:40:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2020-11-29 23:40:12,506 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2020-11-29 23:40:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:12,512 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2020-11-29 23:40:12,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:40:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2020-11-29 23:40:12,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:40:12,515 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:12,515 INFO L422 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] [2020-11-29 23:40:12,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 23:40:12,516 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:12,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:12,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121531, now seen corresponding path program 1 times [2020-11-29 23:40:12,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:12,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099286062] [2020-11-29 23:40:12,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:12,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:12,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099286062] [2020-11-29 23:40:12,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:12,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:40:12,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006630925] [2020-11-29 23:40:12,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:40:12,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:12,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:40:12,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:40:12,657 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand 5 states. [2020-11-29 23:40:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:12,855 INFO L93 Difference]: Finished difference Result 1356 states and 1736 transitions. [2020-11-29 23:40:12,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:40:12,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2020-11-29 23:40:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:12,863 INFO L225 Difference]: With dead ends: 1356 [2020-11-29 23:40:12,863 INFO L226 Difference]: Without dead ends: 866 [2020-11-29 23:40:12,866 INFO L677 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 [2020-11-29 23:40:12,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-11-29 23:40:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 480. [2020-11-29 23:40:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2020-11-29 23:40:12,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 610 transitions. [2020-11-29 23:40:12,940 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 610 transitions. Word has length 53 [2020-11-29 23:40:12,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:12,941 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 610 transitions. [2020-11-29 23:40:12,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:40:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 610 transitions. [2020-11-29 23:40:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:40:12,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:12,943 INFO L422 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] [2020-11-29 23:40:12,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 23:40:12,943 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:12,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:12,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075455, now seen corresponding path program 1 times [2020-11-29 23:40:12,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:12,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984235865] [2020-11-29 23:40:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:13,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 23:40:13,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984235865] [2020-11-29 23:40:13,064 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:13,064 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:13,064 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352190396] [2020-11-29 23:40:13,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:13,065 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:13,067 INFO L87 Difference]: Start difference. First operand 480 states and 610 transitions. Second operand 3 states. [2020-11-29 23:40:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:13,153 INFO L93 Difference]: Finished difference Result 862 states and 1099 transitions. [2020-11-29 23:40:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:13,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2020-11-29 23:40:13,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:13,161 INFO L225 Difference]: With dead ends: 862 [2020-11-29 23:40:13,161 INFO L226 Difference]: Without dead ends: 478 [2020-11-29 23:40:13,163 INFO L677 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 [2020-11-29 23:40:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2020-11-29 23:40:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2020-11-29 23:40:13,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2020-11-29 23:40:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 544 transitions. [2020-11-29 23:40:13,206 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 544 transitions. Word has length 53 [2020-11-29 23:40:13,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:13,207 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 544 transitions. [2020-11-29 23:40:13,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 544 transitions. [2020-11-29 23:40:13,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-11-29 23:40:13,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:13,210 INFO L422 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] [2020-11-29 23:40:13,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 23:40:13,211 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:13,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:13,211 INFO L82 PathProgramCache]: Analyzing trace with hash -179687324, now seen corresponding path program 1 times [2020-11-29 23:40:13,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:13,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020288280] [2020-11-29 23:40:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:13,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020288280] [2020-11-29 23:40:13,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:13,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:40:13,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499382837] [2020-11-29 23:40:13,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:40:13,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:40:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:40:13,335 INFO L87 Difference]: Start difference. First operand 437 states and 544 transitions. Second operand 4 states. [2020-11-29 23:40:13,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:13,395 INFO L93 Difference]: Finished difference Result 481 states and 596 transitions. [2020-11-29 23:40:13,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:40:13,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2020-11-29 23:40:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:13,401 INFO L225 Difference]: With dead ends: 481 [2020-11-29 23:40:13,401 INFO L226 Difference]: Without dead ends: 479 [2020-11-29 23:40:13,402 INFO L677 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 [2020-11-29 23:40:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2020-11-29 23:40:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2020-11-29 23:40:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2020-11-29 23:40:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 541 transitions. [2020-11-29 23:40:13,455 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 541 transitions. Word has length 53 [2020-11-29 23:40:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:13,455 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 541 transitions. [2020-11-29 23:40:13,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:40:13,456 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 541 transitions. [2020-11-29 23:40:13,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-11-29 23:40:13,457 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:13,458 INFO L422 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] [2020-11-29 23:40:13,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 23:40:13,458 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:13,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2020-11-29 23:40:13,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:13,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608039361] [2020-11-29 23:40:13,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:13,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608039361] [2020-11-29 23:40:13,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488033567] [2020-11-29 23:40:13,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 23:40:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:13,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-29 23:40:13,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:40:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:13,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-29 23:40:13,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-11-29 23:40:13,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827261027] [2020-11-29 23:40:13,945 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:40:13,945 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:13,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:40:13,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:40:13,947 INFO L87 Difference]: Start difference. First operand 435 states and 541 transitions. Second operand 6 states. [2020-11-29 23:40:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:14,089 INFO L93 Difference]: Finished difference Result 781 states and 968 transitions. [2020-11-29 23:40:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:40:14,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2020-11-29 23:40:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:14,097 INFO L225 Difference]: With dead ends: 781 [2020-11-29 23:40:14,097 INFO L226 Difference]: Without dead ends: 779 [2020-11-29 23:40:14,098 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:40:14,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2020-11-29 23:40:14,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 633. [2020-11-29 23:40:14,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2020-11-29 23:40:14,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 794 transitions. [2020-11-29 23:40:14,174 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 794 transitions. Word has length 54 [2020-11-29 23:40:14,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:14,176 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 794 transitions. [2020-11-29 23:40:14,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:40:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 794 transitions. [2020-11-29 23:40:14,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-29 23:40:14,210 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:14,211 INFO L422 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] [2020-11-29 23:40:14,431 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-29 23:40:14,432 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:14,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:14,433 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2020-11-29 23:40:14,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:14,433 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548944243] [2020-11-29 23:40:14,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:40:14,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548944243] [2020-11-29 23:40:14,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:14,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:14,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277011905] [2020-11-29 23:40:14,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:14,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:14,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:14,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:14,499 INFO L87 Difference]: Start difference. First operand 633 states and 794 transitions. Second operand 3 states. [2020-11-29 23:40:14,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:14,603 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2020-11-29 23:40:14,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:14,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2020-11-29 23:40:14,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:14,608 INFO L225 Difference]: With dead ends: 966 [2020-11-29 23:40:14,609 INFO L226 Difference]: Without dead ends: 629 [2020-11-29 23:40:14,610 INFO L677 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 [2020-11-29 23:40:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2020-11-29 23:40:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 580. [2020-11-29 23:40:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-29 23:40:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 719 transitions. [2020-11-29 23:40:14,675 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 719 transitions. Word has length 69 [2020-11-29 23:40:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:14,676 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 719 transitions. [2020-11-29 23:40:14,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 719 transitions. [2020-11-29 23:40:14,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-11-29 23:40:14,681 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:14,682 INFO L422 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] [2020-11-29 23:40:14,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:40:14,682 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1336457993, now seen corresponding path program 1 times [2020-11-29 23:40:14,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:14,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871151630] [2020-11-29 23:40:14,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:14,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 23:40:14,764 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871151630] [2020-11-29 23:40:14,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:14,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:14,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067713478] [2020-11-29 23:40:14,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:14,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:14,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:14,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:14,767 INFO L87 Difference]: Start difference. First operand 580 states and 719 transitions. Second operand 3 states. [2020-11-29 23:40:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:14,863 INFO L93 Difference]: Finished difference Result 1172 states and 1450 transitions. [2020-11-29 23:40:14,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:14,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-11-29 23:40:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:14,868 INFO L225 Difference]: With dead ends: 1172 [2020-11-29 23:40:14,868 INFO L226 Difference]: Without dead ends: 598 [2020-11-29 23:40:14,870 INFO L677 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 [2020-11-29 23:40:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-11-29 23:40:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 580. [2020-11-29 23:40:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2020-11-29 23:40:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 699 transitions. [2020-11-29 23:40:14,947 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 699 transitions. Word has length 80 [2020-11-29 23:40:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:14,948 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 699 transitions. [2020-11-29 23:40:14,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 699 transitions. [2020-11-29 23:40:14,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-11-29 23:40:14,955 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:14,956 INFO L422 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] [2020-11-29 23:40:14,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:40:14,956 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:14,957 INFO L82 PathProgramCache]: Analyzing trace with hash 393751957, now seen corresponding path program 1 times [2020-11-29 23:40:14,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:14,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649861046] [2020-11-29 23:40:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 23:40:15,019 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649861046] [2020-11-29 23:40:15,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:15,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:15,020 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942871815] [2020-11-29 23:40:15,021 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:15,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:15,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:15,027 INFO L87 Difference]: Start difference. First operand 580 states and 699 transitions. Second operand 3 states. [2020-11-29 23:40:15,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:15,101 INFO L93 Difference]: Finished difference Result 911 states and 1095 transitions. [2020-11-29 23:40:15,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:15,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-11-29 23:40:15,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:15,105 INFO L225 Difference]: With dead ends: 911 [2020-11-29 23:40:15,105 INFO L226 Difference]: Without dead ends: 284 [2020-11-29 23:40:15,106 INFO L677 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 [2020-11-29 23:40:15,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2020-11-29 23:40:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2020-11-29 23:40:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-11-29 23:40:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 320 transitions. [2020-11-29 23:40:15,133 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 320 transitions. Word has length 81 [2020-11-29 23:40:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:15,133 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 320 transitions. [2020-11-29 23:40:15,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 320 transitions. [2020-11-29 23:40:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-11-29 23:40:15,136 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:15,136 INFO L422 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] [2020-11-29 23:40:15,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 23:40:15,136 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:15,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:15,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1534139577, now seen corresponding path program 1 times [2020-11-29 23:40:15,137 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:15,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157383323] [2020-11-29 23:40:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 23:40:15,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157383323] [2020-11-29 23:40:15,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:15,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:15,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835793300] [2020-11-29 23:40:15,203 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:15,204 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:15,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:15,207 INFO L87 Difference]: Start difference. First operand 282 states and 320 transitions. Second operand 3 states. [2020-11-29 23:40:15,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:15,259 INFO L93 Difference]: Finished difference Result 401 states and 458 transitions. [2020-11-29 23:40:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:15,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-11-29 23:40:15,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:15,263 INFO L225 Difference]: With dead ends: 401 [2020-11-29 23:40:15,263 INFO L226 Difference]: Without dead ends: 279 [2020-11-29 23:40:15,264 INFO L677 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 [2020-11-29 23:40:15,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2020-11-29 23:40:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2020-11-29 23:40:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2020-11-29 23:40:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 315 transitions. [2020-11-29 23:40:15,294 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 315 transitions. Word has length 101 [2020-11-29 23:40:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:15,294 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 315 transitions. [2020-11-29 23:40:15,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:15,295 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 315 transitions. [2020-11-29 23:40:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-29 23:40:15,296 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:15,297 INFO L422 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] [2020-11-29 23:40:15,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 23:40:15,297 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:15,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1342369766, now seen corresponding path program 1 times [2020-11-29 23:40:15,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:15,300 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137972437] [2020-11-29 23:40:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-29 23:40:15,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137972437] [2020-11-29 23:40:15,402 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:15,402 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:40:15,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054923269] [2020-11-29 23:40:15,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:40:15,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:15,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:40:15,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:40:15,407 INFO L87 Difference]: Start difference. First operand 279 states and 315 transitions. Second operand 4 states. [2020-11-29 23:40:15,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:15,472 INFO L93 Difference]: Finished difference Result 395 states and 447 transitions. [2020-11-29 23:40:15,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:40:15,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2020-11-29 23:40:15,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:15,475 INFO L225 Difference]: With dead ends: 395 [2020-11-29 23:40:15,476 INFO L226 Difference]: Without dead ends: 270 [2020-11-29 23:40:15,479 INFO L677 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 [2020-11-29 23:40:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2020-11-29 23:40:15,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2020-11-29 23:40:15,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-11-29 23:40:15,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 300 transitions. [2020-11-29 23:40:15,505 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 300 transitions. Word has length 102 [2020-11-29 23:40:15,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:15,506 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 300 transitions. [2020-11-29 23:40:15,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:40:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 300 transitions. [2020-11-29 23:40:15,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-11-29 23:40:15,508 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:15,509 INFO L422 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] [2020-11-29 23:40:15,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 23:40:15,509 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:15,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:15,510 INFO L82 PathProgramCache]: Analyzing trace with hash 759125341, now seen corresponding path program 1 times [2020-11-29 23:40:15,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:15,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785130085] [2020-11-29 23:40:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 23:40:15,594 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785130085] [2020-11-29 23:40:15,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:15,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:40:15,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569509552] [2020-11-29 23:40:15,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:40:15,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:15,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:40:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:40:15,597 INFO L87 Difference]: Start difference. First operand 270 states and 300 transitions. Second operand 3 states. [2020-11-29 23:40:15,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:15,657 INFO L93 Difference]: Finished difference Result 400 states and 443 transitions. [2020-11-29 23:40:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:40:15,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2020-11-29 23:40:15,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:15,660 INFO L225 Difference]: With dead ends: 400 [2020-11-29 23:40:15,660 INFO L226 Difference]: Without dead ends: 259 [2020-11-29 23:40:15,661 INFO L677 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 [2020-11-29 23:40:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2020-11-29 23:40:15,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2020-11-29 23:40:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-11-29 23:40:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 271 transitions. [2020-11-29 23:40:15,688 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 271 transitions. Word has length 102 [2020-11-29 23:40:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:15,689 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 271 transitions. [2020-11-29 23:40:15,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:40:15,689 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 271 transitions. [2020-11-29 23:40:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-11-29 23:40:15,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:40:15,691 INFO L422 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] [2020-11-29 23:40:15,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 23:40:15,691 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:40:15,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:40:15,692 INFO L82 PathProgramCache]: Analyzing trace with hash 961855834, now seen corresponding path program 1 times [2020-11-29 23:40:15,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:40:15,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852267030] [2020-11-29 23:40:15,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:40:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:40:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-29 23:40:15,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852267030] [2020-11-29 23:40:15,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:40:15,865 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:40:15,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40166640] [2020-11-29 23:40:15,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:40:15,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:40:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:40:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:40:15,869 INFO L87 Difference]: Start difference. First operand 250 states and 271 transitions. Second operand 4 states. [2020-11-29 23:40:15,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:40:15,919 INFO L93 Difference]: Finished difference Result 250 states and 271 transitions. [2020-11-29 23:40:15,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:40:15,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2020-11-29 23:40:15,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:40:15,921 INFO L225 Difference]: With dead ends: 250 [2020-11-29 23:40:15,922 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 23:40:15,926 INFO L677 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 [2020-11-29 23:40:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 23:40:15,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 23:40:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 23:40:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 23:40:15,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2020-11-29 23:40:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:40:15,928 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:40:15,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:40:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 23:40:15,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 23:40:15,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 23:40:15,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 23:40:16,060 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 62 [2020-11-29 23:40:16,402 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:16,546 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:16,655 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:16,765 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:16,870 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:17,060 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:17,382 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 87 [2020-11-29 23:40:17,839 WARN L193 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 42 [2020-11-29 23:40:18,181 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2020-11-29 23:40:18,657 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2020-11-29 23:40:19,047 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2020-11-29 23:40:19,533 WARN L193 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2020-11-29 23:40:19,978 WARN L193 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 43 [2020-11-29 23:40:20,591 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2020-11-29 23:40:20,961 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2020-11-29 23:40:21,796 WARN L193 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:22,039 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2020-11-29 23:40:22,920 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:23,512 WARN L193 SmtUtils]: Spent 589.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:24,112 WARN L193 SmtUtils]: Spent 596.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:24,795 WARN L193 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:25,003 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2020-11-29 23:40:25,268 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2020-11-29 23:40:25,462 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2020-11-29 23:40:26,075 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:26,643 WARN L193 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:26,851 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2020-11-29 23:40:27,484 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:28,050 WARN L193 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:28,670 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2020-11-29 23:40:28,674 INFO L274 CegarLoopResult]: For program point L316(line 316) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2020-11-29 23:40:28,675 INFO L274 CegarLoopResult]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2020-11-29 23:40:28,676 INFO L270 CegarLoopResult]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,676 INFO L274 CegarLoopResult]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-11-29 23:40:28,676 INFO L274 CegarLoopResult]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-11-29 23:40:28,676 INFO L274 CegarLoopResult]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-11-29 23:40:28,676 INFO L274 CegarLoopResult]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2020-11-29 23:40:28,677 INFO L270 CegarLoopResult]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,677 INFO L274 CegarLoopResult]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-11-29 23:40:28,677 INFO L274 CegarLoopResult]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-11-29 23:40:28,677 INFO L274 CegarLoopResult]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2020-11-29 23:40:28,677 INFO L274 CegarLoopResult]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-11-29 23:40:28,677 INFO L274 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L274 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-11-29 23:40:28,678 INFO L270 CegarLoopResult]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse21 (+ ~c_num_read~0 1))) (let ((.cse8 (<= .cse21 ~p_num_write~0)) (.cse9 (<= ~p_num_write~0 .cse21)) (.cse2 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse3 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse4 (= ~c_dr_pc~0 0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse5 (= ~q_free~0 0)) (.cse1 (= ~c_dr_st~0 0)) (.cse11 (<= ~p_num_write~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse6 (= ~p_dw_pc~0 0)) (.cse0 (= ~q_read_ev~0 2)) (.cse20 (= ~c_dr_st~0 2)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse18 (= ~q_free~0 1)) (.cse13 (not (= ~q_write_ev~0 1))) (.cse19 (= ~c_num_read~0 0)) (.cse15 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse5 .cse8 .cse0 .cse9 .cse10 .cse14 .cse1 .cse13 .cse15) (and .cse6 .cse0 .cse10 .cse1 .cse16 .cse17 .cse4 .cse18 .cse13 .cse19) (and .cse7 .cse20 .cse2 .cse3 .cse4) (and .cse6 .cse20 .cse4 .cse18) (and .cse5 .cse7 .cse20 .cse10 .cse14) (and .cse5 .cse6 .cse7 .cse20 .cse10) (and .cse5 .cse6 .cse0 .cse10 .cse1 .cse11 .cse12 .cse13 .cse19 .cse15) (and .cse6 .cse0 .cse20 .cse10 .cse16 .cse17 .cse18 .cse13 .cse19 .cse15)))) [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 23:40:28,679 INFO L274 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-11-29 23:40:28,680 INFO L270 CegarLoopResult]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 0)) (.cse5 (= ~p_num_write~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse2 (= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_st~0 2)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse8 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4 (= ~c_dr_st~0 0) .cse5 .cse2 .cse6 .cse7) (and .cse0 .cse3 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0) .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse2) (and .cse1 .cse3 (<= ~p_num_write~0 ~c_num_read~0) .cse4 (= ~p_dw_pc~0 1) .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse8))) [2020-11-29 23:40:28,680 INFO L270 CegarLoopResult]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse8 (= ~c_dr_pc~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ~q_free~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ~p_last_write~0 ~q_buf_0~0)) (.cse9 (<= ~p_num_write~0 1)) (.cse2 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (<= 1 ~p_num_write~0)) (.cse3 (= ~c_dr_pc~0 0)) (.cse11 (= ~c_num_read~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ ~c_num_read~0 1))) (and .cse4 (<= .cse5 ~p_num_write~0) .cse6 .cse1 (<= ~p_num_write~0 .cse5) .cse7 (= ~p_dw_pc~0 1) .cse2 .cse8)) (and .cse4 .cse0 .cse1 .cse6 .cse7 .cse2 .cse9 .cse10 .cse11 .cse8) (and .cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse3) (and .cse4 .cse0 .cse6 .cse7 (= ~c_dr_st~0 0) .cse9 .cse2 .cse10 .cse3 .cse11))) [2020-11-29 23:40:28,680 INFO L270 CegarLoopResult]: At program point L45-1(lines 33 47) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 .cse5 .cse9))) [2020-11-29 23:40:28,680 INFO L270 CegarLoopResult]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~p_dw_st~0 0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (= ~p_num_write~0 0)) (.cse8 (= ~q_free~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (= ~c_num_read~0 0))) (or (and (= ~q_free~0 0) .cse0 .cse1 .cse2 .cse3 (<= ~p_num_write~0 1) (= ~c_dr_pc~0 0) (<= 1 ~p_num_write~0) .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0) .cse8 .cse9) (and .cse10 .cse0 .cse2 .cse7 .cse11 .cse8 .cse5) (and .cse1 .cse6 .cse12 .cse2 .cse3 .cse7 .cse8 .cse4 .cse9) (and .cse10 .cse1 .cse12 .cse2 .cse7 .cse11 .cse8 .cse4 .cse5))) [2020-11-29 23:40:28,681 INFO L274 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-11-29 23:40:28,681 INFO L274 CegarLoopResult]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-11-29 23:40:28,681 INFO L270 CegarLoopResult]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~q_free~0 0) (= 2 ~p_dw_st~0) (<= .cse0 ~p_num_write~0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 .cse0) (= ~p_last_write~0 ~q_buf_0~0) (= ~p_dw_pc~0 1) (not (= ~q_write_ev~0 1)) (= ~c_dr_pc~0 1))) [2020-11-29 23:40:28,681 INFO L270 CegarLoopResult]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse13 (+ ~c_num_read~0 1))) (let ((.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse1 (= ~p_dw_pc~0 0)) (.cse2 (<= .cse13 ~p_num_write~0)) (.cse3 (= ~q_read_ev~0 2)) (.cse5 (<= ~p_num_write~0 .cse13)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (<= ~p_num_write~0 1)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (<= 1 ~p_num_write~0)) (.cse4 (= ~c_dr_st~0 2)) (.cse12 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (= ~p_dw_pc~0 1) .cse7 .cse9 .cse11) (and .cse1 .cse4 .cse7 .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 (= ~c_dr_st~0 0) .cse8 .cse9 .cse12 .cse10) (and .cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0) .cse12)))) [2020-11-29 23:40:28,683 INFO L270 CegarLoopResult]: At program point L46-1(lines 30 48) the Hoare annotation is: (let ((.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse6 (not (= ~q_write_ev~0 1))) (.cse7 (<= ~c_num_read~0 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (<= ~p_num_write~0 1)) (.cse5 (= ~q_free~0 1)) (.cse9 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~c_dr_pc~0 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 (= ~c_dr_pc~0 0) .cse5 .cse9 .cse6 .cse7) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0) .cse4 .cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|) .cse5 .cse9))) [2020-11-29 23:40:28,683 INFO L277 CegarLoopResult]: At program point L360(lines 351 362) the Hoare annotation is: true [2020-11-29 23:40:28,683 INFO L274 CegarLoopResult]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-11-29 23:40:28,685 INFO L270 CegarLoopResult]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,686 INFO L270 CegarLoopResult]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,686 INFO L277 CegarLoopResult]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-11-29 23:40:28,686 INFO L270 CegarLoopResult]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,687 INFO L270 CegarLoopResult]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,687 INFO L270 CegarLoopResult]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse16 (+ ~c_num_read~0 1))) (let ((.cse6 (= ~c_dr_pc~0 1)) (.cse0 (= ~c_dr_st~0 2)) (.cse15 (= ~p_dw_pc~0 1)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse1 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~c_dr_pc~0 0)) (.cse7 (= ~q_free~0 0)) (.cse8 (= ~p_dw_pc~0 0)) (.cse9 (<= .cse16 ~p_num_write~0)) (.cse10 (<= ~p_num_write~0 .cse16)) (.cse11 (= ~p_last_write~0 ~q_buf_0~0)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse14 (<= 1 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse7 .cse9 .cse3 .cse0 .cse10 .cse11 .cse15 .cse6) (and .cse7 .cse8 .cse0 .cse11 .cse4 .cse1 .cse13 .cse5) (and .cse7 .cse0 .cse11 .cse15 .cse1) (and .cse3 (= ~c_dr_st~0 0) .cse4 .cse1 .cse5 .cse2 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)))) [2020-11-29 23:40:28,687 INFO L270 CegarLoopResult]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse0 (= 2 ~p_dw_st~0)) (.cse6 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse13 (= ~p_dw_st~0 0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse11 (<= ~p_num_write~0 1)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse7 (= ~q_free~0 1)) (.cse12 (<= 1 ~p_num_write~0)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= ~c_num_read~0 1) .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse12) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse12 .cse8 .cse9))) [2020-11-29 23:40:28,688 INFO L274 CegarLoopResult]: For program point L98(lines 98 106) no Hoare annotation was computed. [2020-11-29 23:40:28,688 INFO L270 CegarLoopResult]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse17 (+ ~c_num_read~0 1))) (let ((.cse3 (= ~p_dw_pc~0 1)) (.cse9 (= ~c_dr_pc~0 1)) (.cse6 (= ~q_read_ev~0 2)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse0 (= ~q_free~0 0)) (.cse10 (= ~p_dw_pc~0 0)) (.cse11 (<= .cse17 ~p_num_write~0)) (.cse12 (<= ~p_num_write~0 .cse17)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse13 (<= ~p_num_write~0 1)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse15 (<= 1 ~p_num_write~0)) (.cse1 (= ~c_dr_st~0 2)) (.cse4 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse5 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse16 (= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse1 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse0 .cse11 .cse6 .cse1 .cse12 .cse2 .cse3 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse7 .cse4 .cse14 .cse8 .cse5) (and .cse6 (= ~c_dr_st~0 0) .cse7 .cse4 .cse8 .cse5 .cse16 .cse0 .cse10 .cse11 .cse12 .cse2 .cse13 .cse14 .cse15) (and .cse1 .cse4 .cse5 .cse16)))) [2020-11-29 23:40:28,688 INFO L270 CegarLoopResult]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse1 (= ~p_dw_st~0 0)) (.cse11 (= ~c_num_read~0 1)) (.cse12 (<= ~p_num_write~0 1)) (.cse13 (<= 1 ~p_num_write~0)) (.cse14 (= 2 ~p_dw_st~0)) (.cse0 (<= ~p_num_write~0 ~c_num_read~0)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse15 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse7 (= ~q_free~0 1)) (.cse8 (not (= ~q_write_ev~0 1))) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse10 (= ~c_dr_pc~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse5 .cse4 .cse12 .cse6 .cse7 .cse13 .cse8) (and .cse14 .cse11 .cse2 .cse3 .cse4 .cse12 .cse15 .cse7 .cse13) (and .cse14 .cse0 .cse2 .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse8 .cse9 .cse10))) [2020-11-29 23:40:28,688 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 23:40:28,688 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 23:40:28,689 INFO L270 CegarLoopResult]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse2 .cse13 .cse7) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,689 INFO L270 CegarLoopResult]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,689 INFO L274 CegarLoopResult]: For program point L198(lines 198 202) no Hoare annotation was computed. [2020-11-29 23:40:28,689 INFO L274 CegarLoopResult]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2020-11-29 23:40:28,689 INFO L274 CegarLoopResult]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-11-29 23:40:28,689 INFO L274 CegarLoopResult]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-11-29 23:40:28,690 INFO L274 CegarLoopResult]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2020-11-29 23:40:28,690 INFO L274 CegarLoopResult]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2020-11-29 23:40:28,690 INFO L270 CegarLoopResult]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_dw_pc~0 0) (= ~q_read_ev~0 2) (<= ~p_num_write~0 ~c_num_read~0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_dr_st~0 0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (not (= ~q_write_ev~0 1)) (<= ~c_num_read~0 ~p_num_write~0) (= ~c_num_read~0 0)) [2020-11-29 23:40:28,691 INFO L270 CegarLoopResult]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,691 INFO L270 CegarLoopResult]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse23 (+ ~c_num_read~0 1))) (let ((.cse3 (<= ~p_num_write~0 ~c_num_read~0)) (.cse4 (= ~p_dw_st~0 0)) (.cse9 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse17 (= ~p_num_write~0 0)) (.cse10 (= ~c_num_read~0 0)) (.cse7 (= ~q_free~0 1)) (.cse2 (= ~c_dr_st~0 2)) (.cse16 (= 2 ~p_dw_st~0)) (.cse1 (= ~q_read_ev~0 2)) (.cse12 (= ~c_dr_st~0 0)) (.cse18 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse19 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse13 (= ~c_dr_pc~0 0)) (.cse20 (= ~q_free~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse21 (<= .cse23 ~p_num_write~0)) (.cse22 (<= ~p_num_write~0 .cse23)) (.cse5 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse8 (not (= ~q_write_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse12 .cse6 .cse13 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse3 (or (and .cse14 .cse2 .cse4 .cse15) (and .cse2 .cse4 .cse15 .cse7)) .cse5 .cse8 .cse9 .cse11) (and .cse0 .cse16 .cse2 .cse5 .cse6 .cse17 .cse7 .cse10) (and .cse14 .cse2 .cse18 .cse19 .cse13) (and .cse20 .cse16 .cse21 .cse1 .cse22 .cse5 .cse15 .cse12 .cse8 .cse11) (and .cse0 .cse2 .cse13 .cse7) (and .cse0 .cse16 .cse5 .cse12 .cse6 .cse17 .cse13 .cse7 .cse10) (and .cse16 .cse5 (or (and .cse2 .cse15 .cse7) (and .cse14 .cse2 .cse15))) (and .cse16 .cse1 .cse12 .cse18 .cse19 .cse13 .cse20 .cse14 .cse21 .cse22 .cse5 .cse15 (<= ~p_num_write~0 1) (<= 1 ~p_num_write~0) .cse8)))) [2020-11-29 23:40:28,703 INFO L274 CegarLoopResult]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-11-29 23:40:28,704 INFO L274 CegarLoopResult]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2020-11-29 23:40:28,704 INFO L274 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-11-29 23:40:28,704 INFO L270 CegarLoopResult]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse19 (+ ~c_num_read~0 1))) (let ((.cse2 (= ~q_read_ev~0 2)) (.cse6 (= ~c_dr_st~0 0)) (.cse7 (= ~c_dr_pc~0 1)) (.cse1 (<= .cse19 ~p_num_write~0)) (.cse3 (<= ~p_num_write~0 .cse19)) (.cse15 (<= ~p_num_write~0 1)) (.cse17 (<= 1 ~p_num_write~0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse12 (= ~c_dr_pc~0 0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse0 (= ~q_free~0 0)) (.cse13 (= ~p_dw_pc~0 0)) (.cse14 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 0)) (.cse18 (= ~c_dr_st~0 2)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse16 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse2 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse2 .cse8 .cse6 .cse10 .cse7 .cse0 .cse13 .cse1 .cse3 .cse4 .cse15 .cse16 .cse17) (and .cse14 .cse18 .cse9 .cse11 .cse12) (and .cse0 .cse14 .cse18 .cse4 .cse5) (and .cse0 .cse13 .cse14 .cse18 .cse4 .cse8 .cse16 .cse10)))) [2020-11-29 23:40:28,705 INFO L274 CegarLoopResult]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2020-11-29 23:40:28,705 INFO L270 CegarLoopResult]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse9 (= ~p_dw_st~0 0)) (.cse4 (<= ~p_num_write~0 1)) (.cse7 (<= 1 ~p_num_write~0)) (.cse0 (= 2 ~p_dw_st~0)) (.cse8 (<= ~p_num_write~0 ~c_num_read~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_dw_pc~0 1)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 0)) (.cse6 (= ~q_free~0 1)) (.cse10 (not (= ~q_write_ev~0 1))) (.cse11 (<= ~c_num_read~0 ~p_num_write~0)) (.cse12 (= ~c_dr_pc~0 1))) (or (and .cse0 (= ~c_num_read~0 1) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse9 .cse1 .cse2 .cse3 .cse6 .cse10 .cse11 .cse12) (and .cse9 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse10 .cse11) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse11 .cse12))) [2020-11-29 23:40:28,705 INFO L274 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-11-29 23:40:28,705 INFO L274 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-11-29 23:40:28,705 INFO L274 CegarLoopResult]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2020-11-29 23:40:28,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:40:28 BoogieIcfgContainer [2020-11-29 23:40:28,835 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:40:28,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:40:28,845 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:40:28,845 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:40:28,846 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:40:09" (3/4) ... [2020-11-29 23:40:28,850 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 23:40:28,872 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-29 23:40:28,873 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-29 23:40:28,874 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 23:40:28,875 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 23:40:28,918 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,919 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,920 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,921 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,921 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,922 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) [2020-11-29 23:40:28,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) [2020-11-29 23:40:28,923 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && q_read_ev == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-11-29 23:40:28,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) [2020-11-29 23:40:28,924 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-11-29 23:40:28,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) [2020-11-29 23:40:28,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) [2020-11-29 23:40:28,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) [2020-11-29 23:40:28,925 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) [2020-11-29 23:40:28,926 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) [2020-11-29 23:40:28,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1bdbb8ab-0491-48e6-b7c6-83b679096f5c/bin/uautomizer/witness.graphml [2020-11-29 23:40:28,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:40:29,001 INFO L168 Benchmark]: Toolchain (without parser) took 20790.33 ms. Allocated memory was 96.5 MB in the beginning and 287.3 MB in the end (delta: 190.8 MB). Free memory was 57.9 MB in the beginning and 185.7 MB in the end (delta: -127.8 MB). Peak memory consumption was 64.9 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,002 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 96.5 MB. Free memory is still 74.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:40:29,003 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.98 ms. Allocated memory is still 96.5 MB. Free memory was 57.7 MB in the beginning and 46.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,004 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.02 ms. Allocated memory is still 96.5 MB. Free memory was 46.0 MB in the beginning and 44.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,004 INFO L168 Benchmark]: Boogie Preprocessor took 74.77 ms. Allocated memory is still 96.5 MB. Free memory was 43.9 MB in the beginning and 42.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,005 INFO L168 Benchmark]: RCFGBuilder took 1115.15 ms. Allocated memory is still 96.5 MB. Free memory was 42.3 MB in the beginning and 59.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,009 INFO L168 Benchmark]: TraceAbstraction took 18871.42 ms. Allocated memory was 96.5 MB in the beginning and 287.3 MB in the end (delta: 190.8 MB). Free memory was 59.0 MB in the beginning and 193.0 MB in the end (delta: -134.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,011 INFO L168 Benchmark]: Witness Printer took 155.31 ms. Allocated memory is still 287.3 MB. Free memory was 193.0 MB in the beginning and 185.7 MB in the end (delta: 7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 23:40:29,017 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.40 ms. Allocated memory is still 96.5 MB. Free memory is still 74.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 455.98 ms. Allocated memory is still 96.5 MB. Free memory was 57.7 MB in the beginning and 46.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.02 ms. Allocated memory is still 96.5 MB. Free memory was 46.0 MB in the beginning and 44.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 74.77 ms. Allocated memory is still 96.5 MB. Free memory was 43.9 MB in the beginning and 42.4 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1115.15 ms. Allocated memory is still 96.5 MB. Free memory was 42.3 MB in the beginning and 59.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18871.42 ms. Allocated memory was 96.5 MB in the beginning and 287.3 MB in the end (delta: 190.8 MB). Free memory was 59.0 MB in the beginning and 193.0 MB in the end (delta: -134.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 16.1 GB. * Witness Printer took 155.31 ms. Allocated memory is still 287.3 MB. Free memory was 193.0 MB in the beginning and 185.7 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: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) || (((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write == 0) && c_dr_pc == 0) && !(q_write_ev == 1)) && c_num_read == 0)) || (((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == 0) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((c_dr_st == 2 && q_read_ev == 2) && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write) || ((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && c_dr_pc == 1) || (((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && c_dr_st == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && tmp == 0) && 0 == \result) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && \result == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1))) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && \result == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((q_free == 0 && 2 == p_dw_st) && q_read_ev == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && c_dr_pc == 0) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) || (((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && tmp == 0) && q_free == 1) && c_num_read <= p_num_write)) || ((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((((((q_read_ev == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((p_dw_pc == 0 && q_read_ev == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: (((((((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && \result == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || ((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result) && \result == 0)) || ((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((q_free == 0 && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && p_dw_pc == 0) && tmp___0 == 0) && c_dr_st == 2) && p_last_write == q_buf_0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1)) || (((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read == 0) && c_dr_pc == 1) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && c_dr_pc == 0) || ((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_dr_pc == 1)) || (((((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && q_read_ev == 2) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 1 <= p_num_write) && c_num_read == 0) && c_dr_pc == 1)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && p_dw_pc == 0) && q_read_ev == 2) && p_last_write == q_buf_0) && c_dr_st == 0) && p_num_write <= 1) && __retres1 == 0) && 1 <= p_num_write) && c_dr_pc == 0) && c_num_read == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && !(q_write_ev == 1)) && c_dr_pc == 1 - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && tmp == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && tmp == 0) && q_free == 1) && 1 <= p_num_write)) || (((((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && __retres1 == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((((((((p_dw_st == 0 && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && __retres1 == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && __retres1 == 0) && c_dr_pc == 0) || ((((((((((((q_read_ev == 2 && __retres1 == 0) && 0 == \result) && c_dr_pc == 1) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write)) || (((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_pc == 1)) || (((((((q_free == 0 && p_dw_pc == 0) && c_dr_st == 2) && p_last_write == q_buf_0) && __retres1 == 0) && __retres1 == 0) && tmp == 0) && 0 == \result)) || ((((q_free == 0 && c_dr_st == 2) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0)) || (((((((((((((q_read_ev == 2 && c_dr_st == 0) && __retres1 == 0) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0) && q_free == 0) && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_num_write <= 1) && tmp == 0) && 1 <= p_num_write) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1) || ((((((((((2 == p_dw_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && p_num_write <= 1) && c_dr_pc == 0) && q_free == 1) && 1 <= p_num_write) && !(q_write_ev == 1)) && c_num_read <= p_num_write)) || (((((((((2 == p_dw_st && c_num_read == 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && c_last_read == p_last_write) && p_num_write <= 1) && 0 == \result) && q_free == 1) && 1 <= p_num_write) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && p_num_write <= 1) && 0 == \result) && 1 <= p_num_write) && c_dr_pc == 1) || (((((((((q_free == 0 && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && __retres1 == 0) && 0 == \result) && c_dr_pc == 1)) || ((((p_dw_pc == 0 && c_dr_st == 2) && __retres1 == 0) && 0 == \result) && c_dr_pc == 0)) || (((((((((((q_free == 0 && p_dw_pc == 0) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && __retres1 == 0) && c_dr_st == 0) && p_num_write <= 1) && 0 == \result) && c_dr_pc == 0) && 1 <= p_num_write)) || (((c_dr_st == 2 && __retres1 == 0) && \result == 0) && c_dr_pc == 0) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((((((p_dw_pc == 0 && q_read_ev == 2) && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0) && c_dr_pc == 1) || (((((((((((p_dw_pc == 0 && q_read_ev == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && c_dr_pc == 0) && q_free == 1) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_num_read == 0)) || ((((((q_read_ev == 2 && p_num_write <= c_num_read) && ((((tmp___0 == 0 && c_dr_st == 2) && p_dw_st == 0) && p_dw_pc == 1) || (((c_dr_st == 2 && p_dw_st == 0) && p_dw_pc == 1) && q_free == 1))) && p_last_write == q_buf_0) && !(q_write_ev == 1)) && c_num_read <= p_num_write) && c_dr_pc == 1)) || (((((((p_dw_pc == 0 && 2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && c_last_read == p_last_write) && p_num_write == 0) && q_free == 1) && c_num_read == 0)) || ((((tmp___0 == 0 && c_dr_st == 2) && __retres1 == 0) && \result == 0) && c_dr_pc == 0)) || (((((((((q_free == 0 && 2 == p_dw_st) && c_num_read + 1 <= p_num_write) && q_read_ev == 2) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_dr_st == 0) && !(q_write_ev == 1)) && c_dr_pc == 1)) || (((p_dw_pc == 0 && c_dr_st == 2) && c_dr_pc == 0) && q_free == 1)) || ((((((((p_dw_pc == 0 && 2 == p_dw_st) && p_last_write == q_buf_0) && c_dr_st == 0) && c_last_read == p_last_write) && p_num_write == 0) && c_dr_pc == 0) && q_free == 1) && c_num_read == 0)) || ((2 == p_dw_st && p_last_write == q_buf_0) && (((c_dr_st == 2 && p_dw_pc == 1) && q_free == 1) || ((tmp___0 == 0 && c_dr_st == 2) && p_dw_pc == 1)))) || ((((((((((((((2 == p_dw_st && q_read_ev == 2) && c_dr_st == 0) && __retres1 == 0) && \result == 0) && c_dr_pc == 0) && q_free == 0) && tmp___0 == 0) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1) && p_num_write <= 1) && 1 <= p_num_write) && !(q_write_ev == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.8s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 1724 SDslu, 2161 SDs, 0 SdLazy, 206 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 91 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=633occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 17 MinimizatonAttempts, 1368 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 241 NumberOfFragments, 5152 HoareAnnotationTreeSize, 27 FomulaSimplifications, 69970 FormulaSimplificationTreeSizeReduction, 1.5s HoareSimplificationTime, 27 FomulaSimplificationsInter, 11166 FormulaSimplificationTreeSizeReductionInter, 11.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1144 ConstructedInterpolants, 0 QuantifiedInterpolants, 199170 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...