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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:28:15,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:28:15,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:28:15,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:28:15,834 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:28:15,836 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:28:15,838 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:28:15,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:28:15,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:28:15,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:28:15,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:28:15,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:28:15,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:28:15,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:28:15,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:28:15,855 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:28:15,856 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:28:15,857 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:28:15,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:28:15,860 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:28:15,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:28:15,862 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:28:15,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:28:15,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:28:15,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:28:15,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:28:15,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:28:15,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:28:15,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:28:15,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:28:15,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:28:15,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:28:15,870 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:28:15,871 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:28:15,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:28:15,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:28:15,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:28:15,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:28:15,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:28:15,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:28:15,875 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:28:15,876 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-15 01:28:15,889 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:28:15,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:28:15,891 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:28:15,891 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:28:15,891 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:28:15,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:28:15,892 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:28:15,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:28:15,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:28:15,893 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:28:15,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:28:15,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:28:15,893 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:28:15,893 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:28:15,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:28:15,894 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:28:15,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:28:15,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:28:15,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:28:15,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:28:15,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:28:15,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:28:15,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:28:15,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:28:15,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:28:15,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:28:15,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:28:15,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:28:15,896 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:28:16,230 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:28:16,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:28:16,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:28:16,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:28:16,255 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:28:16,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2019-10-15 01:28:16,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a01448f/81b20485192446c1ad9b8c6faf771625/FLAG0af84abec [2019-10-15 01:28:16,766 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:28:16,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2019-10-15 01:28:16,777 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a01448f/81b20485192446c1ad9b8c6faf771625/FLAG0af84abec [2019-10-15 01:28:17,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9a01448f/81b20485192446c1ad9b8c6faf771625 [2019-10-15 01:28:17,176 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:28:17,177 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:28:17,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:17,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:28:17,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:28:17,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7e0ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17, skipping insertion in model container [2019-10-15 01:28:17,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,195 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:28:17,249 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:28:17,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:17,601 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:28:17,746 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:28:17,769 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:28:17,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17 WrapperNode [2019-10-15 01:28:17,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:28:17,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:28:17,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:28:17,771 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:28:17,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,790 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,818 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,821 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (1/1) ... [2019-10-15 01:28:17,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:28:17,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:28:17,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:28:17,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:28:17,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (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-15 01:28:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:28:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:28:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-10-15 01:28:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-10-15 01:28:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-10-15 01:28:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-10-15 01:28:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-10-15 01:28:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-10-15 01:28:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-10-15 01:28:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-10-15 01:28:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-10-15 01:28:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-10-15 01:28:17,893 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-10-15 01:28:17,894 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-10-15 01:28:17,895 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-10-15 01:28:17,895 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-10-15 01:28:17,897 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-10-15 01:28:17,897 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-10-15 01:28:17,897 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-10-15 01:28:17,897 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-10-15 01:28:17,898 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-10-15 01:28:17,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:28:17,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:28:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:28:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-10-15 01:28:17,900 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-10-15 01:28:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-10-15 01:28:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-10-15 01:28:17,901 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-10-15 01:28:17,902 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-10-15 01:28:17,903 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-10-15 01:28:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:28:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:28:17,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:28:18,453 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := ~a~0; [2019-10-15 01:28:18,453 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2019-10-15 01:28:18,464 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:28:18,465 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-15 01:28:18,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:18 BoogieIcfgContainer [2019-10-15 01:28:18,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:28:18,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:28:18,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:28:18,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:28:18,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:28:17" (1/3) ... [2019-10-15 01:28:18,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fe5a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:18, skipping insertion in model container [2019-10-15 01:28:18,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:28:17" (2/3) ... [2019-10-15 01:28:18,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fe5a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:28:18, skipping insertion in model container [2019-10-15 01:28:18,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:28:18" (3/3) ... [2019-10-15 01:28:18,484 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-10-15 01:28:18,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:28:18,515 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:28:18,528 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:28:18,564 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:28:18,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:28:18,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:28:18,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:28:18,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:28:18,566 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:28:18,566 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:28:18,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:28:18,602 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2019-10-15 01:28:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:18,620 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:18,621 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:18,623 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:18,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:18,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1427944937, now seen corresponding path program 1 times [2019-10-15 01:28:18,640 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:18,640 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130541663] [2019-10-15 01:28:18,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,641 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:18,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:19,005 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-15 01:28:19,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130541663] [2019-10-15 01:28:19,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:19,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:28:19,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102435106] [2019-10-15 01:28:19,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:28:19,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:19,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:28:19,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:28:19,032 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 5 states. [2019-10-15 01:28:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:19,974 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-10-15 01:28:19,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:19,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-10-15 01:28:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:19,997 INFO L225 Difference]: With dead ends: 442 [2019-10-15 01:28:19,997 INFO L226 Difference]: Without dead ends: 296 [2019-10-15 01:28:20,004 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-10-15 01:28:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-10-15 01:28:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-10-15 01:28:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 363 transitions. [2019-10-15 01:28:20,160 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 363 transitions. Word has length 78 [2019-10-15 01:28:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:20,160 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 363 transitions. [2019-10-15 01:28:20,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:28:20,161 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2019-10-15 01:28:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:20,165 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:20,166 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:20,166 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:20,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1440144215, now seen corresponding path program 1 times [2019-10-15 01:28:20,167 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:20,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427551737] [2019-10-15 01:28:20,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,167 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:20,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:20,347 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-15 01:28:20,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427551737] [2019-10-15 01:28:20,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:20,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:20,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206640273] [2019-10-15 01:28:20,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:20,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:20,354 INFO L87 Difference]: Start difference. First operand 271 states and 363 transitions. Second operand 6 states. [2019-10-15 01:28:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,446 INFO L93 Difference]: Finished difference Result 737 states and 1016 transitions. [2019-10-15 01:28:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:28:21,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-10-15 01:28:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,454 INFO L225 Difference]: With dead ends: 737 [2019-10-15 01:28:21,454 INFO L226 Difference]: Without dead ends: 493 [2019-10-15 01:28:21,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:28:21,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-10-15 01:28:21,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2019-10-15 01:28:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-15 01:28:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2019-10-15 01:28:21,529 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 78 [2019-10-15 01:28:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,529 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2019-10-15 01:28:21,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:21,530 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2019-10-15 01:28:21,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-10-15 01:28:21,533 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,534 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,534 INFO L82 PathProgramCache]: Analyzing trace with hash -53358805, now seen corresponding path program 1 times [2019-10-15 01:28:21,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229005862] [2019-10-15 01:28:21,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,535 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:21,636 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-15 01:28:21,637 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229005862] [2019-10-15 01:28:21,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:21,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:21,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536046527] [2019-10-15 01:28:21,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:21,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:21,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:21,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:21,639 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand 4 states. [2019-10-15 01:28:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:21,882 INFO L93 Difference]: Finished difference Result 1147 states and 1573 transitions. [2019-10-15 01:28:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:21,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-10-15 01:28:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:21,889 INFO L225 Difference]: With dead ends: 1147 [2019-10-15 01:28:21,889 INFO L226 Difference]: Without dead ends: 774 [2019-10-15 01:28:21,891 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:21,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-10-15 01:28:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 761. [2019-10-15 01:28:21,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-10-15 01:28:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1010 transitions. [2019-10-15 01:28:21,962 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1010 transitions. Word has length 78 [2019-10-15 01:28:21,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:21,964 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1010 transitions. [2019-10-15 01:28:21,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1010 transitions. [2019-10-15 01:28:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:28:21,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:21,973 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:21,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1828215755, now seen corresponding path program 1 times [2019-10-15 01:28:21,974 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:21,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777515229] [2019-10-15 01:28:21,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,974 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:21,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,059 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-15 01:28:22,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777515229] [2019-10-15 01:28:22,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:22,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178314] [2019-10-15 01:28:22,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:22,061 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:22,061 INFO L87 Difference]: Start difference. First operand 761 states and 1010 transitions. Second operand 6 states. [2019-10-15 01:28:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,165 INFO L93 Difference]: Finished difference Result 1519 states and 2030 transitions. [2019-10-15 01:28:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:22,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-10-15 01:28:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,172 INFO L225 Difference]: With dead ends: 1519 [2019-10-15 01:28:22,172 INFO L226 Difference]: Without dead ends: 801 [2019-10-15 01:28:22,175 INFO L600 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-15 01:28:22,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-10-15 01:28:22,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 781. [2019-10-15 01:28:22,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-10-15 01:28:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1028 transitions. [2019-10-15 01:28:22,228 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1028 transitions. Word has length 79 [2019-10-15 01:28:22,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,229 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1028 transitions. [2019-10-15 01:28:22,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1028 transitions. [2019-10-15 01:28:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-15 01:28:22,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,232 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1580069261, now seen corresponding path program 1 times [2019-10-15 01:28:22,232 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,233 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046006871] [2019-10-15 01:28:22,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,316 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-15 01:28:22,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046006871] [2019-10-15 01:28:22,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,317 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:28:22,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160995231] [2019-10-15 01:28:22,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:28:22,318 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:28:22,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:28:22,319 INFO L87 Difference]: Start difference. First operand 781 states and 1028 transitions. Second operand 4 states. [2019-10-15 01:28:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,558 INFO L93 Difference]: Finished difference Result 2202 states and 2963 transitions. [2019-10-15 01:28:22,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:28:22,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-10-15 01:28:22,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,564 INFO L225 Difference]: With dead ends: 2202 [2019-10-15 01:28:22,564 INFO L226 Difference]: Without dead ends: 751 [2019-10-15 01:28:22,570 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-15 01:28:22,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-10-15 01:28:22,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 711. [2019-10-15 01:28:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-15 01:28:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2019-10-15 01:28:22,619 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 79 [2019-10-15 01:28:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,619 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2019-10-15 01:28:22,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:28:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2019-10-15 01:28:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:28:22,622 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,622 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,624 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1122686250, now seen corresponding path program 1 times [2019-10-15 01:28:22,629 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751071125] [2019-10-15 01:28:22,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,734 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-15 01:28:22,734 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751071125] [2019-10-15 01:28:22,734 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,735 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:22,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822722412] [2019-10-15 01:28:22,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:22,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:22,736 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 6 states. [2019-10-15 01:28:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:22,803 INFO L93 Difference]: Finished difference Result 1421 states and 1856 transitions. [2019-10-15 01:28:22,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:28:22,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-15 01:28:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:22,808 INFO L225 Difference]: With dead ends: 1421 [2019-10-15 01:28:22,808 INFO L226 Difference]: Without dead ends: 753 [2019-10-15 01:28:22,811 INFO L600 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-15 01:28:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-10-15 01:28:22,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 741. [2019-10-15 01:28:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-10-15 01:28:22,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 953 transitions. [2019-10-15 01:28:22,858 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 953 transitions. Word has length 80 [2019-10-15 01:28:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:22,858 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 953 transitions. [2019-10-15 01:28:22,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 953 transitions. [2019-10-15 01:28:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:28:22,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:22,861 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:22,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:22,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1195072808, now seen corresponding path program 1 times [2019-10-15 01:28:22,861 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:22,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357563707] [2019-10-15 01:28:22,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,862 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:22,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:22,967 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-15 01:28:22,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357563707] [2019-10-15 01:28:22,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:22,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:28:22,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475438635] [2019-10-15 01:28:22,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:28:22,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:22,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:28:22,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:28:22,972 INFO L87 Difference]: Start difference. First operand 741 states and 953 transitions. Second operand 6 states. [2019-10-15 01:28:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:23,965 INFO L93 Difference]: Finished difference Result 1593 states and 2068 transitions. [2019-10-15 01:28:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:28:23,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-10-15 01:28:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:23,976 INFO L225 Difference]: With dead ends: 1593 [2019-10-15 01:28:23,976 INFO L226 Difference]: Without dead ends: 897 [2019-10-15 01:28:23,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:28:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-15 01:28:24,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 760. [2019-10-15 01:28:24,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-10-15 01:28:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 967 transitions. [2019-10-15 01:28:24,053 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 967 transitions. Word has length 80 [2019-10-15 01:28:24,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,054 INFO L462 AbstractCegarLoop]: Abstraction has 760 states and 967 transitions. [2019-10-15 01:28:24,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:28:24,054 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 967 transitions. [2019-10-15 01:28:24,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-15 01:28:24,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,057 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:24,058 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1704545898, now seen corresponding path program 1 times [2019-10-15 01:28:24,060 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057917336] [2019-10-15 01:28:24,060 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,061 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,141 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-15 01:28:24,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057917336] [2019-10-15 01:28:24,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:24,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281731467] [2019-10-15 01:28:24,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,145 INFO L87 Difference]: Start difference. First operand 760 states and 967 transitions. Second operand 3 states. [2019-10-15 01:28:24,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,309 INFO L93 Difference]: Finished difference Result 2116 states and 2780 transitions. [2019-10-15 01:28:24,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:24,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-10-15 01:28:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,320 INFO L225 Difference]: With dead ends: 2116 [2019-10-15 01:28:24,320 INFO L226 Difference]: Without dead ends: 1435 [2019-10-15 01:28:24,325 INFO L600 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-15 01:28:24,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-10-15 01:28:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1423. [2019-10-15 01:28:24,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-10-15 01:28:24,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1848 transitions. [2019-10-15 01:28:24,455 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1848 transitions. Word has length 80 [2019-10-15 01:28:24,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,456 INFO L462 AbstractCegarLoop]: Abstraction has 1423 states and 1848 transitions. [2019-10-15 01:28:24,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:24,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1848 transitions. [2019-10-15 01:28:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-10-15 01:28:24,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:28:24,460 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:28:24,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:28:24,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:28:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash 683659270, now seen corresponding path program 1 times [2019-10-15 01:28:24,461 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:28:24,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082869417] [2019-10-15 01:28:24,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,461 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:28:24,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:28:24,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:28:24,524 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-15 01:28:24,525 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082869417] [2019-10-15 01:28:24,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:28:24,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:28:24,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986884520] [2019-10-15 01:28:24,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:28:24,526 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:28:24,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:28:24,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:28:24,527 INFO L87 Difference]: Start difference. First operand 1423 states and 1848 transitions. Second operand 3 states. [2019-10-15 01:28:24,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:28:24,622 INFO L93 Difference]: Finished difference Result 2666 states and 3520 transitions. [2019-10-15 01:28:24,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:28:24,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-10-15 01:28:24,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:28:24,625 INFO L225 Difference]: With dead ends: 2666 [2019-10-15 01:28:24,625 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:28:24,634 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-15 01:28:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:28:24,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:28:24,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:28:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:28:24,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-10-15 01:28:24,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:28:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:28:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:28:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:28:24,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:28:24,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:28:26,878 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-10-15 01:28:27,135 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-10-15 01:28:27,394 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-10-15 01:28:27,851 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 11 [2019-10-15 01:28:28,027 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-10-15 01:28:28,487 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-10-15 01:28:28,752 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 20 [2019-10-15 01:28:28,977 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 13 [2019-10-15 01:28:29,316 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 11 [2019-10-15 01:28:29,570 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-10-15 01:28:29,920 WARN L191 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-10-15 01:28:30,140 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-10-15 01:28:30,264 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 13 [2019-10-15 01:28:30,438 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 9 [2019-10-15 01:28:30,670 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2019-10-15 01:28:30,854 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-10-15 01:28:31,071 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 21 [2019-10-15 01:28:31,307 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 19 [2019-10-15 01:28:31,311 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-10-15 01:28:31,311 INFO L443 ceAbstractionStarter]: For program point L383(line 383) no Hoare annotation was computed. [2019-10-15 01:28:31,311 INFO L443 ceAbstractionStarter]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2019-10-15 01:28:31,311 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-10-15 01:28:31,312 INFO L439 ceAbstractionStarter]: At program point L375(line 375) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,312 INFO L439 ceAbstractionStarter]: At program point L377-2(lines 377 381) the Hoare annotation is: (let ((.cse0 (= 2 ~c_dr_pc~0))) (and (or (= 1 ~c_dr_pc~0) (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) .cse0) (or (= 0 activate_threads_~tmp~1) (not (= ~q_read_ev~0 2)) (= ~p_dw_pc~0 1) .cse0))) [2019-10-15 01:28:31,312 INFO L443 ceAbstractionStarter]: For program point L375-1(line 375) no Hoare annotation was computed. [2019-10-15 01:28:31,313 INFO L439 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 369 393) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,313 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2019-10-15 01:28:31,313 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2019-10-15 01:28:31,313 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-10-15 01:28:31,313 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-10-15 01:28:31,313 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2019-10-15 01:28:31,314 INFO L446 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: true [2019-10-15 01:28:31,314 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2019-10-15 01:28:31,314 INFO L439 ceAbstractionStarter]: At program point update_fifo_qENTRY(lines 22 41) the Hoare annotation is: (or (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,314 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-10-15 01:28:31,314 INFO L443 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2019-10-15 01:28:31,314 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2019-10-15 01:28:31,315 INFO L443 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2019-10-15 01:28:31,315 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2019-10-15 01:28:31,315 INFO L443 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-10-15 01:28:31,315 INFO L439 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 315 332) the Hoare annotation is: (or (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,315 INFO L443 ceAbstractionStarter]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2019-10-15 01:28:31,316 INFO L443 ceAbstractionStarter]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2019-10-15 01:28:31,316 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2019-10-15 01:28:31,316 INFO L439 ceAbstractionStarter]: At program point init_threadsENTRY(lines 259 276) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) (= ~p_dw_pc~0 1) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,316 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-10-15 01:28:31,316 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 544 555) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,317 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2019-10-15 01:28:31,317 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2019-10-15 01:28:31,317 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-10-15 01:28:31,317 INFO L439 ceAbstractionStarter]: At program point L549(line 549) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,317 INFO L439 ceAbstractionStarter]: At program point L549-1(line 549) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (and (= ~q_write_ev~0 ~q_read_ev~0) (not (= ~c_dr_pc~0 1)) (= ~q_read_ev~0 2) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= 0 ~p_dw_st~0)) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,318 INFO L446 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: true [2019-10-15 01:28:31,318 INFO L439 ceAbstractionStarter]: At program point do_write_pENTRY(lines 135 183) the Hoare annotation is: (let ((.cse0 (= |old(~p_dw_pc~0)| 1)) (.cse1 (= 2 ~c_dr_pc~0))) (and (or (= 1 ~p_dw_pc~0) (not .cse0) .cse1) (or .cse0 (not (= ~p_dw_pc~0 1)) .cse1))) [2019-10-15 01:28:31,318 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-10-15 01:28:31,318 INFO L439 ceAbstractionStarter]: At program point L178(lines 135 183) the Hoare annotation is: (or (= 1 ~p_dw_pc~0) (= |old(~p_dw_pc~0)| 1) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,318 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-10-15 01:28:31,318 INFO L439 ceAbstractionStarter]: At program point L143(lines 138 182) the Hoare annotation is: (let ((.cse0 (= 2 ~c_dr_pc~0))) (and (or (= |old(~p_dw_pc~0)| 1) .cse0) (or (= 1 ~p_dw_pc~0) .cse0))) [2019-10-15 01:28:31,319 INFO L443 ceAbstractionStarter]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2019-10-15 01:28:31,319 INFO L446 ceAbstractionStarter]: At program point L154-1(lines 138 182) the Hoare annotation is: true [2019-10-15 01:28:31,319 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-10-15 01:28:31,319 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2019-10-15 01:28:31,319 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2019-10-15 01:28:31,319 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 130) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point L126-2(lines 110 134) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsENTRY(lines 110 134) no Hoare annotation was computed. [2019-10-15 01:28:31,320 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 122) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point L118-2(lines 118 122) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point L116-1(line 116) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 110 134) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2019-10-15 01:28:31,321 INFO L446 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: true [2019-10-15 01:28:31,321 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2019-10-15 01:28:31,322 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:28:31,322 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) [2019-10-15 01:28:31,322 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:31,322 INFO L439 ceAbstractionStarter]: At program point evalENTRY(lines 394 446) the Hoare annotation is: (let ((.cse7 (= ~c_dr_pc~0 1)) (.cse3 (= 1 |old(~c_dr_pc~0)|)) (.cse8 (= |old(~p_dw_pc~0)| 1))) (let ((.cse4 (not .cse8)) (.cse2 (= 1 ~p_dw_pc~0)) (.cse6 (not .cse3)) (.cse0 (not .cse7)) (.cse1 (not (= ~c_dr_pc~0 2))) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse5 (= 2 |old(~c_dr_pc~0)|))) (and (or (and .cse0 .cse1 .cse2) .cse3 .cse4 .cse5) (or .cse6 .cse4 (and .cse7 .cse2)) (or .cse3 (= 0 ~p_dw_st~0) (not (= |old(~p_dw_st~0)| 0)) .cse5) (or .cse6 .cse8 (and .cse9 .cse7)) (or .cse3 .cse8 (and .cse0 .cse1 .cse9) .cse5)))) [2019-10-15 01:28:31,322 INFO L439 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 2)) (= 2 |old(~c_dr_pc~0)|))) [2019-10-15 01:28:31,323 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-10-15 01:28:31,323 INFO L443 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-10-15 01:28:31,323 INFO L443 ceAbstractionStarter]: For program point L403(line 403) no Hoare annotation was computed. [2019-10-15 01:28:31,323 INFO L439 ceAbstractionStarter]: At program point L401(line 401) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 2)) (= 2 |old(~c_dr_pc~0)|))) [2019-10-15 01:28:31,323 INFO L439 ceAbstractionStarter]: At program point L432(line 432) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 2)) (= 2 |old(~c_dr_pc~0)|))) [2019-10-15 01:28:31,323 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-10-15 01:28:31,324 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2019-10-15 01:28:31,324 INFO L443 ceAbstractionStarter]: For program point L410(lines 400 440) no Hoare annotation was computed. [2019-10-15 01:28:31,324 INFO L439 ceAbstractionStarter]: At program point L441(lines 394 446) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 2)) (= 2 |old(~c_dr_pc~0)|))) [2019-10-15 01:28:31,324 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-10-15 01:28:31,324 INFO L439 ceAbstractionStarter]: At program point L425(lines 400 440) the Hoare annotation is: (and (or (not (= 1 |old(~c_dr_pc~0)|)) (= ~c_dr_pc~0 1)) (or (not (= ~c_dr_pc~0 2)) (= 2 |old(~c_dr_pc~0)|))) [2019-10-15 01:28:31,325 INFO L446 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: true [2019-10-15 01:28:31,325 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-10-15 01:28:31,325 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2019-10-15 01:28:31,325 INFO L446 ceAbstractionStarter]: At program point L453(line 453) the Hoare annotation is: true [2019-10-15 01:28:31,325 INFO L443 ceAbstractionStarter]: For program point L453-1(line 453) no Hoare annotation was computed. [2019-10-15 01:28:31,325 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2019-10-15 01:28:31,325 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L446 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-10-15 01:28:31,326 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2019-10-15 01:28:31,327 INFO L439 ceAbstractionStarter]: At program point L106(lines 84 108) the Hoare annotation is: (or (= 1 ~c_dr_pc~0) (= 0 is_do_read_c_triggered_~__retres1~1) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,327 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2019-10-15 01:28:31,327 INFO L439 ceAbstractionStarter]: At program point update_channelsENTRY(lines 244 258) the Hoare annotation is: (or (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,327 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2019-10-15 01:28:31,327 INFO L439 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,327 INFO L443 ceAbstractionStarter]: For program point L248(lines 244 258) no Hoare annotation was computed. [2019-10-15 01:28:31,328 INFO L439 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 297 314) the Hoare annotation is: (or (and (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (= 2 ~c_dr_pc~0)) [2019-10-15 01:28:31,328 INFO L443 ceAbstractionStarter]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2019-10-15 01:28:31,328 INFO L443 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-10-15 01:28:31,328 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2019-10-15 01:28:31,328 INFO L439 ceAbstractionStarter]: At program point L481-1(lines 478 518) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,328 INFO L439 ceAbstractionStarter]: At program point L477(line 477) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1))) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,329 INFO L439 ceAbstractionStarter]: At program point L475(line 475) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1))) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,329 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2019-10-15 01:28:31,329 INFO L439 ceAbstractionStarter]: At program point L504(line 504) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,329 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-10-15 01:28:31,329 INFO L439 ceAbstractionStarter]: At program point L500-1(lines 500 509) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,330 INFO L443 ceAbstractionStarter]: For program point L498(line 498) no Hoare annotation was computed. [2019-10-15 01:28:31,330 INFO L439 ceAbstractionStarter]: At program point L494(line 494) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,330 INFO L446 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-10-15 01:28:31,330 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-15 01:28:31,330 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-10-15 01:28:31,330 INFO L439 ceAbstractionStarter]: At program point start_simulationENTRY(lines 466 524) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,331 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-10-15 01:28:31,331 INFO L439 ceAbstractionStarter]: At program point L476(line 476) the Hoare annotation is: (or (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1))) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,331 INFO L439 ceAbstractionStarter]: At program point L474(line 474) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= 0 ~p_dw_st~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,331 INFO L439 ceAbstractionStarter]: At program point L474-1(line 474) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= 0 ~p_dw_st~0)) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,331 INFO L439 ceAbstractionStarter]: At program point L503(line 503) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,332 INFO L439 ceAbstractionStarter]: At program point L503-1(line 503) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,332 INFO L439 ceAbstractionStarter]: At program point L495(line 495) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,332 INFO L439 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,332 INFO L439 ceAbstractionStarter]: At program point L493-1(line 493) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,332 INFO L439 ceAbstractionStarter]: At program point L489(line 489) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,333 INFO L443 ceAbstractionStarter]: For program point L489-1(line 489) no Hoare annotation was computed. [2019-10-15 01:28:31,333 INFO L439 ceAbstractionStarter]: At program point L485(line 485) the Hoare annotation is: (or (not (= ~c_dr_pc~0 2)) (= 1 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| 2)) (not (= |old(~p_dw_st~0)| 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,333 INFO L443 ceAbstractionStarter]: For program point L485-1(line 485) no Hoare annotation was computed. [2019-10-15 01:28:31,333 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:28:31,333 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~q_write_ev~0 ~q_read_ev~0) (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= 0 ~p_dw_st~0)) [2019-10-15 01:28:31,333 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:28:31,333 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2019-10-15 01:28:31,334 INFO L439 ceAbstractionStarter]: At program point L77(lines 55 79) the Hoare annotation is: (or (not (= ~q_read_ev~0 2)) (= ~p_dw_pc~0 1) (= 2 ~c_dr_pc~0) (= is_do_write_p_triggered_~__retres1~0 0)) [2019-10-15 01:28:31,334 INFO L446 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L446 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: true [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-10-15 01:28:31,335 INFO L443 ceAbstractionStarter]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2019-10-15 01:28:31,336 INFO L439 ceAbstractionStarter]: At program point L238(lines 185 243) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (= ~c_dr_pc~0 1))) (and (or .cse0 (= 2 |old(~c_dr_pc~0)|) (and (= ~q_write_ev~0 ~q_read_ev~0) (= ~q_read_ev~0 2) (not (= ~p_dw_pc~0 1)) .cse1)) (or (not .cse0) .cse1))) [2019-10-15 01:28:31,336 INFO L439 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-10-15 01:28:31,336 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-10-15 01:28:31,336 INFO L439 ceAbstractionStarter]: At program point L234-1(lines 188 242) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (= ~c_dr_pc~0 1))) (and (or .cse0 (and (= ~q_write_ev~0 ~q_read_ev~0) (not .cse1) (= ~q_read_ev~0 2) (not (= ~p_dw_pc~0 1))) (= 2 |old(~c_dr_pc~0)|)) (or (not .cse0) .cse1))) [2019-10-15 01:28:31,336 INFO L439 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-10-15 01:28:31,336 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-10-15 01:28:31,336 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-10-15 01:28:31,337 INFO L439 ceAbstractionStarter]: At program point do_read_cENTRY(lines 185 243) the Hoare annotation is: (let ((.cse0 (= 1 |old(~c_dr_pc~0)|)) (.cse1 (= ~c_dr_pc~0 1))) (and (or .cse0 (= 2 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 2)) (not .cse1))) (or (not .cse0) .cse1))) [2019-10-15 01:28:31,337 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-10-15 01:28:31,337 INFO L439 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-10-15 01:28:31,337 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2019-10-15 01:28:31,337 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2019-10-15 01:28:31,337 INFO L439 ceAbstractionStarter]: At program point init_modelENTRY(lines 525 543) the Hoare annotation is: (or (= 1 |old(~c_dr_pc~0)|) (and (not (= ~c_dr_pc~0 1)) (not (= ~c_dr_pc~0 2)) (not (= ~p_dw_pc~0 1)) (= |old(~q_read_ev~0)| ~q_read_ev~0) (= ~q_write_ev~0 |old(~q_write_ev~0)|)) (not (= ~p_dw_st~0 0)) (= |old(~p_dw_pc~0)| 1) (= 2 |old(~c_dr_pc~0)|) (not (= |old(~q_read_ev~0)| |old(~q_write_ev~0)|))) [2019-10-15 01:28:31,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:28:31 BoogieIcfgContainer [2019-10-15 01:28:31,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:28:31,358 INFO L168 Benchmark]: Toolchain (without parser) took 14180.63 ms. Allocated memory was 136.3 MB in the beginning and 446.7 MB in the end (delta: 310.4 MB). Free memory was 101.0 MB in the beginning and 111.7 MB in the end (delta: -10.7 MB). Peak memory consumption was 299.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,359 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.95 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 175.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,360 INFO L168 Benchmark]: Boogie Preprocessor took 54.89 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 173.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,361 INFO L168 Benchmark]: RCFGBuilder took 640.38 ms. Allocated memory is still 199.8 MB. Free memory was 173.3 MB in the beginning and 137.9 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,362 INFO L168 Benchmark]: TraceAbstraction took 12888.08 ms. Allocated memory was 199.8 MB in the beginning and 446.7 MB in the end (delta: 246.9 MB). Free memory was 137.9 MB in the beginning and 111.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 273.1 MB. Max. memory is 7.1 GB. [2019-10-15 01:28:31,365 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.22 ms. Allocated memory is still 136.3 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 590.95 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 100.8 MB in the beginning and 175.7 MB in the end (delta: -74.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.89 ms. Allocated memory is still 199.8 MB. Free memory was 175.7 MB in the beginning and 173.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 640.38 ms. Allocated memory is still 199.8 MB. Free memory was 173.3 MB in the beginning and 137.9 MB in the end (delta: 35.4 MB). Peak memory consumption was 35.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12888.08 ms. Allocated memory was 199.8 MB in the beginning and 446.7 MB in the end (delta: 246.9 MB). Free memory was 137.9 MB in the beginning and 111.7 MB in the end (delta: 26.2 MB). Peak memory consumption was 273.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: 466]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: 2 == \old(c_dr_pc) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((!(q_read_ev == 2) || p_dw_pc == 1) || 2 == c_dr_pc) || __retres1 == 0 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (!(1 == \old(c_dr_pc)) || c_dr_pc == 1) && (!(c_dr_pc == 2) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: (1 == p_dw_pc || \old(p_dw_pc) == 1) || 2 == c_dr_pc - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: ((1 == \old(c_dr_pc) || (((q_write_ev == q_read_ev && !(c_dr_pc == 1)) && q_read_ev == 2) && !(p_dw_pc == 1))) || 2 == \old(c_dr_pc)) && (!(1 == \old(c_dr_pc)) || c_dr_pc == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (\old(p_dw_pc) == 1 || 2 == c_dr_pc) && (1 == p_dw_pc || 2 == c_dr_pc) - InvariantResult [Line: 478]: Loop Invariant Derived loop invariant: (((((!(c_dr_pc == 2) || 1 == \old(c_dr_pc)) || !(\old(q_read_ev) == 2)) || !(\old(p_dw_st) == 0)) || \old(p_dw_pc) == 1) || 2 == \old(c_dr_pc)) || !(\old(q_read_ev) == \old(q_write_ev)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: (!(1 == \old(c_dr_pc)) || c_dr_pc == 1) && (!(c_dr_pc == 2) || 2 == \old(c_dr_pc)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (1 == c_dr_pc || 0 == __retres1) || 2 == c_dr_pc - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: ((1 == \old(c_dr_pc) || 2 == \old(c_dr_pc)) || (((q_write_ev == q_read_ev && q_read_ev == 2) && !(p_dw_pc == 1)) && c_dr_pc == 1)) && (!(1 == \old(c_dr_pc)) || c_dr_pc == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 158 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.6s, HoareTripleCheckerStatistics: 2052 SDtfs, 2196 SDslu, 2586 SDs, 0 SdLazy, 2171 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1423occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 2670 PreInvPairs, 3769 NumberOfFragments, 1188 HoareAnnotationTreeSize, 2670 FomulaSimplifications, 18531 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 63 FomulaSimplificationsInter, 29390 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 704 ConstructedInterpolants, 0 QuantifiedInterpolants, 82582 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...