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.24-673a906-m [2019-10-02 16:18:56,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 16:18:56,966 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 16:18:56,978 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 16:18:56,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 16:18:56,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 16:18:56,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 16:18:56,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 16:18:56,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 16:18:56,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 16:18:56,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 16:18:56,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 16:18:56,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 16:18:56,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 16:18:56,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 16:18:56,991 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 16:18:56,991 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 16:18:56,992 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 16:18:56,994 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 16:18:56,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 16:18:56,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 16:18:56,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 16:18:57,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 16:18:57,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 16:18:57,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 16:18:57,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 16:18:57,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 16:18:57,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 16:18:57,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 16:18:57,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 16:18:57,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 16:18:57,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 16:18:57,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 16:18:57,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 16:18:57,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 16:18:57,009 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 16:18:57,010 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 16:18:57,010 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 16:18:57,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 16:18:57,011 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 16:18:57,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 16:18:57,013 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 [2019-10-02 16:18:57,027 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 16:18:57,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 16:18:57,029 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 16:18:57,029 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 16:18:57,029 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 16:18:57,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 16:18:57,029 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 16:18:57,030 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 16:18:57,030 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 16:18:57,030 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 16:18:57,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 16:18:57,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 16:18:57,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 16:18:57,031 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 16:18:57,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 16:18:57,031 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 16:18:57,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 16:18:57,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 16:18:57,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 16:18:57,032 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 16:18:57,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 16:18:57,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 16:18:57,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 16:18:57,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 16:18:57,033 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 16:18:57,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 16:18:57,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 16:18:57,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 16:18:57,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 16:18:57,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 16:18:57,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 16:18:57,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 16:18:57,079 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 16:18:57,079 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 16:18:57,080 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-02 16:18:57,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c76ad480/c673d1af6e6c4ba38cc29b5292275693/FLAGc1b609f09 [2019-10-02 16:18:57,567 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 16:18:57,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_1.cil-2.c [2019-10-02 16:18:57,577 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c76ad480/c673d1af6e6c4ba38cc29b5292275693/FLAGc1b609f09 [2019-10-02 16:18:57,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c76ad480/c673d1af6e6c4ba38cc29b5292275693 [2019-10-02 16:18:57,974 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 16:18:57,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 16:18:57,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 16:18:57,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 16:18:57,980 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 16:18:57,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:18:57" (1/1) ... [2019-10-02 16:18:57,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8bf277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:57, skipping insertion in model container [2019-10-02 16:18:57,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:18:57" (1/1) ... [2019-10-02 16:18:57,991 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 16:18:58,041 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 16:18:58,257 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:18:58,264 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 16:18:58,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 16:18:58,405 INFO L192 MainTranslator]: Completed translation [2019-10-02 16:18:58,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58 WrapperNode [2019-10-02 16:18:58,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 16:18:58,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 16:18:58,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 16:18:58,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 16:18:58,421 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,437 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (1/1) ... [2019-10-02 16:18:58,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 16:18:58,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 16:18:58,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 16:18:58,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 16:18:58,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (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 [2019-10-02 16:18:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 16:18:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 16:18:58,523 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-02 16:18:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-02 16:18:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-02 16:18:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-02 16:18:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-02 16:18:58,524 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-02 16:18:58,525 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-02 16:18:58,526 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 16:18:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 16:18:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 16:18:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-02 16:18:58,526 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-02 16:18:58,527 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 16:18:58,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 16:18:58,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 16:18:58,964 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 16:18:58,964 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-02 16:18:58,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:18:58 BoogieIcfgContainer [2019-10-02 16:18:58,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 16:18:58,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 16:18:58,967 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 16:18:58,970 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 16:18:58,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:18:57" (1/3) ... [2019-10-02 16:18:58,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1121b177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:18:58, skipping insertion in model container [2019-10-02 16:18:58,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:18:58" (2/3) ... [2019-10-02 16:18:58,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1121b177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:18:58, skipping insertion in model container [2019-10-02 16:18:58,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:18:58" (3/3) ... [2019-10-02 16:18:58,973 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2019-10-02 16:18:58,982 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 16:18:58,989 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 16:18:59,002 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 16:18:59,034 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 16:18:59,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 16:18:59,035 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 16:18:59,035 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 16:18:59,035 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 16:18:59,035 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 16:18:59,035 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 16:18:59,036 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 16:18:59,036 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 16:18:59,056 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-10-02 16:18:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-02 16:18:59,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:59,065 INFO L411 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] [2019-10-02 16:18:59,067 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:59,072 INFO L82 PathProgramCache]: Analyzing trace with hash 800633075, now seen corresponding path program 1 times [2019-10-02 16:18:59,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:59,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:59,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:59,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:18:59,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:59,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:18:59,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:18:59,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:18:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:59,395 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 3 states. [2019-10-02 16:18:59,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:18:59,527 INFO L93 Difference]: Finished difference Result 279 states and 395 transitions. [2019-10-02 16:18:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:18:59,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-02 16:18:59,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:18:59,544 INFO L225 Difference]: With dead ends: 279 [2019-10-02 16:18:59,544 INFO L226 Difference]: Without dead ends: 175 [2019-10-02 16:18:59,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:18:59,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-10-02 16:18:59,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2019-10-02 16:18:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-02 16:18:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 223 transitions. [2019-10-02 16:18:59,614 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 223 transitions. Word has length 65 [2019-10-02 16:18:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:18:59,615 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 223 transitions. [2019-10-02 16:18:59,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:18:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 223 transitions. [2019-10-02 16:18:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:18:59,621 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:18:59,622 INFO L411 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] [2019-10-02 16:18:59,622 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:18:59,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:18:59,623 INFO L82 PathProgramCache]: Analyzing trace with hash -708931582, now seen corresponding path program 1 times [2019-10-02 16:18:59,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:18:59,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:18:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:59,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:18:59,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:18:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:18:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:18:59,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:18:59,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:18:59,830 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:18:59,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:18:59,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:18:59,831 INFO L87 Difference]: Start difference. First operand 171 states and 223 transitions. Second operand 4 states. [2019-10-02 16:19:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:00,086 INFO L93 Difference]: Finished difference Result 469 states and 653 transitions. [2019-10-02 16:19:00,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:00,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-02 16:19:00,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:00,092 INFO L225 Difference]: With dead ends: 469 [2019-10-02 16:19:00,092 INFO L226 Difference]: Without dead ends: 318 [2019-10-02 16:19:00,096 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:00,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-10-02 16:19:00,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 314. [2019-10-02 16:19:00,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-02 16:19:00,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 411 transitions. [2019-10-02 16:19:00,148 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 411 transitions. Word has length 66 [2019-10-02 16:19:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:00,149 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 411 transitions. [2019-10-02 16:19:00,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 411 transitions. [2019-10-02 16:19:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:19:00,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:00,155 INFO L411 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] [2019-10-02 16:19:00,155 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:00,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:00,155 INFO L82 PathProgramCache]: Analyzing trace with hash -822318239, now seen corresponding path program 1 times [2019-10-02 16:19:00,155 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:00,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:00,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:00,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:00,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:00,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:00,253 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:00,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:00,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:00,254 INFO L87 Difference]: Start difference. First operand 314 states and 411 transitions. Second operand 6 states. [2019-10-02 16:19:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:00,335 INFO L93 Difference]: Finished difference Result 575 states and 767 transitions. [2019-10-02 16:19:00,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:00,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-02 16:19:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:00,340 INFO L225 Difference]: With dead ends: 575 [2019-10-02 16:19:00,340 INFO L226 Difference]: Without dead ends: 324 [2019-10-02 16:19:00,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-02 16:19:00,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-10-02 16:19:00,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-02 16:19:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 417 transitions. [2019-10-02 16:19:00,395 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 417 transitions. Word has length 66 [2019-10-02 16:19:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:00,395 INFO L475 AbstractCegarLoop]: Abstraction has 324 states and 417 transitions. [2019-10-02 16:19:00,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 417 transitions. [2019-10-02 16:19:00,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:19:00,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:00,399 INFO L411 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] [2019-10-02 16:19:00,400 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:00,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:00,400 INFO L82 PathProgramCache]: Analyzing trace with hash 403521908, now seen corresponding path program 1 times [2019-10-02 16:19:00,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:00,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:00,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:00,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:00,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:00,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:00,480 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:00,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:00,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:00,481 INFO L87 Difference]: Start difference. First operand 324 states and 417 transitions. Second operand 4 states. [2019-10-02 16:19:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:00,563 INFO L93 Difference]: Finished difference Result 585 states and 748 transitions. [2019-10-02 16:19:00,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:00,564 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-02 16:19:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:00,566 INFO L225 Difference]: With dead ends: 585 [2019-10-02 16:19:00,567 INFO L226 Difference]: Without dead ends: 278 [2019-10-02 16:19:00,568 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-10-02 16:19:00,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2019-10-02 16:19:00,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-10-02 16:19:00,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 349 transitions. [2019-10-02 16:19:00,590 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 349 transitions. Word has length 66 [2019-10-02 16:19:00,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:00,590 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 349 transitions. [2019-10-02 16:19:00,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:00,590 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 349 transitions. [2019-10-02 16:19:00,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:19:00,592 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:00,592 INFO L411 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] [2019-10-02 16:19:00,592 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:00,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:00,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1843386593, now seen corresponding path program 1 times [2019-10-02 16:19:00,593 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:00,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:00,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:00,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:00,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:00,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:00,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:00,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:00,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:00,691 INFO L87 Difference]: Start difference. First operand 278 states and 349 transitions. Second operand 6 states. [2019-10-02 16:19:01,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:01,205 INFO L93 Difference]: Finished difference Result 850 states and 1130 transitions. [2019-10-02 16:19:01,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 16:19:01,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-02 16:19:01,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:01,210 INFO L225 Difference]: With dead ends: 850 [2019-10-02 16:19:01,211 INFO L226 Difference]: Without dead ends: 589 [2019-10-02 16:19:01,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-02 16:19:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-10-02 16:19:01,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 577. [2019-10-02 16:19:01,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-02 16:19:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 713 transitions. [2019-10-02 16:19:01,262 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 713 transitions. Word has length 66 [2019-10-02 16:19:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:01,262 INFO L475 AbstractCegarLoop]: Abstraction has 577 states and 713 transitions. [2019-10-02 16:19:01,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 713 transitions. [2019-10-02 16:19:01,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:19:01,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:01,268 INFO L411 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] [2019-10-02 16:19:01,268 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:01,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1172255968, now seen corresponding path program 1 times [2019-10-02 16:19:01,269 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:01,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:01,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:01,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:01,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 16:19:01,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 16:19:01,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 16:19:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 16:19:01,366 INFO L87 Difference]: Start difference. First operand 577 states and 713 transitions. Second operand 6 states. [2019-10-02 16:19:01,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:01,436 INFO L93 Difference]: Finished difference Result 1140 states and 1459 transitions. [2019-10-02 16:19:01,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 16:19:01,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-10-02 16:19:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:01,445 INFO L225 Difference]: With dead ends: 1140 [2019-10-02 16:19:01,445 INFO L226 Difference]: Without dead ends: 616 [2019-10-02 16:19:01,447 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:01,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-02 16:19:01,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 604. [2019-10-02 16:19:01,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 16:19:01,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 735 transitions. [2019-10-02 16:19:01,507 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 735 transitions. Word has length 66 [2019-10-02 16:19:01,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:01,508 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 735 transitions. [2019-10-02 16:19:01,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 16:19:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 735 transitions. [2019-10-02 16:19:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-02 16:19:01,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:01,516 INFO L411 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] [2019-10-02 16:19:01,516 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1347703966, now seen corresponding path program 1 times [2019-10-02 16:19:01,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:01,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:01,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:01,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 16:19:01,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 16:19:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 16:19:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 16:19:01,628 INFO L87 Difference]: Start difference. First operand 604 states and 735 transitions. Second operand 4 states. [2019-10-02 16:19:01,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:01,776 INFO L93 Difference]: Finished difference Result 842 states and 1059 transitions. [2019-10-02 16:19:01,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 16:19:01,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-10-02 16:19:01,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:01,783 INFO L225 Difference]: With dead ends: 842 [2019-10-02 16:19:01,783 INFO L226 Difference]: Without dead ends: 839 [2019-10-02 16:19:01,784 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 16:19:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-02 16:19:01,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 675. [2019-10-02 16:19:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2019-10-02 16:19:01,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 829 transitions. [2019-10-02 16:19:01,858 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 829 transitions. Word has length 66 [2019-10-02 16:19:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:01,859 INFO L475 AbstractCegarLoop]: Abstraction has 675 states and 829 transitions. [2019-10-02 16:19:01,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 16:19:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 829 transitions. [2019-10-02 16:19:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-02 16:19:01,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:01,862 INFO L411 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] [2019-10-02 16:19:01,862 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:01,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:01,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1170545691, now seen corresponding path program 1 times [2019-10-02 16:19:01,863 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:01,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:01,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:01,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:01,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:01,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:01,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:19:01,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:19:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:19:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:01,962 INFO L87 Difference]: Start difference. First operand 675 states and 829 transitions. Second operand 3 states. [2019-10-02 16:19:02,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:02,021 INFO L93 Difference]: Finished difference Result 1249 states and 1576 transitions. [2019-10-02 16:19:02,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:19:02,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-02 16:19:02,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:02,026 INFO L225 Difference]: With dead ends: 1249 [2019-10-02 16:19:02,027 INFO L226 Difference]: Without dead ends: 655 [2019-10-02 16:19:02,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:02,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-10-02 16:19:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 567. [2019-10-02 16:19:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-02 16:19:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 677 transitions. [2019-10-02 16:19:02,067 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 677 transitions. Word has length 67 [2019-10-02 16:19:02,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:02,067 INFO L475 AbstractCegarLoop]: Abstraction has 567 states and 677 transitions. [2019-10-02 16:19:02,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:19:02,068 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 677 transitions. [2019-10-02 16:19:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 16:19:02,070 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:02,070 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 16:19:02,070 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:02,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:02,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1338277302, now seen corresponding path program 1 times [2019-10-02 16:19:02,071 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:02,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:02,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:02,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:02,130 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 16:19:02,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:02,130 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:02,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:02,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:02,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:19:02,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:02,288 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:02,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:02,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 16:19:02,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 16:19:02,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 16:19:02,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 16:19:02,303 INFO L87 Difference]: Start difference. First operand 567 states and 677 transitions. Second operand 7 states. [2019-10-02 16:19:02,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:02,721 INFO L93 Difference]: Finished difference Result 1850 states and 2333 transitions. [2019-10-02 16:19:02,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 16:19:02,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2019-10-02 16:19:02,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:02,729 INFO L225 Difference]: With dead ends: 1850 [2019-10-02 16:19:02,729 INFO L226 Difference]: Without dead ends: 930 [2019-10-02 16:19:02,733 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-10-02 16:19:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-10-02 16:19:02,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 759. [2019-10-02 16:19:02,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-10-02 16:19:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 948 transitions. [2019-10-02 16:19:02,796 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 948 transitions. Word has length 87 [2019-10-02 16:19:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:02,797 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 948 transitions. [2019-10-02 16:19:02,797 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 16:19:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 948 transitions. [2019-10-02 16:19:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 16:19:02,801 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:02,802 INFO L411 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] [2019-10-02 16:19:02,802 INFO L418 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:02,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:02,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1396688396, now seen corresponding path program 1 times [2019-10-02 16:19:02,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:02,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:02,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:02,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:03,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 16:19:03,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:03,011 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:03,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:03,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-02 16:19:03,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 16:19:03,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 16:19:03,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-10-02 16:19:03,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 16:19:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 16:19:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 16:19:03,383 INFO L87 Difference]: Start difference. First operand 759 states and 948 transitions. Second operand 12 states. [2019-10-02 16:19:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:05,321 INFO L93 Difference]: Finished difference Result 2594 states and 4274 transitions. [2019-10-02 16:19:05,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 16:19:05,321 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 99 [2019-10-02 16:19:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:05,342 INFO L225 Difference]: With dead ends: 2594 [2019-10-02 16:19:05,343 INFO L226 Difference]: Without dead ends: 2591 [2019-10-02 16:19:05,345 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2019-10-02 16:19:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2019-10-02 16:19:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2512. [2019-10-02 16:19:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2512 states. [2019-10-02 16:19:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2512 states to 2512 states and 4092 transitions. [2019-10-02 16:19:05,650 INFO L78 Accepts]: Start accepts. Automaton has 2512 states and 4092 transitions. Word has length 99 [2019-10-02 16:19:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:05,651 INFO L475 AbstractCegarLoop]: Abstraction has 2512 states and 4092 transitions. [2019-10-02 16:19:05,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 16:19:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2512 states and 4092 transitions. [2019-10-02 16:19:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 16:19:05,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:05,657 INFO L411 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] [2019-10-02 16:19:05,658 INFO L418 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:05,658 INFO L82 PathProgramCache]: Analyzing trace with hash 83738947, now seen corresponding path program 2 times [2019-10-02 16:19:05,658 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:05,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:05,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:05,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 16:19:05,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 16:19:05,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 16:19:05,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 16:19:05,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 16:19:05,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 16:19:05,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:05,728 INFO L87 Difference]: Start difference. First operand 2512 states and 4092 transitions. Second operand 3 states. [2019-10-02 16:19:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:05,941 INFO L93 Difference]: Finished difference Result 4236 states and 7499 transitions. [2019-10-02 16:19:05,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 16:19:05,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-02 16:19:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:05,962 INFO L225 Difference]: With dead ends: 4236 [2019-10-02 16:19:05,963 INFO L226 Difference]: Without dead ends: 2365 [2019-10-02 16:19:05,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 16:19:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2365 states. [2019-10-02 16:19:06,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2365 to 2365. [2019-10-02 16:19:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2019-10-02 16:19:06,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 3821 transitions. [2019-10-02 16:19:06,228 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 3821 transitions. Word has length 125 [2019-10-02 16:19:06,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:06,228 INFO L475 AbstractCegarLoop]: Abstraction has 2365 states and 3821 transitions. [2019-10-02 16:19:06,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 16:19:06,228 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 3821 transitions. [2019-10-02 16:19:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 16:19:06,237 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 16:19:06,237 INFO L411 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, 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] [2019-10-02 16:19:06,237 INFO L418 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 16:19:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 16:19:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1612542371, now seen corresponding path program 1 times [2019-10-02 16:19:06,238 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 16:19:06,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 16:19:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:06,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 16:19:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 16:19:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-02 16:19:06,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 16:19:06,420 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 16:19:06,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 16:19:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 16:19:06,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 16:19:06,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 16:19:06,614 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 16:19:06,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 16:19:06,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-10-02 16:19:06,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 16:19:06,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 16:19:06,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-02 16:19:06,629 INFO L87 Difference]: Start difference. First operand 2365 states and 3821 transitions. Second operand 9 states. [2019-10-02 16:19:07,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 16:19:07,454 INFO L93 Difference]: Finished difference Result 3071 states and 5408 transitions. [2019-10-02 16:19:07,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 16:19:07,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 143 [2019-10-02 16:19:07,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 16:19:07,456 INFO L225 Difference]: With dead ends: 3071 [2019-10-02 16:19:07,456 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 16:19:07,482 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2019-10-02 16:19:07,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 16:19:07,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 16:19:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 16:19:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 16:19:07,483 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 143 [2019-10-02 16:19:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 16:19:07,483 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 16:19:07,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 16:19:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 16:19:07,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 16:19:07,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 16:19:11,070 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-02 16:19:11,472 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-02 16:19:11,924 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-02 16:19:12,138 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-10-02 16:19:12,772 WARN L191 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2019-10-02 16:19:14,135 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 134 DAG size of output: 85 [2019-10-02 16:19:15,008 WARN L191 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-10-02 16:19:15,588 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-10-02 16:19:15,952 WARN L191 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 37 [2019-10-02 16:19:16,375 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 72 [2019-10-02 16:19:18,674 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2019-10-02 16:19:18,860 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-02 16:19:19,355 WARN L191 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 78 [2019-10-02 16:19:19,927 WARN L191 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-10-02 16:19:20,091 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-02 16:19:20,230 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-02 16:19:22,342 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 157 DAG size of output: 115 [2019-10-02 16:19:22,456 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 1 [2019-10-02 16:19:23,529 WARN L191 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 143 DAG size of output: 112 [2019-10-02 16:19:24,537 WARN L191 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 132 DAG size of output: 97 [2019-10-02 16:19:25,455 WARN L191 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 85 [2019-10-02 16:19:25,623 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-10-02 16:19:26,200 WARN L191 SmtUtils]: Spent 573.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-10-02 16:19:28,303 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 157 DAG size of output: 113 [2019-10-02 16:19:28,427 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 1 [2019-10-02 16:19:28,710 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-02 16:19:29,140 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-10-02 16:19:29,617 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 43 [2019-10-02 16:19:31,546 WARN L191 SmtUtils]: Spent 1.92 s on a formula simplification. DAG size of input: 137 DAG size of output: 104 [2019-10-02 16:19:32,352 WARN L191 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 78 [2019-10-02 16:19:32,920 WARN L191 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 78 [2019-10-02 16:19:32,923 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 210 229) no Hoare annotation was computed. [2019-10-02 16:19:32,923 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 223) no Hoare annotation was computed. [2019-10-02 16:19:32,923 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 224) no Hoare annotation was computed. [2019-10-02 16:19:32,923 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 210 229) the Hoare annotation is: true [2019-10-02 16:19:32,924 INFO L446 ceAbstractionStarter]: At program point L226(lines 213 228) the Hoare annotation is: true [2019-10-02 16:19:32,924 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 210 229) no Hoare annotation was computed. [2019-10-02 16:19:32,924 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 192 209) no Hoare annotation was computed. [2019-10-02 16:19:32,924 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 192 209) no Hoare annotation was computed. [2019-10-02 16:19:32,924 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 192 209) the Hoare annotation is: (or (= 0 ~p_dw_st~0) (= 1 ~c_dr_pc~0) (not (= ~q_buf_0~0 ~p_last_write~0)) (not (= ~p_dw_i~0 1)) (= ~p_dw_pc~0 2) (not (= ~q_free~0 1)) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (not (= 0 ~c_num_read~0)) (not (= 0 ~p_num_write~0)) (not (= ~c_last_read~0 ~p_last_write~0))) [2019-10-02 16:19:32,924 INFO L443 ceAbstractionStarter]: For program point L196-1(lines 195 208) no Hoare annotation was computed. [2019-10-02 16:19:32,925 INFO L439 ceAbstractionStarter]: At program point L354-1(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (= 1 ~p_dw_i~0) (not (= ~c_dr_pc~0 1)) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= 0 ~p_dw_st~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-10-02 16:19:32,925 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 349 360) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= 0 ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-10-02 16:19:32,925 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 349 360) no Hoare annotation was computed. [2019-10-02 16:19:32,925 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 349 360) no Hoare annotation was computed. [2019-10-02 16:19:32,925 INFO L443 ceAbstractionStarter]: For program point L355(line 355) no Hoare annotation was computed. [2019-10-02 16:19:32,926 INFO L439 ceAbstractionStarter]: At program point L354(line 354) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= 0 ~q_free~0) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-10-02 16:19:32,926 INFO L439 ceAbstractionStarter]: At program point L128(lines 91 133) the Hoare annotation is: (let ((.cse23 (= |old(~p_dw_pc~0)| 1))) (let ((.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse9 (not .cse23)) (.cse1 (= 0 ~q_free~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse24 (= 1 ~p_dw_i~0)) (.cse25 (not (= ~c_dr_pc~0 1))) (.cse26 (not (= 1 ~p_dw_st~0))) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse20 (= 1 ~c_dr_pc~0))) (let ((.cse8 (not .cse20)) (.cse10 (not (= 2 |old(~c_dr_st~0)|))) (.cse13 (and .cse24 .cse25 (= ~c_dr_st~0 2) .cse26 .cse3 .cse5)) (.cse14 (= |old(~p_dw_pc~0)| 2)) (.cse15 (not (= |old(~q_free~0)| 1))) (.cse16 (and .cse1 .cse2 (= ~p_num_write~0 1) .cse3 .cse5)) (.cse17 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (= |old(~p_dw_st~0)| 0)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse19 (not (= ~c_last_read~0 |old(~p_last_write~0)|))) (.cse21 (and .cse24 .cse25 (not (= ~c_dr_st~0 0)) .cse26 .cse3 .cse5)) (.cse12 (or .cse20 .cse6 .cse7 .cse9)) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse11 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 (let ((.cse4 (+ |old(~p_num_write~0)| 1))) (and .cse1 .cse2 .cse3 (<= .cse4 ~p_num_write~0) .cse5 (<= ~p_num_write~0 .cse4))) (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse6 .cse7 .cse8 .cse9) .cse10 .cse11 (not (<= |old(~p_num_write~0)| ~c_num_read~0)))) (or .cse12 .cse10 .cse11 .cse13) (or .cse6 .cse7 .cse8 .cse14 .cse15 .cse16 .cse17 .cse0 .cse10 .cse11 .cse18 .cse19) (or .cse20 .cse6 .cse7 .cse10 .cse15 .cse11 .cse13 .cse19) (or .cse21 .cse20 .cse6 .cse7 .cse22 .cse15 .cse11 .cse19) (or .cse6 .cse7 .cse14 .cse15 .cse16 .cse17 .cse0 .cse20 .cse11 .cse23 .cse18 .cse19) (or .cse21 .cse12 .cse22 .cse11))))) [2019-10-02 16:19:32,926 INFO L439 ceAbstractionStarter]: At program point do_write_pENTRY(lines 91 133) the Hoare annotation is: (let ((.cse9 (= |old(~p_dw_pc~0)| 1))) (let ((.cse4 (= 1 ~c_dr_pc~0)) (.cse5 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse6 (not (= ~p_dw_i~0 1))) (.cse19 (not .cse9))) (let ((.cse0 (or .cse4 .cse5 .cse6 .cse19)) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse14 (not (= ~c_dr_st~0 0))) (.cse18 (= 1 ~p_dw_pc~0)) (.cse16 (= |old(~p_dw_st~0)| 0)) (.cse22 (= |old(~p_dw_pc~0)| 2)) (.cse15 (= ~p_last_write~0 ~q_buf_0~0)) (.cse17 (not (= 0 ~p_dw_st~0))) (.cse11 (not (= 2 ~p_dw_st~0))) (.cse12 (= ~c_last_read~0 ~p_last_write~0)) (.cse13 (= 1 ~q_free~0)) (.cse20 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse21 (= 0 ~p_num_write~0)) (.cse24 (not (= 0 ~c_num_read~0))) (.cse23 (not (= 0 |old(~p_num_write~0)|))) (.cse1 (not (= 2 |old(~c_dr_st~0)|))) (.cse8 (not (= |old(~q_free~0)| 1))) (.cse3 (= |old(~p_dw_st~0)| 2)) (.cse2 (= ~c_dr_st~0 2)) (.cse10 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse3 .cse9 .cse10 (and (not (= ~p_dw_pc~0 1)) .cse11 .cse12 .cse13 .cse14 .cse15)) (or .cse16 (and .cse17 (and (= ~p_num_write~0 |old(~p_num_write~0)|) .cse11 .cse2 .cse15 .cse18)) (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse5 .cse6 (not .cse4) .cse19) .cse1 .cse3 (not (<= |old(~p_num_write~0)| ~c_num_read~0)))) (or (and .cse15 .cse17 .cse11 .cse12 .cse13 .cse2 .cse20 .cse21) .cse5 .cse6 .cse22 .cse8 .cse23 .cse16 .cse1 .cse3 .cse9 .cse24 .cse10) (or .cse0 .cse7 (and .cse11 .cse14 .cse15 .cse18) .cse3) (or .cse16 .cse4 .cse5 .cse6 .cse22 (and .cse15 .cse17 .cse11 .cse12 .cse13 .cse20 .cse21) .cse8 .cse3 .cse9 .cse24 .cse23 .cse10) (or .cse4 .cse5 .cse6 .cse1 .cse8 .cse3 .cse2 .cse10))))) [2019-10-02 16:19:32,927 INFO L439 ceAbstractionStarter]: At program point L124(line 124) the Hoare annotation is: (let ((.cse14 (= |old(~p_dw_pc~0)| 1))) (let ((.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse21 (not .cse14)) (.cse6 (= 1 ~c_dr_pc~0))) (let ((.cse20 (not .cse6)) (.cse2 (= |old(~p_dw_pc~0)| 2)) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse5 (= |old(~p_dw_st~0)| 0)) (.cse7 (= 0 ~q_free~0)) (.cse8 (not (= 0 ~p_dw_st~0))) (.cse10 (= ~p_num_write~0 1)) (.cse19 (= ~c_dr_st~0 2)) (.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse18 (not (= 2 |old(~c_dr_st~0)|))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse17 (or .cse6 .cse0 .cse1 .cse21)) (.cse9 (not (= 2 ~p_dw_st~0))) (.cse23 (not (= ~c_dr_st~0 0))) (.cse12 (= ~p_last_write~0 ~q_buf_0~0)) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse3 (not (= |old(~q_free~0)| 1))) (.cse13 (= |old(~p_dw_st~0)| 2)) (.cse16 (not (= ~c_last_read~0 |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse17 .cse18 .cse19 .cse13) (or .cse6 .cse0 .cse1 .cse19 .cse18 .cse3 .cse13 .cse16) (or .cse5 (and .cse12 (<= (+ |old(~p_num_write~0)| 1) ~p_num_write~0) .cse7 .cse8 .cse9 (<= ~p_num_write~0 (+ ~c_num_read~0 1)) .cse19 .cse11) (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse0 .cse1 .cse20 .cse21) .cse18 .cse13 (not (<= |old(~p_num_write~0)| ~c_num_read~0)))) (or .cse0 .cse1 .cse20 .cse2 .cse3 .cse4 .cse5 (and .cse12 .cse7 .cse8 .cse9 .cse10 .cse19 .cse11) .cse18 .cse13 .cse15 .cse16) (or .cse17 .cse22 (and .cse9 .cse23 .cse12 (= 1 ~p_dw_pc~0)) .cse13) (or .cse6 .cse0 .cse1 (and (not (= ~p_dw_pc~0 1)) .cse9 .cse23 .cse12) .cse22 .cse3 .cse13 .cse14 .cse16))))) [2019-10-02 16:19:32,927 INFO L443 ceAbstractionStarter]: For program point L124-1(line 124) no Hoare annotation was computed. [2019-10-02 16:19:32,927 INFO L443 ceAbstractionStarter]: For program point L108(lines 107 127) no Hoare annotation was computed. [2019-10-02 16:19:32,927 INFO L443 ceAbstractionStarter]: For program point do_write_pEXIT(lines 91 133) no Hoare annotation was computed. [2019-10-02 16:19:32,927 INFO L439 ceAbstractionStarter]: At program point L109(lines 95 132) the Hoare annotation is: (let ((.cse14 (= |old(~p_dw_pc~0)| 1))) (let ((.cse18 (= 1 ~c_dr_pc~0)) (.cse6 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse7 (not (= ~p_dw_i~0 1))) (.cse19 (not .cse14))) (let ((.cse2 (= ~c_dr_st~0 2)) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse17 (or .cse18 .cse6 .cse7 .cse19)) (.cse8 (= |old(~p_dw_pc~0)| 2)) (.cse10 (not (= 0 |old(~p_num_write~0)|))) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse3 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse5 (= 0 ~p_num_write~0)) (.cse11 (= |old(~p_dw_st~0)| 0)) (.cse15 (not (= 0 ~c_num_read~0))) (.cse1 (not (= 2 ~p_dw_st~0))) (.cse21 (not (= ~c_dr_st~0 0))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse20 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not (= |old(~q_free~0)| 1))) (.cse13 (= |old(~p_dw_st~0)| 2)) (.cse16 (not (= ~c_last_read~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 .cse16) (or .cse17 .cse12 .cse2 .cse13) (or .cse11 (and (and (and .cse1 .cse2 .cse4) (= ~p_num_write~0 |old(~p_num_write~0)|)) .cse0 .cse3) (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse6 .cse7 (not .cse18) .cse19) .cse12 .cse13 (not (<= |old(~p_num_write~0)| ~c_num_read~0)))) (or .cse18 .cse6 .cse7 .cse2 .cse12 .cse9 .cse13 .cse16) (or .cse17 .cse20 (and .cse1 .cse21 .cse4 (= 1 ~p_dw_pc~0)) .cse13) (or .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse0 .cse1 .cse3 .cse4 .cse5) .cse11 .cse18 .cse13 .cse14 .cse15 .cse16) (or .cse18 .cse6 .cse7 (and (not (= ~p_dw_pc~0 1)) .cse1 .cse21 .cse4) .cse20 .cse9 .cse13 .cse14 .cse16))))) [2019-10-02 16:19:32,928 INFO L439 ceAbstractionStarter]: At program point L107-1(lines 95 132) the Hoare annotation is: (let ((.cse17 (= |old(~p_dw_pc~0)| 1))) (let ((.cse24 (= 0 ~q_free~0)) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 2 ~p_dw_st~0))) (.cse6 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse21 (= 1 ~c_dr_pc~0)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse26 (not .cse17))) (let ((.cse5 (= ~c_dr_st~0 2)) (.cse20 (or .cse21 .cse8 .cse9 .cse26)) (.cse15 (not (= 2 |old(~c_dr_st~0)|))) (.cse23 (not (= ~c_dr_st~0 0))) (.cse22 (= 0 |old(~c_dr_st~0)|)) (.cse11 (= |old(~p_dw_pc~0)| 2)) (.cse3 (= ~c_last_read~0 ~p_last_write~0)) (.cse4 (= 1 ~q_free~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse13 (not (= 0 |old(~p_num_write~0)|))) (.cse14 (= |old(~p_dw_st~0)| 0)) (.cse10 (and .cse24 .cse1 .cse2 (= ~p_num_write~0 1) .cse6 .cse0)) (.cse16 (= |old(~p_dw_st~0)| 2)) (.cse18 (not (= 0 ~c_num_read~0))) (.cse19 (not (= ~c_last_read~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 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse15 .cse5 .cse16) (or .cse21 .cse8 .cse9 .cse5 .cse15 .cse12 .cse16 .cse19) (or .cse20 .cse22 (and .cse2 .cse23 .cse0 (= 1 ~p_dw_pc~0)) .cse16) (or .cse14 (let ((.cse25 (+ |old(~p_num_write~0)| 1))) (and .cse24 (and .cse2 .cse0) .cse6 (<= .cse25 ~p_num_write~0) (<= ~p_num_write~0 .cse25))) (or (not (<= ~c_num_read~0 |old(~p_num_write~0)|)) (or .cse8 .cse9 (not .cse21) .cse26) .cse15 .cse16 (not (<= |old(~p_num_write~0)| ~c_num_read~0)))) (or .cse21 .cse8 .cse9 (and (not (= ~p_dw_pc~0 1)) .cse2 .cse23 .cse0) .cse22 .cse12 .cse16 .cse17 .cse19) (or .cse8 .cse9 .cse11 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) .cse12 .cse13 .cse14 .cse21 .cse10 .cse16 .cse17 .cse18 .cse19))))) [2019-10-02 16:19:32,928 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 103) no Hoare annotation was computed. [2019-10-02 16:19:32,928 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2019-10-02 16:19:32,928 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2019-10-02 16:19:32,928 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2019-10-02 16:19:32,928 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-02 16:19:32,929 INFO L439 ceAbstractionStarter]: At program point immediate_notify_threadsENTRY(lines 66 90) the Hoare annotation is: (let ((.cse23 (= 0 ~p_dw_st~0))) (let ((.cse14 (= ~p_dw_pc~0 1)) (.cse18 (not .cse23)) (.cse19 (not (= 2 ~p_dw_st~0))) (.cse24 (= ~c_dr_st~0 2)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse21 (not (= ~c_dr_st~0 0)))) (let ((.cse10 (= ~p_dw_pc~0 2)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse2 (and (<= 2 ~p_dw_st~0) .cse21)) (.cse4 (not (= ~q_free~0 1))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not .cse17)) (.cse11 (not (= ~q_free~0 0))) (.cse16 (and .cse18 .cse19 .cse24)) (.cse3 (not .cse14)) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse9 (= |old(~p_dw_st~0)| 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse13 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse15 .cse16) (or .cse9 .cse17 .cse0 .cse1 .cse10 .cse11 (and .cse18 .cse19) .cse6 .cse13 .cse14 .cse15) (or .cse2 .cse0 .cse1 .cse20 .cse3 .cse4 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse7 .cse8) (or .cse17 .cse0 .cse1 (and .cse19 .cse21) .cse5 .cse13) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse9 (not (<= .cse22 ~p_num_write~0)) (or .cse12 (or .cse0 .cse1 .cse20 .cse3) .cse13) .cse11 .cse16 (not (<= ~p_num_write~0 .cse22)))) (or (or .cse17 .cse0 .cse1 .cse3) .cse5 .cse23 (not .cse9)) (or .cse17 .cse0 .cse1 .cse24 .cse12 .cse13))))) [2019-10-02 16:19:32,929 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 86) no Hoare annotation was computed. [2019-10-02 16:19:32,929 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-02 16:19:32,929 INFO L443 ceAbstractionStarter]: For program point L82-2(lines 66 90) no Hoare annotation was computed. [2019-10-02 16:19:32,929 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 78) no Hoare annotation was computed. [2019-10-02 16:19:32,929 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 66 90) no Hoare annotation was computed. [2019-10-02 16:19:32,930 INFO L439 ceAbstractionStarter]: At program point L72(line 72) the Hoare annotation is: (let ((.cse23 (= 0 ~p_dw_st~0))) (let ((.cse14 (= ~p_dw_pc~0 1)) (.cse18 (not .cse23)) (.cse19 (not (= 2 ~p_dw_st~0))) (.cse24 (= ~c_dr_st~0 2)) (.cse17 (= 1 ~c_dr_pc~0)) (.cse21 (not (= ~c_dr_st~0 0)))) (let ((.cse10 (= ~p_dw_pc~0 2)) (.cse6 (not (= 1 ~p_num_write~0))) (.cse15 (not (= 0 ~c_num_read~0))) (.cse2 (and (<= 2 ~p_dw_st~0) .cse21)) (.cse4 (not (= ~q_free~0 1))) (.cse7 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse20 (not .cse17)) (.cse11 (not (= ~q_free~0 0))) (.cse16 (and .cse18 .cse19 .cse24)) (.cse3 (not .cse14)) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse9 (= |old(~p_dw_st~0)| 0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse12 (not (= 2 |old(~c_dr_st~0)|))) (.cse13 (= |old(~p_dw_st~0)| 2))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= 1 ~c_num_read~0)) .cse7 .cse8) (or .cse9 .cse0 .cse1 .cse10 .cse11 .cse12 .cse6 .cse13 .cse14 .cse15 .cse16) (or .cse9 .cse17 .cse0 .cse1 .cse10 .cse11 (and .cse18 .cse19) .cse6 .cse13 .cse14 .cse15) (or .cse2 .cse0 .cse1 .cse20 .cse3 .cse4 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse7 .cse8) (or .cse17 .cse0 .cse1 (and .cse19 .cse21) .cse5 .cse13) (let ((.cse22 (+ ~c_num_read~0 1))) (or .cse9 (not (<= .cse22 ~p_num_write~0)) (or .cse12 (or .cse0 .cse1 .cse20 .cse3) .cse13) .cse11 .cse16 (not (<= ~p_num_write~0 .cse22)))) (or (or .cse17 .cse0 .cse1 .cse3) .cse5 .cse23 (not .cse9)) (or .cse17 .cse0 .cse1 .cse24 .cse12 .cse13))))) [2019-10-02 16:19:32,930 INFO L439 ceAbstractionStarter]: At program point L74-2(lines 74 78) the Hoare annotation is: (let ((.cse11 (= ~p_dw_pc~0 1))) (let ((.cse14 (not (= ~c_dr_st~0 0))) (.cse2 (= 1 ~c_dr_pc~0)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (not .cse11)) (.cse26 (= 0 ~p_dw_st~0)) (.cse12 (= immediate_notify_threads_~tmp~0 0))) (let ((.cse19 (or .cse26 .cse12)) (.cse22 (= ~p_dw_pc~0 2)) (.cse18 (not (= ~q_free~0 0))) (.cse25 (not (= 0 ~c_num_read~0))) (.cse23 (not .cse26)) (.cse13 (not (= 2 ~p_dw_st~0))) (.cse21 (or .cse2 .cse0 .cse1 .cse3)) (.cse15 (= |old(~p_dw_st~0)| 0)) (.cse7 (and (<= 2 ~p_dw_st~0) .cse12 .cse14)) (.cse4 (not (= ~q_free~0 1))) (.cse6 (and .cse26 .cse14)) (.cse5 (= 0 |old(~c_dr_st~0)|)) (.cse24 (not (= 1 ~p_num_write~0))) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (not (= ~c_last_read~0 ~p_last_write~0))) (.cse17 (not (= 2 |old(~c_dr_st~0)|))) (.cse10 (= |old(~p_dw_st~0)| 2)) (.cse20 (= ~c_dr_st~0 2))) (and (or .cse0 .cse1 (not .cse2) .cse3 .cse4 (not (<= ~c_num_read~0 ~p_num_write~0)) .cse5 .cse6 .cse7 (not (<= ~p_num_write~0 ~c_num_read~0)) .cse8 .cse9) (or .cse2 .cse0 .cse1 .cse5 .cse10 .cse11 (and .cse12 .cse13 .cse14)) (let ((.cse16 (+ ~c_num_read~0 1))) (or .cse15 (not (<= .cse16 ~p_num_write~0)) (or .cse17 (or .cse0 .cse1 .cse3) .cse10) .cse18 (not (<= ~p_num_write~0 .cse16)) (and .cse19 .cse13 .cse20))) (or .cse21 .cse5 .cse10 (and .cse13 .cse19 .cse14)) (or .cse15 .cse2 .cse0 .cse1 .cse22 .cse18 (and .cse12 .cse23 .cse13) .cse24 .cse10 .cse11 .cse25) (or .cse15 .cse0 .cse1 .cse22 .cse18 .cse17 .cse24 .cse10 .cse11 .cse25 (and .cse12 .cse23 .cse13 .cse20)) (or .cse21 .cse5 .cse26 (not .cse15)) (or .cse0 .cse1 .cse7 .cse3 .cse4 .cse6 .cse5 .cse24 (not (= 1 ~c_num_read~0)) .cse8 .cse9) (or .cse2 .cse0 .cse1 .cse17 .cse10 .cse20))))) [2019-10-02 16:19:32,930 INFO L443 ceAbstractionStarter]: For program point L72-1(line 72) no Hoare annotation was computed. [2019-10-02 16:19:32,930 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:19:32,930 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~p_num_write~0 |old(~p_num_write~0)|) (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) [2019-10-02 16:19:32,931 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:32,931 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 230 283) the Hoare annotation is: (let ((.cse24 (= |old(~p_dw_pc~0)| 1)) (.cse13 (= 1 |old(~c_dr_pc~0)|))) (let ((.cse14 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse30 (not .cse13)) (.cse29 (not .cse24)) (.cse40 (+ |old(~c_num_read~0)| 1)) (.cse7 (= ~c_dr_pc~0 1))) (let ((.cse33 (= ~c_num_read~0 0)) (.cse18 (= ~c_last_read~0 ~p_last_write~0)) (.cse19 (= 1 ~q_free~0)) (.cse34 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse35 (= 0 ~p_num_write~0)) (.cse31 (= |old(~p_dw_pc~0)| 2)) (.cse22 (not (= |old(~q_free~0)| 1))) (.cse32 (not (= 0 |old(~c_num_read~0)|))) (.cse36 (not (= 0 |old(~p_num_write~0)|))) (.cse25 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse17 (not .cse7)) (.cse21 (not (= ~c_dr_st~0 0))) (.cse16 (= 0 |old(~c_dr_st~0)|)) (.cse26 (not (<= .cse40 |old(~p_num_write~0)|))) (.cse0 (or .cse14 .cse15 .cse30 .cse29)) (.cse27 (not (= |old(~q_free~0)| 0))) (.cse28 (not (<= |old(~p_num_write~0)| .cse40))) (.cse37 (= 0 ~q_free~0)) (.cse6 (<= 2 ~p_dw_st~0)) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse38 (= |old(~p_dw_st~0)| 1)) (.cse3 (<= ~c_num_read~0 ~p_num_write~0)) (.cse4 (<= ~p_num_write~0 ~c_num_read~0)) (.cse5 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse20 (= 0 ~p_dw_st~0)) (.cse8 (= ~c_dr_st~0 2)) (.cse9 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= 1 ~p_dw_pc~0)) (.cse1 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse2 (not (= 2 |old(~c_dr_st~0)|))) (.cse23 (not (= |old(~p_dw_st~0)| 0))) (.cse11 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12) (or .cse13 .cse14 .cse15 .cse16 (and .cse17 (not (= ~p_dw_pc~0 1)) .cse18 .cse19 .cse20 .cse21 .cse9) .cse22 .cse23 .cse24 .cse25) (or .cse26 .cse0 .cse27 .cse2 .cse28 .cse8 .cse12) (or .cse13 .cse14 .cse15 .cse16 .cse20 .cse29 .cse23) (or .cse14 .cse15 .cse30 .cse31 .cse2 .cse22 .cse23 .cse24 .cse32 (and .cse7 .cse20 .cse9 .cse33 .cse18 .cse19 .cse8 .cse34 .cse35) .cse36 .cse25) (or .cse26 .cse0 .cse21 .cse27 .cse28 .cse16 .cse12) (or .cse13 .cse14 .cse15 .cse8 .cse2 .cse22 .cse23 .cse25) (or (and .cse33 .cse17 .cse37 .cse6 (= ~p_num_write~0 1) .cse9 .cse10) .cse13 .cse14 .cse15 .cse27 .cse29 (not (= 1 |old(~p_num_write~0)|)) .cse32 .cse12) (or (and .cse33 .cse17 .cse18 .cse19 .cse20 .cse34 .cse9 .cse35) .cse13 .cse14 .cse15 .cse31 .cse22 .cse23 .cse24 .cse32 .cse36 .cse25) (or (and .cse17 .cse21 (not (= 1 ~p_dw_st~0)) .cse9 .cse10) .cse13 .cse14 .cse15 .cse16 .cse29 .cse38) (or .cse26 .cse0 .cse27 .cse28 (let ((.cse39 (+ ~c_num_read~0 1))) (and (<= .cse39 ~p_num_write~0) .cse37 .cse5 .cse6 .cse7 (<= ~p_num_write~0 .cse39) .cse9 .cse10)) .cse12) (or .cse13 .cse14 .cse15 .cse2 .cse29 .cse8 .cse38) (or (and .cse3 .cse4 .cse5 .cse7 .cse20 .cse8 .cse9 .cse10) .cse1 .cse2 (or .cse14 .cse15 .cse30 .cse29 .cse23) .cse11))))) [2019-10-02 16:19:32,932 INFO L439 ceAbstractionStarter]: At program point L254(line 254) the Hoare annotation is: (let ((.cse33 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse15 (= ~c_dr_pc~0 1))) (let ((.cse20 (= ~c_last_read~0 ~p_last_write~0)) (.cse21 (= 1 ~q_free~0)) (.cse31 (not .cse15)) (.cse37 (not (= ~c_dr_st~0 0))) (.cse18 (not (= 0 ~p_dw_st~0))) (.cse36 (= 1 ~p_dw_i~0)) (.cse19 (not (= 2 ~p_dw_st~0))) (.cse4 (= ~c_dr_st~0 2)) (.cse16 (= ~p_last_write~0 ~q_buf_0~0)) (.cse38 (= 1 ~p_dw_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse24 (not .cse0)) (.cse5 (not .cse33)) (.cse39 (+ |old(~c_num_read~0)| 1))) (let ((.cse6 (= |old(~p_dw_st~0)| 1)) (.cse7 (not (<= .cse39 |old(~p_num_write~0)|))) (.cse11 (not (<= |old(~p_num_write~0)| .cse39))) (.cse25 (= |old(~p_dw_pc~0)| 2)) (.cse27 (not (= 0 |old(~p_num_write~0)|))) (.cse17 (= ~c_num_read~0 0)) (.cse22 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse23 (= 0 ~p_num_write~0)) (.cse8 (or .cse1 .cse2 .cse24 .cse5)) (.cse9 (not (= |old(~q_free~0)| 0))) (.cse29 (not (= 0 |old(~c_num_read~0)|))) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse34 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse10 (and .cse18 (and (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) .cse36 .cse19 .cse15 .cse4 .cse16 .cse38))) (.cse35 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse13 (= 0 |old(~c_dr_st~0)|)) (.cse14 (and .cse36 .cse31 .cse19 .cse37 .cse16 .cse38)) (.cse32 (and .cse36 .cse31 (not (= ~p_dw_pc~0 1)) .cse19 .cse20 .cse21 .cse37 .cse16)) (.cse3 (not (= 2 |old(~c_dr_st~0)|))) (.cse26 (not (= |old(~q_free~0)| 1))) (.cse28 (not (= |old(~p_dw_st~0)| 0))) (.cse30 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse5 .cse6) (or .cse7 .cse8 .cse9 .cse11 .cse13 .cse12) (or (and .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse4 .cse22 .cse23) .cse1 .cse2 .cse24 .cse25 .cse10 .cse26 .cse27 .cse3 .cse28 .cse29 .cse30) (or .cse1 .cse2 .cse25 .cse10 (and .cse31 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) .cse26 .cse14 .cse27 (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse4 .cse22 .cse23) .cse32 .cse0 .cse28 .cse33 .cse29 .cse30) (or .cse8 .cse34 .cse3 .cse35 .cse12) (or .cse1 .cse2 .cse10 .cse5 .cse14 .cse9 (not (= 1 |old(~p_num_write~0)|)) .cse29 .cse12) (or .cse34 .cse3 .cse10 (or .cse1 .cse2 .cse24 .cse5 .cse28) .cse35) (or .cse0 .cse1 .cse2 .cse13 .cse14 .cse26 .cse28 .cse30 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse26 .cse28 .cse4 .cse30))))) [2019-10-02 16:19:32,932 INFO L443 ceAbstractionStarter]: For program point L242(lines 242 246) no Hoare annotation was computed. [2019-10-02 16:19:32,932 INFO L443 ceAbstractionStarter]: For program point L242-1(lines 237 277) no Hoare annotation was computed. [2019-10-02 16:19:32,932 INFO L443 ceAbstractionStarter]: For program point L240(line 240) no Hoare annotation was computed. [2019-10-02 16:19:32,932 INFO L439 ceAbstractionStarter]: At program point L238(line 238) the Hoare annotation is: (let ((.cse14 (= ~c_dr_pc~0 1)) (.cse42 (= |old(~p_dw_pc~0)| 1)) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse33 (<= .cse47 ~p_num_write~0)) (.cse10 (<= ~c_num_read~0 ~p_num_write~0)) (.cse11 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse24 (= ~c_num_read~0 0)) (.cse46 (= 0 ~q_free~0)) (.cse13 (<= 2 ~p_dw_st~0)) (.cse16 (= 1 ~p_dw_pc~0)) (.cse1 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse19 (not .cse0)) (.cse43 (not .cse42)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse45 (= 1 ~p_dw_i~0)) (.cse40 (not .cse14)) (.cse25 (= ~c_last_read~0 ~p_last_write~0)) (.cse26 (= 1 ~q_free~0)) (.cse23 (= 0 ~p_dw_st~0)) (.cse34 (not (= ~c_dr_st~0 0))) (.cse15 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse12 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse21 (= |old(~p_dw_pc~0)| 2)) (.cse5 (not (= |old(~q_free~0)| 1))) (.cse39 (and .cse45 .cse40 .cse25 .cse26 .cse23 .cse34 .cse15)) (.cse29 (not (= 0 |old(~p_num_write~0)|))) (.cse27 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse28 (= 0 ~p_num_write~0)) (.cse7 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse37 (= 0 |old(~c_dr_st~0)|)) (.cse32 (not (<= .cse48 |old(~p_num_write~0)|))) (.cse8 (or .cse1 .cse2 .cse19 .cse43)) (.cse36 (not (<= |old(~p_num_write~0)| .cse48))) (.cse9 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (= |old(~p_dw_st~0)| 0))) (.cse17 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse4 (not (= 2 |old(~c_dr_st~0)|))) (.cse44 (= |old(~p_dw_st~0)| 1)) (.cse41 (and .cse24 .cse46 .cse13 (= ~p_num_write~0 1) .cse15 .cse16)) (.cse20 (and .cse10 .cse11 .cse45 .cse13 .cse14 .cse3 .cse15 .cse16)) (.cse22 (and .cse10 .cse45 .cse11 .cse14 .cse23 .cse3 .cse15 .cse16)) (.cse38 (and .cse45 .cse40 .cse34 (not (= 1 ~p_dw_st~0)) .cse15 .cse16)) (.cse35 (not (= |old(~q_free~0)| 0))) (.cse30 (and .cse45 .cse33 .cse46 .cse13 .cse14 (<= ~p_num_write~0 .cse47) .cse15 .cse16)) (.cse31 (not (= 0 |old(~c_num_read~0)|))) (.cse18 (not (<= 2 |old(~p_dw_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse4 (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16) .cse17 .cse18) (or .cse1 .cse2 .cse19 .cse20 .cse21 .cse5 .cse22 (and .cse14 .cse23 .cse15 .cse24 .cse25 .cse26 .cse3 .cse27 .cse28) .cse29 .cse4 .cse30 .cse6 .cse31 .cse7) (or .cse32 .cse8 (and .cse33 .cse12 .cse34) .cse35 .cse36 .cse37 .cse18) (or .cse32 .cse8 .cse35 .cse4 .cse36 .cse3 .cse18) (or .cse38 .cse0 .cse1 .cse2 .cse37 .cse39 .cse5 .cse6 .cse7) (or (and .cse24 .cse40 .cse25 .cse26 .cse23 .cse27 .cse15 .cse28) .cse1 .cse2 .cse20 .cse21 .cse5 .cse39 .cse22 .cse29 .cse41 .cse0 .cse38 (and .cse24 .cse25 .cse23 .cse26 .cse3 .cse27 .cse15 .cse28) .cse30 .cse6 .cse42 .cse31 .cse7) (or .cse38 .cse0 .cse1 .cse2 .cse37 .cse43 .cse44) (or .cse32 .cse8 .cse20 .cse35 .cse36 .cse22 .cse30 .cse18) (or .cse9 .cse20 .cse4 .cse22 .cse30 (or .cse1 .cse2 .cse19 .cse43 .cse6) .cse17) (or .cse0 .cse1 .cse2 .cse4 .cse43 .cse3 .cse44) (or .cse41 .cse1 .cse2 .cse20 .cse43 .cse22 .cse38 .cse35 .cse30 (not (= 1 |old(~p_num_write~0)|)) .cse31 .cse18))))) [2019-10-02 16:19:32,933 INFO L439 ceAbstractionStarter]: At program point L269(line 269) the Hoare annotation is: (let ((.cse27 (= |old(~p_dw_pc~0)| 1))) (let ((.cse21 (= 0 ~q_free~0)) (.cse18 (<= 2 ~p_dw_st~0)) (.cse25 (= ~c_dr_pc~0 1)) (.cse23 (not (= ~c_dr_st~0 0))) (.cse19 (= ~p_last_write~0 ~q_buf_0~0)) (.cse26 (= 1 ~p_dw_pc~0)) (.cse0 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse10 (= 1 |old(~c_dr_pc~0)|)) (.cse17 (not .cse27)) (.cse31 (+ |old(~c_num_read~0)| 1))) (let ((.cse12 (not (<= .cse31 |old(~p_num_write~0)|))) (.cse14 (not (= |old(~q_free~0)| 0))) (.cse15 (not (<= |old(~p_num_write~0)| .cse31))) (.cse24 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse2 (= |old(~p_dw_pc~0)| 2)) (.cse20 (= ~c_num_read~0 0)) (.cse22 (= ~p_num_write~0 1)) (.cse3 (not (= |old(~q_free~0)| 1))) (.cse4 (not (= 0 |old(~p_num_write~0)|))) (.cse8 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse13 (or .cse0 .cse1 (not .cse10) .cse17)) (.cse16 (not (<= 2 |old(~p_dw_st~0)|))) (.cse28 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse6 (not (= 2 |old(~c_dr_st~0)|))) (.cse7 (not (= |old(~p_dw_st~0)| 0))) (.cse5 (let ((.cse30 (+ ~c_num_read~0 1))) (and (= 1 ~p_dw_i~0) (<= .cse30 ~p_num_write~0) .cse21 .cse18 .cse25 (<= ~p_num_write~0 .cse30) .cse23 .cse19 .cse26))) (.cse29 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse11 (= 0 |old(~c_dr_st~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse10 .cse0 .cse1 .cse11 .cse3 .cse7 .cse9) (or .cse12 .cse13 .cse14 .cse15 .cse11 .cse16) (or .cse0 .cse1 .cse14 .cse17 (and .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (not (= 1 |old(~p_num_write~0)|)) .cse8 .cse5 .cse16) (or .cse12 .cse13 .cse14 .cse15 .cse5 .cse16) (or .cse0 .cse1 (and (not .cse25) (= 0 ~p_dw_st~0) .cse19 .cse20 (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) .cse23 .cse24 (= 0 ~p_num_write~0)) .cse2 (and .cse20 .cse21 .cse18 .cse22 .cse23 .cse19 .cse26) .cse3 .cse4 .cse5 .cse10 .cse7 .cse27 .cse8 .cse9) (or .cse13 .cse28 .cse6 .cse29 .cse16) (or .cse28 .cse6 (or .cse0 .cse1 .cse17 .cse7) .cse5 .cse29) (or .cse10 .cse0 .cse1 .cse11 .cse17 (= |old(~p_dw_st~0)| 1)))))) [2019-10-02 16:19:32,933 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 230 283) no Hoare annotation was computed. [2019-10-02 16:19:32,933 INFO L443 ceAbstractionStarter]: For program point L251(lines 251 258) no Hoare annotation was computed. [2019-10-02 16:19:32,933 INFO L443 ceAbstractionStarter]: For program point L247(lines 237 277) no Hoare annotation was computed. [2019-10-02 16:19:32,934 INFO L439 ceAbstractionStarter]: At program point L278(lines 230 283) the Hoare annotation is: (let ((.cse32 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_pc~0)| 1)) (.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse39 (<= .cse47 ~p_num_write~0)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~c_dr_st~0 2)) (.cse0 (= ~c_num_read~0 0)) (.cse46 (= 0 ~q_free~0)) (.cse31 (<= 2 ~p_dw_st~0)) (.cse33 (= 1 ~p_dw_pc~0)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse37 (not .cse17)) (.cse43 (not .cse22)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse45 (= 1 ~p_dw_i~0)) (.cse1 (not .cse32)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse40 (not (= ~c_dr_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (and .cse45 .cse1 (not (= ~p_dw_pc~0 1)) .cse2 .cse3 .cse4 .cse40 .cse6)) (.cse11 (= |old(~p_dw_pc~0)| 2)) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse5 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse30 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse36 (= 0 |old(~c_dr_st~0)|)) (.cse38 (not (<= .cse48 |old(~p_num_write~0)|))) (.cse26 (or .cse8 .cse9 .cse37 .cse43)) (.cse42 (not (<= |old(~p_num_write~0)| .cse48))) (.cse27 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse34 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse44 (= |old(~p_dw_st~0)| 1)) (.cse16 (and .cse0 .cse46 .cse31 (= ~p_num_write~0 1) .cse6 .cse33)) (.cse10 (and .cse28 .cse29 .cse45 .cse31 .cse32 .cse19 .cse6 .cse33)) (.cse14 (and .cse28 .cse45 .cse29 .cse32 .cse4 .cse19 .cse6 .cse33)) (.cse18 (and .cse45 .cse1 .cse40 (not (= 1 ~p_dw_st~0)) .cse6 .cse33)) (.cse41 (not (= |old(~q_free~0)| 0))) (.cse20 (and .cse45 .cse39 .cse46 .cse31 .cse32 (<= ~p_num_write~0 .cse47) .cse6 .cse33)) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse35 (not (<= 2 |old(~p_dw_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse0 .cse2 .cse4 .cse3 .cse19 .cse5 .cse6 .cse7) .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse17 .cse8 .cse9 .cse19 .cse25 .cse12 .cse21 .cse24) (or .cse26 .cse27 .cse25 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse19 .cse6 .cse33) .cse34 .cse35) (or .cse18 .cse17 .cse8 .cse9 .cse36 .cse13 .cse12 .cse21 .cse24) (or .cse8 .cse9 .cse37 .cse10 .cse11 .cse12 .cse14 (and .cse32 .cse4 .cse6 .cse0 .cse2 .cse3 .cse19 .cse5 .cse7) .cse15 .cse25 .cse20 .cse21 .cse23 .cse24) (or .cse38 .cse26 (and .cse39 .cse30 .cse40) .cse41 .cse42 .cse36 .cse35) (or .cse38 .cse26 .cse41 .cse25 .cse42 .cse19 .cse35) (or .cse18 .cse17 .cse8 .cse9 .cse36 .cse43 .cse44) (or .cse38 .cse26 .cse10 .cse41 .cse42 .cse14 .cse20 .cse35) (or .cse27 .cse10 .cse25 .cse14 .cse20 (or .cse8 .cse9 .cse37 .cse43 .cse21) .cse34) (or .cse17 .cse8 .cse9 .cse25 .cse43 .cse19 .cse44) (or .cse16 .cse8 .cse9 .cse10 .cse43 .cse14 .cse18 .cse41 .cse20 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse35))))) [2019-10-02 16:19:32,934 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 273) no Hoare annotation was computed. [2019-10-02 16:19:32,934 INFO L439 ceAbstractionStarter]: At program point L262(lines 237 277) the Hoare annotation is: (let ((.cse32 (= ~c_dr_pc~0 1)) (.cse22 (= |old(~p_dw_pc~0)| 1)) (.cse17 (= 1 |old(~c_dr_pc~0)|)) (.cse47 (+ ~c_num_read~0 1))) (let ((.cse39 (<= .cse47 ~p_num_write~0)) (.cse28 (<= ~c_num_read~0 ~p_num_write~0)) (.cse29 (<= ~p_num_write~0 ~c_num_read~0)) (.cse19 (= ~c_dr_st~0 2)) (.cse0 (= ~c_num_read~0 0)) (.cse46 (= 0 ~q_free~0)) (.cse31 (<= 2 ~p_dw_st~0)) (.cse33 (= 1 ~p_dw_pc~0)) (.cse8 (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|))) (.cse9 (not (= ~p_dw_i~0 1))) (.cse37 (not .cse17)) (.cse43 (not .cse22)) (.cse48 (+ |old(~c_num_read~0)| 1)) (.cse45 (= 1 ~p_dw_i~0)) (.cse1 (not .cse32)) (.cse2 (= ~c_last_read~0 ~p_last_write~0)) (.cse3 (= 1 ~q_free~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse40 (not (= ~c_dr_st~0 0))) (.cse6 (= ~p_last_write~0 ~q_buf_0~0))) (let ((.cse13 (and .cse45 .cse1 (not (= ~p_dw_pc~0 1)) .cse2 .cse3 .cse4 .cse40 .cse6)) (.cse11 (= |old(~p_dw_pc~0)| 2)) (.cse12 (not (= |old(~q_free~0)| 1))) (.cse5 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse7 (= 0 ~p_num_write~0)) (.cse15 (not (= 0 |old(~p_num_write~0)|))) (.cse24 (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) (.cse30 (= ~p_num_write~0 |old(~p_num_write~0)|)) (.cse36 (= 0 |old(~c_dr_st~0)|)) (.cse38 (not (<= .cse48 |old(~p_num_write~0)|))) (.cse26 (or .cse8 .cse9 .cse37 .cse43)) (.cse42 (not (<= |old(~p_num_write~0)| .cse48))) (.cse27 (not (<= |old(~c_num_read~0)| |old(~p_num_write~0)|))) (.cse21 (not (= |old(~p_dw_st~0)| 0))) (.cse34 (not (<= |old(~p_num_write~0)| |old(~c_num_read~0)|))) (.cse25 (not (= 2 |old(~c_dr_st~0)|))) (.cse44 (= |old(~p_dw_st~0)| 1)) (.cse16 (and .cse0 .cse46 .cse31 (= ~p_num_write~0 1) .cse6 .cse33)) (.cse10 (and .cse28 .cse29 .cse45 .cse31 .cse32 .cse19 .cse6 .cse33)) (.cse14 (and .cse28 .cse45 .cse29 .cse32 .cse4 .cse19 .cse6 .cse33)) (.cse18 (and .cse45 .cse1 .cse40 (not (= 1 ~p_dw_st~0)) .cse6 .cse33)) (.cse41 (not (= |old(~q_free~0)| 0))) (.cse20 (and .cse45 .cse39 .cse46 .cse31 .cse32 (<= ~p_num_write~0 .cse47) .cse6 .cse33)) (.cse23 (not (= 0 |old(~c_num_read~0)|))) (.cse35 (not (<= 2 |old(~p_dw_st~0)|)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (and .cse0 .cse2 .cse4 .cse3 .cse19 .cse5 .cse6 .cse7) .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse17 .cse8 .cse9 .cse19 .cse25 .cse12 .cse21 .cse24) (or .cse26 .cse27 .cse25 (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse19 .cse6 .cse33) .cse34 .cse35) (or .cse18 .cse17 .cse8 .cse9 .cse36 .cse13 .cse12 .cse21 .cse24) (or .cse8 .cse9 .cse37 .cse10 .cse11 .cse12 .cse14 (and .cse32 .cse4 .cse6 .cse0 .cse2 .cse3 .cse19 .cse5 .cse7) .cse15 .cse25 .cse20 .cse21 .cse23 .cse24) (or .cse38 .cse26 (and .cse39 .cse30 .cse40) .cse41 .cse42 .cse36 .cse35) (or .cse38 .cse26 .cse41 .cse25 .cse42 .cse19 .cse35) (or .cse18 .cse17 .cse8 .cse9 .cse36 .cse43 .cse44) (or .cse38 .cse26 .cse10 .cse41 .cse42 .cse14 .cse20 .cse35) (or .cse27 .cse10 .cse25 .cse14 .cse20 (or .cse8 .cse9 .cse37 .cse43 .cse21) .cse34) (or .cse17 .cse8 .cse9 .cse25 .cse43 .cse19 .cse44) (or .cse16 .cse8 .cse9 .cse10 .cse43 .cse14 .cse18 .cse41 .cse20 (not (= 1 |old(~p_num_write~0)|)) .cse23 .cse35))))) [2019-10-02 16:19:32,934 INFO L443 ceAbstractionStarter]: For program point L290-1(line 290) no Hoare annotation was computed. [2019-10-02 16:19:32,935 INFO L446 ceAbstractionStarter]: At program point L299(lines 288 301) the Hoare annotation is: true [2019-10-02 16:19:32,935 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 284 302) no Hoare annotation was computed. [2019-10-02 16:19:32,935 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 297) no Hoare annotation was computed. [2019-10-02 16:19:32,935 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 284 302) the Hoare annotation is: true [2019-10-02 16:19:32,935 INFO L446 ceAbstractionStarter]: At program point L290(line 290) the Hoare annotation is: true [2019-10-02 16:19:32,935 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 284 302) no Hoare annotation was computed. [2019-10-02 16:19:32,935 INFO L439 ceAbstractionStarter]: At program point L62(lines 50 64) the Hoare annotation is: (let ((.cse4 (= 0 ~c_dr_st~0)) (.cse0 (= 1 ~c_dr_pc~0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse7 (not (= 1 ~p_num_write~0))) (.cse5 (= ~p_dw_st~0 2)) (.cse6 (= ~p_dw_pc~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse2 (not .cse6) (not (= ~q_free~0 1)) .cse3 .cse0 .cse4 .cse7 (not (= 1 ~c_num_read~0)) (not (= ~c_last_read~0 ~p_last_write~0))) (or (= ~p_dw_st~0 0) .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) (not (= ~q_free~0 0)) .cse3 .cse7 .cse5 .cse6 (not (= 0 ~c_num_read~0))))) [2019-10-02 16:19:32,936 INFO L446 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 47 65) the Hoare annotation is: true [2019-10-02 16:19:32,936 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 57) no Hoare annotation was computed. [2019-10-02 16:19:32,936 INFO L443 ceAbstractionStarter]: For program point L51(lines 51 60) no Hoare annotation was computed. [2019-10-02 16:19:32,936 INFO L443 ceAbstractionStarter]: For program point L51-2(lines 51 60) no Hoare annotation was computed. [2019-10-02 16:19:32,936 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 47 65) no Hoare annotation was computed. [2019-10-02 16:19:32,936 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 47 65) no Hoare annotation was computed. [2019-10-02 16:19:32,936 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 303 331) the Hoare annotation is: (or (and (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= 0 ~p_dw_st~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-10-02 16:19:32,937 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 324) no Hoare annotation was computed. [2019-10-02 16:19:32,937 INFO L443 ceAbstractionStarter]: For program point L318(line 318) no Hoare annotation was computed. [2019-10-02 16:19:32,937 INFO L439 ceAbstractionStarter]: At program point L317(line 317) the Hoare annotation is: (let ((.cse16 (= ~c_dr_pc~0 1))) (let ((.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse6 (not .cse16)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse2 (= 0 ~p_dw_st~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_num_read~0 0)) (.cse14 (= 0 ~q_free~0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 (not (= 1 ~p_dw_st~0)) .cse4 .cse5) (and .cse8 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (and (<= .cse13 ~p_num_write~0) .cse14 .cse15 .cse16 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse8 .cse6 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse10 .cse2 .cse7 .cse4) (not (= 0 |old(~p_num_write~0)|)) (and .cse8 .cse14 .cse15 (= ~p_num_write~0 1) .cse4 .cse5) (not (= |old(~p_dw_st~0)| 0))))) [2019-10-02 16:19:32,937 INFO L439 ceAbstractionStarter]: At program point L317-1(line 317) the Hoare annotation is: (let ((.cse16 (= ~c_dr_pc~0 1))) (let ((.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse6 (not .cse16)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse2 (= 0 ~p_dw_st~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_num_read~0 0)) (.cse14 (= 0 ~q_free~0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 (not (= 1 ~p_dw_st~0)) .cse4 .cse5) (and .cse8 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (and (<= .cse13 ~p_num_write~0) .cse14 .cse15 .cse16 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse8 .cse6 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse10 .cse2 .cse7 .cse4) (not (= 0 |old(~p_num_write~0)|)) (and .cse8 .cse14 .cse15 (= ~p_num_write~0 1) .cse4 .cse5) (not (= |old(~p_dw_st~0)| 0))))) [2019-10-02 16:19:32,937 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 303 331) no Hoare annotation was computed. [2019-10-02 16:19:32,938 INFO L443 ceAbstractionStarter]: For program point L314(line 314) no Hoare annotation was computed. [2019-10-02 16:19:32,938 INFO L439 ceAbstractionStarter]: At program point L313-1(lines 310 325) the Hoare annotation is: (let ((.cse16 (= ~c_dr_pc~0 1))) (let ((.cse11 (= |old(~p_dw_pc~0)| ~p_dw_pc~0)) (.cse12 (= 0 ~p_num_write~0)) (.cse0 (<= ~c_num_read~0 ~p_num_write~0)) (.cse1 (<= ~p_num_write~0 ~c_num_read~0)) (.cse3 (= ~c_dr_st~0 2)) (.cse6 (not .cse16)) (.cse9 (= ~c_last_read~0 ~p_last_write~0)) (.cse10 (= 1 ~q_free~0)) (.cse2 (= 0 ~p_dw_st~0)) (.cse7 (not (= ~c_dr_st~0 0))) (.cse8 (= ~c_num_read~0 0)) (.cse14 (= 0 ~q_free~0)) (.cse15 (<= 2 ~p_dw_st~0)) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= 1 ~p_dw_pc~0))) (or (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (= 1 |old(~c_dr_pc~0)|) (and .cse6 .cse7 (not (= 1 ~p_dw_st~0)) .cse4 .cse5) (and .cse8 .cse9 .cse2 .cse10 .cse3 .cse11 .cse4 .cse12) (let ((.cse13 (+ ~c_num_read~0 1))) (and (<= .cse13 ~p_num_write~0) .cse14 .cse15 .cse16 (<= ~p_num_write~0 .cse13) .cse4 .cse5)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|)) (and .cse8 .cse6 .cse9 .cse10 .cse2 .cse11 .cse4 .cse12) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (and .cse0 .cse1 .cse15 .cse3 .cse4 .cse5) (and .cse6 .cse9 .cse10 .cse2 .cse7 .cse4) (not (= 0 |old(~p_num_write~0)|)) (and .cse8 .cse14 .cse15 (= ~p_num_write~0 1) .cse4 .cse5) (not (= |old(~p_dw_st~0)| 0))))) [2019-10-02 16:19:32,938 INFO L439 ceAbstractionStarter]: At program point L310(line 310) the Hoare annotation is: (or (and (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) (= 0 ~p_dw_st~0) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_buf_0~0)| |old(~p_last_write~0)|)) (not (= ~p_dw_i~0 1)) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (not (= 0 |old(~p_num_write~0)|)) (not (= |old(~c_last_read~0)| |old(~p_last_write~0)|))) [2019-10-02 16:19:32,938 INFO L446 ceAbstractionStarter]: At program point L326(lines 303 331) the Hoare annotation is: true [2019-10-02 16:19:32,938 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 16:19:32,938 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (not (= ~p_dw_pc~0 2)) (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= 0 ~q_free~0) (not (= ~p_dw_pc~0 1)) (= ~c_last_read~0 ~p_last_write~0) (= 0 ~p_dw_st~0) (not (= 1 ~p_dw_i~0)) (= ~p_last_write~0 ~q_buf_0~0) (= 0 ~p_num_write~0)) [2019-10-02 16:19:32,939 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 38) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 41) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point L32-2(lines 32 41) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 28 46) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 28 46) no Hoare annotation was computed. [2019-10-02 16:19:32,939 INFO L439 ceAbstractionStarter]: At program point L43(lines 31 45) the Hoare annotation is: (let ((.cse0 (= 1 ~c_dr_pc~0)) (.cse6 (= ~p_dw_st~0 0)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (= ~p_dw_pc~0 2)) (.cse8 (not (= ~q_free~0 0))) (.cse9 (not (= 1 ~p_num_write~0))) (.cse3 (= ~p_dw_st~0 2)) (.cse4 (= ~p_dw_pc~0 1)) (.cse10 (not (= 0 ~c_num_read~0))) (.cse5 (= is_do_write_p_triggered_~__retres1~0 0))) (and (or .cse0 .cse1 .cse2 (= 0 ~c_dr_st~0) .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse1 .cse2 .cse7 .cse8 .cse9 .cse3 .cse5 .cse4 .cse10) (or .cse6 .cse1 .cse2 .cse7 .cse8 (not (= 2 ~c_dr_st~0)) .cse9 .cse3 .cse4 .cse10 .cse5))) [2019-10-02 16:19:32,940 INFO L446 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 28 46) the Hoare annotation is: true [2019-10-02 16:19:32,940 INFO L443 ceAbstractionStarter]: For program point do_read_cEXIT(lines 135 191) no Hoare annotation was computed. [2019-10-02 16:19:32,940 INFO L439 ceAbstractionStarter]: At program point L186(lines 135 191) the Hoare annotation is: (let ((.cse18 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse18)) (.cse5 (not (= |old(~q_free~0)| 0))) (.cse8 (<= 2 ~p_dw_st~0)) (.cse14 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (= 0 |old(~c_dr_st~0)|)) (.cse17 (not (= 0 |old(~c_num_read~0)|))) (.cse9 (= ~c_dr_pc~0 1)) (.cse15 (= 0 ~p_dw_st~0)) (.cse11 (= ~c_last_read~0 ~p_last_write~0)) (.cse12 (= 1 ~q_free~0)) (.cse13 (= ~c_dr_st~0 2))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1)) (.cse7 (<= ~p_num_write~0 ~c_num_read~0)) (.cse10 (<= ~c_num_read~0 ~p_num_write~0))) (or (not (<= .cse0 ~p_num_write~0)) (or .cse1 .cse2 (not .cse3) .cse4) .cse5 (not (<= ~p_num_write~0 .cse0)) .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14 (and .cse7 .cse9 .cse15 .cse10 .cse11 .cse12 .cse13))) (let ((.cse16 (= ~c_num_read~0 1))) (or .cse1 .cse2 .cse4 .cse5 .cse6 (and .cse8 .cse9 .cse16 .cse11 .cse12 .cse13) (not (= 1 ~p_num_write~0)) .cse17 (and .cse9 .cse15 .cse16 .cse11 .cse12 .cse13) .cse14)) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse6 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse18 .cse17 (and .cse9 .cse15 (= ~c_num_read~0 0) .cse11 .cse12 .cse13) (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,940 INFO L443 ceAbstractionStarter]: For program point L151(lines 150 185) no Hoare annotation was computed. [2019-10-02 16:19:32,940 INFO L439 ceAbstractionStarter]: At program point L182(line 182) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse7 ~p_num_write~0)) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (not (<= ~p_num_write~0 .cse7)) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,941 INFO L439 ceAbstractionStarter]: At program point L182-1(lines 138 190) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse12 (not .cse9)) (.cse4 (= ~c_num_read~0 0)) (.cse8 (not (= ~c_dr_st~0 0))) (.cse16 (<= 2 ~p_dw_st~0)) (.cse13 (not (= |old(~q_free~0)| 0))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse10 (not (= 0 |old(~c_num_read~0)|))) (.cse5 (= ~c_last_read~0 ~p_last_write~0)) (.cse6 (= 1 ~q_free~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse17 (not (<= 2 |old(~p_dw_st~0)|)))) (and (or .cse0 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (and .cse4 .cse5 .cse6 .cse7 .cse8) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse10 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0))) (let ((.cse11 (+ |old(~c_num_read~0)| 1)) (.cse14 (<= ~c_num_read~0 ~p_num_write~0)) (.cse15 (<= ~p_num_write~0 ~c_num_read~0))) (or (not (<= .cse11 ~p_num_write~0)) (or .cse1 .cse2 (not .cse0) .cse12) .cse13 (and .cse14 .cse15 .cse16 .cse5 .cse6) (not (<= ~p_num_write~0 .cse11)) .cse3 (and .cse14 .cse15 .cse5 .cse6 .cse7) .cse17)) (let ((.cse18 (= ~c_num_read~0 1))) (or .cse1 .cse2 .cse12 (and (not (= ~c_dr_pc~0 1)) .cse16 .cse4 (= 0 ~q_free~0) .cse8) (and .cse16 .cse5 .cse6 .cse18) .cse13 .cse3 (not (= 1 ~p_num_write~0)) .cse10 (and .cse5 .cse6 .cse7 .cse18) .cse17))))) [2019-10-02 16:19:32,941 INFO L439 ceAbstractionStarter]: At program point L143(lines 138 190) the Hoare annotation is: (let ((.cse10 (= ~p_dw_pc~0 1))) (let ((.cse6 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse10)) (.cse8 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse7 (= 0 |old(~c_dr_st~0)|)) (.cse9 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (or .cse1 .cse2 (not .cse3) .cse4) (let ((.cse5 (+ ~c_num_read~0 1))) (and (<= .cse5 ~p_num_write~0) (<= 2 ~p_dw_st~0) (= ~c_dr_pc~0 1) (= 0 ~q_free~0) (<= ~p_num_write~0 .cse5) (not (= ~c_dr_st~0 0)))) .cse6 (not (<= ~p_num_write~0 .cse0)) .cse7 .cse8)) (or .cse3 .cse1 .cse2 .cse6 .cse7 .cse4 (not (= 1 ~p_num_write~0)) .cse9 .cse8) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse7 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse10 .cse9 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,941 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 184) no Hoare annotation was computed. [2019-10-02 16:19:32,941 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 147) no Hoare annotation was computed. [2019-10-02 16:19:32,942 INFO L439 ceAbstractionStarter]: At program point do_read_cENTRY(lines 135 191) the Hoare annotation is: (let ((.cse15 (= ~c_dr_pc~0 1)) (.cse16 (= ~p_dw_pc~0 1))) (let ((.cse5 (not .cse16)) (.cse7 (<= 2 ~p_dw_st~0)) (.cse9 (= 0 ~q_free~0)) (.cse3 (not (= |old(~q_free~0)| 0))) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse6 (not .cse15)) (.cse8 (= ~c_num_read~0 0)) (.cse10 (not (= ~c_dr_st~0 0))) (.cse4 (= 0 |old(~c_dr_st~0)|)) (.cse11 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse6 .cse7 .cse8 .cse9 .cse10) (not (= 1 ~p_num_write~0)) .cse11 .cse12) (let ((.cse13 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse13 ~p_num_write~0)) (or .cse1 .cse2 (not .cse0) .cse5) (let ((.cse14 (+ ~c_num_read~0 1))) (and (<= .cse14 ~p_num_write~0) .cse7 .cse15 .cse9 (<= ~p_num_write~0 .cse14) .cse10)) .cse3 (not (<= ~p_num_write~0 .cse13)) .cse4 .cse12)) (or .cse0 .cse1 .cse2 (and .cse6 (= 0 ~p_dw_st~0) .cse8 (= ~c_last_read~0 ~p_last_write~0) (= 1 ~q_free~0) .cse10) (= ~p_dw_pc~0 2) .cse4 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse16 .cse11 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,942 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 152 162) no Hoare annotation was computed. [2019-10-02 16:19:32,942 INFO L439 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (let ((.cse9 (= ~p_dw_pc~0 1))) (let ((.cse4 (not .cse9)) (.cse2 (not (= |old(~q_free~0)| 0))) (.cse6 (not (<= 2 |old(~p_dw_st~0)|))) (.cse8 (= 1 |old(~c_dr_pc~0)|)) (.cse0 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse1 (not (= ~p_dw_i~0 1))) (.cse3 (= 0 |old(~c_dr_st~0)|)) (.cse5 (not (= 0 |old(~c_num_read~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= 1 ~p_num_write~0)) .cse5 .cse6) (let ((.cse7 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse7 ~p_num_write~0)) (or .cse0 .cse1 (not .cse8) .cse4) .cse2 (not (<= ~p_num_write~0 .cse7)) .cse3 .cse6)) (or .cse8 .cse0 .cse1 (= ~p_dw_pc~0 2) .cse3 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse9 .cse5 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,942 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 146) no Hoare annotation was computed. [2019-10-02 16:19:32,942 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 179) no Hoare annotation was computed. [2019-10-02 16:19:32,942 INFO L439 ceAbstractionStarter]: At program point L169(line 169) the Hoare annotation is: (let ((.cse14 (= ~p_dw_pc~0 1))) (let ((.cse10 (not (= |old(~q_free~0)| 0))) (.cse4 (not .cse14)) (.cse6 (= ~c_dr_pc~0 1)) (.cse5 (<= 2 ~p_dw_st~0)) (.cse7 (= ~c_last_read~0 ~p_last_write~0)) (.cse8 (= 1 ~q_free~0)) (.cse9 (not (= ~c_dr_st~0 0))) (.cse12 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (not (= ~q_buf_0~0 ~p_last_write~0))) (.cse2 (not (= ~p_dw_i~0 1))) (.cse11 (= 0 |old(~c_dr_st~0)|)) (.cse13 (not (= 0 |old(~c_num_read~0)|)))) (and (let ((.cse0 (+ |old(~c_num_read~0)| 1))) (or (not (<= .cse0 ~p_num_write~0)) (or .cse1 .cse2 (not .cse3) .cse4) (and (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse6 (<= ~c_num_read~0 ~p_num_write~0) .cse7 .cse8 .cse9) .cse10 (not (<= ~p_num_write~0 .cse0)) .cse11 .cse12)) (or .cse3 .cse1 .cse2 .cse10 .cse11 .cse4 (and (not .cse6) .cse5 (= ~c_num_read~0 1) .cse7 .cse8 .cse9) (not (= 1 ~p_num_write~0)) .cse13 .cse12) (or .cse3 .cse1 .cse2 (= ~p_dw_pc~0 2) .cse11 (not (= |old(~q_free~0)| 1)) (not (= |old(~p_dw_st~0)| 0)) .cse14 .cse13 (not (= 0 ~p_num_write~0)) (not (= |old(~c_last_read~0)| ~p_last_write~0)))))) [2019-10-02 16:19:32,943 INFO L443 ceAbstractionStarter]: For program point L169-1(line 169) no Hoare annotation was computed. [2019-10-02 16:19:32,943 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 332 348) no Hoare annotation was computed. [2019-10-02 16:19:32,943 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 332 348) no Hoare annotation was computed. [2019-10-02 16:19:32,943 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 332 348) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= ~q_buf_0~0 ~p_last_write~0)) (= |old(~p_dw_i~0)| 1) (= |old(~p_dw_pc~0)| 2) (not (= |old(~q_free~0)| 0)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (not (= 0 |old(~c_num_read~0)|)) (and (= ~c_num_read~0 0) (not (= ~c_dr_pc~0 1)) (= 0 ~q_free~0) (not (= 1 ~p_dw_i~0)) (= |old(~p_dw_pc~0)| ~p_dw_pc~0) (= 0 ~p_num_write~0)) (not (= 0 |old(~p_num_write~0)|)) (not (= ~c_last_read~0 ~p_last_write~0))) [2019-10-02 16:19:33,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:19:33 BoogieIcfgContainer [2019-10-02 16:19:33,006 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 16:19:33,008 INFO L168 Benchmark]: Toolchain (without parser) took 35032.42 ms. Allocated memory was 132.6 MB in the beginning and 698.4 MB in the end (delta: 565.7 MB). Free memory was 88.3 MB in the beginning and 420.3 MB in the end (delta: -331.9 MB). Peak memory consumption was 588.6 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,009 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 429.77 ms. Allocated memory was 132.6 MB in the beginning and 197.7 MB in the end (delta: 65.0 MB). Free memory was 88.1 MB in the beginning and 173.3 MB in the end (delta: -85.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,011 INFO L168 Benchmark]: Boogie Preprocessor took 56.59 ms. Allocated memory is still 197.7 MB. Free memory was 173.3 MB in the beginning and 171.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,012 INFO L168 Benchmark]: RCFGBuilder took 501.71 ms. Allocated memory is still 197.7 MB. Free memory was 171.4 MB in the beginning and 144.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,013 INFO L168 Benchmark]: TraceAbstraction took 34039.75 ms. Allocated memory was 197.7 MB in the beginning and 698.4 MB in the end (delta: 500.7 MB). Free memory was 144.9 MB in the beginning and 420.3 MB in the end (delta: -275.4 MB). Peak memory consumption was 580.1 MB. Max. memory is 7.1 GB. [2019-10-02 16:19:33,016 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory was 106.9 MB in the beginning and 106.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 429.77 ms. Allocated memory was 132.6 MB in the beginning and 197.7 MB in the end (delta: 65.0 MB). Free memory was 88.1 MB in the beginning and 173.3 MB in the end (delta: -85.2 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.59 ms. Allocated memory is still 197.7 MB. Free memory was 173.3 MB in the beginning and 171.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 501.71 ms. Allocated memory is still 197.7 MB. Free memory was 171.4 MB in the beginning and 144.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34039.75 ms. Allocated memory was 197.7 MB in the beginning and 698.4 MB in the end (delta: 500.7 MB). Free memory was 144.9 MB in the beginning and 420.3 MB in the end (delta: -275.4 MB). Peak memory consumption was 580.1 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: ((((((((((((((((((((((((((((((((((c_num_read == 0 && !(c_dr_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_num_write))) || (((((c_num_read == 0 && 0 == q_free) && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || c_dr_st == 2) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 == \old(c_dr_st))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_num_write) <= \old(c_num_read))) || !(2 <= \old(p_dw_st)))) && (((((((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((c_dr_pc == 1 && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || !(2 == \old(c_dr_st))) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(2 <= \old(p_dw_st)))) && ((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || c_dr_st == 2) || !(2 <= \old(p_dw_st)))) && (((((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1)) && (((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 <= \old(p_dw_st)))) && ((((((!(\old(c_num_read) <= \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(p_num_write) <= \old(c_num_read)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || c_dr_st == 2) || \old(p_dw_st) == 1)) && ((((((((((((((((c_num_read == 0 && 0 == q_free) && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(2 <= \old(p_dw_st))) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || (((((c_num_read + 1 <= p_num_write && 2 <= p_dw_st) && c_dr_pc == 1) && 0 == q_free) && p_num_write <= c_num_read + 1) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(2 <= \old(p_dw_st))) && ((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(p_dw_pc == 1)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || !(2 <= \old(p_dw_st)))) && ((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((p_last_write == q_buf_0 && !(0 == p_dw_st)) && !(2 == p_dw_st)) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((0 == q_free && !(0 == p_dw_st)) && !(2 == p_dw_st)) && p_num_write == 1) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || c_dr_st == 2) || \old(p_dw_st) == 2)) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || c_dr_st == 2) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || (((!(2 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && ((\old(p_dw_st) == 0 || ((((0 == q_free && !(2 == p_dw_st) && p_last_write == q_buf_0) && \old(p_dw_pc) == p_dw_pc) && \old(p_num_write) + 1 <= p_num_write) && p_num_write <= \old(p_num_write) + 1)) || (((!(c_num_read <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(\old(p_num_write) <= c_num_read))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((!(p_dw_pc == 1) && !(2 == p_dw_st)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write)))) && ((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || ((((((p_last_write == q_buf_0 && !(0 == p_dw_st)) && !(2 == p_dw_st)) && c_last_read == p_last_write) && 1 == q_free) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || (((((0 == q_free && !(0 == p_dw_st)) && !(2 == p_dw_st)) && p_num_write == 1) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || ((((c_num_read == 0 && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0))) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) && (((((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_last_read == p_last_write) && 1 == q_free)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || ((((c_num_read <= p_num_write && p_num_write <= c_num_read) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st)) || !(2 <= \old(p_dw_st)))) && ((((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || ((((!(c_dr_pc == 1) && 2 <= p_dw_st) && c_num_read == 0) && 0 == q_free) && !(c_dr_st == 0))) || (((2 <= p_dw_st && c_last_read == p_last_write) && 1 == q_free) && c_num_read == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || (((c_last_read == p_last_write && 1 == q_free) && 0 == p_dw_st) && c_num_read == 1)) || !(2 <= \old(p_dw_st))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: (((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == c_dr_st) || p_dw_st == 2) || p_dw_pc == 1) || __retres1 == 0) && ((((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(1 == p_num_write)) || p_dw_st == 2) || __retres1 == 0) || p_dw_pc == 1) || !(0 == c_num_read))) && ((((((((((p_dw_st == 0 || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || !(2 == c_dr_st)) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) || __retres1 == 0) - InvariantResult [Line: 310]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_i == 1) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || ((((!(c_dr_pc == 1) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || ((((((c_num_read + 1 <= p_num_write && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) || (((((((c_num_read == 0 && !(c_dr_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || !(\old(q_buf_0) == \old(p_last_write))) || (((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 2 <= p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((!(c_dr_pc == 1) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(0 == \old(p_num_write))) || (((((c_num_read == 0 && 0 == q_free) && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((c_num_read == 0 && !(c_dr_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_num_write))) || (((((c_num_read == 0 && 0 == q_free) && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || 1 == \old(c_dr_pc)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((c_num_read == 0 && c_last_read == p_last_write) && 0 == p_dw_st) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write))) && (((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || c_dr_st == 2) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(c_num_read) <= \old(p_num_write))) || !(2 == \old(c_dr_st))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && p_num_write == \old(p_num_write)) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_num_write) <= \old(c_num_read))) || !(2 <= \old(p_dw_st)))) && (((((((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || (((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && c_last_read == p_last_write) && 1 == q_free) && 0 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(c_last_read) == \old(p_last_write)))) && (((((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || ((((((((c_dr_pc == 1 && 0 == p_dw_st) && p_last_write == q_buf_0) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && 0 == p_num_write)) || !(0 == \old(p_num_write))) || !(2 == \old(c_dr_st))) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_st) == 0)) || !(0 == \old(c_num_read))) || !(\old(c_last_read) == \old(p_last_write)))) && ((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || ((c_num_read + 1 <= p_num_write && p_num_write == \old(p_num_write)) && !(c_dr_st == 0))) || !(\old(q_free) == 0)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || !(2 <= \old(p_dw_st)))) && ((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(q_free) == 0)) || !(2 == \old(c_dr_st))) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || c_dr_st == 2) || !(2 <= \old(p_dw_st)))) && (((((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || 1 == \old(c_dr_pc)) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(p_dw_pc) == 1)) || \old(p_dw_st) == 1)) && (((((((!(\old(c_num_read) + 1 <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || !(\old(p_num_write) <= \old(c_num_read) + 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 <= \old(p_dw_st)))) && ((((((!(\old(c_num_read) <= \old(p_num_write)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(2 == \old(c_dr_st))) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) == 1)) || !(\old(p_dw_st) == 0)) || !(\old(p_num_write) <= \old(c_num_read)))) && ((((((1 == \old(c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(p_dw_pc) == 1)) || c_dr_st == 2) || \old(p_dw_st) == 1)) && ((((((((((((((((c_num_read == 0 && 0 == q_free) && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((((((c_num_read <= p_num_write && p_num_write <= c_num_read) && 1 == p_dw_i) && 2 <= p_dw_st) && c_dr_pc == 1) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(p_dw_pc) == 1)) || (((((((c_num_read <= p_num_write && 1 == p_dw_i) && p_num_write <= c_num_read) && c_dr_pc == 1) && 0 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(\old(q_free) == 0)) || (((((((1 == p_dw_i && c_num_read + 1 <= p_num_write) && 0 == q_free) && 2 <= p_dw_st) && c_dr_pc == 1) && p_num_write <= c_num_read + 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(1 == \old(p_num_write))) || !(0 == \old(c_num_read))) || !(2 <= \old(p_dw_st))) - InvariantResult [Line: 91]: Loop Invariant Derived loop invariant: (((((((\old(p_dw_st) == 0 || (((((0 == q_free && 2 <= p_dw_st) && p_last_write == q_buf_0) && \old(p_num_write) + 1 <= p_num_write) && 1 == p_dw_pc) && p_num_write <= \old(p_num_write) + 1)) || (((!(c_num_read <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(\old(p_num_write) <= c_num_read)) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && c_dr_st == 2) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || ((((0 == q_free && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || (((((1 == p_dw_i && !(c_dr_pc == 1)) && c_dr_st == 2) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(c_last_read == \old(p_last_write)))) && ((((((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || 1 == c_dr_pc) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || ((((0 == q_free && 2 <= p_dw_st) && p_num_write == 1) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((1 == p_dw_i && !(c_dr_pc == 1)) && !(c_dr_st == 0)) && !(1 == p_dw_st)) && p_last_write == q_buf_0) && 1 == p_dw_pc) || ((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || \old(p_dw_st) == 2) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: ((((((1 == c_dr_pc || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || 0 == __retres1) || 0 == c_dr_st) || p_dw_st == 2) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || !(q_free == 1)) || 0 == __retres1) || 1 == c_dr_pc) || 0 == c_dr_st) || !(1 == p_num_write)) || !(1 == c_num_read)) || !(c_last_read == p_last_write))) && ((((((((((p_dw_st == 0 || 1 == c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || !(q_free == 0)) || 0 == __retres1) || !(1 == p_num_write)) || p_dw_st == 2) || p_dw_pc == 1) || !(0 == c_num_read)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((!(\old(c_num_read) + 1 <= p_num_write) || ((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(1 == \old(c_dr_pc))) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || !(p_num_write <= \old(c_num_read) + 1)) || 0 == \old(c_dr_st)) || ((((((p_num_write <= c_num_read && 2 <= p_dw_st) && c_dr_pc == 1) && c_num_read <= p_num_write) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2)) || !(2 <= \old(p_dw_st))) || ((((((p_num_write <= c_num_read && c_dr_pc == 1) && 0 == p_dw_st) && c_num_read <= p_num_write) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2)) && (((((((((!(q_buf_0 == p_last_write) || !(p_dw_i == 1)) || !(p_dw_pc == 1)) || !(\old(q_free) == 0)) || 0 == \old(c_dr_st)) || (((((2 <= p_dw_st && c_dr_pc == 1) && c_num_read == 1) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2)) || !(1 == p_num_write)) || !(0 == \old(c_num_read))) || (((((c_dr_pc == 1 && 0 == p_dw_st) && c_num_read == 1) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2)) || !(2 <= \old(p_dw_st)))) && (((((((((((1 == \old(c_dr_pc) || !(q_buf_0 == p_last_write)) || !(p_dw_i == 1)) || p_dw_pc == 2) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || !(\old(p_dw_st) == 0)) || p_dw_pc == 1) || !(0 == \old(c_num_read))) || (((((c_dr_pc == 1 && 0 == p_dw_st) && c_num_read == 0) && c_last_read == p_last_write) && 1 == q_free) && c_dr_st == 2)) || !(0 == p_num_write)) || !(\old(c_last_read) == p_last_write)) - InvariantResult [Line: 213]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 95]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(0 == p_dw_st) && !(2 == p_dw_st)) && c_dr_st == 2) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write) || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || \old(p_dw_st) == 0) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || c_dr_st == 2) || \old(p_dw_st) == 2)) && ((\old(p_dw_st) == 0 || (((((!(2 == p_dw_st) && c_dr_st == 2) && p_last_write == q_buf_0) && p_num_write == \old(p_num_write)) && !(0 == p_dw_st)) && \old(p_dw_pc) == p_dw_pc)) || (((!(c_num_read <= \old(p_num_write)) || ((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || !(1 == c_dr_pc)) || !(\old(p_dw_pc) == 1)) || !(2 == \old(c_dr_st))) || \old(p_dw_st) == 2) || !(\old(p_num_write) <= c_num_read))) && (((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || c_dr_st == 2) || !(2 == \old(c_dr_st))) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || !(c_last_read == \old(p_last_write)))) && ((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || !(\old(p_dw_pc) == 1)) || 0 == \old(c_dr_st)) || (((!(2 == p_dw_st) && !(c_dr_st == 0)) && p_last_write == q_buf_0) && 1 == p_dw_pc)) || \old(p_dw_st) == 2)) && (((((((((((!(\old(q_buf_0) == \old(p_last_write)) || !(p_dw_i == 1)) || \old(p_dw_pc) == 2) || !(\old(q_free) == 1)) || !(0 == \old(p_num_write))) || ((((!(0 == p_dw_st) && !(2 == p_dw_st)) && \old(p_dw_pc) == p_dw_pc) && p_last_write == q_buf_0) && 0 == p_num_write)) || \old(p_dw_st) == 0) || 1 == c_dr_pc) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(0 == c_num_read)) || !(c_last_read == \old(p_last_write)))) && ((((((((1 == c_dr_pc || !(\old(q_buf_0) == \old(p_last_write))) || !(p_dw_i == 1)) || (((!(p_dw_pc == 1) && !(2 == p_dw_st)) && !(c_dr_st == 0)) && p_last_write == q_buf_0)) || 0 == \old(c_dr_st)) || !(\old(q_free) == 1)) || \old(p_dw_st) == 2) || \old(p_dw_pc) == 1) || !(c_last_read == \old(p_last_write))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 107 locations, 1 error locations. SAFE Result, 33.9s OverallTime, 12 OverallIterations, 3 TraceHistogramMax, 4.9s AutomataDifference, 0.0s DeadEndRemovalTime, 25.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2259 SDtfs, 3569 SDslu, 3234 SDs, 0 SdLazy, 2630 SolverSat, 1152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 377 SyntacticMatches, 6 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2512occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 534 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 45 LocationsWithAnnotation, 3323 PreInvPairs, 4585 NumberOfFragments, 10457 HoareAnnotationTreeSize, 3323 FomulaSimplifications, 90882 FormulaSimplificationTreeSizeReduction, 3.3s HoareSimplificationTime, 45 FomulaSimplificationsInter, 36822 FormulaSimplificationTreeSizeReductionInter, 21.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1311 NumberOfCodeBlocks, 1311 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1296 ConstructedInterpolants, 0 QuantifiedInterpolants, 239106 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1919 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 279/320 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...