/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:49:50,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:49:50,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:49:50,416 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:49:50,417 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:49:50,418 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:49:50,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:49:50,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:49:50,425 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:49:50,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:49:50,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:49:50,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:49:50,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:49:50,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:49:50,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:49:50,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:49:50,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:49:50,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:49:50,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:49:50,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:49:50,447 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:49:50,449 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:49:50,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:49:50,452 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:49:50,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:49:50,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:49:50,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:49:50,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:49:50,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:49:50,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:49:50,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:49:50,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:49:50,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:49:50,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:49:50,481 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:49:50,481 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:49:50,483 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:49:50,483 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:49:50,483 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:49:50,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:49:50,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:49:50,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:49:50,556 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:49:50,557 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:49:50,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:49:50,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:49:50,560 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:49:50,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:49:50,561 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:49:50,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:49:50,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:49:50,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:49:50,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:49:50,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:49:50,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:49:50,563 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:49:50,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:49:50,563 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:49:50,564 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:49:50,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:49:50,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:49:50,564 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:49:50,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:49:50,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:49:50,565 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:49:50,565 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:49:50,566 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:49:50,566 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:49:50,566 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:49:50,566 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:49:50,566 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:49:50,566 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-06 22:49:50,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:49:50,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:49:50,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:49:50,984 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:49:50,985 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:49:50,986 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-11-06 22:49:51,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6535ccb/da993aa5c29849d1b6fbc825fee057ff/FLAGf40939c36 [2020-11-06 22:49:51,743 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:49:51,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-11-06 22:49:51,756 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6535ccb/da993aa5c29849d1b6fbc825fee057ff/FLAGf40939c36 [2020-11-06 22:49:52,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6535ccb/da993aa5c29849d1b6fbc825fee057ff [2020-11-06 22:49:52,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:49:52,104 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:49:52,107 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:49:52,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:49:52,112 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:49:52,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa32c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52, skipping insertion in model container [2020-11-06 22:49:52,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:49:52,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:49:52,361 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:49:52,374 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:49:52,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:49:52,463 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:49:52,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52 WrapperNode [2020-11-06 22:49:52,465 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:49:52,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:49:52,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:49:52,467 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:49:52,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... [2020-11-06 22:49:52,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:49:52,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:49:52,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:49:52,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:49:52,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-06 22:49:52,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:49:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:49:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:49:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-11-06 22:49:52,673 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-11-06 22:49:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-11-06 22:49:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-11-06 22:49:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-11-06 22:49:52,674 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-11-06 22:49:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-11-06 22:49:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-11-06 22:49:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-11-06 22:49:52,675 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-11-06 22:49:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-11-06 22:49:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-11-06 22:49:52,676 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:49:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:49:52,676 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:49:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:49:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:49:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:49:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-11-06 22:49:52,677 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-11-06 22:49:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-11-06 22:49:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-11-06 22:49:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-11-06 22:49:52,678 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-11-06 22:49:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-11-06 22:49:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-11-06 22:49:52,679 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-11-06 22:49:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-11-06 22:49:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-11-06 22:49:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-11-06 22:49:52,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:49:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:49:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:49:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:49:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:49:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:49:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:49:53,309 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:49:53,310 INFO L298 CfgBuilder]: Removed 4 assume(true) statements. [2020-11-06 22:49:53,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:53 BoogieIcfgContainer [2020-11-06 22:49:53,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:49:53,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:49:53,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:49:53,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:49:53,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:49:52" (1/3) ... [2020-11-06 22:49:53,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7293c292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:53, skipping insertion in model container [2020-11-06 22:49:53,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:49:52" (2/3) ... [2020-11-06 22:49:53,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7293c292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:49:53, skipping insertion in model container [2020-11-06 22:49:53,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:49:53" (3/3) ... [2020-11-06 22:49:53,322 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-11-06 22:49:53,341 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:49:53,346 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:49:53,361 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:49:53,394 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:49:53,395 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:49:53,395 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:49:53,395 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:49:53,395 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:49:53,396 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:49:53,396 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:49:53,396 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:49:53,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2020-11-06 22:49:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-06 22:49:53,429 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:49:53,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:49:53,431 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:49:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:49:53,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1379772032, now seen corresponding path program 1 times [2020-11-06 22:49:53,449 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:49:53,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118548653] [2020-11-06 22:49:53,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:49:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:53,947 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-11-06 22:49:53,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:49:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:49:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:49:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:49:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-11-06 22:49:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:49:54,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:49:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:54,180 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-06 22:49:54,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118548653] [2020-11-06 22:49:54,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:49:54,182 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:49:54,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114341936] [2020-11-06 22:49:54,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:49:54,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:49:54,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:49:54,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:49:54,233 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 6 states. [2020-11-06 22:49:54,490 WARN L194 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-11-06 22:49:56,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:49:56,182 INFO L93 Difference]: Finished difference Result 362 states and 562 transitions. [2020-11-06 22:49:56,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:49:56,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-11-06 22:49:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:49:56,218 INFO L225 Difference]: With dead ends: 362 [2020-11-06 22:49:56,218 INFO L226 Difference]: Without dead ends: 250 [2020-11-06 22:49:56,224 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:49:56,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-11-06 22:49:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 186. [2020-11-06 22:49:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-11-06 22:49:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2020-11-06 22:49:56,338 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 66 [2020-11-06 22:49:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:49:56,338 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2020-11-06 22:49:56,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:49:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2020-11-06 22:49:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-06 22:49:56,347 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:49:56,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:49:56,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:49:56,348 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:49:56,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:49:56,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1159353771, now seen corresponding path program 1 times [2020-11-06 22:49:56,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:49:56,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420130168] [2020-11-06 22:49:56,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:49:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:49:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:49:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:49:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:49:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:49:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:49:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:49:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:56,647 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-06 22:49:56,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420130168] [2020-11-06 22:49:56,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:49:56,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:49:56,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691636341] [2020-11-06 22:49:56,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:49:56,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:49:56,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:49:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:49:56,655 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand 7 states. [2020-11-06 22:49:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:49:57,716 INFO L93 Difference]: Finished difference Result 408 states and 564 transitions. [2020-11-06 22:49:57,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:49:57,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2020-11-06 22:49:57,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:49:57,728 INFO L225 Difference]: With dead ends: 408 [2020-11-06 22:49:57,729 INFO L226 Difference]: Without dead ends: 239 [2020-11-06 22:49:57,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:49:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-11-06 22:49:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 183. [2020-11-06 22:49:57,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2020-11-06 22:49:57,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 242 transitions. [2020-11-06 22:49:57,800 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 242 transitions. Word has length 67 [2020-11-06 22:49:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:49:57,800 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 242 transitions. [2020-11-06 22:49:57,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:49:57,800 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 242 transitions. [2020-11-06 22:49:57,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-11-06 22:49:57,805 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:49:57,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:49:57,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:49:57,806 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:49:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:49:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1279577159, now seen corresponding path program 1 times [2020-11-06 22:49:57,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:49:57,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057897430] [2020-11-06 22:49:57,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:49:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:57,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:49:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:49:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:49:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:49:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:49:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-06 22:49:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:49:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:49:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:49:58,267 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-06 22:49:58,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057897430] [2020-11-06 22:49:58,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:49:58,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-11-06 22:49:58,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668982132] [2020-11-06 22:49:58,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:49:58,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:49:58,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:49:58,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:49:58,271 INFO L87 Difference]: Start difference. First operand 183 states and 242 transitions. Second operand 14 states. [2020-11-06 22:50:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:03,086 INFO L93 Difference]: Finished difference Result 865 states and 1338 transitions. [2020-11-06 22:50:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-11-06 22:50:03,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 73 [2020-11-06 22:50:03,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:03,096 INFO L225 Difference]: With dead ends: 865 [2020-11-06 22:50:03,096 INFO L226 Difference]: Without dead ends: 699 [2020-11-06 22:50:03,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=377, Invalid=1785, Unknown=0, NotChecked=0, Total=2162 [2020-11-06 22:50:03,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-11-06 22:50:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 466. [2020-11-06 22:50:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2020-11-06 22:50:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 663 transitions. [2020-11-06 22:50:03,202 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 663 transitions. Word has length 73 [2020-11-06 22:50:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:03,203 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 663 transitions. [2020-11-06 22:50:03,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:50:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 663 transitions. [2020-11-06 22:50:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-06 22:50:03,206 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:03,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:03,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-06 22:50:03,207 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash -110854073, now seen corresponding path program 1 times [2020-11-06 22:50:03,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:03,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257894932] [2020-11-06 22:50:03,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:03,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-06 22:50:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:03,521 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-06 22:50:03,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257894932] [2020-11-06 22:50:03,523 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:50:03,523 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:50:03,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911767684] [2020-11-06 22:50:03,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:50:03,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:03,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:50:03,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:50:03,528 INFO L87 Difference]: Start difference. First operand 466 states and 663 transitions. Second operand 6 states. [2020-11-06 22:50:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:04,834 INFO L93 Difference]: Finished difference Result 1350 states and 2013 transitions. [2020-11-06 22:50:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:50:04,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2020-11-06 22:50:04,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:04,849 INFO L225 Difference]: With dead ends: 1350 [2020-11-06 22:50:04,849 INFO L226 Difference]: Without dead ends: 901 [2020-11-06 22:50:04,856 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:50:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2020-11-06 22:50:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 743. [2020-11-06 22:50:05,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2020-11-06 22:50:05,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1054 transitions. [2020-11-06 22:50:05,020 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1054 transitions. Word has length 67 [2020-11-06 22:50:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:05,021 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 1054 transitions. [2020-11-06 22:50:05,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:50:05,021 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1054 transitions. [2020-11-06 22:50:05,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-11-06 22:50:05,024 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:05,025 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:05,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-06 22:50:05,025 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash -708580500, now seen corresponding path program 1 times [2020-11-06 22:50:05,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:05,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554197644] [2020-11-06 22:50:05,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:50:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:50:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-11-06 22:50:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:05,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:50:05,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554197644] [2020-11-06 22:50:05,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:50:05,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:50:05,319 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353196474] [2020-11-06 22:50:05,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:50:05,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:05,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:50:05,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:50:05,320 INFO L87 Difference]: Start difference. First operand 743 states and 1054 transitions. Second operand 7 states. [2020-11-06 22:50:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:06,667 INFO L93 Difference]: Finished difference Result 1930 states and 2883 transitions. [2020-11-06 22:50:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:50:06,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2020-11-06 22:50:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:06,680 INFO L225 Difference]: With dead ends: 1930 [2020-11-06 22:50:06,680 INFO L226 Difference]: Without dead ends: 1208 [2020-11-06 22:50:06,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:50:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-11-06 22:50:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1096. [2020-11-06 22:50:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2020-11-06 22:50:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1573 transitions. [2020-11-06 22:50:06,861 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1573 transitions. Word has length 87 [2020-11-06 22:50:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:06,862 INFO L481 AbstractCegarLoop]: Abstraction has 1096 states and 1573 transitions. [2020-11-06 22:50:06,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:50:06,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1573 transitions. [2020-11-06 22:50:06,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-06 22:50:06,872 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:06,872 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:06,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-06 22:50:06,872 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1583944108, now seen corresponding path program 1 times [2020-11-06 22:50:06,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:06,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677229189] [2020-11-06 22:50:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:07,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:50:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,205 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-06 22:50:07,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677229189] [2020-11-06 22:50:07,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606597608] [2020-11-06 22:50:07,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-06 22:50:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:07,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:50:07,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:50:07,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:07,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-11-06 22:50:07,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844155568] [2020-11-06 22:50:07,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:07,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:50:07,652 INFO L87 Difference]: Start difference. First operand 1096 states and 1573 transitions. Second operand 3 states. [2020-11-06 22:50:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:07,973 INFO L93 Difference]: Finished difference Result 2125 states and 3232 transitions. [2020-11-06 22:50:07,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:07,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-11-06 22:50:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:07,988 INFO L225 Difference]: With dead ends: 2125 [2020-11-06 22:50:07,988 INFO L226 Difference]: Without dead ends: 1096 [2020-11-06 22:50:07,999 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:50:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1096 states. [2020-11-06 22:50:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1096 to 1096. [2020-11-06 22:50:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2020-11-06 22:50:08,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 1565 transitions. [2020-11-06 22:50:08,264 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 1565 transitions. Word has length 98 [2020-11-06 22:50:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:08,265 INFO L481 AbstractCegarLoop]: Abstraction has 1096 states and 1565 transitions. [2020-11-06 22:50:08,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 1565 transitions. [2020-11-06 22:50:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-06 22:50:08,274 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:08,274 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:08,489 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-11-06 22:50:08,490 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash 442296715, now seen corresponding path program 1 times [2020-11-06 22:50:08,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:08,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053125207] [2020-11-06 22:50:08,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,729 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:08,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2020-11-06 22:50:08,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:50:08,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053125207] [2020-11-06 22:50:08,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722152777] [2020-11-06 22:50:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:08,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 667 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-06 22:50:09,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:50:09,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:09,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-11-06 22:50:09,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371832499] [2020-11-06 22:50:09,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:09,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:50:09,025 INFO L87 Difference]: Start difference. First operand 1096 states and 1565 transitions. Second operand 3 states. [2020-11-06 22:50:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:09,202 INFO L93 Difference]: Finished difference Result 1902 states and 2868 transitions. [2020-11-06 22:50:09,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:09,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2020-11-06 22:50:09,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:09,211 INFO L225 Difference]: With dead ends: 1902 [2020-11-06 22:50:09,211 INFO L226 Difference]: Without dead ends: 873 [2020-11-06 22:50:09,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:50:09,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2020-11-06 22:50:09,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 866. [2020-11-06 22:50:09,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-11-06 22:50:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1175 transitions. [2020-11-06 22:50:09,365 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1175 transitions. Word has length 98 [2020-11-06 22:50:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:09,366 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 1175 transitions. [2020-11-06 22:50:09,366 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1175 transitions. [2020-11-06 22:50:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-06 22:50:09,370 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:09,370 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:09,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:09,583 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:09,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash 178594704, now seen corresponding path program 1 times [2020-11-06 22:50:09,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:09,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256540512] [2020-11-06 22:50:09,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:09,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:09,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:50:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-06 22:50:09,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256540512] [2020-11-06 22:50:09,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082745070] [2020-11-06 22:50:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:10,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:50:10,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:50:10,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:50:10,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2020-11-06 22:50:10,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83739152] [2020-11-06 22:50:10,210 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:50:10,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:10,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:50:10,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:50:10,212 INFO L87 Difference]: Start difference. First operand 866 states and 1175 transitions. Second operand 12 states. [2020-11-06 22:50:11,115 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:50:11,261 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-06 22:50:11,392 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-06 22:50:12,259 WARN L194 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-11-06 22:50:13,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:13,252 INFO L93 Difference]: Finished difference Result 1790 states and 2589 transitions. [2020-11-06 22:50:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-11-06 22:50:13,253 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2020-11-06 22:50:13,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:13,263 INFO L225 Difference]: With dead ends: 1790 [2020-11-06 22:50:13,263 INFO L226 Difference]: Without dead ends: 1010 [2020-11-06 22:50:13,270 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2020-11-06 22:50:13,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2020-11-06 22:50:13,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 938. [2020-11-06 22:50:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2020-11-06 22:50:13,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1269 transitions. [2020-11-06 22:50:13,414 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1269 transitions. Word has length 99 [2020-11-06 22:50:13,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:13,415 INFO L481 AbstractCegarLoop]: Abstraction has 938 states and 1269 transitions. [2020-11-06 22:50:13,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:50:13,415 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1269 transitions. [2020-11-06 22:50:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-06 22:50:13,418 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:13,419 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:13,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:13,633 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1675690692, now seen corresponding path program 1 times [2020-11-06 22:50:13,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:13,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639345660] [2020-11-06 22:50:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-11-06 22:50:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-11-06 22:50:13,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639345660] [2020-11-06 22:50:13,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788233673] [2020-11-06 22:50:13,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:14,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 33 conjunts are in the unsatisfiable core [2020-11-06 22:50:14,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:50:14,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:50:14,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-11-06 22:50:14,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998833177] [2020-11-06 22:50:14,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-06 22:50:14,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:14,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-06 22:50:14,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:50:14,330 INFO L87 Difference]: Start difference. First operand 938 states and 1269 transitions. Second operand 16 states. [2020-11-06 22:50:14,551 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-11-06 22:50:15,538 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-06 22:50:15,667 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-11-06 22:50:17,193 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-06 22:50:17,334 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-11-06 22:50:17,607 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-06 22:50:18,796 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-06 22:50:18,952 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-11-06 22:50:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:20,783 INFO L93 Difference]: Finished difference Result 3070 states and 4672 transitions. [2020-11-06 22:50:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-11-06 22:50:20,783 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 100 [2020-11-06 22:50:20,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:20,803 INFO L225 Difference]: With dead ends: 3070 [2020-11-06 22:50:20,803 INFO L226 Difference]: Without dead ends: 2060 [2020-11-06 22:50:20,815 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=400, Invalid=2252, Unknown=0, NotChecked=0, Total=2652 [2020-11-06 22:50:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2020-11-06 22:50:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 1910. [2020-11-06 22:50:21,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1910 states. [2020-11-06 22:50:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1910 states to 1910 states and 2760 transitions. [2020-11-06 22:50:21,082 INFO L78 Accepts]: Start accepts. Automaton has 1910 states and 2760 transitions. Word has length 100 [2020-11-06 22:50:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:21,082 INFO L481 AbstractCegarLoop]: Abstraction has 1910 states and 2760 transitions. [2020-11-06 22:50:21,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-06 22:50:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1910 states and 2760 transitions. [2020-11-06 22:50:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-11-06 22:50:21,088 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:21,089 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:50:21,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:21,304 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:21,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:21,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1757734131, now seen corresponding path program 1 times [2020-11-06 22:50:21,305 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:21,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862713139] [2020-11-06 22:50:21,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-06 22:50:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:21,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-06 22:50:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:21,560 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-11-06 22:50:21,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862713139] [2020-11-06 22:50:21,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:50:21,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-06 22:50:21,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573249238] [2020-11-06 22:50:21,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-06 22:50:21,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-06 22:50:21,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:50:21,563 INFO L87 Difference]: Start difference. First operand 1910 states and 2760 transitions. Second operand 7 states. [2020-11-06 22:50:22,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:22,760 INFO L93 Difference]: Finished difference Result 2873 states and 4302 transitions. [2020-11-06 22:50:22,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:50:22,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2020-11-06 22:50:22,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:22,775 INFO L225 Difference]: With dead ends: 2873 [2020-11-06 22:50:22,775 INFO L226 Difference]: Without dead ends: 1633 [2020-11-06 22:50:22,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:50:22,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2020-11-06 22:50:22,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1526. [2020-11-06 22:50:22,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1526 states. [2020-11-06 22:50:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2048 transitions. [2020-11-06 22:50:22,982 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2048 transitions. Word has length 126 [2020-11-06 22:50:22,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:22,982 INFO L481 AbstractCegarLoop]: Abstraction has 1526 states and 2048 transitions. [2020-11-06 22:50:22,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-06 22:50:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2048 transitions. [2020-11-06 22:50:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-11-06 22:50:22,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:22,988 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:22,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:50:22,989 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:22,989 INFO L82 PathProgramCache]: Analyzing trace with hash -935626536, now seen corresponding path program 1 times [2020-11-06 22:50:22,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:22,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217230765] [2020-11-06 22:50:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,194 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-06 22:50:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-11-06 22:50:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:23,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:23,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2020-11-06 22:50:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:23,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-11-06 22:50:23,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217230765] [2020-11-06 22:50:23,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994650078] [2020-11-06 22:50:23,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:23,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:50:23,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:23,641 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-11-06 22:50:23,642 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:23,642 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2020-11-06 22:50:23,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348737555] [2020-11-06 22:50:23,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:23,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:23,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:23,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:50:23,651 INFO L87 Difference]: Start difference. First operand 1526 states and 2048 transitions. Second operand 3 states. [2020-11-06 22:50:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:23,769 INFO L93 Difference]: Finished difference Result 1855 states and 2458 transitions. [2020-11-06 22:50:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:23,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2020-11-06 22:50:23,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:23,775 INFO L225 Difference]: With dead ends: 1855 [2020-11-06 22:50:23,775 INFO L226 Difference]: Without dead ends: 531 [2020-11-06 22:50:23,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:50:23,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2020-11-06 22:50:23,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 511. [2020-11-06 22:50:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2020-11-06 22:50:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 577 transitions. [2020-11-06 22:50:23,849 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 577 transitions. Word has length 144 [2020-11-06 22:50:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:23,849 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 577 transitions. [2020-11-06 22:50:23,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 577 transitions. [2020-11-06 22:50:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2020-11-06 22:50:23,853 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:23,854 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:24,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-11-06 22:50:24,067 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:24,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1877191226, now seen corresponding path program 1 times [2020-11-06 22:50:24,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:24,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622532839] [2020-11-06 22:50:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-11-06 22:50:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-11-06 22:50:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-06 22:50:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-11-06 22:50:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:50:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2020-11-06 22:50:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2020-11-06 22:50:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:24,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2020-11-06 22:50:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,582 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2020-11-06 22:50:24,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622532839] [2020-11-06 22:50:24,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685472830] [2020-11-06 22:50:24,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:24,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:50:24,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 155 proven. 21 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-11-06 22:50:24,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:50:24,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 17 [2020-11-06 22:50:24,953 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524173635] [2020-11-06 22:50:24,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-06 22:50:24,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:24,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-06 22:50:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:50:24,955 INFO L87 Difference]: Start difference. First operand 511 states and 577 transitions. Second operand 17 states. [2020-11-06 22:50:26,362 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-06 22:50:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:29,020 INFO L93 Difference]: Finished difference Result 921 states and 1106 transitions. [2020-11-06 22:50:29,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-11-06 22:50:29,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 200 [2020-11-06 22:50:29,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:29,025 INFO L225 Difference]: With dead ends: 921 [2020-11-06 22:50:29,026 INFO L226 Difference]: Without dead ends: 591 [2020-11-06 22:50:29,028 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=1850, Unknown=0, NotChecked=0, Total=2256 [2020-11-06 22:50:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2020-11-06 22:50:29,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 518. [2020-11-06 22:50:29,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2020-11-06 22:50:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 594 transitions. [2020-11-06 22:50:29,105 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 594 transitions. Word has length 200 [2020-11-06 22:50:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:29,106 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 594 transitions. [2020-11-06 22:50:29,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-06 22:50:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 594 transitions. [2020-11-06 22:50:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2020-11-06 22:50:29,111 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:29,111 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:50:29,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:29,326 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:29,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:29,326 INFO L82 PathProgramCache]: Analyzing trace with hash 928650364, now seen corresponding path program 1 times [2020-11-06 22:50:29,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:29,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225461920] [2020-11-06 22:50:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:29,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,473 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-11-06 22:50:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-06 22:50:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:29,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-11-06 22:50:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2020-11-06 22:50:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-11-06 22:50:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-11-06 22:50:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:50:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2020-11-06 22:50:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-11-06 22:50:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2020-11-06 22:50:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 33 proven. 37 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2020-11-06 22:50:29,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225461920] [2020-11-06 22:50:29,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928325089] [2020-11-06 22:50:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:29,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:29,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-06 22:50:29,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2020-11-06 22:50:30,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:30,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2020-11-06 22:50:30,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133236603] [2020-11-06 22:50:30,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:30,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:50:30,059 INFO L87 Difference]: Start difference. First operand 518 states and 594 transitions. Second operand 3 states. [2020-11-06 22:50:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:30,160 INFO L93 Difference]: Finished difference Result 1098 states and 1263 transitions. [2020-11-06 22:50:30,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:30,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 224 [2020-11-06 22:50:30,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:30,189 INFO L225 Difference]: With dead ends: 1098 [2020-11-06 22:50:30,189 INFO L226 Difference]: Without dead ends: 424 [2020-11-06 22:50:30,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:50:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2020-11-06 22:50:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 401. [2020-11-06 22:50:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2020-11-06 22:50:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 431 transitions. [2020-11-06 22:50:30,245 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 431 transitions. Word has length 224 [2020-11-06 22:50:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:30,246 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 431 transitions. [2020-11-06 22:50:30,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 431 transitions. [2020-11-06 22:50:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-06 22:50:30,248 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:30,249 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:30,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:30,463 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:30,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1112736867, now seen corresponding path program 1 times [2020-11-06 22:50:30,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:30,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810445318] [2020-11-06 22:50:30,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-06 22:50:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:50:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-06 22:50:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:50:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-06 22:50:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2020-11-06 22:50:30,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810445318] [2020-11-06 22:50:30,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528635951] [2020-11-06 22:50:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 935 conjuncts, 3 conjunts are in the unsatisfiable core [2020-11-06 22:50:31,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:31,042 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2020-11-06 22:50:31,042 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:31,043 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 9 [2020-11-06 22:50:31,043 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784331527] [2020-11-06 22:50:31,043 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:31,043 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:31,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:50:31,044 INFO L87 Difference]: Start difference. First operand 401 states and 431 transitions. Second operand 3 states. [2020-11-06 22:50:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:31,090 INFO L93 Difference]: Finished difference Result 565 states and 616 transitions. [2020-11-06 22:50:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:31,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-06 22:50:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:31,093 INFO L225 Difference]: With dead ends: 565 [2020-11-06 22:50:31,093 INFO L226 Difference]: Without dead ends: 397 [2020-11-06 22:50:31,094 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 218 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:50:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2020-11-06 22:50:31,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2020-11-06 22:50:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2020-11-06 22:50:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 422 transitions. [2020-11-06 22:50:31,148 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 422 transitions. Word has length 180 [2020-11-06 22:50:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:31,148 INFO L481 AbstractCegarLoop]: Abstraction has 397 states and 422 transitions. [2020-11-06 22:50:31,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 422 transitions. [2020-11-06 22:50:31,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-11-06 22:50:31,151 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:31,152 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 22:50:31,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-11-06 22:50:31,365 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:31,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash -722371558, now seen corresponding path program 2 times [2020-11-06 22:50:31,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:31,367 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443641404] [2020-11-06 22:50:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-06 22:50:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:50:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-06 22:50:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:50:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,676 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-06 22:50:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2020-11-06 22:50:31,769 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443641404] [2020-11-06 22:50:31,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047660518] [2020-11-06 22:50:31,770 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:31,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:50:31,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:50:31,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:50:31,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2020-11-06 22:50:32,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:50:32,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-11-06 22:50:32,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351960813] [2020-11-06 22:50:32,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:50:32,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:50:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:50:32,020 INFO L87 Difference]: Start difference. First operand 397 states and 422 transitions. Second operand 3 states. [2020-11-06 22:50:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:32,081 INFO L93 Difference]: Finished difference Result 524 states and 560 transitions. [2020-11-06 22:50:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:50:32,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2020-11-06 22:50:32,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:32,085 INFO L225 Difference]: With dead ends: 524 [2020-11-06 22:50:32,085 INFO L226 Difference]: Without dead ends: 382 [2020-11-06 22:50:32,086 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:50:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2020-11-06 22:50:32,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2020-11-06 22:50:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2020-11-06 22:50:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 401 transitions. [2020-11-06 22:50:32,138 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 401 transitions. Word has length 180 [2020-11-06 22:50:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:32,138 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 401 transitions. [2020-11-06 22:50:32,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:50:32,138 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 401 transitions. [2020-11-06 22:50:32,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2020-11-06 22:50:32,141 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:50:32,141 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:50:32,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2020-11-06 22:50:32,356 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:50:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:50:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -387773456, now seen corresponding path program 1 times [2020-11-06 22:50:32,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:50:32,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130396835] [2020-11-06 22:50:32,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:50:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:50:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:50:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-11-06 22:50:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-11-06 22:50:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-11-06 22:50:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-11-06 22:50:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,594 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-11-06 22:50:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-11-06 22:50:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:32,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2020-11-06 22:50:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2020-11-06 22:50:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:50:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2020-11-06 22:50:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2020-11-06 22:50:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-11-06 22:50:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:50:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2020-11-06 22:50:32,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130396835] [2020-11-06 22:50:32,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509975865] [2020-11-06 22:50:32,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:50:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:50:32,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 45 conjunts are in the unsatisfiable core [2020-11-06 22:50:32,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:50:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:50:33,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:50:33,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2020-11-06 22:50:33,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955116898] [2020-11-06 22:50:33,381 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-06 22:50:33,381 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:50:33,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-06 22:50:33,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:50:33,382 INFO L87 Difference]: Start difference. First operand 382 states and 401 transitions. Second operand 25 states. [2020-11-06 22:50:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:50:37,612 INFO L93 Difference]: Finished difference Result 520 states and 549 transitions. [2020-11-06 22:50:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2020-11-06 22:50:37,614 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 181 [2020-11-06 22:50:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:50:37,615 INFO L225 Difference]: With dead ends: 520 [2020-11-06 22:50:37,615 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:50:37,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=397, Invalid=2683, Unknown=0, NotChecked=0, Total=3080 [2020-11-06 22:50:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:50:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:50:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:50:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:50:37,620 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2020-11-06 22:50:37,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:50:37,620 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:50:37,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-06 22:50:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:50:37,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:50:37,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-11-06 22:50:37,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:50:39,478 WARN L194 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 163 [2020-11-06 22:50:41,387 WARN L194 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 163 [2020-11-06 22:50:43,889 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 111 [2020-11-06 22:50:43,993 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2020-11-06 22:50:44,097 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2020-11-06 22:50:45,757 WARN L194 SmtUtils]: Spent 823.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 75 [2020-11-06 22:50:46,971 WARN L194 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 157 DAG size of output: 78 [2020-11-06 22:50:47,618 WARN L194 SmtUtils]: Spent 443.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 77 [2020-11-06 22:50:48,355 WARN L194 SmtUtils]: Spent 729.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 47 [2020-11-06 22:50:48,536 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-11-06 22:50:48,942 WARN L194 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-11-06 22:50:49,123 WARN L194 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-11-06 22:50:49,363 WARN L194 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-06 22:50:49,532 WARN L194 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2020-11-06 22:50:52,702 WARN L194 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 203 DAG size of output: 131 [2020-11-06 22:50:54,633 WARN L194 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 157 DAG size of output: 72 [2020-11-06 22:50:56,202 WARN L194 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 162 DAG size of output: 79 [2020-11-06 22:50:57,267 WARN L194 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 145 DAG size of output: 72 [2020-11-06 22:50:58,167 WARN L194 SmtUtils]: Spent 894.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2020-11-06 22:51:01,297 WARN L194 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 203 DAG size of output: 131 [2020-11-06 22:51:01,406 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2020-11-06 22:51:02,420 WARN L194 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2020-11-06 22:51:02,648 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-11-06 22:51:03,719 WARN L194 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 141 DAG size of output: 94 [2020-11-06 22:51:03,907 WARN L194 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 1 [2020-11-06 22:51:05,361 WARN L194 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 184 DAG size of output: 99 [2020-11-06 22:51:05,524 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 1 [2020-11-06 22:51:07,099 WARN L194 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 146 DAG size of output: 94 [2020-11-06 22:51:07,490 WARN L194 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 74 [2020-11-06 22:51:08,987 WARN L194 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2020-11-06 22:51:09,094 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 1 [2020-11-06 22:51:09,898 WARN L194 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 99 [2020-11-06 22:51:10,082 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 65 [2020-11-06 22:51:10,230 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2020-11-06 22:51:10,383 WARN L194 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2020-11-06 22:51:11,120 WARN L194 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 85 [2020-11-06 22:51:11,281 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 1 [2020-11-06 22:51:12,964 WARN L194 SmtUtils]: Spent 1.68 s on a formula simplification. DAG size of input: 215 DAG size of output: 81 [2020-11-06 22:51:13,377 WARN L194 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2020-11-06 22:51:14,448 WARN L194 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 145 DAG size of output: 72 [2020-11-06 22:51:15,895 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2020-11-06 22:51:17,106 WARN L194 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 154 DAG size of output: 64 [2020-11-06 22:51:17,396 WARN L194 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2020-11-06 22:51:17,402 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2020-11-06 22:51:17,402 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-11-06 22:51:17,403 INFO L266 CegarLoopResult]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2020-11-06 22:51:17,403 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-06 22:51:17,403 INFO L266 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 212 231) no Hoare annotation was computed. [2020-11-06 22:51:17,403 INFO L266 CegarLoopResult]: For program point L220(lines 220 225) no Hoare annotation was computed. [2020-11-06 22:51:17,403 INFO L266 CegarLoopResult]: For program point L216(lines 216 226) no Hoare annotation was computed. [2020-11-06 22:51:17,403 INFO L269 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 212 231) the Hoare annotation is: true [2020-11-06 22:51:17,404 INFO L262 CegarLoopResult]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse16 (= ~c_dr_st~0 0))) (let ((.cse1 (not .cse16)) (.cse8 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= ~q_free~0 0))) (.cse13 (not (= ~c_dr_st~0 2))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse15 (not (= ~p_num_write~0 0))) (.cse11 (not (= ~p_dw_st~0 0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (and (<= exists_runnable_thread_~__retres1~2 1) (<= 1 exists_runnable_thread_~__retres1~2))) (.cse12 (not (= ~c_num_read~0 0))) (.cse17 (not (= ~q_free~0 1))) (.cse5 (not (<= 2 ~q_read_ev~0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~c_dr_pc~0 0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse18 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (let ((.cse4 (+ ~c_num_read~0 1))) (or .cse0 .cse1 .cse2 .cse3 (not (<= ~p_num_write~0 .cse4)) (not (<= .cse4 ~p_num_write~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)) (or .cse11 .cse2 .cse3 .cse12 .cse5 .cse13 .cse6 .cse14 .cse9) (or .cse15 .cse11 .cse2 .cse16 .cse12 .cse3 .cse17 .cse5 .cse6 .cse14 .cse18) (or .cse0 .cse15 .cse11 .cse2 .cse3 .cse12 .cse17 .cse13 .cse5 .cse6 .cse7 .cse18) (or .cse1 .cse2 .cse3 .cse12 .cse5 .cse6 .cse14 .cse7 .cse8 .cse9 (not (= ~p_num_write~0 1)) .cse10) (or .cse11 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse5 .cse13 .cse7 .cse18 .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse2 .cse3 .cse17 .cse6 .cse9) (or .cse15 .cse11 .cse2 .cse3 .cse12 .cse17 .cse5 .cse6 .cse14 .cse7 .cse18)))) [2020-11-06 22:51:17,404 INFO L266 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 212 231) no Hoare annotation was computed. [2020-11-06 22:51:17,404 INFO L266 CegarLoopResult]: For program point L203-1(lines 194 211) no Hoare annotation was computed. [2020-11-06 22:51:17,404 INFO L266 CegarLoopResult]: For program point init_threadsEXIT(lines 194 211) no Hoare annotation was computed. [2020-11-06 22:51:17,405 INFO L262 CegarLoopResult]: At program point init_threadsENTRY(lines 194 211) the Hoare annotation is: (or (not (= ~p_num_write~0 0)) (not (= ~p_dw_i~0 1)) (not (= ~c_num_read~0 0)) (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_dw_st~0 0)) (not (= ~q_free~0 1)) (not (<= 2 ~q_read_ev~0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= ~c_dr_pc~0 0)) (not (= |old(~p_dw_st~0)| 0)) (not (<= 2 ~q_write_ev~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-11-06 22:51:17,405 INFO L266 CegarLoopResult]: For program point L198-1(lines 197 210) no Hoare annotation was computed. [2020-11-06 22:51:17,405 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 351 362) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-11-06 22:51:17,405 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 351 362) no Hoare annotation was computed. [2020-11-06 22:51:17,405 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 351 362) no Hoare annotation was computed. [2020-11-06 22:51:17,406 INFO L266 CegarLoopResult]: For program point L357(line 357) no Hoare annotation was computed. [2020-11-06 22:51:17,406 INFO L262 CegarLoopResult]: At program point L356(line 356) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-11-06 22:51:17,406 INFO L262 CegarLoopResult]: At program point L356-1(line 356) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (= |old(~p_dw_i~0)| 1) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_free~0)| 0)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (<= 2 ~q_write_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 ~q_buf_0~0) (<= 2 ~q_read_ev~0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~0) (= ~c_dr_pc~0 0) (= ~q_free~0 1) (= ~p_dw_i~0 1) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_num_read~0)| 0))) [2020-11-06 22:51:17,406 INFO L262 CegarLoopResult]: At program point do_write_pENTRY(lines 93 135) the Hoare annotation is: (let ((.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse14 (= ~c_dr_st~0 2)) (.cse15 (= |old(~q_free~0)| ~q_free~0)) (.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse18 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse19 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse13 (not (= |old(~p_dw_pc~0)| 1))) (.cse6 (and .cse20 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse11 (and .cse20 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse15 .cse16 .cse17 .cse18 .cse21 .cse19)) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse5 (not (= ~c_num_read~0 0))) (.cse7 (not (<= 2 ~q_read_ev~0))) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= |old(~p_num_write~0)| 0))) (.cse12 (not (= ~c_dr_pc~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12) (or .cse0 .cse1 .cse13 .cse4 .cse7 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse8 .cse10 (and .cse14 (= ~p_last_write~0 ~q_buf_0~0) .cse15 (= ~p_dw_pc~0 1) .cse16 .cse17 .cse18 .cse19) (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse13 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse10) (or (= |old(~c_dr_st~0)| 0) .cse2 .cse11 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse12)))) [2020-11-06 22:51:17,407 INFO L262 CegarLoopResult]: At program point L126(line 126) the Hoare annotation is: (let ((.cse3 (= ~q_free~0 0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0))) (let ((.cse7 (= ~p_dw_pc~0 1)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse5 (= ~c_dr_st~0 2)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse13 (not (= ~c_num_read~0 0))) (.cse10 (not (<= 2 ~q_read_ev~0))) (.cse17 (and .cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse6 .cse8 .cse19)) (.cse11 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~p_num_write~0)| 0))) (.cse14 (not (= ~c_dr_pc~0 0)))) (and (or .cse0 .cse1 .cse2 (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4) .cse6 .cse7 .cse8)) .cse9 .cse10 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse11 .cse12 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or (and .cse5 .cse6 .cse7 .cse8) .cse2 .cse9 .cse13 .cse10 .cse11 .cse14 .cse12) (or (= |old(~c_dr_st~0)| 0) .cse15 .cse16 .cse9 .cse13 .cse10 .cse17 .cse11 .cse18 .cse14) (or .cse0 .cse1 .cse15 .cse16 .cse9 .cse13 .cse10 .cse11 .cse18 (and .cse3 .cse5 .cse6 .cse8 .cse19) .cse12) (or .cse1 .cse15 .cse16 .cse9 .cse13 .cse10 .cse17 .cse11 .cse18 .cse14)))) [2020-11-06 22:51:17,407 INFO L266 CegarLoopResult]: For program point L126-1(line 126) no Hoare annotation was computed. [2020-11-06 22:51:17,407 INFO L266 CegarLoopResult]: For program point L110(lines 109 129) no Hoare annotation was computed. [2020-11-06 22:51:17,407 INFO L266 CegarLoopResult]: For program point do_write_pEXIT(lines 93 135) no Hoare annotation was computed. [2020-11-06 22:51:17,408 INFO L262 CegarLoopResult]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse15 (= |old(~q_free~0)| ~q_free~0)) (.cse16 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse18 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse19 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse15 .cse16 .cse17 .cse18 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse19)) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse8 (not (= |old(~p_num_write~0)| 0))) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse0 (not (<= 2 |old(~q_write_ev~0)|))) (.cse12 (= ~c_dr_st~0 2)) (.cse13 (= ~p_last_write~0 ~q_buf_0~0)) (.cse14 (= ~p_dw_pc~0 1)) (.cse20 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (not (= ~p_dw_i~0 1))) (.cse5 (not (= ~c_num_read~0 0))) (.cse6 (not (<= 2 ~q_read_ev~0))) (.cse7 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= ~c_dr_pc~0 0))) (.cse11 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11) (or (= |old(~c_dr_st~0)| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20 .cse4 .cse6 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse7 .cse11 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or (and .cse12 .cse13 .cse14 .cse16 (or (and .cse15 .cse17 .cse18 .cse19) (not (= ~q_free~0 0)))) .cse20 .cse4 .cse5 .cse6 .cse7 .cse9 .cse11)))) [2020-11-06 22:51:17,408 INFO L262 CegarLoopResult]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse17 (= ~q_free~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse23 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse19 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse24 (= |old(~q_free~0)| ~q_free~0)) (.cse3 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse25 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse26 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse27 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse28 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse11 (and .cse23 .cse19 .cse24 .cse3 .cse25 .cse26 .cse27 .cse28)) (.cse9 (not (= ~c_dr_pc~0 0))) (.cse4 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (= ~p_dw_pc~0 1)) (.cse16 (not (<= 2 |old(~q_write_ev~0)|))) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse6 (not (= ~c_num_read~0 0))) (.cse0 (= ~c_dr_st~0 2)) (.cse7 (not (<= 2 ~q_read_ev~0))) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (= |old(~p_num_write~0)| 0))) (.cse18 (<= 2 ~q_write_ev~0)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse21 (not (= ~c_dr_pc~0 1))) (.cse13 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= ~p_dw_i~0 1))) (.cse14 (and .cse17 .cse19 .cse1 .cse3 .cse20))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or (= |old(~c_dr_st~0)| 0) .cse11 .cse12 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse9) (or .cse16 (and .cse17 .cse18 .cse19 .cse1 .cse3 .cse20) .cse12 .cse11 .cse13 .cse5 .cse6 .cse7 .cse8 .cse15 .cse9) (or .cse21 .cse16 .cse4 (let ((.cse22 (+ ~c_num_read~0 1))) (and .cse17 .cse18 (<= .cse22 ~p_num_write~0) (<= ~p_num_write~0 .cse22) .cse1 .cse2)) (and .cse17 .cse19 .cse1 .cse2 .cse3) .cse5 .cse7 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse8 .cse10 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse16 .cse12 .cse6 (and .cse23 .cse0 .cse24 .cse3 .cse25 .cse26 .cse27 .cse28) .cse7 .cse8 .cse15 (and .cse17 .cse18 .cse1 .cse20) .cse10 .cse21 .cse13 .cse5 .cse14)))) [2020-11-06 22:51:17,408 INFO L266 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2020-11-06 22:51:17,409 INFO L262 CegarLoopResult]: At program point L130(lines 93 135) the Hoare annotation is: (let ((.cse2 (= ~q_free~0 0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse20 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse11 (= ~c_dr_st~0 2)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (<= 2 ~q_read_ev~0)) (.cse7 (= ~p_dw_pc~0 1)) (.cse24 (= ~c_dr_pc~0 0)) (.cse23 (= ~p_dw_i~0 1))) (let ((.cse8 (not (= |old(~p_dw_pc~0)| 1))) (.cse19 (and .cse11 .cse6 .cse22 .cse7 .cse24 .cse23)) (.cse18 (not .cse24)) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse1 (not (<= 2 |old(~q_write_ev~0)|))) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse15 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse9 (not .cse23)) (.cse16 (not (= ~c_num_read~0 0))) (.cse21 (and .cse2 .cse3 .cse5 .cse6 .cse7 .cse20)) (.cse10 (not .cse22)) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse17 (not (= |old(~p_num_write~0)| 0))) (.cse13 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse2 .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4) .cse6 .cse7)) .cse8 .cse9 .cse10 (and .cse2 .cse11 .cse5 .cse6 .cse7) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse12 .cse13 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse14 .cse15 .cse9 .cse16 .cse10 .cse12 .cse17 .cse18 .cse19 .cse13) (or .cse8 .cse9 .cse16 .cse10 .cse12 .cse18 .cse19 .cse13) (or (= |old(~c_dr_st~0)| 0) .cse14 .cse15 .cse9 .cse16 .cse10 .cse12 .cse17 .cse18 (and .cse2 (not (= ~c_dr_st~0 0)) .cse5 .cse6 .cse7 .cse20)) (or .cse1 .cse14 .cse15 .cse9 .cse16 .cse10 .cse21 .cse12 .cse17 .cse18) (or .cse0 .cse1 (and .cse2 .cse11 .cse5 .cse6 .cse7 .cse20) .cse14 .cse15 .cse9 .cse16 .cse21 .cse10 .cse12 .cse17 .cse13)))) [2020-11-06 22:51:17,409 INFO L266 CegarLoopResult]: For program point errorEXIT(lines 7 14) no Hoare annotation was computed. [2020-11-06 22:51:17,409 INFO L266 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-11-06 22:51:17,409 INFO L269 CegarLoopResult]: At program point errorENTRY(lines 7 14) the Hoare annotation is: true [2020-11-06 22:51:17,409 INFO L266 CegarLoopResult]: For program point errorFINAL(lines 7 14) no Hoare annotation was computed. [2020-11-06 22:51:17,409 INFO L262 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 68 92) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse1 (= |old(~c_dr_st~0)| 0)) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= ~q_free~0 1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse18)) (.cse6 (not (= ~c_dr_pc~0 0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~c_num_read~0 0))) (.cse13 (not (<= 2 ~q_read_ev~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (and (= ~c_dr_st~0 2) .cse18)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~p_num_write~0 1))) (.cse16 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (let ((.cse12 (+ ~c_num_read~0 1))) (or .cse11 (not (<= ~p_num_write~0 .cse12)) .cse2 (not (<= .cse12 ~p_num_write~0)) .cse13 .cse14 .cse5 .cse15 .cse8 .cse16)) (or .cse2 .cse17 .cse13 .cse5 .cse14 .cse6 .cse15) (or .cse0 .cse2 .cse17 .cse13 .cse5 .cse6 .cse10 .cse16) (or .cse11 .cse2 .cse17 .cse13 .cse5 .cse14 .cse15 .cse10 .cse16)))) [2020-11-06 22:51:17,410 INFO L266 CegarLoopResult]: For program point L84(lines 84 88) no Hoare annotation was computed. [2020-11-06 22:51:17,410 INFO L266 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-11-06 22:51:17,410 INFO L266 CegarLoopResult]: For program point L84-2(lines 68 92) no Hoare annotation was computed. [2020-11-06 22:51:17,410 INFO L266 CegarLoopResult]: For program point L76(lines 76 80) no Hoare annotation was computed. [2020-11-06 22:51:17,410 INFO L262 CegarLoopResult]: At program point L74(line 74) the Hoare annotation is: (let ((.cse18 (= |old(~p_dw_st~0)| ~p_dw_st~0))) (let ((.cse1 (= |old(~c_dr_st~0)| 0)) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= ~q_free~0 1))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse18)) (.cse6 (not (= ~c_dr_pc~0 0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse17 (not (= ~c_num_read~0 0))) (.cse13 (not (<= 2 ~q_read_ev~0))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (and (= ~c_dr_st~0 2) .cse18)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= ~p_num_write~0 1))) (.cse16 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse0 .cse11 .cse1 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9) (let ((.cse12 (+ ~c_num_read~0 1))) (or .cse11 (not (<= ~p_num_write~0 .cse12)) .cse2 (not (<= .cse12 ~p_num_write~0)) .cse13 .cse14 .cse5 .cse15 .cse8 .cse16)) (or .cse2 .cse17 .cse13 .cse5 .cse14 .cse6 .cse15) (or .cse0 .cse2 .cse17 .cse13 .cse5 .cse6 .cse10 .cse16) (or .cse11 .cse2 .cse17 .cse13 .cse5 .cse14 .cse15 .cse10 .cse16)))) [2020-11-06 22:51:17,411 INFO L262 CegarLoopResult]: At program point L76-2(lines 76 80) the Hoare annotation is: (let ((.cse19 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse20 (<= immediate_notify_threads_~tmp~0 0)) (.cse21 (<= 0 immediate_notify_threads_~tmp~0))) (let ((.cse5 (and (= ~c_dr_st~0 2) .cse19 .cse20 .cse21)) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= ~c_dr_pc~0 1))) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse13 (and (not (= ~c_dr_st~0 0)) (= ~p_dw_st~0 0))) (.cse14 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse16 (= |old(~c_dr_st~0)| 0)) (.cse17 (not (<= 2 |old(~p_dw_st~0)|))) (.cse18 (not (= ~q_free~0 1))) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse15 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) .cse19 .cse20 .cse21)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse9 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~c_dr_pc~0 0))) (.cse10 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8)) (or .cse0 .cse2 .cse9 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse2 .cse9 .cse3 .cse4 .cse5 .cse11 .cse6) (or (not (<= ~p_num_write~0 ~c_num_read~0)) .cse12 .cse13 .cse14 .cse0 .cse15 .cse16 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse2 .cse17 .cse18 .cse4 .cse7) (or .cse12 .cse13 .cse14 .cse10 .cse15 .cse16 .cse2 .cse17 (not (= ~c_num_read~0 1)) .cse18 .cse4 .cse11 .cse7) (or .cse15 .cse2 .cse9 .cse3 .cse4 .cse11 .cse10 .cse8)))) [2020-11-06 22:51:17,411 INFO L266 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 68 92) no Hoare annotation was computed. [2020-11-06 22:51:17,411 INFO L266 CegarLoopResult]: For program point L74-1(line 74) no Hoare annotation was computed. [2020-11-06 22:51:17,411 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:51:17,411 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~c_num_read~0 |old(~c_num_read~0)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= |#NULL.base| |old(#NULL.base)|) (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_free~0 |old(~q_free~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~p_dw_pc~0 |old(~p_dw_pc~0)|) (= ~q_read_ev~0 |old(~q_read_ev~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|)) [2020-11-06 22:51:17,411 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:51:17,412 INFO L262 CegarLoopResult]: At program point evalENTRY(lines 232 285) the Hoare annotation is: (let ((.cse0 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse1 (= ~a_t~0 |old(~a_t~0)|)) (.cse2 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse5 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse6 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse7 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse8 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse9 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse25 (= ~c_dr_st~0 2)) (.cse10 (= |old(~q_free~0)| ~q_free~0)) (.cse11 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse13 (= |old(~c_dr_st~0)| 0)) (.cse18 (not (= |old(~q_free~0)| 0))) (.cse14 (not (= |old(~p_dw_pc~0)| 1))) (.cse17 (not (<= 2 |old(~p_dw_st~0)|))) (.cse20 (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12)) (.cse21 (not (= 2 |old(~c_dr_st~0)|))) (.cse22 (not (= |old(~c_dr_pc~0)| 0))) (.cse4 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse23 (= ~c_dr_pc~0 0)) (.cse24 (= ~c_num_read~0 0)) (.cse31 (= ~p_dw_st~0 0)) (.cse27 (not (= |old(~q_free~0)| 1))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse19 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse29 (not (= |old(~p_num_write~0)| 0))) (.cse30 (not (= |old(~p_dw_st~0)| 0))) (.cse26 (not (= |old(~c_num_read~0)| 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse14 .cse15 .cse16 .cse17 .cse20 .cse18 .cse19 .cse21) (or .cse22 .cse14 .cse15 .cse16 .cse19 (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse8 .cse23 .cse9 .cse24 .cse25 .cse10 .cse11 .cse12) .cse21 .cse26) (or .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse8 .cse23 .cse9 .cse24 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 (not (= |old(~p_num_write~0)| 1)) .cse18 .cse19 .cse26) (or .cse27 .cse14 .cse15 .cse16 .cse17 .cse28 .cse20 .cse19 .cse21) (or .cse22 .cse27 .cse15 .cse16 .cse28 .cse19 .cse29 .cse30 .cse21 .cse26 (and .cse0 .cse1 .cse2 .cse3 .cse8 .cse23 .cse9 .cse24 .cse25 .cse31 .cse10 .cse11 .cse12)) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse22 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse23 .cse9 .cse24 .cse31 .cse10 .cse11 .cse12) .cse27 .cse15 .cse16 .cse28 .cse19 .cse29 .cse30 .cse26)))) [2020-11-06 22:51:17,412 INFO L262 CegarLoopResult]: At program point L256(line 256) the Hoare annotation is: (let ((.cse13 (= ~c_dr_st~0 2)) (.cse26 (<= 2 ~q_read_ev~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse27 (= ~p_dw_pc~0 1)) (.cse18 (= ~c_dr_pc~0 0)) (.cse30 (= ~p_dw_i~0 1)) (.cse19 (= ~c_num_read~0 0))) (let ((.cse21 (= |old(~c_dr_st~0)| 0)) (.cse5 (and .cse13 .cse26 .cse14 .cse27 .cse18 .cse30 .cse19)) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse4 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse8 (not (= |old(~p_dw_st~0)| 0))) (.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse15 (= |old(~q_free~0)| ~q_free~0)) (.cse17 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse16 (= ~c_last_read~0 ~p_last_write~0)) (.cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse10 (not (= |old(~c_num_read~0)| 0))) (.cse22 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (not .cse30)) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse23 (not (<= 2 |old(~p_dw_st~0)|))) (.cse24 (not (= |old(~q_free~0)| 0))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse21 .cse22 .cse2 .cse3 .cse23 .cse24 .cse6 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse6 .cse9) (or .cse0 .cse21 .cse22 .cse2 .cse3 .cse23 (not (= |old(~p_num_write~0)| 1)) .cse24 .cse6 .cse10) (or .cse0 .cse22 .cse2 .cse3 .cse5 .cse6 .cse9 .cse10) (let ((.cse25 (<= 2 ~q_write_ev~0)) (.cse28 (= eval_~tmp___1~0 1)) (.cse29 (= ~c_dr_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse1 .cse4 (and .cse25 .cse13 (<= ~p_num_write~0 ~c_num_read~0) .cse14 .cse26 .cse27 .cse28 (<= ~c_num_read~0 ~p_num_write~0) .cse29) .cse6 .cse7 .cse8 .cse0 (and .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse28 .cse19 .cse20) (and .cse25 .cse13 .cse14 .cse26 .cse16 (= ~q_free~0 1) .cse28 .cse19 .cse20 .cse29) .cse2 .cse3 .cse10)) (or .cse22 .cse2 .cse3 .cse23 .cse24 .cse6 .cse9)))) [2020-11-06 22:51:17,412 INFO L266 CegarLoopResult]: For program point L244(lines 244 248) no Hoare annotation was computed. [2020-11-06 22:51:17,413 INFO L266 CegarLoopResult]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2020-11-06 22:51:17,413 INFO L266 CegarLoopResult]: For program point L242(line 242) no Hoare annotation was computed. [2020-11-06 22:51:17,413 INFO L262 CegarLoopResult]: At program point L240(line 240) the Hoare annotation is: (let ((.cse38 (= ~c_last_read~0 ~p_last_write~0)) (.cse39 (= ~q_free~0 1)) (.cse42 (= ~q_free~0 0)) (.cse44 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 2)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (<= 2 ~q_read_ev~0)) (.cse32 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse40 (= ~p_dw_i~0 1)) (.cse8 (= ~c_num_read~0 0))) (let ((.cse30 (= |old(~c_dr_st~0)| 0)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse20 (and .cse9 .cse36 .cse37 .cse32 .cse6 .cse40 .cse8)) (.cse29 (and .cse42 .cse9 .cse44 .cse36 .cse37 .cse32 .cse40)) (.cse19 (not (= |old(~p_num_write~0)| 0))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse13 (not (= |old(~c_dr_pc~0)| 0))) (.cse33 (and .cse9 .cse44 .cse36 .cse37 .cse32 .cse38 .cse39 .cse40)) (.cse23 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse24 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse2 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse27 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse7 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= |old(~q_free~0)| ~q_free~0)) (.cse11 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (not .cse40)) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse25 (not (<= 2 |old(~p_dw_st~0)|))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 2 |old(~c_dr_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse15 .cse16 .cse25 (and .cse1 .cse2 .cse0 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) .cse28 .cse18 .cse22) (or .cse29 .cse30 (and .cse1 .cse2 .cse3 .cse31 .cse26 .cse4 .cse27 .cse5 .cse7 .cse32 .cse10 .cse11 .cse12) .cse24 .cse15 .cse16 .cse25 .cse28 .cse18 .cse33 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse29 .cse24 (not (= |old(~p_num_write~0)| 1)) .cse18 (and .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12) .cse13 .cse30 .cse15 .cse16 .cse25 .cse28 .cse33 .cse23) (or .cse13 .cse24 .cse15 .cse16 .cse20 .cse18 .cse22 .cse23) (let ((.cse45 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse43 (not (= ~c_dr_st~0 0))) (.cse35 (= ~p_dw_st~0 0)) (.cse34 (<= 2 ~q_write_ev~0)) (.cse41 (= ~c_dr_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse29 .cse14 (and .cse34 .cse9 .cse35 .cse36 .cse37 .cse38 (= eval_~tmp___1~0 1) .cse39 .cse40 .cse8 .cse12 .cse41) .cse17 (and .cse42 .cse43 .cse44 .cse36 .cse37 .cse32 .cse45 .cse6 .cse8) (and .cse42 .cse34 .cse44 .cse36 .cse37 .cse32 .cse45 .cse6 .cse8) .cse18 (and .cse42 .cse43 .cse44 .cse36 (<= 1 ~c_dr_pc~0) .cse37 .cse32) .cse19 .cse21 (and .cse34 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse35 .cse36 .cse37 .cse32 .cse38 .cse39 .cse40 (<= ~c_num_read~0 ~p_num_write~0) .cse41) .cse13 .cse15 .cse16 .cse33 (let ((.cse46 (+ ~c_num_read~0 1))) (and .cse42 .cse34 (<= .cse46 ~p_num_write~0) (<= ~p_num_write~0 .cse46) .cse44 .cse36 .cse37 .cse32 .cse41)) .cse23 (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))) (or .cse14 .cse24 (and .cse1 .cse2 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse32 .cse10 .cse11 .cse12) .cse15 .cse16 .cse25 .cse17 .cse18 .cse22)))) [2020-11-06 22:51:17,414 INFO L262 CegarLoopResult]: At program point L271(line 271) the Hoare annotation is: (let ((.cse0 (= |old(~c_dr_st~0)| 0)) (.cse10 (not (= |old(~c_dr_pc~0)| 0))) (.cse7 (not (= |old(~q_free~0)| 1))) (.cse8 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse21 (not (= |old(~p_num_write~0)| 0))) (.cse22 (not (= |old(~p_dw_st~0)| 0))) (.cse11 (not (= |old(~c_num_read~0)| 0))) (.cse1 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse7 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse6 .cse11) (or .cse10 .cse1 .cse2 .cse3 .cse6 .cse9 .cse11) (let ((.cse19 (= ~c_dr_pc~0 0)) (.cse20 (= ~c_num_read~0 0)) (.cse12 (= ~q_free~0 0)) (.cse13 (<= 2 ~q_write_ev~0)) (.cse14 (not (= ~c_dr_st~0 0))) (.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (<= 2 ~q_read_ev~0)) (.cse18 (= ~p_dw_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse19 .cse20) .cse7 .cse8 .cse6 .cse21 .cse22 .cse10 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) .cse14 (= ~p_dw_st~0 0) .cse16 (= |old(~q_free~0)| ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse19 (= eval_~tmp___1~0 1) .cse20 (= ~p_num_write~0 |old(~p_num_write~0)|)) .cse2 .cse3 (let ((.cse23 (+ ~c_num_read~0 1))) (and .cse12 .cse13 (<= .cse23 ~p_num_write~0) .cse14 (<= ~p_num_write~0 .cse23) .cse15 .cse16 .cse17 .cse18 (= ~c_dr_pc~0 1))) .cse11)) (or .cse10 .cse7 .cse2 .cse3 .cse8 .cse6 .cse21 .cse22 .cse9 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9))) [2020-11-06 22:51:17,414 INFO L266 CegarLoopResult]: For program point L253(lines 253 260) no Hoare annotation was computed. [2020-11-06 22:51:17,414 INFO L266 CegarLoopResult]: For program point evalEXIT(lines 232 285) no Hoare annotation was computed. [2020-11-06 22:51:17,414 INFO L266 CegarLoopResult]: For program point L249(lines 239 279) no Hoare annotation was computed. [2020-11-06 22:51:17,415 INFO L262 CegarLoopResult]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse17 (= ~c_dr_pc~0 0)) (.cse18 (= ~c_num_read~0 0)) (.cse24 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse25 (= ~a_t~0 |old(~a_t~0)|)) (.cse36 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse26 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse37 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse28 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse38 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse29 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse30 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse31 (= |old(~q_free~0)| ~q_free~0)) (.cse32 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse33 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse11 (= ~q_free~0 0)) (.cse39 (= ~c_dr_st~0 2)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (<= 2 ~q_read_ev~0)) (.cse16 (= ~p_dw_pc~0 1)) (.cse40 (= ~p_dw_i~0 1))) (let ((.cse19 (not (= |old(~p_num_write~0)| 0))) (.cse20 (not (= |old(~p_dw_st~0)| 0))) (.cse8 (and .cse11 .cse39 .cse13 .cse14 .cse15 .cse16 .cse40)) (.cse27 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse34 (= |old(~c_dr_st~0)| 0)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse22 (and .cse39 .cse13 .cse14 .cse15 .cse16 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1) .cse40)) (.cse9 (not (= |old(~q_free~0)| 1))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse4 (and .cse24 .cse25 .cse36 .cse26 .cse37 .cse28 .cse38 .cse29 .cse30 .cse39 .cse31 .cse32 .cse33)) (.cse21 (not (= |old(~c_dr_pc~0)| 0))) (.cse0 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (not .cse40)) (.cse2 (not (<= 2 |old(~q_read_ev~0)|))) (.cse35 (and .cse39 .cse14 .cse15 .cse16 .cse17 .cse40 .cse18)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= 2 |old(~c_dr_st~0)|))) (.cse23 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse12 (not (= ~c_dr_st~0 0)))) (or .cse8 (not (<= 2 |old(~q_write_ev~0)|)) .cse9 .cse10 (and .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse17 .cse18) (and .cse11 .cse12 .cse13 .cse14 (<= 1 ~c_dr_pc~0) .cse15 .cse16) .cse6 .cse19 .cse20 .cse21 .cse1 .cse2 .cse22 .cse23)) (or .cse8 .cse0 (not (= |old(~p_num_write~0)| 1)) .cse6 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse17 .cse30 .cse18 .cse16 .cse31 .cse32 .cse33) .cse21 .cse34 .cse1 .cse2 .cse3 .cse5 .cse22 .cse23) (or .cse21 .cse9 .cse1 .cse2 .cse10 .cse6 .cse19 .cse35 .cse20 .cse7 .cse23) (or .cse8 (and .cse24 .cse25 .cse36 .cse26 .cse27 .cse37 .cse28 .cse38 .cse29 .cse30 .cse31 .cse32 .cse33) .cse34 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse9 .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse6 .cse7) (or .cse21 .cse0 .cse1 .cse2 .cse35 .cse6 .cse7 .cse23)))) [2020-11-06 22:51:17,415 INFO L266 CegarLoopResult]: For program point L268(lines 268 275) no Hoare annotation was computed. [2020-11-06 22:51:17,415 INFO L262 CegarLoopResult]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse38 (= ~c_last_read~0 ~p_last_write~0)) (.cse39 (= ~q_free~0 1)) (.cse42 (= ~q_free~0 0)) (.cse44 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 2)) (.cse36 (= ~p_last_write~0 ~q_buf_0~0)) (.cse37 (<= 2 ~q_read_ev~0)) (.cse32 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse40 (= ~p_dw_i~0 1)) (.cse8 (= ~c_num_read~0 0))) (let ((.cse30 (= |old(~c_dr_st~0)| 0)) (.cse28 (not (= |old(~q_free~0)| 0))) (.cse20 (and .cse9 .cse36 .cse37 .cse32 .cse6 .cse40 .cse8)) (.cse29 (and .cse42 .cse9 .cse44 .cse36 .cse37 .cse32 .cse40)) (.cse19 (not (= |old(~p_num_write~0)| 0))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse13 (not (= |old(~c_dr_pc~0)| 0))) (.cse33 (and .cse9 .cse44 .cse36 .cse37 .cse32 .cse38 .cse39 .cse40)) (.cse23 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (not (= |old(~q_free~0)| 1))) (.cse24 (not (= |old(~p_dw_pc~0)| 1))) (.cse1 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse2 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse26 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse27 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse7 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse10 (= |old(~q_free~0)| ~q_free~0)) (.cse11 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse15 (not .cse40)) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse25 (not (<= 2 |old(~p_dw_st~0)|))) (.cse17 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse22 (not (= 2 |old(~c_dr_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse24 .cse15 .cse16 .cse25 (and .cse1 .cse2 .cse0 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12) .cse28 .cse18 .cse22) (or .cse29 .cse30 (and .cse1 .cse2 .cse3 .cse31 .cse26 .cse4 .cse27 .cse5 .cse7 .cse32 .cse10 .cse11 .cse12) .cse24 .cse15 .cse16 .cse25 .cse28 .cse18 .cse33 (not (<= 1 |old(~c_dr_pc~0)|))) (or .cse29 .cse24 (not (= |old(~p_num_write~0)| 1)) .cse18 (and .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse32 .cse10 .cse11 .cse12) .cse13 .cse30 .cse15 .cse16 .cse25 .cse28 .cse33 .cse23) (or .cse13 .cse24 .cse15 .cse16 .cse20 .cse18 .cse22 .cse23) (let ((.cse45 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0)) (.cse43 (not (= ~c_dr_st~0 0))) (.cse35 (= ~p_dw_st~0 0)) (.cse34 (<= 2 ~q_write_ev~0)) (.cse41 (= ~c_dr_pc~0 1))) (or (not (<= 2 |old(~q_write_ev~0)|)) .cse29 .cse14 (and .cse34 .cse9 .cse35 .cse36 .cse37 .cse38 (= eval_~tmp___1~0 1) .cse39 .cse40 .cse8 .cse12 .cse41) .cse17 (and .cse42 .cse43 .cse44 .cse36 .cse37 .cse32 .cse45 .cse6 .cse8) (and .cse42 .cse34 .cse44 .cse36 .cse37 .cse32 .cse45 .cse6 .cse8) .cse18 (and .cse42 .cse43 .cse44 .cse36 (<= 1 ~c_dr_pc~0) .cse37 .cse32) .cse19 .cse21 (and .cse34 .cse9 (<= ~p_num_write~0 ~c_num_read~0) .cse35 .cse36 .cse37 .cse32 .cse38 .cse39 .cse40 (<= ~c_num_read~0 ~p_num_write~0) .cse41) .cse13 .cse15 .cse16 .cse33 (let ((.cse46 (+ ~c_num_read~0 1))) (and .cse42 .cse34 (<= .cse46 ~p_num_write~0) (<= ~p_num_write~0 .cse46) .cse44 .cse36 .cse37 .cse32 .cse41)) .cse23 (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12))) (or .cse14 .cse24 (and .cse1 .cse2 .cse3 .cse26 .cse4 .cse27 .cse5 .cse7 .cse9 .cse32 .cse10 .cse11 .cse12) .cse15 .cse16 .cse25 .cse17 .cse18 .cse22)))) [2020-11-06 22:51:17,415 INFO L269 CegarLoopResult]: At program point L301(lines 290 303) the Hoare annotation is: true [2020-11-06 22:51:17,416 INFO L266 CegarLoopResult]: For program point L294(lines 294 299) no Hoare annotation was computed. [2020-11-06 22:51:17,416 INFO L266 CegarLoopResult]: For program point stop_simulationEXIT(lines 286 304) no Hoare annotation was computed. [2020-11-06 22:51:17,416 INFO L269 CegarLoopResult]: At program point L292(line 292) the Hoare annotation is: true [2020-11-06 22:51:17,416 INFO L269 CegarLoopResult]: At program point stop_simulationENTRY(lines 286 304) the Hoare annotation is: true [2020-11-06 22:51:17,416 INFO L266 CegarLoopResult]: For program point L292-1(line 292) no Hoare annotation was computed. [2020-11-06 22:51:17,416 INFO L266 CegarLoopResult]: For program point stop_simulationFINAL(lines 286 304) no Hoare annotation was computed. [2020-11-06 22:51:17,416 INFO L262 CegarLoopResult]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse12 (not (= ~c_num_read~0 0))) (.cse13 (not (<= 2 ~q_read_ev~0))) (.cse3 (not (= ~c_num_read~0 1))) (.cse6 (not (= ~c_dr_pc~0 0))) (.cse17 (not (<= 2 ~p_dw_st~0))) (.cse11 (not (= ~p_num_write~0 1))) (.cse14 (not (= ~c_dr_pc~0 1))) (.cse15 (not (<= ~c_num_read~0 ~p_num_write~0))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse16 (not (<= ~p_num_write~0 ~c_num_read~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (= ~c_dr_st~0 0)) (.cse4 (not (= ~q_free~0 1))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse10 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse11 (not (= ~q_free~0 0))) (or .cse14 .cse15 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse17 .cse9 .cse10) (or .cse1 .cse12 .cse13 (not (= ~c_dr_st~0 2)) .cse5 .cse6 .cse7) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse17 .cse9 .cse10 .cse11) (or .cse14 .cse15 .cse0 .cse16 .cse1 .cse2 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2020-11-06 22:51:17,417 INFO L269 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 49 67) the Hoare annotation is: true [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point L54(lines 54 59) no Hoare annotation was computed. [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point L53(lines 53 62) no Hoare annotation was computed. [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 49 67) no Hoare annotation was computed. [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 49 67) no Hoare annotation was computed. [2020-11-06 22:51:17,417 INFO L262 CegarLoopResult]: At program point start_simulationENTRY(lines 305 333) the Hoare annotation is: (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_i~0 1)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-11-06 22:51:17,417 INFO L266 CegarLoopResult]: For program point L320(line 320) no Hoare annotation was computed. [2020-11-06 22:51:17,418 INFO L262 CegarLoopResult]: At program point L319(line 319) the Hoare annotation is: (let ((.cse5 (not (= ~c_dr_st~0 0))) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 2)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~c_num_read~0 0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~p_dw_st~0 0) .cse0 (= |old(~q_free~0)| ~q_free~0) .cse1 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse2 .cse3 (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse8 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse9 .cse6 .cse0 .cse7 .cse8 .cse1 (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and .cse4 .cse9 .cse6 .cse0 .cse7 .cse8) (not (= ~p_dw_i~0 1)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse9 .cse0 .cse7 .cse8 .cse2 .cse3) (not (= |old(~c_num_read~0)| 0)))) [2020-11-06 22:51:17,418 INFO L262 CegarLoopResult]: At program point L319-1(line 319) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_st~0 0))) (.cse0 (= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (<= 2 ~q_read_ev~0)) (.cse5 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~c_num_read~0 0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 (<= 1 ~c_dr_pc~0) .cse4 .cse5) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse8 .cse2 .cse3 .cse4 .cse5 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5) (not (= ~p_dw_i~0 1)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse8 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~c_num_read~0)| 0)))) [2020-11-06 22:51:17,418 INFO L266 CegarLoopResult]: For program point L316(line 316) no Hoare annotation was computed. [2020-11-06 22:51:17,418 INFO L266 CegarLoopResult]: For program point start_simulationEXIT(lines 305 333) no Hoare annotation was computed. [2020-11-06 22:51:17,419 INFO L262 CegarLoopResult]: At program point L315-1(lines 312 327) the Hoare annotation is: (let ((.cse5 (not (= ~c_dr_st~0 0))) (.cse1 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~q_free~0 0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse9 (= ~c_dr_st~0 2)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= 2 ~q_read_ev~0)) (.cse8 (= ~p_dw_pc~0 1)) (.cse2 (= ~c_dr_pc~0 0)) (.cse3 (= ~c_num_read~0 0))) (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~q_free~0)| 1)) (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~p_dw_st~0 0) .cse0 (= |old(~q_free~0)| ~q_free~0) .cse1 (= ~q_write_ev~0 |old(~q_write_ev~0)|) .cse2 .cse3 (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse4 .cse5 .cse6 .cse0 .cse7 .cse8 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse0 (<= 1 ~c_dr_pc~0) .cse7 .cse8) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and .cse9 .cse6 .cse0 .cse7 .cse8 .cse1 (= ~q_free~0 1)) (not (= |old(~c_dr_pc~0)| 0)) (and .cse4 .cse9 .cse6 .cse0 .cse7 .cse8) (not (= ~p_dw_i~0 1)) (not (<= 2 |old(~q_read_ev~0)|)) (and .cse9 .cse0 .cse7 .cse8 .cse2 .cse3) (not (= |old(~c_num_read~0)| 0)))) [2020-11-06 22:51:17,419 INFO L262 CegarLoopResult]: At program point L312(line 312) the Hoare annotation is: (or (not (<= 2 |old(~q_write_ev~0)|)) (not (= |old(~c_dr_pc~0)| 0)) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~p_last_write~0 |old(~p_last_write~0)|) (= ~c_num_read~0 0) (= ~p_dw_st~0 0) (= |old(~q_free~0)| ~q_free~0) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (= |old(~q_free~0)| 1)) (not (= ~p_dw_i~0 1)) (not (<= 2 |old(~q_read_ev~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (not (= |old(~c_num_read~0)| 0))) [2020-11-06 22:51:17,419 INFO L269 CegarLoopResult]: At program point L328(lines 305 333) the Hoare annotation is: true [2020-11-06 22:51:17,419 INFO L266 CegarLoopResult]: For program point L322(lines 322 326) no Hoare annotation was computed. [2020-11-06 22:51:17,419 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:51:17,419 INFO L262 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~q_free~0 0) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~p_dw_i~0 1)) (= ~p_num_write~0 0) (= ~c_dr_pc~0 0) (= ~c_num_read~0 0)) [2020-11-06 22:51:17,419 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:51:17,420 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:51:17,420 INFO L266 CegarLoopResult]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2020-11-06 22:51:17,420 INFO L266 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 30 48) no Hoare annotation was computed. [2020-11-06 22:51:17,420 INFO L266 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 30 48) no Hoare annotation was computed. [2020-11-06 22:51:17,420 INFO L262 CegarLoopResult]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_pc~0 1))) (.cse10 (not (= ~p_num_write~0 1))) (.cse7 (not (= ~q_free~0 0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse8 (not (= ~c_num_read~0 0))) (.cse3 (not (<= 2 ~q_read_ev~0))) (.cse4 (not (= ~c_dr_st~0 2))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse9 (not (= ~c_dr_pc~0 0)))) (and (let ((.cse1 (+ ~c_num_read~0 1))) (or .cse0 (not (<= ~p_num_write~0 .cse1)) .cse2 (not (<= .cse1 ~p_num_write~0)) .cse3 .cse4 .cse5 .cse6 (not (= ~p_dw_pc~0 1)) .cse7)) (or .cse2 .cse8 .cse3 .cse5 .cse9 .cse6 .cse10 .cse7) (or .cse0 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse10 .cse7) (or .cse2 .cse8 .cse3 .cse4 .cse5 .cse6 .cse9))) [2020-11-06 22:51:17,420 INFO L269 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 30 48) the Hoare annotation is: true [2020-11-06 22:51:17,420 INFO L266 CegarLoopResult]: For program point L35(lines 35 40) no Hoare annotation was computed. [2020-11-06 22:51:17,421 INFO L266 CegarLoopResult]: For program point L34(lines 34 43) no Hoare annotation was computed. [2020-11-06 22:51:17,421 INFO L266 CegarLoopResult]: For program point do_read_cEXIT(lines 137 193) no Hoare annotation was computed. [2020-11-06 22:51:17,421 INFO L262 CegarLoopResult]: At program point L188(lines 137 193) the Hoare annotation is: (let ((.cse17 (= ~c_num_read~0 1)) (.cse1 (= ~c_dr_st~0 2)) (.cse10 (<= 2 ~p_dw_st~0)) (.cse22 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (<= 2 ~q_read_ev~0)) (.cse24 (= ~p_dw_pc~0 1)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~q_free~0 1)) (.cse23 (= ~p_dw_i~0 1)) (.cse25 (= ~p_num_write~0 1))) (let ((.cse18 (not .cse25)) (.cse9 (not (= |old(~c_dr_pc~0)| 1))) (.cse13 (not (<= 2 |old(~p_dw_st~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse20 (and .cse25 .cse17 .cse1 .cse10 .cse22 .cse3 .cse24 .cse4 .cse5 .cse23)) (.cse16 (not .cse24)) (.cse19 (not (= |old(~c_dr_pc~0)| 0))) (.cse8 (= |old(~c_dr_st~0)| 0)) (.cse11 (not .cse23)) (.cse12 (not (<= 2 |old(~q_read_ev~0)|))) (.cse15 (not .cse22)) (.cse2 (= ~p_dw_st~0 0)) (.cse6 (= ~c_dr_pc~0 1)) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse21 (not (= |old(~c_num_read~0)| 0)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (not (<= ~p_num_write~0 .cse0)) (and .cse1 (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 .cse4 .cse5 (<= ~c_num_read~0 ~p_num_write~0) .cse6) .cse7 .cse8 .cse9 (and .cse1 .cse10 .cse3 .cse4 .cse5) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or (and .cse17 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) .cse7 .cse18 .cse19 .cse8 .cse11 .cse12 .cse13 .cse15 .cse14 .cse20 .cse21 .cse16) (or .cse7 .cse18 .cse8 .cse2 .cse9 .cse11 .cse12 .cse13 .cse15 .cse14 .cse20 .cse21 .cse16) (or .cse19 .cse8 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse11 .cse12 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse15 (not (= |old(~p_dw_st~0)| 0)) (and .cse1 .cse2 .cse3 (= |old(~q_free~0)| ~q_free~0) .cse4 (= ~c_num_read~0 0) .cse6) .cse7 .cse21)))) [2020-11-06 22:51:17,421 INFO L266 CegarLoopResult]: For program point L153(lines 152 187) no Hoare annotation was computed. [2020-11-06 22:51:17,421 INFO L262 CegarLoopResult]: At program point L184(line 184) the Hoare annotation is: (let ((.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse6 (not (= |old(~c_num_read~0)| 0))) (.cse1 (= |old(~c_dr_st~0)| 0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse2 .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (= |old(~p_dw_st~0)| 0)) .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6 .cse9 (not (= ~p_num_write~0 1))) (let ((.cse10 (+ |old(~c_num_read~0)| 1))) (or .cse1 (not (<= .cse10 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse10)) .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9)))) [2020-11-06 22:51:17,422 INFO L262 CegarLoopResult]: At program point L184-1(lines 140 192) the Hoare annotation is: (let ((.cse4 (= ~p_dw_i~0 1)) (.cse26 (+ |old(~c_num_read~0)| 1))) (let ((.cse13 (not (= |old(~c_dr_pc~0)| 0))) (.cse7 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse8 (= ~a_t~0 |old(~a_t~0)|)) (.cse9 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse10 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse11 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 0)) (.cse20 (not (= |old(~c_num_read~0)| 0))) (.cse23 (= .cse26 ~c_num_read~0)) (.cse6 (not (= ~p_num_write~0 1))) (.cse21 (= ~p_dw_st~0 0)) (.cse22 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse14 (= |old(~c_dr_st~0)| 0)) (.cse0 (<= 2 ~p_dw_st~0)) (.cse1 (<= 2 ~q_read_ev~0)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= ~q_free~0 1)) (.cse25 (not (= |old(~c_dr_pc~0)| 1))) (.cse15 (not .cse4)) (.cse16 (not (<= 2 |old(~q_read_ev~0)|))) (.cse17 (not (<= 2 |old(~p_dw_st~0)|))) (.cse19 (not (= |old(~q_free~0)| 0))) (.cse18 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse24 (not (= ~p_dw_pc~0 1)))) (and (or (and (= ~c_num_read~0 1) .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 (= |old(~q_free~0)| ~q_free~0) .cse11 (= ~c_dr_pc~0 0) .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (and (not (= ~c_dr_st~0 0)) .cse21 .cse22 .cse1 .cse2 .cse3 .cse4 .cse23) .cse24) (or .cse13 .cse14 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) (and .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse3 .cse12) .cse15 .cse16 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse18 (not (= |old(~p_dw_st~0)| 0)) .cse5 .cse20) (or .cse14 .cse25 .cse15 .cse16 .cse17 .cse18 .cse19 .cse5 .cse20 .cse23 .cse24 .cse6) (or (not (<= .cse26 ~p_num_write~0)) (not (<= ~p_num_write~0 .cse26)) (and .cse21 (<= ~p_num_write~0 ~c_num_read~0) .cse1 .cse22 .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse14 (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse25 .cse15 .cse16 .cse17 .cse19 .cse18 .cse24)))) [2020-11-06 22:51:17,422 INFO L262 CegarLoopResult]: At program point L145(lines 140 192) the Hoare annotation is: (let ((.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse1 (= |old(~c_dr_st~0)| 0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse6 (not (= |old(~c_num_read~0)| 0))) (.cse11 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse2 .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (= |old(~p_dw_st~0)| 0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or .cse1 (not (<= .cse7 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (let ((.cse8 (+ ~c_num_read~0 1))) (and (= ~c_last_read~0 |old(~c_last_read~0)|) (= ~a_t~0 |old(~a_t~0)|) (= |old(~q_read_ev~0)| ~q_read_ev~0) (<= .cse8 ~p_num_write~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_num_write~0 .cse8) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_dr_pc~0 1))) (not (<= ~p_num_write~0 .cse7)) .cse2 .cse3 .cse9 .cse10 .cse4 .cse5 .cse11)) (or .cse0 .cse1 .cse2 .cse3 .cse9 .cse10 .cse4 .cse5 .cse6 .cse11 (not (= ~p_num_write~0 1))))) [2020-11-06 22:51:17,422 INFO L266 CegarLoopResult]: For program point L174(lines 174 186) no Hoare annotation was computed. [2020-11-06 22:51:17,422 INFO L266 CegarLoopResult]: For program point L141(lines 141 149) no Hoare annotation was computed. [2020-11-06 22:51:17,423 INFO L262 CegarLoopResult]: At program point do_read_cENTRY(lines 137 193) the Hoare annotation is: (let ((.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse17 (not (= ~p_dw_pc~0 1))) (.cse8 (not (= |old(~c_dr_pc~0)| 0))) (.cse9 (= |old(~c_dr_st~0)| 0)) (.cse0 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse1 (= ~a_t~0 |old(~a_t~0)|)) (.cse2 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse4 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~c_dr_pc~0 0)) (.cse7 (= ~c_num_read~0 0)) (.cse10 (not (= ~p_dw_i~0 1))) (.cse11 (not (<= 2 |old(~q_read_ev~0)|))) (.cse14 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse16 (not (= |old(~c_num_read~0)| 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (not (= ~p_num_write~0 1))) (let ((.cse18 (+ |old(~c_num_read~0)| 1))) (or .cse9 (not (<= .cse18 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (let ((.cse19 (+ ~c_num_read~0 1))) (and .cse0 .cse1 .cse2 (<= .cse19 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse19) .cse4 .cse5 (= ~c_dr_pc~0 1))) (not (<= ~p_num_write~0 .cse18)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17)) (or .cse8 .cse9 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 0) .cse4 .cse6 .cse7) .cse10 .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse14 (not (= |old(~p_dw_st~0)| 0)) .cse15 .cse16))) [2020-11-06 22:51:17,423 INFO L266 CegarLoopResult]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2020-11-06 22:51:17,423 INFO L262 CegarLoopResult]: At program point L179(line 179) the Hoare annotation is: (let ((.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse6 (not (= |old(~c_num_read~0)| 0))) (.cse1 (= |old(~c_dr_st~0)| 0)) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~q_read_ev~0)|))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 .cse1 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse2 .cse3 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse4 (not (= |old(~p_dw_st~0)| 0)) .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6 .cse9 (not (= ~p_num_write~0 1))) (let ((.cse10 (+ |old(~c_num_read~0)| 1))) (or .cse1 (not (<= .cse10 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse10)) .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse9)))) [2020-11-06 22:51:17,423 INFO L266 CegarLoopResult]: For program point L144(lines 144 148) no Hoare annotation was computed. [2020-11-06 22:51:17,423 INFO L266 CegarLoopResult]: For program point L175(lines 175 181) no Hoare annotation was computed. [2020-11-06 22:51:17,424 INFO L262 CegarLoopResult]: At program point L171(line 171) the Hoare annotation is: (let ((.cse0 (not (= |old(~c_dr_pc~0)| 0))) (.cse12 (not (= |old(~c_num_read~0)| 0))) (.cse5 (= |old(~c_dr_st~0)| 0)) (.cse6 (not (= ~p_dw_i~0 1))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= ~q_free~0 1)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (= ~p_dw_pc~0 1)))) (and (or .cse0 (and (= ~c_num_read~0 1) .cse1 .cse2 .cse3 (= ~c_dr_pc~0 0) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (not (= ~p_num_write~0 1))) (or .cse0 .cse5 (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse6 .cse7 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse10 (not (= |old(~p_dw_st~0)| 0)) .cse11 .cse12) (let ((.cse14 (+ |old(~c_num_read~0)| 1))) (or .cse5 (not (<= .cse14 ~p_num_write~0)) (not (= |old(~c_dr_pc~0)| 1)) (not (<= ~p_num_write~0 .cse14)) .cse6 .cse7 .cse8 (and .cse1 (<= ~p_num_write~0 ~c_num_read~0) .cse2 .cse3 .cse4 (<= ~c_num_read~0 ~p_num_write~0) (= ~c_dr_pc~0 1)) .cse9 .cse10 .cse11 .cse13)))) [2020-11-06 22:51:17,424 INFO L266 CegarLoopResult]: For program point L171-1(line 171) no Hoare annotation was computed. [2020-11-06 22:51:17,424 INFO L266 CegarLoopResult]: For program point init_modelFINAL(lines 334 350) no Hoare annotation was computed. [2020-11-06 22:51:17,424 INFO L266 CegarLoopResult]: For program point init_modelEXIT(lines 334 350) no Hoare annotation was computed. [2020-11-06 22:51:17,424 INFO L262 CegarLoopResult]: At program point init_modelENTRY(lines 334 350) the Hoare annotation is: (or (not (= |old(~c_dr_pc~0)| 0)) (not (= ~p_dw_st~0 0)) (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= |old(~c_dr_i~0)| ~c_dr_i~0) (= |old(~q_free~0)| ~q_free~0) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~c_dr_pc~0 0) (= ~c_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (= |old(~p_dw_i~0)| 1) (not (= |old(~q_free~0)| 0)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~c_num_read~0)| 0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-11-06 22:51:17,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:51:17 BoogieIcfgContainer [2020-11-06 22:51:17,528 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:51:17,530 INFO L168 Benchmark]: Toolchain (without parser) took 85431.07 ms. Allocated memory was 160.4 MB in the beginning and 697.3 MB in the end (delta: 536.9 MB). Free memory was 135.9 MB in the beginning and 636.8 MB in the end (delta: -501.0 MB). Peak memory consumption was 430.3 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:17,530 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 125.8 MB. Free memory is still 100.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:51:17,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.42 ms. Allocated memory is still 160.4 MB. Free memory was 135.2 MB in the beginning and 123.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:17,531 INFO L168 Benchmark]: Boogie Preprocessor took 99.16 ms. Allocated memory is still 160.4 MB. Free memory was 123.5 MB in the beginning and 121.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:17,531 INFO L168 Benchmark]: RCFGBuilder took 742.04 ms. Allocated memory is still 160.4 MB. Free memory was 121.4 MB in the beginning and 127.5 MB in the end (delta: -6.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:17,532 INFO L168 Benchmark]: TraceAbstraction took 84214.83 ms. Allocated memory was 160.4 MB in the beginning and 697.3 MB in the end (delta: 536.9 MB). Free memory was 127.0 MB in the beginning and 636.8 MB in the end (delta: -509.8 MB). Peak memory consumption was 420.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:51:17,534 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.18 ms. Allocated memory is still 125.8 MB. Free memory is still 100.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 358.42 ms. Allocated memory is still 160.4 MB. Free memory was 135.2 MB in the beginning and 123.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 99.16 ms. Allocated memory is still 160.4 MB. Free memory was 123.5 MB in the beginning and 121.6 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 742.04 ms. Allocated memory is still 160.4 MB. Free memory was 121.4 MB in the beginning and 127.5 MB in the end (delta: -6.1 MB). Peak memory consumption was 14.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 84214.83 ms. Allocated memory was 160.4 MB in the beginning and 697.3 MB in the end (delta: 536.9 MB). Free memory was 127.0 MB in the beginning and 636.8 MB in the end (delta: -509.8 MB). Peak memory consumption was 420.7 MB. Max. memory is 8.0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_num_read == 1 && 2 <= p_dw_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) || !(2 <= q_write_ev)) || !(p_num_write == 1)) || (((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_dr_pc == 0) && c_num_read == 0)) || !(\old(c_dr_pc) == 0)) || \old(c_dr_st) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || !(\old(c_num_read) == 0)) || (((((((!(c_dr_st == 0) && p_dw_st == 0) && c_dr_pc == \old(c_dr_pc)) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && \old(c_num_read) + 1 == c_num_read)) || !(p_dw_pc == 1)) && (((((((((((!(\old(c_dr_pc) == 0) || \old(c_dr_st) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || (((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && q_free == 1) && c_num_read == 0)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0))) && (((((((((((\old(c_dr_st) == 0 || !(\old(c_dr_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || \old(c_num_read) + 1 == c_num_read) || !(p_dw_pc == 1)) || !(p_num_write == 1))) && ((((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((p_dw_st == 0 && p_num_write <= c_num_read) && 2 <= q_read_ev) && c_dr_pc == \old(c_dr_pc)) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write)) || !(2 <= q_write_ev)) || \old(c_dr_st) == 0) || ((((2 <= p_dw_st && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_dr_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) && (((((((((((((((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1) || !(2 <= \old(q_write_ev))) || !(\old(q_free) == 1)) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_dr_pc == 0) && c_num_read == 0)) || ((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || !(\old(c_dr_pc) == 0)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_num_read) == 0))) && ((((((((((((((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(\old(p_num_write) == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && p_last_write == \old(p_last_write)) && c_num_read == 0) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 0)) || \old(c_dr_st) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_num_read) == 0))) && ((((((((((!(\old(c_dr_pc) == 0) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(p_dw_st) == 0)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0))) && ((((((((((((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || \old(c_dr_st) == 0) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(1 <= \old(c_dr_pc)))) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st)))) && (((((((!(\old(c_dr_pc) == 0) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((!(\old(c_dr_pc) == 0) || \old(c_dr_st) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) && (((((((((((\old(c_dr_st) == 0 || !(\old(c_num_read) + 1 <= p_num_write)) || !(\old(c_dr_pc) == 1)) || ((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_num_read + 1 <= p_num_write) && c_dr_st == \old(c_dr_st)) && p_num_write <= c_num_read + 1) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_dr_pc == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1))) && ((((((((((!(\old(c_dr_pc) == 0) || \old(c_dr_st) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((((!(c_dr_pc == 1) || !(p_num_write <= c_num_read + 1)) || !(p_dw_i == 1)) || !(c_num_read + 1 <= p_num_write)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || !(q_free == 0)) && (((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && ((((((((!(c_dr_pc == 1) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && ((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(c_dr_pc == 0)) - InvariantResult [Line: 312]: Loop Invariant Derived loop invariant: ((((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || (((((((((\old(p_dw_pc) == p_dw_pc && \old(q_read_ev) == q_read_ev) && p_dw_st == 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && c_num_read == 0) && p_num_write == \old(p_num_write))) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_dr_pc == 0) && c_num_read == 0)) || ((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1)) || !(\old(c_dr_pc) == 0)) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && c_num_read == 0)) || !(\old(c_num_read) == 0) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: ((((((((((((((((!(c_dr_pc == 1) || !(c_dr_st == 0)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(p_num_write <= c_num_read + 1)) || !(c_num_read + 1 <= p_num_write)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(q_free == 0)) && ((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(p_dw_pc == 1))) && ((((((((((!(p_num_write == 0) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || c_dr_st == 0) || !(c_num_read == 0)) || (__retres1 <= 1 && 1 <= __retres1)) || !(q_free == 1)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(c_last_read == p_last_write))) && (((((((((((!(c_dr_pc == 1) || !(p_num_write == 0)) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(q_free == 1)) || !(c_dr_st == 2)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write))) && (((((((((((!(c_dr_st == 0) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) || !(q_free == 0))) && ((((((((((((!(p_dw_st == 0) || !(p_num_write <= c_num_read)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write)) || !(c_dr_pc == 1)) || !(c_num_read <= p_num_write)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1))) && ((((((((((!(p_num_write == 0) || !(p_dw_st == 0)) || !(p_dw_i == 1)) || (__retres1 <= 1 && 1 <= __retres1)) || !(c_num_read == 0)) || !(q_free == 1)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || !(2 <= q_write_ev)) || !(c_last_read == p_last_write)) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) && ((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(2 == \old(c_dr_st)))) && (((((((((\old(c_dr_st) == 0 || !(\old(q_free) == 1)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && (((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || (((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write)))) && (((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && ((((\old(q_free) == q_free && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) || !(q_free == 0))) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st))) - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((c_dr_st == 2 && p_num_write <= c_num_read) && p_dw_st == 0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= q_write_ev)) || \old(c_dr_st) == 0) || !(\old(c_dr_pc) == 1)) || ((((c_dr_st == 2 && 2 <= p_dw_st) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) && ((((((((((((((((((c_num_read == 1 && c_dr_st == 2) && p_dw_st == 0) && 2 <= q_read_ev) && c_last_read == p_last_write) && q_free == 1) && c_dr_pc == 1) || !(2 <= q_write_ev)) || !(p_num_write == 1)) || !(\old(c_dr_pc) == 0)) || \old(c_dr_st) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || (((((((((p_num_write == 1 && c_num_read == 1) && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1))) && ((((((((((((!(2 <= q_write_ev) || !(p_num_write == 1)) || \old(c_dr_st) == 0) || p_dw_st == 0) || !(\old(c_dr_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || (((((((((p_num_write == 1 && c_num_read == 1) && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1))) && (((((((((((!(\old(c_dr_pc) == 0) || \old(c_dr_st) == 0) || !(p_num_write == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(p_last_write == \old(c_last_read))) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || ((((((c_dr_st == 2 && p_dw_st == 0) && 2 <= q_read_ev) && \old(q_free) == q_free) && c_last_read == p_last_write) && c_num_read == 0) && c_dr_pc == 1)) || !(2 <= q_write_ev)) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((\old(p_dw_pc) == p_dw_pc && c_last_read == \old(c_last_read)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && p_last_write == \old(p_last_write)) && c_num_read == 0) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)) || !(\old(c_dr_pc) == 0)) || !(\old(q_free) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(p_dw_st) == 0)) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0)) && (((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st)))) && ((((((((((((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1) || \old(c_dr_st) == 0) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(1 <= \old(c_dr_pc)))) && ((((((((((((((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1) || !(\old(p_dw_pc) == 1)) || !(\old(p_num_write) == 1)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && p_last_write == \old(p_last_write)) && c_num_read == 0) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 0)) || \old(c_dr_st) == 0) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(\old(c_num_read) == 0))) && (((((((!(\old(c_dr_pc) == 0) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(\old(c_num_read) == 0))) && ((((((((((((((((((!(2 <= \old(q_write_ev)) || ((((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && p_dw_i == 1)) || !(\old(q_free) == 1)) || (((((((((((2 <= q_write_ev && c_dr_st == 2) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && c_last_read == p_last_write) && tmp___1 == 1) && q_free == 1) && p_dw_i == 1) && c_num_read == 0) && p_num_write == \old(p_num_write)) && c_dr_pc == 1)) || !(\old(c_last_read) == \old(p_last_write))) || ((((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_dr_pc == 0) && c_num_read == 0)) || ((((((((q_free == 0 && 2 <= q_write_ev) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_dr_pc == 0) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || ((((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 1 <= c_dr_pc) && 2 <= q_read_ev) && p_dw_pc == 1)) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || (((((((((((2 <= q_write_ev && c_dr_st == 2) && p_num_write <= c_num_read) && p_dw_st == 0) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 0)) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || (((((((c_dr_st == 2 && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || ((((((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && 2 <= p_dw_st) && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 1)) || !(\old(c_num_read) == 0)) || ((((((((((((\old(p_dw_pc) == p_dw_pc && c_last_read == \old(c_last_read)) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_st == \old(c_dr_st)) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && c_dr_pc == 0) && p_last_write == \old(p_last_write)) && c_num_read == 0) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write)))) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) == 1)) || ((((((((((((c_last_read == \old(c_last_read) && a_t == \old(a_t)) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && \old(p_dw_st) == p_dw_st) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && c_dr_st == 2) && p_dw_pc == 1) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(p_dw_i == 1)) || !(2 <= \old(q_read_ev))) || !(2 <= \old(p_dw_st))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((c_dr_st == 2 && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || !(2 == \old(c_dr_st))) && ((((((((((\old(c_dr_st) == 0 || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || ((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && ((((((((((!(2 <= \old(q_write_ev)) || (((((q_free == 0 && 2 <= q_write_ev) && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_free) == 1)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && ((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) == 1)) || (((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1)) || ((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write)))) && ((((((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || !(c_num_read == 0)) || (((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == 2) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_last_write == \old(p_last_write)) && p_num_write == \old(p_num_write))) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((q_free == 0 && 2 <= q_write_ev) && p_last_write == q_buf_0) && \old(p_num_write) + 1 == p_num_write)) || !(2 == \old(c_dr_st))) || !(c_dr_pc == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || ((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: ((((((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || ((((((q_free == 0 && 2 <= q_write_ev) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && p_dw_pc == 1)) || !(\old(p_dw_pc) == 1)) || !(p_dw_i == 1)) || !(2 <= q_read_ev)) || ((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1)) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(2 == \old(c_dr_st))) || !(c_num_read <= \old(p_num_write))) && (((((((((!(\old(q_free) == 1) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1)) || !(2 == \old(c_dr_st)))) && (((((((!(\old(p_dw_pc) == 1) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_dr_pc == 0)) || (((((c_dr_st == 2 && p_last_write == q_buf_0) && 2 <= q_read_ev) && p_dw_pc == 1) && c_dr_pc == 0) && p_dw_i == 1)) || !(2 == \old(c_dr_st)))) && (((((((((\old(c_dr_st) == 0 || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0)) || (((((q_free == 0 && !(c_dr_st == 0)) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write))) && (((((((((!(2 <= \old(q_write_ev)) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || (((((q_free == 0 && 2 <= q_write_ev) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(c_dr_pc == 0))) && (((((((((((!(c_dr_pc == 1) || !(2 <= \old(q_write_ev))) || (((((q_free == 0 && c_dr_st == 2) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) || !(\old(q_free) == 1)) || !(c_last_read == \old(p_last_write))) || !(p_dw_i == 1)) || !(c_num_read == 0)) || (((((q_free == 0 && 2 <= q_write_ev) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write)) || !(2 <= q_read_ev)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || !(2 == \old(c_dr_st))) - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || c_dr_st == 0) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write)) || !(p_num_write == 1)) && (((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_num_write == 1)) || !(q_free == 0))) && (((((((((((!(c_dr_pc == 1) || !(c_num_read <= p_num_write)) || !(p_num_write <= c_num_read)) || !(p_dw_i == 1)) || c_dr_st == 0) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write))) && ((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(2 <= q_read_ev)) || !(c_dr_st == 2)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0))) && (((((((((!(p_dw_i == 1) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || !(c_dr_pc == 0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && (((((((((((!(c_dr_pc == 1) || !(c_num_read <= p_num_write)) || !(p_dw_st == 0)) || !(p_num_write <= c_num_read)) || !(p_dw_i == 1)) || c_dr_st == 0) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= q_write_ev)) || !(p_dw_pc == 1)) || !(c_last_read == p_last_write)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 111 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 44.4s, OverallIterations: 16, TraceHistogramMax: 5, AutomataDifference: 30.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2489 SDtfs, 4729 SDslu, 3163 SDs, 0 SdLazy, 11313 SolverSat, 1626 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2292 GetRequests, 1972 SyntacticMatches, 8 SemanticMatches, 312 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 13.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1910occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 1075 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 3949 PreInvPairs, 4557 NumberOfFragments, 9543 HoareAnnotationTreeSize, 3949 FomulaSimplifications, 3749213 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 46 FomulaSimplificationsInter, 241289 FormulaSimplificationTreeSizeReductionInter, 32.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 3494 NumberOfCodeBlocks, 3494 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3468 ConstructedInterpolants, 0 QuantifiedInterpolants, 1304102 SizeOfPredicates, 20 NumberOfNonLiveVariables, 8383 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 26 InterpolantComputations, 12 PerfectInterpolantSequences, 1872/2238 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...