/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.1.25-72570d3 [2020-08-22 17:02:59,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 17:02:59,532 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 17:02:59,583 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 17:02:59,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 17:02:59,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 17:02:59,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 17:02:59,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 17:02:59,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 17:02:59,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 17:02:59,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 17:02:59,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 17:02:59,595 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 17:02:59,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 17:02:59,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 17:02:59,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 17:02:59,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 17:02:59,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 17:02:59,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 17:02:59,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 17:02:59,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 17:02:59,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 17:02:59,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 17:02:59,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 17:02:59,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 17:02:59,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 17:02:59,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 17:02:59,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 17:02:59,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 17:02:59,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 17:02:59,621 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 17:02:59,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 17:02:59,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 17:02:59,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 17:02:59,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 17:02:59,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 17:02:59,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 17:02:59,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 17:02:59,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 17:02:59,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 17:02:59,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 17:02:59,630 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-08-22 17:02:59,654 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 17:02:59,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 17:02:59,656 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-22 17:02:59,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-22 17:02:59,657 INFO L138 SettingsManager]: * Use SBE=true [2020-08-22 17:02:59,657 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 17:02:59,657 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 17:02:59,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 17:02:59,658 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 17:02:59,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 17:02:59,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 17:02:59,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 17:02:59,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 17:02:59,659 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 17:02:59,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 17:02:59,659 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 17:02:59,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 17:02:59,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 17:02:59,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-22 17:02:59,660 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 17:02:59,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 17:02:59,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 17:02:59,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 17:02:59,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-22 17:02:59,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-22 17:02:59,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-22 17:02:59,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-22 17:02:59,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 17:02:59,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-22 17:02:59,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-08-22 17:02:59,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 17:02:59,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 17:02:59,985 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 17:02:59,988 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 17:02:59,988 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 17:02:59,990 INFO L429 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-08-22 17:03:00,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d475c7/6bdb20b888f44dd5a9f091adee7733af/FLAG1d08c5437 [2020-08-22 17:03:00,583 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 17:03:00,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2020-08-22 17:03:00,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d475c7/6bdb20b888f44dd5a9f091adee7733af/FLAG1d08c5437 [2020-08-22 17:03:00,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dc7d475c7/6bdb20b888f44dd5a9f091adee7733af [2020-08-22 17:03:00,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 17:03:00,969 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 17:03:00,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 17:03:00,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 17:03:00,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 17:03:00,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:03:00" (1/1) ... [2020-08-22 17:03:00,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66ced5bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:00, skipping insertion in model container [2020-08-22 17:03:00,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 05:03:00" (1/1) ... [2020-08-22 17:03:00,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 17:03:01,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 17:03:01,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:03:01,249 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 17:03:01,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 17:03:01,408 INFO L208 MainTranslator]: Completed translation [2020-08-22 17:03:01,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01 WrapperNode [2020-08-22 17:03:01,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 17:03:01,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 17:03:01,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 17:03:01,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 17:03:01,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (1/1) ... [2020-08-22 17:03:01,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 17:03:01,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 17:03:01,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 17:03:01,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 17:03:01,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (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-08-22 17:03:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 17:03:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 17:03:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-22 17:03:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-08-22 17:03:01,535 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-22 17:03:01,536 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-22 17:03:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-22 17:03:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-22 17:03:01,537 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 17:03:01,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 17:03:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 17:03:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-22 17:03:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-08-22 17:03:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-08-22 17:03:01,538 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-22 17:03:01,539 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-22 17:03:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-22 17:03:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-22 17:03:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 17:03:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 17:03:01,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 17:03:02,067 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 17:03:02,068 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-08-22 17:03:02,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:03:02 BoogieIcfgContainer [2020-08-22 17:03:02,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 17:03:02,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 17:03:02,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 17:03:02,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 17:03:02,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 05:03:00" (1/3) ... [2020-08-22 17:03:02,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e72c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:03:02, skipping insertion in model container [2020-08-22 17:03:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 05:03:01" (2/3) ... [2020-08-22 17:03:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e72c38a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 05:03:02, skipping insertion in model container [2020-08-22 17:03:02,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 05:03:02" (3/3) ... [2020-08-22 17:03:02,098 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2020-08-22 17:03:02,110 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-08-22 17:03:02,119 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 17:03:02,134 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 17:03:02,165 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 17:03:02,165 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 17:03:02,165 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-08-22 17:03:02,165 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 17:03:02,166 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 17:03:02,166 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 17:03:02,166 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 17:03:02,166 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 17:03:02,190 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2020-08-22 17:03:02,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-08-22 17:03:02,202 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:02,204 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] [2020-08-22 17:03:02,204 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:02,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:02,210 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2020-08-22 17:03:02,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:02,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489979524] [2020-08-22 17:03:02,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2020-08-22 17:03:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:02,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:02,872 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489979524] [2020-08-22 17:03:02,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:02,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 17:03:02,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002826289] [2020-08-22 17:03:02,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:03:02,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:02,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:03:02,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 17:03:02,900 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 6 states. [2020-08-22 17:03:04,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:04,117 INFO L93 Difference]: Finished difference Result 356 states and 554 transitions. [2020-08-22 17:03:04,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:03:04,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2020-08-22 17:03:04,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:04,140 INFO L225 Difference]: With dead ends: 356 [2020-08-22 17:03:04,141 INFO L226 Difference]: Without dead ends: 248 [2020-08-22 17:03:04,147 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 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-08-22 17:03:04,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2020-08-22 17:03:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 185. [2020-08-22 17:03:04,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2020-08-22 17:03:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 246 transitions. [2020-08-22 17:03:04,287 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 246 transitions. Word has length 65 [2020-08-22 17:03:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:04,288 INFO L479 AbstractCegarLoop]: Abstraction has 185 states and 246 transitions. [2020-08-22 17:03:04,288 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:03:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 246 transitions. [2020-08-22 17:03:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:04,294 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:04,294 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-08-22 17:03:04,294 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 17:03:04,295 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:04,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:04,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1537976919, now seen corresponding path program 1 times [2020-08-22 17:03:04,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:04,296 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52848884] [2020-08-22 17:03:04,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:04,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:04,460 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52848884] [2020-08-22 17:03:04,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:04,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 17:03:04,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757224647] [2020-08-22 17:03:04,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 17:03:04,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:04,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 17:03:04,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-08-22 17:03:04,464 INFO L87 Difference]: Start difference. First operand 185 states and 246 transitions. Second operand 7 states. [2020-08-22 17:03:05,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:05,165 INFO L93 Difference]: Finished difference Result 406 states and 562 transitions. [2020-08-22 17:03:05,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:03:05,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2020-08-22 17:03:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:05,170 INFO L225 Difference]: With dead ends: 406 [2020-08-22 17:03:05,171 INFO L226 Difference]: Without dead ends: 238 [2020-08-22 17:03:05,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:03:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-08-22 17:03:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 182. [2020-08-22 17:03:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-08-22 17:03:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 241 transitions. [2020-08-22 17:03:05,212 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 241 transitions. Word has length 66 [2020-08-22 17:03:05,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:05,213 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 241 transitions. [2020-08-22 17:03:05,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 17:03:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 241 transitions. [2020-08-22 17:03:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-08-22 17:03:05,216 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:05,216 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] [2020-08-22 17:03:05,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 17:03:05,217 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:05,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash -478173211, now seen corresponding path program 1 times [2020-08-22 17:03:05,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:05,218 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015795636] [2020-08-22 17:03:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-08-22 17:03:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:05,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015795636] [2020-08-22 17:03:05,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:05,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:03:05,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267465228] [2020-08-22 17:03:05,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:03:05,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:05,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:03:05,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:03:05,491 INFO L87 Difference]: Start difference. First operand 182 states and 241 transitions. Second operand 9 states. [2020-08-22 17:03:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:06,944 INFO L93 Difference]: Finished difference Result 582 states and 869 transitions. [2020-08-22 17:03:06,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-08-22 17:03:06,946 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2020-08-22 17:03:06,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:06,959 INFO L225 Difference]: With dead ends: 582 [2020-08-22 17:03:06,960 INFO L226 Difference]: Without dead ends: 417 [2020-08-22 17:03:06,963 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:03:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2020-08-22 17:03:07,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 336. [2020-08-22 17:03:07,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2020-08-22 17:03:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 490 transitions. [2020-08-22 17:03:07,081 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 490 transitions. Word has length 72 [2020-08-22 17:03:07,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:07,082 INFO L479 AbstractCegarLoop]: Abstraction has 336 states and 490 transitions. [2020-08-22 17:03:07,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:03:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 490 transitions. [2020-08-22 17:03:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-22 17:03:07,085 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:07,085 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-08-22 17:03:07,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 17:03:07,085 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:07,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:07,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2098500188, now seen corresponding path program 1 times [2020-08-22 17:03:07,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:07,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861105401] [2020-08-22 17:03:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2020-08-22 17:03:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:07,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:07,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:07,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861105401] [2020-08-22 17:03:07,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:07,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-08-22 17:03:07,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139926826] [2020-08-22 17:03:07,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-08-22 17:03:07,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-08-22 17:03:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-08-22 17:03:07,429 INFO L87 Difference]: Start difference. First operand 336 states and 490 transitions. Second operand 12 states. [2020-08-22 17:03:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:10,607 INFO L93 Difference]: Finished difference Result 873 states and 1358 transitions. [2020-08-22 17:03:10,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-08-22 17:03:10,607 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2020-08-22 17:03:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:10,614 INFO L225 Difference]: With dead ends: 873 [2020-08-22 17:03:10,615 INFO L226 Difference]: Without dead ends: 554 [2020-08-22 17:03:10,619 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=278, Invalid=912, Unknown=0, NotChecked=0, Total=1190 [2020-08-22 17:03:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2020-08-22 17:03:10,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 211. [2020-08-22 17:03:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2020-08-22 17:03:10,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 276 transitions. [2020-08-22 17:03:10,676 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 276 transitions. Word has length 73 [2020-08-22 17:03:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:10,677 INFO L479 AbstractCegarLoop]: Abstraction has 211 states and 276 transitions. [2020-08-22 17:03:10,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-08-22 17:03:10,681 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 276 transitions. [2020-08-22 17:03:10,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:10,682 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:10,683 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-08-22 17:03:10,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 17:03:10,693 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2020-08-22 17:03:10,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:10,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155396070] [2020-08-22 17:03:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:10,888 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155396070] [2020-08-22 17:03:10,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:10,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 17:03:10,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711778004] [2020-08-22 17:03:10,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 17:03:10,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:10,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 17:03:10,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-22 17:03:10,890 INFO L87 Difference]: Start difference. First operand 211 states and 276 transitions. Second operand 8 states. [2020-08-22 17:03:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:12,178 INFO L93 Difference]: Finished difference Result 612 states and 874 transitions. [2020-08-22 17:03:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:03:12,179 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2020-08-22 17:03:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:12,183 INFO L225 Difference]: With dead ends: 612 [2020-08-22 17:03:12,184 INFO L226 Difference]: Without dead ends: 418 [2020-08-22 17:03:12,187 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:03:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2020-08-22 17:03:12,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 323. [2020-08-22 17:03:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2020-08-22 17:03:12,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 419 transitions. [2020-08-22 17:03:12,238 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 419 transitions. Word has length 66 [2020-08-22 17:03:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:12,239 INFO L479 AbstractCegarLoop]: Abstraction has 323 states and 419 transitions. [2020-08-22 17:03:12,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 17:03:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 419 transitions. [2020-08-22 17:03:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:12,241 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:12,241 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-08-22 17:03:12,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 17:03:12,242 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:12,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:12,242 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2020-08-22 17:03:12,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:12,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128130125] [2020-08-22 17:03:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:12,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:12,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128130125] [2020-08-22 17:03:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:03:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917691231] [2020-08-22 17:03:12,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:03:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:03:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:03:12,433 INFO L87 Difference]: Start difference. First operand 323 states and 419 transitions. Second operand 9 states. [2020-08-22 17:03:13,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:13,432 INFO L93 Difference]: Finished difference Result 727 states and 1002 transitions. [2020-08-22 17:03:13,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 17:03:13,433 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-08-22 17:03:13,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:13,437 INFO L225 Difference]: With dead ends: 727 [2020-08-22 17:03:13,437 INFO L226 Difference]: Without dead ends: 421 [2020-08-22 17:03:13,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-08-22 17:03:13,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-08-22 17:03:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 341. [2020-08-22 17:03:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2020-08-22 17:03:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 437 transitions. [2020-08-22 17:03:13,484 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 437 transitions. Word has length 66 [2020-08-22 17:03:13,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:13,485 INFO L479 AbstractCegarLoop]: Abstraction has 341 states and 437 transitions. [2020-08-22 17:03:13,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:03:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 437 transitions. [2020-08-22 17:03:13,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:13,486 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:13,486 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-08-22 17:03:13,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 17:03:13,487 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:13,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:13,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2020-08-22 17:03:13,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:13,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177518902] [2020-08-22 17:03:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:13,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,652 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:13,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:13,689 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177518902] [2020-08-22 17:03:13,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:13,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:03:13,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734227459] [2020-08-22 17:03:13,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:03:13,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:03:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:03:13,692 INFO L87 Difference]: Start difference. First operand 341 states and 437 transitions. Second operand 9 states. [2020-08-22 17:03:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:16,806 INFO L93 Difference]: Finished difference Result 1164 states and 1617 transitions. [2020-08-22 17:03:16,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 17:03:16,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-08-22 17:03:16,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:16,815 INFO L225 Difference]: With dead ends: 1164 [2020-08-22 17:03:16,815 INFO L226 Difference]: Without dead ends: 840 [2020-08-22 17:03:16,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=200, Invalid=730, Unknown=0, NotChecked=0, Total=930 [2020-08-22 17:03:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2020-08-22 17:03:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 643. [2020-08-22 17:03:16,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2020-08-22 17:03:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 815 transitions. [2020-08-22 17:03:16,935 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 815 transitions. Word has length 66 [2020-08-22 17:03:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:16,937 INFO L479 AbstractCegarLoop]: Abstraction has 643 states and 815 transitions. [2020-08-22 17:03:16,937 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:03:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 815 transitions. [2020-08-22 17:03:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:16,939 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:16,939 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-08-22 17:03:16,940 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 17:03:16,940 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2020-08-22 17:03:16,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:16,942 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642454696] [2020-08-22 17:03:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:17,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:17,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642454696] [2020-08-22 17:03:17,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:17,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-22 17:03:17,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479140510] [2020-08-22 17:03:17,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 17:03:17,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:17,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 17:03:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:03:17,190 INFO L87 Difference]: Start difference. First operand 643 states and 815 transitions. Second operand 9 states. [2020-08-22 17:03:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:18,148 INFO L93 Difference]: Finished difference Result 1352 states and 1804 transitions. [2020-08-22 17:03:18,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:03:18,148 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2020-08-22 17:03:18,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:18,155 INFO L225 Difference]: With dead ends: 1352 [2020-08-22 17:03:18,155 INFO L226 Difference]: Without dead ends: 764 [2020-08-22 17:03:18,158 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:03:18,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2020-08-22 17:03:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 669. [2020-08-22 17:03:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 669 states. [2020-08-22 17:03:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 834 transitions. [2020-08-22 17:03:18,238 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 834 transitions. Word has length 66 [2020-08-22 17:03:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:18,239 INFO L479 AbstractCegarLoop]: Abstraction has 669 states and 834 transitions. [2020-08-22 17:03:18,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 17:03:18,239 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 834 transitions. [2020-08-22 17:03:18,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-08-22 17:03:18,241 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:18,241 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-08-22 17:03:18,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 17:03:18,241 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:18,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2020-08-22 17:03:18,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:18,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585691489] [2020-08-22 17:03:18,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-08-22 17:03:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:18,422 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585691489] [2020-08-22 17:03:18,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:18,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-08-22 17:03:18,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253200578] [2020-08-22 17:03:18,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 17:03:18,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:18,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 17:03:18,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 17:03:18,432 INFO L87 Difference]: Start difference. First operand 669 states and 834 transitions. Second operand 6 states. [2020-08-22 17:03:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:19,217 INFO L93 Difference]: Finished difference Result 1262 states and 1648 transitions. [2020-08-22 17:03:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:03:19,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-08-22 17:03:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:19,226 INFO L225 Difference]: With dead ends: 1262 [2020-08-22 17:03:19,226 INFO L226 Difference]: Without dead ends: 814 [2020-08-22 17:03:19,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-08-22 17:03:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2020-08-22 17:03:19,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 708. [2020-08-22 17:03:19,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2020-08-22 17:03:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 908 transitions. [2020-08-22 17:03:19,325 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 908 transitions. Word has length 66 [2020-08-22 17:03:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:19,325 INFO L479 AbstractCegarLoop]: Abstraction has 708 states and 908 transitions. [2020-08-22 17:03:19,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 17:03:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 908 transitions. [2020-08-22 17:03:19,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-08-22 17:03:19,330 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:19,331 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] [2020-08-22 17:03:19,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 17:03:19,331 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:19,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1757954899, now seen corresponding path program 1 times [2020-08-22 17:03:19,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:19,332 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532236213] [2020-08-22 17:03:19,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2020-08-22 17:03:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2020-08-22 17:03:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 17:03:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,568 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 17:03:19,568 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532236213] [2020-08-22 17:03:19,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253698158] [2020-08-22 17:03:19,569 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-08-22 17:03:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:19,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 2 conjunts are in the unsatisfiable core [2020-08-22 17:03:19,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:03:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:19,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:03:19,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2020-08-22 17:03:19,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121632093] [2020-08-22 17:03:19,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:03:19,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:03:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:03:19,816 INFO L87 Difference]: Start difference. First operand 708 states and 908 transitions. Second operand 3 states. [2020-08-22 17:03:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:20,017 INFO L93 Difference]: Finished difference Result 1674 states and 2250 transitions. [2020-08-22 17:03:20,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:03:20,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-08-22 17:03:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:20,026 INFO L225 Difference]: With dead ends: 1674 [2020-08-22 17:03:20,027 INFO L226 Difference]: Without dead ends: 812 [2020-08-22 17:03:20,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:03:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-08-22 17:03:20,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-08-22 17:03:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-08-22 17:03:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1048 transitions. [2020-08-22 17:03:20,153 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1048 transitions. Word has length 86 [2020-08-22 17:03:20,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:20,154 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 1048 transitions. [2020-08-22 17:03:20,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:03:20,155 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1048 transitions. [2020-08-22 17:03:20,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-08-22 17:03:20,158 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:20,158 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-08-22 17:03:20,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-08-22 17:03:20,373 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:20,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:20,374 INFO L82 PathProgramCache]: Analyzing trace with hash -232030383, now seen corresponding path program 1 times [2020-08-22 17:03:20,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:20,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493279757] [2020-08-22 17:03:20,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:03:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:03:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 17:03:20,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493279757] [2020-08-22 17:03:20,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:20,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 17:03:20,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621893100] [2020-08-22 17:03:20,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 17:03:20,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:20,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 17:03:20,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-22 17:03:20,656 INFO L87 Difference]: Start difference. First operand 812 states and 1048 transitions. Second operand 8 states. [2020-08-22 17:03:21,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:21,692 INFO L93 Difference]: Finished difference Result 962 states and 1270 transitions. [2020-08-22 17:03:21,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 17:03:21,693 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2020-08-22 17:03:21,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:21,701 INFO L225 Difference]: With dead ends: 962 [2020-08-22 17:03:21,701 INFO L226 Difference]: Without dead ends: 959 [2020-08-22 17:03:21,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2020-08-22 17:03:21,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2020-08-22 17:03:21,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 820. [2020-08-22 17:03:21,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2020-08-22 17:03:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1043 transitions. [2020-08-22 17:03:21,847 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1043 transitions. Word has length 98 [2020-08-22 17:03:21,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:21,847 INFO L479 AbstractCegarLoop]: Abstraction has 820 states and 1043 transitions. [2020-08-22 17:03:21,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 17:03:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1043 transitions. [2020-08-22 17:03:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-08-22 17:03:21,851 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:21,851 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] [2020-08-22 17:03:21,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 17:03:21,851 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2020-08-22 17:03:21,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:21,854 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372215201] [2020-08-22 17:03:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:03:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2020-08-22 17:03:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,194 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-08-22 17:03:22,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372215201] [2020-08-22 17:03:22,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737422462] [2020-08-22 17:03:22,195 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-08-22 17:03:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:22,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2020-08-22 17:03:22,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:03:22,512 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 17:03:22,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-08-22 17:03:22,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-08-22 17:03:22,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108426896] [2020-08-22 17:03:22,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 17:03:22,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 17:03:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2020-08-22 17:03:22,515 INFO L87 Difference]: Start difference. First operand 820 states and 1043 transitions. Second operand 16 states. [2020-08-22 17:03:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:27,463 INFO L93 Difference]: Finished difference Result 2540 states and 3915 transitions. [2020-08-22 17:03:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-08-22 17:03:27,464 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 99 [2020-08-22 17:03:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:27,486 INFO L225 Difference]: With dead ends: 2540 [2020-08-22 17:03:27,486 INFO L226 Difference]: Without dead ends: 2537 [2020-08-22 17:03:27,489 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=306, Invalid=1674, Unknown=0, NotChecked=0, Total=1980 [2020-08-22 17:03:27,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2537 states. [2020-08-22 17:03:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2537 to 2338. [2020-08-22 17:03:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2338 states. [2020-08-22 17:03:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2338 states to 2338 states and 3577 transitions. [2020-08-22 17:03:27,858 INFO L78 Accepts]: Start accepts. Automaton has 2338 states and 3577 transitions. Word has length 99 [2020-08-22 17:03:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:27,858 INFO L479 AbstractCegarLoop]: Abstraction has 2338 states and 3577 transitions. [2020-08-22 17:03:27,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 17:03:27,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2338 states and 3577 transitions. [2020-08-22 17:03:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-08-22 17:03:27,867 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:27,867 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] [2020-08-22 17:03:28,080 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-08-22 17:03:28,081 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:28,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:28,082 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2020-08-22 17:03:28,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:28,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361026994] [2020-08-22 17:03:28,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,190 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:03:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,238 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-08-22 17:03:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-08-22 17:03:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:28,281 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2020-08-22 17:03:28,282 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361026994] [2020-08-22 17:03:28,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 17:03:28,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 17:03:28,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380842712] [2020-08-22 17:03:28,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 17:03:28,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:28,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 17:03:28,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-08-22 17:03:28,285 INFO L87 Difference]: Start difference. First operand 2338 states and 3577 transitions. Second operand 7 states. [2020-08-22 17:03:29,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:29,385 INFO L93 Difference]: Finished difference Result 3773 states and 6055 transitions. [2020-08-22 17:03:29,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-22 17:03:29,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2020-08-22 17:03:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:29,411 INFO L225 Difference]: With dead ends: 3773 [2020-08-22 17:03:29,412 INFO L226 Difference]: Without dead ends: 2107 [2020-08-22 17:03:29,434 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-08-22 17:03:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2020-08-22 17:03:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 2006. [2020-08-22 17:03:29,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2006 states. [2020-08-22 17:03:29,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2006 states to 2006 states and 2998 transitions. [2020-08-22 17:03:29,706 INFO L78 Accepts]: Start accepts. Automaton has 2006 states and 2998 transitions. Word has length 125 [2020-08-22 17:03:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:29,707 INFO L479 AbstractCegarLoop]: Abstraction has 2006 states and 2998 transitions. [2020-08-22 17:03:29,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 17:03:29,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2006 states and 2998 transitions. [2020-08-22 17:03:29,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2020-08-22 17:03:29,714 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 17:03:29,714 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] [2020-08-22 17:03:29,714 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-22 17:03:29,715 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 17:03:29,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 17:03:29,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1218823465, now seen corresponding path program 1 times [2020-08-22 17:03:29,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-08-22 17:03:29,716 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276769067] [2020-08-22 17:03:29,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 17:03:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 17:03:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-22 17:03:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 17:03:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 17:03:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,902 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 17:03:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 17:03:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2020-08-22 17:03:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2020-08-22 17:03:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-22 17:03:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2020-08-22 17:03:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-22 17:03:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:29,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 17:03:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-08-22 17:03:30,013 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276769067] [2020-08-22 17:03:30,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418710385] [2020-08-22 17:03:30,014 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-08-22 17:03:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 17:03:30,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2020-08-22 17:03:30,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-08-22 17:03:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-08-22 17:03:30,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-08-22 17:03:30,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2020-08-22 17:03:30,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330614678] [2020-08-22 17:03:30,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-08-22 17:03:30,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-08-22 17:03:30,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-08-22 17:03:30,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:03:30,158 INFO L87 Difference]: Start difference. First operand 2006 states and 2998 transitions. Second operand 3 states. [2020-08-22 17:03:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 17:03:30,285 INFO L93 Difference]: Finished difference Result 2401 states and 3609 transitions. [2020-08-22 17:03:30,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-08-22 17:03:30,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2020-08-22 17:03:30,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 17:03:30,288 INFO L225 Difference]: With dead ends: 2401 [2020-08-22 17:03:30,288 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 17:03:30,302 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-08-22 17:03:30,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 17:03:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 17:03:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 17:03:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 17:03:30,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 142 [2020-08-22 17:03:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 17:03:30,304 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 17:03:30,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-08-22 17:03:30,304 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 17:03:30,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 17:03:30,519 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-08-22 17:03:30,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 17:03:31,077 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-08-22 17:03:31,182 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 [2020-08-22 17:03:31,947 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2020-08-22 17:03:38,235 WARN L193 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-08-22 17:03:39,302 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-08-22 17:03:40,411 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-08-22 17:03:40,700 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 79 [2020-08-22 17:03:40,812 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-08-22 17:03:41,477 WARN L193 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 77 [2020-08-22 17:03:41,736 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-08-22 17:03:42,817 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 150 DAG size of output: 74 [2020-08-22 17:03:43,493 WARN L193 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2020-08-22 17:03:44,114 WARN L193 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2020-08-22 17:03:44,389 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 35 [2020-08-22 17:03:45,475 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 124 DAG size of output: 94 [2020-08-22 17:03:45,612 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-08-22 17:03:45,790 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2020-08-22 17:03:48,689 WARN L193 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 215 DAG size of output: 153 [2020-08-22 17:03:48,845 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-08-22 17:03:49,402 WARN L193 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 81 [2020-08-22 17:03:50,011 WARN L193 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 79 [2020-08-22 17:03:50,300 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-08-22 17:03:50,564 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-08-22 17:03:53,611 WARN L193 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 227 DAG size of output: 156 [2020-08-22 17:03:56,177 WARN L193 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 179 DAG size of output: 134 [2020-08-22 17:03:57,756 WARN L193 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 180 DAG size of output: 114 [2020-08-22 17:03:58,642 WARN L193 SmtUtils]: Spent 882.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 89 [2020-08-22 17:03:58,844 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2020-08-22 17:03:59,823 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 101 [2020-08-22 17:04:02,794 WARN L193 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 215 DAG size of output: 153 [2020-08-22 17:04:03,064 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 1 [2020-08-22 17:04:03,363 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 75 [2020-08-22 17:04:03,483 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2020-08-22 17:04:03,597 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2020-08-22 17:04:04,255 WARN L193 SmtUtils]: Spent 654.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 92 [2020-08-22 17:04:04,454 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2020-08-22 17:04:04,895 WARN L193 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 52 [2020-08-22 17:04:07,862 WARN L193 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 195 DAG size of output: 120 [2020-08-22 17:04:08,580 WARN L193 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2020-08-22 17:04:09,923 WARN L193 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 193 DAG size of output: 86 [2020-08-22 17:04:09,928 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2020-08-22 17:04:09,928 INFO L268 CegarLoopResult]: For program point L218(lines 218 223) no Hoare annotation was computed. [2020-08-22 17:04:09,928 INFO L268 CegarLoopResult]: For program point L214(lines 214 224) no Hoare annotation was computed. [2020-08-22 17:04:09,928 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2020-08-22 17:04:09,928 INFO L271 CegarLoopResult]: At program point L226(lines 213 228) the Hoare annotation is: true [2020-08-22 17:04:09,929 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2020-08-22 17:04:09,929 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2020-08-22 17:04:09,929 INFO L268 CegarLoopResult]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2020-08-22 17:04:09,929 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 192 209) 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 (<= ~p_dw_pc~0 0)) (not (= ~q_free~0 1)) (not (= ~p_last_write~0 ~q_buf_0~0)) (not (= |old(~p_dw_st~0)| 0)) (= ~c_dr_pc~0 1) (not (= ~c_last_read~0 ~p_last_write~0))) [2020-08-22 17:04:09,930 INFO L268 CegarLoopResult]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2020-08-22 17:04:09,930 INFO L264 CegarLoopResult]: At program point L354-1(line 354) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= ~p_last_write~0 ~q_buf_0~0) (<= ~p_dw_pc~0 0) (= |old(~p_dw_st~0)| ~p_dw_st~0) (= ~c_last_read~0 ~p_last_write~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(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |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)) (not (= |old(~c_num_read~0)| 0))) [2020-08-22 17:04:09,931 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |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 (= ~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)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~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(~c_num_read~0)| 0))) [2020-08-22 17:04:09,931 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2020-08-22 17:04:09,931 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2020-08-22 17:04:09,931 INFO L268 CegarLoopResult]: For program point L355(line 355) no Hoare annotation was computed. [2020-08-22 17:04:09,931 INFO L264 CegarLoopResult]: At program point L354(line 354) the Hoare annotation is: (or (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (= |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 (= ~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)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~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(~c_num_read~0)| 0))) [2020-08-22 17:04:09,932 INFO L264 CegarLoopResult]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse10 (= ~c_dr_pc~0 1))) (let ((.cse12 (not .cse10)) (.cse13 (= ~q_free~0 0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (= ~p_dw_pc~0 1))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= ~c_num_read~0 0))) (.cse8 (and .cse13 .cse15 .cse16 .cse17 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse9 (and .cse12 (<= 2 ~c_dr_st~0) (not (= ~p_dw_st~0 1)) .cse17 (not (= ~p_dw_st~0 ~q_free~0)) (not (= ~p_dw_pc~0 ~q_free~0)))) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse1 .cse2 .cse4 .cse10) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse6 .cse7 .cse10) (or .cse0 .cse9 .cse11 .cse4 .cse10) (or .cse12 .cse0 .cse11 .cse4 (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse13 (<= .cse14 ~p_num_write~0) .cse15 (<= ~p_num_write~0 .cse14) .cse16 .cse17)) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse6 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))))))) [2020-08-22 17:04:09,932 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse11 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse12 (= |old(~q_free~0)| ~q_free~0)) (.cse13 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse14 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse15 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse16 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse17 (= ~p_num_write~0 |old(~p_num_write~0)|))) (let ((.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse10 (not (= |old(~p_dw_pc~0)| 1))) (.cse2 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17)) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse3 (not (<= |old(~p_dw_pc~0)| 0))) (.cse4 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse6 (not (= ~c_num_read~0 0))) (.cse7 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse8 (not (= |old(~p_num_write~0)| 0))) (.cse9 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse9) (or .cse0 .cse10 .cse5 (and .cse11 .cse12 (= ~p_dw_pc~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse7 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse2 .cse10 .cse5 .cse9) (or .cse2 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9)))) [2020-08-22 17:04:09,933 INFO L264 CegarLoopResult]: At program point L124(line 124) the Hoare annotation is: (let ((.cse15 (+ |old(~p_num_write~0)| 1))) (let ((.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse11 (not (= ~c_num_read~0 0))) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse13 (not (= |old(~p_num_write~0)| 0))) (.cse5 (= ~q_free~0 0)) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse8 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (<= ~p_dw_pc~0 0)) (.cse9 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse10 (= .cse15 ~p_num_write~0)) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse16 (= ~p_dw_pc~0 1)) (.cse17 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse18 (not (= ~p_dw_i~0 1)))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse18) (or (= |old(~q_free~0)| 0) .cse18 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse14 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13) (or (not .cse14) .cse0 (and .cse5 .cse6 .cse8 (<= .cse15 ~p_num_write~0) .cse16 .cse9 (<= ~p_num_write~0 .cse15)) .cse17 .cse4 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse12 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse0 .cse1 .cse2 (and .cse6 .cse7 .cse9) .cse4 .cse14) (or .cse1 .cse2 .cse3 .cse4 .cse11 .cse12 .cse13 (and .cse5 .cse6 .cse8 .cse7 .cse9 .cse10) .cse14) (or .cse0 (and (<= 2 ~c_dr_st~0) .cse16) .cse17 .cse4 .cse14)))) [2020-08-22 17:04:09,933 INFO L268 CegarLoopResult]: For program point L124-1(line 124) no Hoare annotation was computed. [2020-08-22 17:04:09,933 INFO L268 CegarLoopResult]: For program point L108(lines 107 127) no Hoare annotation was computed. [2020-08-22 17:04:09,933 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2020-08-22 17:04:09,934 INFO L264 CegarLoopResult]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse17 (= ~p_dw_i~0 1))) (let ((.cse8 (not (= |old(~q_free~0)| 1))) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse12 (not (= ~c_num_read~0 0))) (.cse14 (not (= |old(~p_num_write~0)| 0))) (.cse1 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~p_dw_pc~0 1)) (.cse4 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse5 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse6 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse7 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse18 (not (= ~q_free~0 0))) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (not (<= 2 |old(~c_dr_st~0)|))) (.cse19 (not (= |old(~p_dw_pc~0)| 1))) (.cse11 (let ((.cse21 (not .cse17))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse21) (or (= |old(~q_free~0)| 0) .cse21 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse13 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse16 .cse8 .cse9 (and .cse1 (<= ~p_dw_pc~0 0) .cse4 .cse17 .cse18) .cse11 .cse15) (or .cse16 .cse8 (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse7) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse16 .cse19 .cse11 (and (<= 2 ~c_dr_st~0) .cse20 .cse17 .cse18) .cse15) (or (and .cse1 .cse2 .cse3 .cse20 .cse4 .cse5 .cse6 .cse17 .cse7 .cse18) (not .cse15) .cse16 .cse19 .cse11 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse13 (not (<= ~c_num_read~0 |old(~p_num_write~0)|)))))) [2020-08-22 17:04:09,934 INFO L264 CegarLoopResult]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse12 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse20 (= ~p_dw_i~0 1)) (.cse8 (= ~q_free~0 0)) (.cse17 (+ |old(~p_num_write~0)| 1))) (let ((.cse13 (= .cse17 ~p_num_write~0)) (.cse0 (and (= |old(~p_dw_pc~0)| ~p_dw_pc~0) .cse9 (= |old(~q_free~0)| ~q_free~0) .cse12 (= ~q_write_ev~0 |old(~q_write_ev~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_last_write~0 |old(~p_last_write~0)|) .cse20 (= ~p_num_write~0 |old(~p_num_write~0)|) (not .cse8))) (.cse3 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse5 (not (= ~c_num_read~0 0))) (.cse7 (not (= |old(~p_num_write~0)| 0))) (.cse1 (not (= |old(~q_free~0)| 1))) (.cse2 (not (<= |old(~p_dw_pc~0)| 0))) (.cse11 (<= ~p_dw_pc~0 0)) (.cse10 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (<= 2 |old(~c_dr_st~0)|))) (.cse18 (= ~p_dw_pc~0 1)) (.cse16 (not (= |old(~p_dw_pc~0)| 1))) (.cse4 (let ((.cse19 (not .cse20))) (and (or (not (<= 1 |old(~q_free~0)|)) .cse19) (or (= |old(~q_free~0)| 0) .cse19 (= |old(~p_dw_pc~0)| |old(~q_free~0)|))))) (.cse14 (= ~c_dr_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (or .cse15 (and .cse8 .cse10 .cse11 .cse13) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse15 .cse1 .cse2 (and .cse9 .cse11 .cse12) .cse4 .cse14) (or (not .cse14) .cse15 .cse16 (and .cse8 .cse10 (<= .cse17 ~p_num_write~0) .cse18 (<= ~p_num_write~0 .cse17)) .cse4 (not (<= |old(~p_num_write~0)| ~c_num_read~0)) .cse6 (not (<= ~c_num_read~0 |old(~p_num_write~0)|))) (or .cse15 (and (<= 2 ~c_dr_st~0) .cse18) .cse16 .cse4 .cse14)))) [2020-08-22 17:04:09,934 INFO L268 CegarLoopResult]: For program point L99(lines 99 103) no Hoare annotation was computed. [2020-08-22 17:04:09,935 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-08-22 17:04:09,935 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-08-22 17:04:09,935 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-08-22 17:04:09,935 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-08-22 17:04:09,936 INFO L264 CegarLoopResult]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse2 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~p_num_write~0 1))) (.cse3 (not (<= ~p_dw_pc~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse9 (not (= ~c_num_read~0 1)) .cse10 .cse4 .cse11 .cse12 .cse6) (or .cse0 .cse8 .cse1 .cse11 .cse5) (or .cse0 .cse8 .cse1 .cse3 .cse5) (or (not .cse5) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse9 .cse10 .cse4 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse8 .cse1 (not (<= ~p_num_write~0 .cse13)) (not (<= .cse13 ~p_num_write~0)) .cse4 .cse11 .cse7)))) [2020-08-22 17:04:09,936 INFO L268 CegarLoopResult]: For program point L82(lines 82 86) no Hoare annotation was computed. [2020-08-22 17:04:09,936 INFO L268 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-08-22 17:04:09,936 INFO L268 CegarLoopResult]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2020-08-22 17:04:09,936 INFO L268 CegarLoopResult]: For program point L74(lines 74 78) no Hoare annotation was computed. [2020-08-22 17:04:09,936 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2020-08-22 17:04:09,937 INFO L264 CegarLoopResult]: At program point L72(line 72) the Hoare annotation is: (let ((.cse2 (not (= ~c_num_read~0 0))) (.cse6 (not (= ~p_num_write~0 1))) (.cse3 (not (<= ~p_dw_pc~0 0))) (.cse5 (= ~c_dr_pc~0 1)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (not (= ~q_free~0 1))) (.cse12 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse0 (and (= ~c_dr_st~0 |old(~c_dr_st~0)|) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (.cse8 (not (<= 2 |old(~c_dr_st~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse4 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse11 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (or .cse0 .cse1 .cse9 (not (= ~c_num_read~0 1)) .cse10 .cse4 .cse11 .cse12 .cse6) (or .cse0 .cse8 .cse1 .cse11 .cse5) (or .cse0 .cse8 .cse1 .cse3 .cse5) (or (not .cse5) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) (not (<= ~p_num_write~0 ~c_num_read~0)) .cse1 .cse9 .cse10 .cse4 .cse11 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (or .cse0 .cse8 .cse1 (not (<= ~p_num_write~0 .cse13)) (not (<= .cse13 ~p_num_write~0)) .cse4 .cse11 .cse7)))) [2020-08-22 17:04:09,937 INFO L264 CegarLoopResult]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse16 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse17 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse1 (= ~p_dw_st~0 0))) (let ((.cse9 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (and (<= 2 ~c_dr_st~0) (or (and .cse16 .cse17) .cse1))) (.cse13 (not (= ~c_num_read~0 0))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse8 (not (= ~p_num_write~0 1))) (.cse14 (not (= ~q_free~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse0 (and .cse16 .cse17 (<= immediate_notify_threads_~tmp~0 0) (<= 0 immediate_notify_threads_~tmp~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (not (<= 2 |old(~p_dw_st~0)|))) (.cse4 (not (= ~q_free~0 1))) (.cse5 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse7 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= ~c_num_read~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse0 .cse2 .cse10 .cse11) (or .cse9 .cse2 .cse12 .cse6 .cse11) (or .cse9 .cse0 .cse2 .cse13 .cse10 .cse5 .cse8 .cse14) (let ((.cse15 (+ ~c_num_read~0 1))) (or .cse9 .cse2 (not (<= ~p_num_write~0 .cse15)) (not (<= .cse15 ~p_num_write~0)) .cse5 .cse12 .cse6 .cse14)) (or .cse0 .cse2 .cse13 .cse10 .cse5 .cse11 .cse8 .cse14) (or (not .cse11) .cse0 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse1 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)))) [2020-08-22 17:04:09,937 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-08-22 17:04:09,937 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-08-22 17:04:09,937 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~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)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~c_num_read~0 |old(~c_num_read~0)|) (= ~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)|) (= ~p_dw_i~0 |old(~p_dw_i~0)|) (= ~p_dw_st~0 |old(~p_dw_st~0)|) (= ~q_buf_0~0 |old(~q_buf_0~0)|) (= ~p_num_write~0 |old(~p_num_write~0)|) (= ~c_dr_i~0 |old(~c_dr_i~0)|)) [2020-08-22 17:04:09,937 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-08-22 17:04:09,938 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse41 (= ~p_dw_i~0 1))) (let ((.cse38 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse39 (not (<= 1 |old(~q_free~0)|))) (.cse37 (not .cse41)) (.cse40 (<= 1 ~q_free~0)) (.cse28 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse29 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse30 (= ~a_t~0 |old(~a_t~0)|)) (.cse3 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse31 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse33 (= ~p_dw_st~0 0)) (.cse32 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse34 (= |old(~q_free~0)| ~q_free~0)) (.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse42 (not (= ~p_dw_pc~0 ~q_free~0))) (.cse43 (= |old(~q_free~0)| 0))) (let ((.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse26 (not (= |old(~p_num_write~0)| 0))) (.cse22 (not (= |old(~q_free~0)| 1))) (.cse23 (not (<= |old(~p_dw_pc~0)| 0))) (.cse2 (= |old(~c_dr_pc~0)| 1)) (.cse17 (not .cse43)) (.cse9 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~c_num_read~0 0)) (.cse27 (not (= |old(~c_num_read~0)| 0))) (.cse19 (or (and .cse28 .cse29 .cse30 .cse40 .cse3 .cse31 .cse33 .cse32 .cse34 .cse5 .cse41) (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse33 .cse32 .cse34 .cse5 .cse41 .cse42 (not (= ~q_free~0 0))))) (.cse24 (let ((.cse44 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse43 .cse37 .cse38 .cse44) (or .cse39 .cse37 .cse44)))) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse14 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~p_dw_pc~0 1)) (.cse6 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse8 (or (and .cse28 .cse30 .cse40 .cse31 .cse32 .cse34 .cse41) (and .cse28 .cse30 .cse31 .cse32 .cse34 (not (= ~p_dw_st~0 ~q_free~0)) .cse41 .cse42))) (.cse10 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse11 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse1 (not (= |old(~p_dw_pc~0)| 1))) (.cse16 (not (<= 2 |old(~p_dw_st~0)|))) (.cse35 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse18 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse12 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse37 .cse38) (or .cse39 .cse37))) (.cse36 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|)))) (and (or .cse0 .cse1 (= |old(~p_dw_st~0)| 1) .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (let ((.cse15 (+ |old(~c_num_read~0)| 1))) (or (not .cse2) (let ((.cse13 (+ ~c_num_read~0 1))) (and .cse3 (<= .cse13 ~p_num_write~0) (<= ~p_num_write~0 .cse13) .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse11)) .cse1 (not (<= .cse15 |old(~p_num_write~0)|)) .cse16 .cse17 .cse18 (not (<= |old(~p_num_write~0)| .cse15)) .cse12)) (or (and .cse19 .cse20 .cse7 .cse9 .cse21 .cse11) .cse22 .cse23 .cse24 .cse2 .cse25 .cse18 .cse26 .cse27) (or .cse0 (and .cse28 .cse29 .cse30 .cse3 .cse31 .cse32 .cse7 .cse6 .cse33 .cse34 .cse20 .cse9 .cse11) .cse22 .cse23 .cse24 .cse25 .cse18 .cse26 .cse27) (or .cse0 .cse22 .cse23 .cse24 (and .cse19 .cse6 .cse7 .cse9 .cse10 .cse11) .cse2) (or .cse1 .cse16 (not (= |old(~p_num_write~0)| 1)) .cse17 (and .cse3 .cse14 .cse4 .cse5 .cse7 .cse8 .cse9 .cse21 .cse11) .cse18 .cse12 .cse27) (or .cse0 (and .cse19 .cse14 .cse6 .cse7 .cse10 .cse11) .cse24 .cse1 .cse35 .cse18 .cse36) (or .cse0 (and .cse3 .cse14 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11) .cse1 .cse16 .cse35 .cse18 .cse12 .cse36))))) [2020-08-22 17:04:09,939 INFO L264 CegarLoopResult]: At program point L254(line 254) the Hoare annotation is: (let ((.cse36 (= ~p_dw_i~0 1))) (let ((.cse35 (= ~p_dw_pc~0 1)) (.cse37 (not (= ~q_free~0 0))) (.cse38 (+ |old(~c_num_read~0)| 1)) (.cse19 (= |old(~c_dr_pc~0)| 1)) (.cse39 (= |old(~q_free~0)| 0)) (.cse32 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse33 (not (<= 1 |old(~q_free~0)|))) (.cse31 (not .cse36)) (.cse29 (<= 2 ~c_dr_st~0)) (.cse23 (= ~p_last_write~0 ~q_buf_0~0)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse28 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse27 (= ~c_num_read~0 0)) (.cse34 (= ~c_dr_pc~0 1))) (let ((.cse0 (and .cse29 .cse23 (<= ~p_dw_pc~0 0) .cse25 (= ~q_free~0 1) .cse28 .cse27 .cse34)) (.cse6 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse9 (not (= |old(~p_num_write~0)| 0))) (.cse10 (not (= |old(~c_num_read~0)| 0))) (.cse2 (not (= |old(~q_free~0)| 1))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse22 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse24 (= |old(~q_free~0)| ~q_free~0)) (.cse26 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse3 (let ((.cse40 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse39 .cse31 .cse32 .cse40) (or .cse33 .cse31 .cse40)))) (.cse15 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse16 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse4 (not .cse19)) (.cse17 (not (<= .cse38 |old(~p_num_write~0)|))) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (and .cse29 (<= ~p_num_write~0 ~c_num_read~0) .cse23 .cse35 .cse36 (<= ~c_num_read~0 ~p_num_write~0) .cse37 .cse34)) (.cse13 (not .cse39)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse18 (not (<= |old(~p_num_write~0)| .cse38))) (.cse1 (not (<= 2 |old(~c_dr_st~0)|))) (.cse11 (not (= |old(~p_dw_pc~0)| 1))) (.cse30 (and .cse29 (not .cse34) .cse35 .cse36 .cse37)) (.cse14 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse31 .cse32) (or .cse33 .cse31)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (or .cse11 .cse12 .cse7 (not (= |old(~p_num_write~0)| 1)) .cse13 .cse8 .cse14 .cse10) (or .cse1 .cse4 .cse11 .cse12 .cse15 .cse8 .cse14 .cse16) (or .cse1 .cse4 .cse11 .cse17 .cse12 .cse13 .cse8 .cse18 .cse14) (or .cse0 .cse2 .cse3 .cse5 .cse19 .cse6 (and .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) .cse7 .cse8 .cse9 .cse10) (or .cse1 .cse2 .cse5 .cse3 .cse19 (and .cse29 .cse20 .cse21 .cse22 .cse24 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse26 .cse28) .cse30) (or .cse1 .cse4 .cse3 .cse11 .cse7 .cse15 .cse8 .cse16) (or .cse4 .cse11 .cse17 .cse12 .cse7 .cse13 .cse8 .cse18 .cse14) (or .cse1 .cse11 (= |old(~p_dw_st~0)| 1) .cse19 .cse30 .cse14))))) [2020-08-22 17:04:09,939 INFO L268 CegarLoopResult]: For program point L242(lines 242 246) no Hoare annotation was computed. [2020-08-22 17:04:09,939 INFO L268 CegarLoopResult]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2020-08-22 17:04:09,939 INFO L268 CegarLoopResult]: For program point L240(line 240) no Hoare annotation was computed. [2020-08-22 17:04:09,940 INFO L264 CegarLoopResult]: At program point L238(line 238) the Hoare annotation is: (let ((.cse54 (+ ~c_num_read~0 1)) (.cse35 (= ~q_free~0 0)) (.cse55 (<= 1 ~q_free~0)) (.cse56 (= ~p_dw_i~0 1))) (let ((.cse51 (+ |old(~c_num_read~0)| 1)) (.cse34 (= |old(~c_dr_pc~0)| 1)) (.cse45 (not (= ~p_dw_st~0 1))) (.cse52 (= |old(~q_free~0)| 0)) (.cse49 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse50 (not (<= 1 |old(~q_free~0)|))) (.cse48 (not .cse56)) (.cse37 (<= 2 ~c_dr_st~0)) (.cse46 (<= ~p_num_write~0 ~c_num_read~0)) (.cse30 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse56 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse35)) (and .cse55 .cse57 .cse56)))) (.cse44 (<= ~c_num_read~0 ~p_num_write~0)) (.cse47 (<= .cse54 ~p_num_write~0)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse43 (or (and .cse55 .cse56) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse56))) (.cse27 (= ~c_dr_pc~0 1))) (let ((.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (not (= |old(~p_num_write~0)| 0))) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_num_read~0 0)) (.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse0 (and .cse35 .cse47 .cse36 (<= ~p_num_write~0 .cse54) .cse17 .cse19 .cse43 .cse27)) (.cse1 (and .cse37 .cse46 .cse17 .cse19 .cse30 .cse44 .cse27)) (.cse3 (and .cse37 .cse46 .cse36 .cse17 .cse19 .cse43 .cse44 .cse27)) (.cse23 (not (= |old(~q_free~0)| 1))) (.cse33 (not (<= |old(~p_dw_pc~0)| 0))) (.cse31 (let ((.cse53 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse52 .cse48 .cse49 .cse53) (or .cse50 .cse48 .cse53)))) (.cse26 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse28 (<= ~p_dw_pc~0 0)) (.cse42 (and (not .cse27) .cse37 .cse45 .cse19 .cse43)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse32 (not .cse34)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse38 (not (<= .cse51 |old(~p_num_write~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse52)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse39 (not (<= |old(~p_num_write~0)| .cse51))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse48 .cse49) (or .cse50 .cse48)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse0 .cse22 .cse23 .cse3 .cse24 .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse15 .cse16 .cse27 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse32 .cse33 .cse8) (or .cse0 .cse23 .cse3 .cse34 .cse24 (and .cse35 .cse36 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse33 (and .cse37 .cse17 .cse28 .cse29 (= ~q_free~0 1) .cse30 .cse21 .cse16 .cse27) .cse8) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7) (or .cse0 .cse22 .cse1 .cse32 .cse31 .cse2 .cse3 .cse40 .cse6 .cse41) (or .cse22 .cse23 .cse33 .cse42 .cse31 .cse34 (and .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse15 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse28 .cse18 .cse20 .cse30 .cse21)) (or .cse22 .cse42 .cse2 (= |old(~p_dw_st~0)| 1) .cse34 .cse7) (or .cse22 .cse32 .cse2 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse44 .cse27 .cse37 .cse45 .cse46 .cse17 .cse19 .cse18 .cse20 .cse21) .cse40 .cse6 .cse7 .cse41) (or .cse22 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse27 .cse37 .cse47 .cse45 .cse17 .cse19 .cse20 .cse21) .cse32 .cse2 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7))))) [2020-08-22 17:04:09,940 INFO L264 CegarLoopResult]: At program point L269(line 269) the Hoare annotation is: (let ((.cse36 (= ~p_dw_i~0 1))) (let ((.cse33 (+ |old(~c_num_read~0)| 1)) (.cse22 (= ~q_free~0 0)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse6 (= ~p_last_write~0 ~q_buf_0~0)) (.cse23 (= ~p_dw_pc~0 1)) (.cse19 (= |old(~c_dr_pc~0)| 1)) (.cse34 (= |old(~q_free~0)| 0)) (.cse31 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse32 (not (<= 1 |old(~q_free~0)|))) (.cse30 (not .cse36))) (let ((.cse3 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse4 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse7 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse8 (= |old(~q_free~0)| ~q_free~0)) (.cse9 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse26 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse27 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse16 (not (= |old(~q_free~0)| 1))) (.cse17 (not (<= |old(~p_dw_pc~0)| 0))) (.cse18 (let ((.cse37 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse34 .cse30 .cse31 .cse37) (or .cse32 .cse30 .cse37)))) (.cse20 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse24 (not (= |old(~p_num_write~0)| 0))) (.cse14 (not (= |old(~c_num_read~0)| 0))) (.cse25 (not .cse19)) (.cse1 (let ((.cse35 (+ ~c_num_read~0 1))) (and .cse22 (<= .cse35 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse35) .cse6 .cse23 .cse36 (= ~c_dr_pc~0 1)))) (.cse28 (not (<= .cse33 |old(~p_num_write~0)|))) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not .cse34)) (.cse12 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse29 (not (<= |old(~p_num_write~0)| .cse33))) (.cse15 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (= |old(~p_dw_pc~0)| 1))) (.cse13 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse30 .cse31) (or .cse32 .cse30)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~p_num_write~0)| 1)) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse9 .cse10) .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19) (let ((.cse21 (= ~c_num_read~0 0))) (or .cse16 .cse18 .cse17 .cse19 .cse1 .cse20 (and .cse3 .cse4 (= ~p_dw_st~0 0) .cse7 .cse6 .cse8 (= ~c_last_read~0 ~p_last_write~0) .cse9 .cse21 .cse10) (and .cse22 .cse5 .cse6 .cse23 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse21) .cse12 .cse24 .cse14)) (or .cse15 .cse25 .cse0 .cse2 .cse26 .cse12 .cse13 .cse27) (or .cse15 .cse25 .cse0 .cse28 .cse2 .cse11 .cse12 .cse29 .cse13) (or .cse15 .cse18 .cse0 .cse1 .cse26 .cse12 .cse27) (or .cse15 .cse16 .cse17 .cse18 .cse1 .cse20 .cse12 .cse24 .cse14) (or .cse25 .cse0 .cse1 .cse28 .cse2 .cse11 .cse12 .cse29 .cse13) (or .cse15 .cse0 (= |old(~p_dw_st~0)| 1) .cse19 .cse13))))) [2020-08-22 17:04:09,940 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2020-08-22 17:04:09,940 INFO L268 CegarLoopResult]: For program point L251(lines 251 258) no Hoare annotation was computed. [2020-08-22 17:04:09,941 INFO L268 CegarLoopResult]: For program point L247(lines 237 277) no Hoare annotation was computed. [2020-08-22 17:04:09,941 INFO L264 CegarLoopResult]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse43 (= ~q_free~0 0)) (.cse56 (<= 1 ~q_free~0)) (.cse14 (= ~p_dw_i~0 1))) (let ((.cse50 (<= ~p_num_write~0 ~c_num_read~0)) (.cse34 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse14 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse43)) (and .cse56 .cse57 .cse14)))) (.cse52 (<= ~c_num_read~0 ~p_num_write~0)) (.cse44 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse15 (= ~c_dr_pc~0 1)) (.cse16 (<= 2 ~c_dr_st~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse51 (or (and .cse56 .cse14) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse14))) (.cse49 (= |old(~q_free~0)| 0)) (.cse47 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse48 (not (<= 1 |old(~q_free~0)|))) (.cse46 (not .cse14)) (.cse42 (= |old(~c_dr_pc~0)| 1)) (.cse55 (+ |old(~c_num_read~0)| 1))) (let ((.cse28 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse29 (not (= |old(~p_num_write~0)| 0))) (.cse33 (= ~c_last_read~0 ~p_last_write~0)) (.cse31 (= ~c_num_read~0 0)) (.cse3 (not (<= .cse55 |old(~p_num_write~0)|))) (.cse23 (not (<= |old(~p_num_write~0)| .cse55))) (.cse1 (not .cse42)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse26 (not (= |old(~q_free~0)| 1))) (.cse37 (not (<= |old(~p_dw_pc~0)| 0))) (.cse36 (let ((.cse54 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse49 .cse46 .cse47 .cse54) (or .cse48 .cse46 .cse54)))) (.cse30 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse32 (<= ~p_dw_pc~0 0)) (.cse0 (not (<= 2 |old(~c_dr_st~0)|))) (.cse45 (and (not .cse15) .cse16 (not (= ~p_dw_st~0 1)) .cse19 .cse51)) (.cse25 (let ((.cse53 (+ ~c_num_read~0 1))) (and .cse43 (<= .cse53 ~p_num_write~0) .cse44 (<= ~p_num_write~0 .cse53) .cse17 .cse19 .cse51 .cse15))) (.cse6 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse7 (= ~a_t~0 |old(~a_t~0)|)) (.cse8 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse9 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse10 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse11 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~c_num_read~0 |old(~c_num_read~0)|)) (.cse13 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse39 (= ~p_last_write~0 |old(~p_last_write~0)|)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse35 (and .cse16 .cse50 .cse17 .cse19 .cse34 .cse52 .cse15)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse27 (and .cse16 .cse50 .cse44 .cse17 .cse19 .cse51 .cse52 .cse15)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse49)) (.cse22 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse24 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse46 .cse47) (or .cse48 .cse46))) (.cse38 (not (= |old(~c_num_read~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23 .cse24) (or .cse25 .cse0 .cse26 .cse27 .cse28 .cse22 .cse29 (and .cse7 .cse30 .cse8 .cse9 .cse13 .cse31 .cse15 .cse17 .cse32 .cse18 .cse33 .cse20 .cse34 .cse21) .cse35 .cse36 .cse1 .cse37 .cse38) (or .cse0 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse39 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21) .cse1 .cse2 .cse4 .cse40 .cse22 .cse24 .cse41) (or .cse25 .cse26 .cse27 .cse42 .cse28 (and .cse43 .cse44 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse31) .cse22 .cse29 (and .cse7 .cse30 .cse8 .cse9 .cse10 .cse13 .cse31 .cse17 .cse32 .cse18 .cse33 .cse20 .cse34 .cse21) .cse35 .cse36 .cse37 (and .cse16 .cse17 .cse32 .cse33 (= ~q_free~0 1) .cse34 .cse21 .cse31 .cse15) .cse38) (or .cse25 .cse35 .cse1 .cse2 .cse27 .cse3 .cse4 .cse5 .cse22 .cse23 .cse24) (or .cse25 .cse0 .cse35 .cse1 .cse36 .cse2 .cse27 .cse40 .cse22 .cse41) (or .cse0 .cse26 .cse37 .cse45 .cse36 .cse42 (and .cse6 .cse7 .cse30 .cse8 .cse9 .cse10 .cse12 .cse13 .cse39 .cse32 .cse18 .cse20 .cse34 .cse21)) (or .cse0 .cse45 .cse2 (= |old(~p_dw_st~0)| 1) .cse42 .cse24) (or .cse25 (and .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse39 .cse19 .cse18 .cse20 .cse21) .cse35 .cse2 .cse27 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse22 .cse24 .cse38))))) [2020-08-22 17:04:09,941 INFO L268 CegarLoopResult]: For program point L266(lines 266 273) no Hoare annotation was computed. [2020-08-22 17:04:09,942 INFO L264 CegarLoopResult]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse54 (+ ~c_num_read~0 1)) (.cse35 (= ~q_free~0 0)) (.cse55 (<= 1 ~q_free~0)) (.cse56 (= ~p_dw_i~0 1))) (let ((.cse51 (+ |old(~c_num_read~0)| 1)) (.cse34 (= |old(~c_dr_pc~0)| 1)) (.cse45 (not (= ~p_dw_st~0 1))) (.cse52 (= |old(~q_free~0)| 0)) (.cse49 (= |old(~p_dw_pc~0)| |old(~q_free~0)|)) (.cse50 (not (<= 1 |old(~q_free~0)|))) (.cse48 (not .cse56)) (.cse37 (<= 2 ~c_dr_st~0)) (.cse46 (<= ~p_num_write~0 ~c_num_read~0)) (.cse30 (let ((.cse57 (= ~p_dw_st~0 0))) (or (and .cse57 .cse56 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse35)) (and .cse55 .cse57 .cse56)))) (.cse44 (<= ~c_num_read~0 ~p_num_write~0)) (.cse47 (<= .cse54 ~p_num_write~0)) (.cse36 (<= 2 ~p_dw_st~0)) (.cse17 (= ~p_last_write~0 ~q_buf_0~0)) (.cse19 (= ~p_dw_pc~0 1)) (.cse43 (or (and .cse55 .cse56) (and (not (= ~p_dw_st~0 ~q_free~0)) .cse56))) (.cse27 (= ~c_dr_pc~0 1))) (let ((.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse25 (not (= |old(~p_num_write~0)| 0))) (.cse29 (= ~c_last_read~0 ~p_last_write~0)) (.cse16 (= ~c_num_read~0 0)) (.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse0 (and .cse35 .cse47 .cse36 (<= ~p_num_write~0 .cse54) .cse17 .cse19 .cse43 .cse27)) (.cse1 (and .cse37 .cse46 .cse17 .cse19 .cse30 .cse44 .cse27)) (.cse3 (and .cse37 .cse46 .cse36 .cse17 .cse19 .cse43 .cse44 .cse27)) (.cse23 (not (= |old(~q_free~0)| 1))) (.cse33 (not (<= |old(~p_dw_pc~0)| 0))) (.cse31 (let ((.cse53 (not (= |old(~p_dw_st~0)| 0)))) (and (or .cse52 .cse48 .cse49 .cse53) (or .cse50 .cse48 .cse53)))) (.cse26 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse13 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse28 (<= ~p_dw_pc~0 0)) (.cse42 (and (not .cse27) .cse37 .cse45 .cse19 .cse43)) (.cse18 (= |old(~q_free~0)| ~q_free~0)) (.cse40 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse41 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse22 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse10 (= ~a_t~0 |old(~a_t~0)|)) (.cse11 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse12 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse15 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse20 (= ~q_buf_0~0 |old(~q_buf_0~0)|)) (.cse21 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse32 (not .cse34)) (.cse2 (not (= |old(~p_dw_pc~0)| 1))) (.cse38 (not (<= .cse51 |old(~p_num_write~0)|))) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (not .cse52)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse39 (not (<= |old(~p_num_write~0)| .cse51))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse48 .cse49) (or .cse50 .cse48)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= |old(~p_num_write~0)| 1)) .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse0 .cse22 .cse23 .cse3 .cse24 .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse15 .cse16 .cse27 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse32 .cse33 .cse8) (or .cse0 .cse23 .cse3 .cse34 .cse24 (and .cse35 .cse36 .cse17 .cse19 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse16) .cse6 .cse25 (and .cse10 .cse26 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse29 .cse20 .cse30 .cse21) .cse1 .cse31 .cse33 (and .cse37 .cse17 .cse28 .cse29 (= ~q_free~0 1) .cse30 .cse21 .cse16 .cse27) .cse8) (or .cse0 .cse1 .cse32 .cse2 .cse3 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7) (or .cse0 .cse22 .cse1 .cse32 .cse31 .cse2 .cse3 .cse40 .cse6 .cse41) (or .cse22 .cse23 .cse33 .cse42 .cse31 .cse34 (and .cse9 .cse10 .cse26 .cse11 .cse12 .cse13 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse15 (= ~p_last_write~0 |old(~p_last_write~0)|) .cse28 .cse18 .cse20 .cse30 .cse21)) (or .cse22 .cse42 .cse2 (= |old(~p_dw_st~0)| 1) .cse34 .cse7) (or .cse22 .cse32 .cse2 .cse4 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse44 .cse27 .cse37 .cse45 .cse46 .cse17 .cse19 .cse18 .cse20 .cse21) .cse40 .cse6 .cse7 .cse41) (or .cse22 (and .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse43 .cse27 .cse37 .cse47 .cse45 .cse17 .cse19 .cse20 .cse21) .cse32 .cse2 .cse38 .cse4 .cse5 .cse6 .cse39 .cse7))))) [2020-08-22 17:04:09,942 INFO L268 CegarLoopResult]: For program point L290-1(line 290) no Hoare annotation was computed. [2020-08-22 17:04:09,942 INFO L271 CegarLoopResult]: At program point L299(lines 288 301) the Hoare annotation is: true [2020-08-22 17:04:09,942 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2020-08-22 17:04:09,943 INFO L268 CegarLoopResult]: For program point L292(lines 292 297) no Hoare annotation was computed. [2020-08-22 17:04:09,943 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2020-08-22 17:04:09,943 INFO L271 CegarLoopResult]: At program point L290(line 290) the Hoare annotation is: true [2020-08-22 17:04:09,943 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2020-08-22 17:04:09,943 INFO L264 CegarLoopResult]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~c_dr_st~0))) (.cse5 (not (= ~c_num_read~0 1))) (.cse6 (not (= ~q_free~0 1))) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse2 (not (<= ~p_dw_pc~0 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (and (<= 0 is_do_read_c_triggered_~__retres1~1) (<= is_do_read_c_triggered_~__retres1~1 0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse10 (not (= ~p_num_write~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~p_dw_st~0 0)) .cse1 .cse5 .cse6 .cse7 .cse3 .cse8 .cse4 .cse9 .cse10) (or .cse0 .cse1 .cse3 .cse8 .cse4) (or .cse1 .cse5 .cse6 .cse7 .cse3 (not (<= 2 ~p_dw_st~0)) .cse8 .cse4 .cse9 .cse10) (or .cse1 (not (= ~c_num_read~0 0)) .cse2 .cse7 .cse3 .cse4 .cse10 (not (= ~q_free~0 0))))) [2020-08-22 17:04:09,943 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2020-08-22 17:04:09,943 INFO L268 CegarLoopResult]: For program point L52(lines 52 57) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point L51(lines 51 60) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (not (= |old(~q_free~0)| 1)) (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (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)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~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 (= ~p_dw_i~0 1)) (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-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point L320(lines 320 324) no Hoare annotation was computed. [2020-08-22 17:04:09,944 INFO L268 CegarLoopResult]: For program point L318(line 318) no Hoare annotation was computed. [2020-08-22 17:04:09,945 INFO L264 CegarLoopResult]: At program point L317(line 317) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-08-22 17:04:09,945 INFO L264 CegarLoopResult]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-08-22 17:04:09,945 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2020-08-22 17:04:09,945 INFO L268 CegarLoopResult]: For program point L314(line 314) no Hoare annotation was computed. [2020-08-22 17:04:09,946 INFO L264 CegarLoopResult]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse16 (= ~q_free~0 0)) (.cse19 (<= 1 ~q_free~0)) (.cse20 (= ~p_dw_i~0 1))) (let ((.cse12 (<= ~p_num_write~0 ~c_num_read~0)) (.cse15 (<= ~c_num_read~0 ~p_num_write~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse2 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse5 (= |old(~q_free~0)| ~q_free~0)) (.cse7 (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (.cse14 (= ~p_dw_pc~0 1)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse3 (<= ~p_dw_pc~0 0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse6 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (let ((.cse21 (= ~p_dw_st~0 0))) (or (and .cse21 .cse20 (not (= ~p_dw_pc~0 ~q_free~0)) (not .cse16)) (and .cse19 .cse21 .cse20)))) (.cse10 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse9 (= ~c_num_read~0 0)) (.cse18 (= ~c_dr_pc~0 1))) (or (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse12 .cse13 .cse4 .cse14 .cse15) (= |old(~c_dr_pc~0)| 1) (and .cse11 .cse12 .cse4 .cse14 .cse15 .cse8) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse16 .cse13 .cse4 .cse14 (= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse9) (not (= |old(~p_num_write~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (let ((.cse17 (+ ~c_num_read~0 1))) (and .cse16 (<= .cse17 ~p_num_write~0) .cse13 (<= ~p_num_write~0 .cse17) .cse4 .cse14 .cse18)) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse7 .cse8 .cse10) (not (<= |old(~p_dw_pc~0)| 0)) (and (not .cse18) .cse11 (not (= ~p_dw_st~0 1)) .cse14 (or .cse19 (not (= ~p_dw_st~0 ~q_free~0)))) (and .cse11 .cse3 .cse4 .cse6 (= ~q_free~0 1) .cse8 .cse10 .cse9 .cse18) (not .cse20) (not (= |old(~c_num_read~0)| 0))))) [2020-08-22 17:04:09,946 INFO L264 CegarLoopResult]: At program point L310(line 310) the Hoare annotation is: (or (not (= |old(~q_free~0)| 1)) (not (<= |old(~p_dw_pc~0)| 0)) (= |old(~c_dr_pc~0)| 1) (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)|) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= ~q_write_ev~0 |old(~q_write_ev~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 (= ~p_dw_i~0 1)) (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-08-22 17:04:09,946 INFO L271 CegarLoopResult]: At program point L326(lines 303 331) the Hoare annotation is: true [2020-08-22 17:04:09,946 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (= ~q_free~0 0) (not (= ~c_dr_pc~0 1)) (= ~p_dw_st~0 0) (= ~p_last_write~0 ~q_buf_0~0) (<= ~p_dw_pc~0 0) (= ~c_last_read~0 ~p_last_write~0) (not (= ~p_dw_i~0 1)) (= ~p_num_write~0 0) (= ~c_num_read~0 0)) [2020-08-22 17:04:09,947 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point L33(lines 33 38) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point L32(lines 32 41) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2020-08-22 17:04:09,947 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2020-08-22 17:04:09,948 INFO L264 CegarLoopResult]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~c_dr_st~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse5 (not (= ~c_num_read~0 0))) (.cse2 (not (<= ~p_dw_pc~0 0))) (.cse6 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (and (<= 0 is_do_write_p_triggered_~__retres1~0) (<= is_do_write_p_triggered_~__retres1~0 0))) (.cse4 (= ~c_dr_pc~0 1)) (.cse7 (not (= ~p_num_write~0 1))) (.cse8 (not (= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse2 .cse6 .cse3 .cse7 .cse8) (or .cse1 .cse5 .cse2 .cse6 .cse3 .cse4 .cse7 .cse8))) [2020-08-22 17:04:09,948 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2020-08-22 17:04:09,948 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2020-08-22 17:04:09,948 INFO L264 CegarLoopResult]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse8 (not (= |old(~c_num_read~0)| 0))) (.cse10 (<= 2 ~p_dw_st~0)) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse2 (<= 2 ~c_dr_st~0)) (.cse3 (= ~p_dw_st~0 0)) (.cse4 (= ~c_last_read~0 ~p_last_write~0)) (.cse5 (= ~q_free~0 1)) (.cse6 (= ~c_dr_pc~0 1)) (.cse11 (not (<= 2 |old(~p_dw_st~0)|))) (.cse12 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse14 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) (and .cse2 .cse3 .cse4 .cse5 (= ~c_num_read~0 0) .cse6) .cse7 (not (= |old(~p_dw_st~0)| 0)) .cse8) (let ((.cse9 (= ~c_num_read~0 1))) (or (and .cse2 .cse9 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse9 .cse10 .cse4 .cse5 .cse6) .cse11 .cse12 .cse13 .cse7 .cse8 .cse14 (not (= ~p_num_write~0 1)))) (let ((.cse16 (<= ~p_num_write~0 ~c_num_read~0)) (.cse17 (<= ~c_num_read~0 ~p_num_write~0)) (.cse15 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse15 ~p_num_write~0)) (and .cse2 .cse16 .cse10 .cse4 .cse5 .cse17 .cse6) (not .cse0) (and .cse2 .cse16 .cse3 .cse4 .cse5 .cse17 .cse6) (not (<= ~p_num_write~0 .cse15)) .cse11 .cse12 .cse13 .cse7 .cse14))))) [2020-08-22 17:04:09,948 INFO L268 CegarLoopResult]: For program point L151(lines 150 185) no Hoare annotation was computed. [2020-08-22 17:04:09,948 INFO L264 CegarLoopResult]: At program point L182(line 182) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse4 .cse5 .cse6 .cse2 .cse3 .cse7 (not (= ~p_num_write~0 1))) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse8 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse8)) .cse4 .cse5 .cse6 .cse2 .cse7))))) [2020-08-22 17:04:09,949 INFO L264 CegarLoopResult]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse10 (= ~p_dw_pc~0 1)) (.cse5 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse12 (= ~q_free~0 1)) (.cse13 (= ~p_dw_i~0 1))) (let ((.cse21 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= ~a_t~0 |old(~a_t~0)|)) (.cse1 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|)) (.cse4 (= |old(~q_free~0)| ~q_free~0)) (.cse6 (= ~c_num_read~0 0)) (.cse23 (= |old(~c_dr_pc~0)| 1)) (.cse8 (= ~p_dw_st~0 0)) (.cse14 (not .cse13)) (.cse15 (not (<= 2 |old(~p_dw_st~0)|))) (.cse16 (= |old(~q_free~0)| ~p_dw_pc~0)) (.cse19 (let ((.cse27 (<= 1 ~q_free~0))) (or (and .cse27 (not (= ~p_dw_st~0 1)) .cse10 .cse12 .cse13 (= ~c_dr_pc~0 1)) (and .cse27 .cse2 .cse10 .cse5 .cse12 .cse13)))) (.cse20 (<= 2 ~p_dw_st~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse18 (not (= |old(~q_free~0)| 0))) (.cse17 (not .cse9)) (.cse22 (not .cse10))) (and (let ((.cse7 (= ~c_num_read~0 1))) (or (and (= ~c_last_read~0 |old(~c_last_read~0)|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse7 .cse19 .cse20 .cse11) .cse21 .cse22 (not (= ~p_num_write~0 1)))) (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse23 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse14 (not (<= ~p_dw_pc~0 0)) .cse17 (not (= |old(~p_dw_st~0)| 0)) .cse21 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6)) (let ((.cse24 (+ |old(~c_num_read~0)| 1)) (.cse25 (<= ~p_num_write~0 ~c_num_read~0)) (.cse26 (<= ~c_num_read~0 ~p_num_write~0))) (or (not (<= .cse24 ~p_num_write~0)) (not .cse23) (not (<= ~p_num_write~0 .cse24)) (and .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26) .cse14 .cse15 .cse16 (and .cse19 .cse25 .cse20 .cse11 .cse26) .cse18 .cse17 .cse22))))) [2020-08-22 17:04:09,949 INFO L264 CegarLoopResult]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse8 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse9 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (let ((.cse4 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse4 ~p_num_write~0)) (let ((.cse5 (+ ~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) (<= .cse5 ~p_num_write~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_num_write~0 .cse5) (= ~c_dr_pc~0 |old(~c_dr_pc~0)|) (= |old(~q_free~0)| ~q_free~0) (= |old(~p_dw_st~0)| ~p_dw_st~0))) (not .cse0) (not (<= ~p_num_write~0 .cse4)) .cse6 .cse7 .cse8 .cse2 .cse9)) (or .cse0 .cse6 .cse7 .cse8 .cse2 .cse3 .cse9 (not (= ~p_num_write~0 1)))))) [2020-08-22 17:04:09,949 INFO L268 CegarLoopResult]: For program point L172(lines 172 184) no Hoare annotation was computed. [2020-08-22 17:04:09,949 INFO L268 CegarLoopResult]: For program point L139(lines 139 147) no Hoare annotation was computed. [2020-08-22 17:04:09,950 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse18 (= ~p_dw_i~0 1))) (let ((.cse15 (not .cse18)) (.cse12 (= ~a_t~0 |old(~a_t~0)|)) (.cse13 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse14 (= ~c_dr_pc~0 |old(~c_dr_pc~0)|))) (let ((.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (let ((.cse16 (= ~c_last_read~0 |old(~c_last_read~0)|)) (.cse17 (= |old(~q_free~0)| ~q_free~0))) (or (and .cse16 .cse12 (<= 1 ~q_free~0) .cse13 .cse14 .cse17 .cse18) (and .cse16 .cse12 .cse13 .cse14 .cse17 (not (= ~p_dw_st~0 ~q_free~0)) .cse18 (not (= ~p_dw_pc~0 ~q_free~0)))))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse15 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse15))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse0 (= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse1 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse3 (= ~c_num_read~0 0)) (.cse11 (= |old(~c_dr_pc~0)| 1)) (.cse7 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse8 (not (= |old(~c_num_read~0)| 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= ~p_num_write~0 1))) (let ((.cse10 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse10 ~p_num_write~0)) (not .cse11) (not (<= ~p_num_write~0 .cse10)) .cse4 (and .cse0 .cse1 (= ~c_num_read~0 |old(~c_num_read~0)|) .cse2) .cse5 .cse6 .cse7 .cse9)) (or (and .cse12 .cse0 .cse13 .cse14 .cse1 (= ~c_last_read~0 ~p_last_write~0) (= ~q_free~0 1) .cse3) (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse11 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse15 (not (<= ~p_dw_pc~0 0)) .cse7 (not (= |old(~p_dw_st~0)| 0)) .cse8))))) [2020-08-22 17:04:09,950 INFO L268 CegarLoopResult]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2020-08-22 17:04:09,950 INFO L264 CegarLoopResult]: At program point L177(line 177) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse5 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse7 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse4 .cse5 .cse6 .cse2 .cse3 .cse7 (not (= ~p_num_write~0 1))) (let ((.cse8 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse8 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse8)) .cse4 .cse5 .cse6 .cse2 .cse7))))) [2020-08-22 17:04:09,950 INFO L268 CegarLoopResult]: For program point L142(lines 142 146) no Hoare annotation was computed. [2020-08-22 17:04:09,950 INFO L268 CegarLoopResult]: For program point L173(lines 173 179) no Hoare annotation was computed. [2020-08-22 17:04:09,951 INFO L264 CegarLoopResult]: At program point L169(line 169) the Hoare annotation is: (let ((.cse1 (not (= ~p_dw_i~0 1)))) (let ((.cse3 (not (= |old(~c_num_read~0)| 0))) (.cse0 (= |old(~c_dr_pc~0)| 1)) (.cse4 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (and (or (= |old(~p_dw_st~0)| |old(~q_free~0)|) .cse1 (= |old(~q_free~0)| ~p_dw_pc~0)) (or (not (<= 1 |old(~q_free~0)|)) .cse1))) (.cse6 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse7 (= |old(~p_dw_st~0)| ~p_dw_st~0)) (.cse8 (= ~c_last_read~0 ~p_last_write~0)) (.cse9 (= ~q_free~0 1)) (.cse5 (= ~c_dr_pc~0 1)) (.cse11 (not (= |old(~q_free~0)| 0))) (.cse2 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse12 (not (= ~p_dw_pc~0 1)))) (and (or (not (= ~p_num_write~0 0)) (not (= |old(~q_free~0)| 1)) .cse0 (not (= ~p_last_write~0 |old(~c_last_read~0)|)) .cse1 (not (<= ~p_dw_pc~0 0)) .cse2 (not (= |old(~p_dw_st~0)| 0)) .cse3) (or .cse0 .cse4 (and (not .cse5) (= ~c_num_read~0 1) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 .cse2 .cse3 .cse12 (not (= ~p_num_write~0 1))) (let ((.cse13 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse13 ~p_num_write~0)) (not .cse0) (not (<= ~p_num_write~0 .cse13)) .cse4 .cse10 (and .cse6 (<= ~p_num_write~0 ~c_num_read~0) .cse7 .cse8 .cse9 (<= ~c_num_read~0 ~p_num_write~0) .cse5) .cse11 .cse2 .cse12))))) [2020-08-22 17:04:09,951 INFO L268 CegarLoopResult]: For program point L169-1(line 169) no Hoare annotation was computed. [2020-08-22 17:04:09,951 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2020-08-22 17:04:09,951 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2020-08-22 17:04:09,951 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (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) (= ~c_dr_pc~0 |old(~c_dr_pc~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_num_read~0 0) (= ~p_num_write~0 |old(~p_num_write~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~c_dr_pc~0)| 1) (= |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-08-22 17:04:10,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 05:04:10 BoogieIcfgContainer [2020-08-22 17:04:10,070 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 17:04:10,078 INFO L168 Benchmark]: Toolchain (without parser) took 69103.70 ms. Allocated memory was 139.5 MB in the beginning and 820.0 MB in the end (delta: 680.5 MB). Free memory was 102.0 MB in the beginning and 431.9 MB in the end (delta: -329.9 MB). Peak memory consumption was 679.2 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,079 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.62 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 180.8 MB in the end (delta: -78.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,080 INFO L168 Benchmark]: Boogie Preprocessor took 46.15 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 178.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,081 INFO L168 Benchmark]: RCFGBuilder took 623.94 ms. Allocated memory is still 203.4 MB. Free memory was 178.8 MB in the beginning and 151.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,085 INFO L168 Benchmark]: TraceAbstraction took 67985.26 ms. Allocated memory was 203.4 MB in the beginning and 820.0 MB in the end (delta: 616.6 MB). Free memory was 151.5 MB in the beginning and 431.9 MB in the end (delta: -280.4 MB). Peak memory consumption was 664.8 MB. Max. memory is 7.1 GB. [2020-08-22 17:04:10,088 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68 ms. Allocated memory is still 139.5 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 438.62 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.0 MB in the beginning and 180.8 MB in the end (delta: -78.8 MB). Peak memory consumption was 23.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.15 ms. Allocated memory is still 203.4 MB. Free memory was 180.8 MB in the beginning and 178.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 623.94 ms. Allocated memory is still 203.4 MB. Free memory was 178.8 MB in the beginning and 151.5 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 67985.26 ms. Allocated memory was 203.4 MB in the beginning and 820.0 MB in the end (delta: 616.6 MB). Free memory was 151.5 MB in the beginning and 431.9 MB in the end (delta: -280.4 MB). Peak memory consumption was 664.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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: 288]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 230]: Loop Invariant Derived loop invariant: ((((((((((((((((!(2 <= \old(c_dr_st)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 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_dw_i == 1) && c_dr_pc == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) && (((((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((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)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && c_dr_pc == 1) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) <= 0)) || !(\old(c_num_read) == 0))) && ((((((((!(2 <= \old(c_dr_st)) || (((((((((((((((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_dw_i == 1) && p_last_write == \old(p_last_write)) && c_dr_pc == 1) && 2 <= c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || \old(c_dr_pc) == 1) || !(\old(c_last_read) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((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)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) <= 0)) || ((((((((2 <= c_dr_st && p_last_write == q_buf_0) && p_dw_pc <= 0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(\old(c_num_read) == 0))) && (((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || \old(c_dr_pc) == 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)) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc <= 0) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)))) && (((((!(2 <= \old(c_dr_st)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1) || \old(c_dr_pc) == 1) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && (((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 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) && 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))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) == 1)) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) == 0)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) && ((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((((((((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) && c_dr_pc == \old(c_dr_pc)) && \old(q_free) == q_free) && \old(p_dw_st) == p_dw_st)) || !(\old(c_dr_pc) == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1))) && (((((((\old(c_dr_pc) == 1 || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\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_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((q_free == 0 && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st) && \old(p_num_write) + 1 == p_num_write)) || c_dr_pc == 1) && (((((((((!(2 <= \old(c_dr_st)) || (((q_free == 0 && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(p_num_write) + 1 == p_num_write)) || (((((((((\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_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0))) && (((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((c_dr_st == \old(c_dr_st) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && (((((((!(c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((((q_free == 0 && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && p_dw_pc == 1) && p_num_write <= \old(p_num_write) + 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write)))) && ((((!(2 <= \old(c_dr_st)) || (2 <= c_dr_st && p_dw_pc == 1)) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((((((((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(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_num_read == 0) || ((((((c_num_read == 1 && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1)) || !(p_dw_i == 1)) || !(2 <= \old(p_dw_st))) || \old(q_free) == p_dw_pc) || !(p_last_write == q_buf_0)) || !(\old(q_free) == 0)) || (((c_num_read == 1 && ((((((1 <= q_free && !(p_dw_st == 1)) && p_dw_pc == 1) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((1 <= q_free && c_dr_st == \old(c_dr_st)) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_free == 1) && p_dw_i == 1))) && 2 <= p_dw_st) && c_last_read == p_last_write)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1)) && (((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) || (((((((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(q_free) == q_free) && \old(p_dw_st) == p_dw_st) && c_last_read == p_last_write) && c_num_read == 0))) && ((((((((((!(\old(c_num_read) + 1 <= p_num_write) || !(\old(c_dr_pc) == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || (((((((p_num_write <= c_num_read && p_dw_st == 0) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_last_read == p_last_write) && q_free == 1) && p_dw_i == 1) && c_num_read <= p_num_write)) || !(p_dw_i == 1)) || !(2 <= \old(p_dw_st))) || \old(q_free) == p_dw_pc) || ((((((((((1 <= q_free && !(p_dw_st == 1)) && p_dw_pc == 1) && q_free == 1) && p_dw_i == 1) && c_dr_pc == 1) || (((((1 <= q_free && c_dr_st == \old(c_dr_st)) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_free == 1) && p_dw_i == 1)) && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && c_num_read <= p_num_write)) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) && (((((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(c_num_read == 0)) || !(p_dw_pc <= 0)) || !(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)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) || !(p_num_write == 1)) || !(q_free == 0)) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(q_free) == 1) || ((((((((((\old(p_dw_pc) == p_dw_pc && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && p_dw_pc <= 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)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read == 0) && p_num_write == \old(p_num_write))) || (((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read <= p_num_write)) || \old(c_dr_pc) == 1) || (((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && c_num_read <= p_num_write) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1)))) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(p_num_write) == 0)) || !(\old(p_dw_st) == 0)) || ((((((q_free == 0 && 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) && c_dr_pc == 1)) || (((((((((2 <= c_dr_st && \old(p_dw_pc) == p_dw_pc) && \old(q_read_ev) == q_read_ev) && c_dr_pc == \old(c_dr_pc)) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && (1 <= q_free || !(p_dw_st == q_free)))) || ((((((((2 <= c_dr_st && p_dw_pc <= 0) && p_last_write == q_buf_0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(p_dw_i == 1)) || !(\old(c_num_read) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || !(\old(p_num_write) == 1)) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) == 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) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) && (((((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_last_read) == \old(p_last_write))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((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)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && c_dr_pc == 1) && p_dw_pc <= 0) && p_last_write == q_buf_0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) <= 0)) || !(\old(c_num_read) == 0))) && ((((((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(\old(q_free) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || \old(c_dr_pc) == 1) || !(\old(c_last_read) == \old(p_last_write))) || (((((q_free == 0 && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && \old(p_num_write) + 1 == p_num_write) && c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || (((((((((((((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)) && q_write_ev == \old(q_write_ev)) && c_num_read == 0) && p_last_write == q_buf_0) && p_dw_pc <= 0) && \old(q_free) == q_free) && c_last_read == p_last_write) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) <= 0)) || ((((((((2 <= c_dr_st && p_last_write == q_buf_0) && p_dw_pc <= 0) && c_last_read == p_last_write) && q_free == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)) && c_num_read == 0) && c_dr_pc == 1)) || !(\old(c_num_read) == 0))) && (((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((((((((((q_free == 0 && 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) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || !(\old(p_dw_pc) == 1)) || (((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && p_last_write == q_buf_0) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(c_num_read) <= \old(p_num_write)))) && ((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || ((((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) || !(\old(p_dw_st) == 0)) && ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) || !(\old(p_dw_st) == 0)))) || \old(c_dr_pc) == 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)) && c_num_read == \old(c_num_read)) && q_write_ev == \old(q_write_ev)) && p_last_write == \old(p_last_write)) && p_dw_pc <= 0) && \old(q_free) == q_free) && q_buf_0 == \old(q_buf_0)) && ((((p_dw_st == 0 && p_dw_i == 1) && !(p_dw_pc == q_free)) && !(q_free == 0)) || ((1 <= q_free && p_dw_st == 0) && p_dw_i == 1))) && p_num_write == \old(p_num_write)))) && (((((!(2 <= \old(c_dr_st)) || ((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1)))) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1) || \old(c_dr_pc) == 1) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1))))) && ((((((((!(2 <= \old(c_dr_st)) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(2 <= \old(p_dw_st))) || ((((((((((((((((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)) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_num_read <= p_num_write) && c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_num_write <= c_num_read) && p_last_write == q_buf_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(p_num_write) <= \old(c_num_read))) || !(\old(q_buf_0) == \old(p_last_write))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(c_num_read) <= \old(p_num_write)))) && (((((((((!(2 <= \old(c_dr_st)) || ((((((((((((((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)) && ((1 <= q_free && p_dw_i == 1) || (!(p_dw_st == q_free) && p_dw_i == 1))) && c_dr_pc == 1) && 2 <= c_dr_st) && c_num_read + 1 <= p_num_write) && !(p_dw_st == 1)) && p_last_write == q_buf_0) && p_dw_pc == 1) && q_buf_0 == \old(q_buf_0)) && p_num_write == \old(p_num_write))) || !(\old(c_dr_pc) == 1)) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) + 1 <= \old(p_num_write))) || !(2 <= \old(p_dw_st))) || !(\old(q_free) == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || ((((q_free == 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(c_dr_st)) || (((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && !(p_dw_st == q_free)) && !(p_dw_pc == q_free))) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && ((((((((!(\old(q_free) == 1) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || ((((q_free == 0 && 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 == 1)) && ((((!(2 <= \old(c_dr_st)) || (((((!(c_dr_pc == 1) && 2 <= c_dr_st) && !(p_dw_st == 1)) && p_dw_pc == 1) && !(p_dw_st == q_free)) && !(p_dw_pc == q_free))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && (((((((!(c_dr_pc == 1) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || (((((q_free == 0 && 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_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write))) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (((((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) && (((((((((!(p_dw_st == 0) || !(p_dw_i == 1)) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || c_dr_pc == 1) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && ((((!(2 <= c_dr_st) || !(p_dw_i == 1)) || (0 <= __retres1 && __retres1 <= 0)) || !(p_dw_pc == 1)) || c_dr_pc == 1)) && (((((((((!(p_dw_i == 1) || !(c_num_read == 1)) || !(q_free == 1)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || !(2 <= p_dw_st)) || !(p_dw_pc == 1)) || c_dr_pc == 1) || !(c_last_read == p_last_write)) || !(p_num_write == 1))) && (((((((!(p_dw_i == 1) || !(c_num_read == 0)) || !(p_dw_pc <= 0)) || !(p_last_write == q_buf_0)) || (0 <= __retres1 && __retres1 <= 0)) || c_dr_pc == 1) || !(p_num_write == 1)) || !(q_free == 0)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(p_num_write == 0) || !(\old(q_free) == 1)) || \old(c_dr_pc) == 1) || !(p_last_write == \old(c_last_read))) || !(p_dw_i == 1)) || !(p_dw_pc <= 0)) || (((((2 <= c_dr_st && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_num_read == 0) && c_dr_pc == 1)) || !(p_last_write == q_buf_0)) || !(\old(p_dw_st) == 0)) || !(\old(c_num_read) == 0)) && (((((((((((((2 <= c_dr_st && c_num_read == 1) && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_dr_pc == 1) || (((((2 <= c_dr_st && c_num_read == 1) && 2 <= p_dw_st) && c_last_read == p_last_write) && q_free == 1) && c_dr_pc == 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(\old(c_num_read) == 0)) || !(p_dw_pc == 1)) || !(p_num_write == 1))) && (((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(\old(c_dr_pc) == 1)) || ((((((2 <= c_dr_st && p_num_write <= c_num_read) && p_dw_st == 0) && c_last_read == p_last_write) && q_free == 1) && c_num_read <= p_num_write) && c_dr_pc == 1)) || !(p_num_write <= \old(c_num_read) + 1)) || !(2 <= \old(p_dw_st))) || (((\old(p_dw_st) == \old(q_free) || !(p_dw_i == 1)) || \old(q_free) == p_dw_pc) && (!(1 <= \old(q_free)) || !(p_dw_i == 1)))) || !(\old(q_free) == 0)) || !(p_last_write == q_buf_0)) || !(p_dw_pc == 1)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((\old(p_dw_pc) == p_dw_pc && c_dr_st == \old(c_dr_st)) && p_last_write == q_buf_0) && \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(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0)) || c_dr_pc == 1) && (((((!(2 <= \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_pc) <= 0)) || ((((c_dr_st == \old(c_dr_st) && p_dw_pc <= 0) && \old(p_dw_st) == p_dw_st) && p_dw_i == 1) && !(q_free == 0))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || c_dr_pc == 1)) && ((((((((!(2 <= \old(c_dr_st)) || !(\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))) || !(\old(p_dw_pc) <= 0)) || !(c_last_read == \old(p_last_write))) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(c_num_read == 0)) || !(\old(q_buf_0) == \old(p_last_write))) || !(\old(p_num_write) == 0))) && ((((!(2 <= \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || (((2 <= c_dr_st && p_dw_pc == 1) && p_dw_i == 1) && !(q_free == 0))) || c_dr_pc == 1)) && ((((((((((((((((c_dr_st == \old(c_dr_st) && p_last_write == q_buf_0) && \old(q_free) == q_free) && p_dw_pc == 1) && \old(p_dw_st) == p_dw_st) && q_write_ev == \old(q_write_ev)) && q_buf_0 == \old(q_buf_0)) && p_dw_i == 1) && p_num_write == \old(p_num_write)) && !(q_free == 0)) || !(c_dr_pc == 1)) || !(2 <= \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || ((!(1 <= \old(q_free)) || !(p_dw_i == 1)) && ((\old(q_free) == 0 || !(p_dw_i == 1)) || \old(p_dw_pc) == \old(q_free)))) || !(\old(p_num_write) <= c_num_read)) || !(\old(q_buf_0) == \old(p_last_write))) || !(c_num_read <= \old(p_num_write))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 28.3s, OverallIterations: 14, TraceHistogramMax: 3, AutomataDifference: 21.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 39.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2089 SDtfs, 4980 SDslu, 2213 SDs, 0 SdLazy, 10324 SolverSat, 2044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 623 SyntacticMatches, 3 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2338occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1555 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3013 PreInvPairs, 3531 NumberOfFragments, 12855 HoareAnnotationTreeSize, 3013 FomulaSimplifications, 38256310 FormulaSimplificationTreeSizeReduction, 7.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 1266568 FormulaSimplificationTreeSizeReductionInter, 31.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1483 NumberOfCodeBlocks, 1483 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1466 ConstructedInterpolants, 0 QuantifiedInterpolants, 378715 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1910 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 17 InterpolantComputations, 13 PerfectInterpolantSequences, 310/340 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...