java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:40:06,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:40:06,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:40:06,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:40:06,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:40:06,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:40:06,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:40:06,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:40:06,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:40:06,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:40:06,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:40:06,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:40:06,267 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:40:06,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:40:06,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:40:06,274 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:40:06,275 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:40:06,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:40:06,280 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:40:06,286 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:40:06,290 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:40:06,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:40:06,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:40:06,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:40:06,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:40:06,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:40:06,295 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:40:06,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:40:06,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:40:06,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:40:06,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:40:06,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:40:06,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:40:06,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:40:06,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:40:06,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:40:06,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:40:06,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:40:06,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:40:06,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:40:06,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:40:06,304 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-09-16 16:40:06,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:40:06,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:40:06,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:40:06,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:40:06,320 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:40:06,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:40:06,321 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:40:06,321 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:40:06,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:40:06,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:40:06,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:40:06,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:40:06,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:40:06,322 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:40:06,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:40:06,322 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:40:06,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:40:06,323 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:40:06,323 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:40:06,323 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:40:06,323 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:40:06,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:40:06,324 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:40:06,324 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:40:06,324 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:40:06,324 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:40:06,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:40:06,325 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:40:06,325 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:40:06,353 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:40:06,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:40:06,373 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:40:06,374 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:40:06,374 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:40:06,375 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-09-16 16:40:06,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3d10486/dba0a6ca21504198b24461010144da5d/FLAGc724e3a3a [2019-09-16 16:40:06,941 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:40:06,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2019-09-16 16:40:06,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3d10486/dba0a6ca21504198b24461010144da5d/FLAGc724e3a3a [2019-09-16 16:40:07,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad3d10486/dba0a6ca21504198b24461010144da5d [2019-09-16 16:40:07,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:40:07,293 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:40:07,294 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:07,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:40:07,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:40:07,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ddc21c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07, skipping insertion in model container [2019-09-16 16:40:07,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,311 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:40:07,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:40:07,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:07,635 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:40:07,775 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:40:07,799 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:40:07,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07 WrapperNode [2019-09-16 16:40:07,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:40:07,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:40:07,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:40:07,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:40:07,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,821 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,822 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (1/1) ... [2019-09-16 16:40:07,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:40:07,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:40:07,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:40:07,864 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:40:07,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (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-09-16 16:40:07,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:40:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:40:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-09-16 16:40:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2019-09-16 16:40:07,917 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2019-09-16 16:40:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2019-09-16 16:40:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2019-09-16 16:40:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2019-09-16 16:40:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2019-09-16 16:40:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-09-16 16:40:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-09-16 16:40:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-09-16 16:40:07,919 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-09-16 16:40:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-09-16 16:40:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-09-16 16:40:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-09-16 16:40:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-09-16 16:40:07,920 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-09-16 16:40:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-09-16 16:40:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-09-16 16:40:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-09-16 16:40:07,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:40:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:40:07,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 16:40:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-09-16 16:40:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2019-09-16 16:40:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2019-09-16 16:40:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2019-09-16 16:40:07,922 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-09-16 16:40:07,923 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-09-16 16:40:07,924 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-09-16 16:40:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-09-16 16:40:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:40:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:40:07,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:40:08,511 INFO L683 $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-09-16 16:40:08,511 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2019-09-16 16:40:08,534 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:40:08,534 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-16 16:40:08,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:08 BoogieIcfgContainer [2019-09-16 16:40:08,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:40:08,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:40:08,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:40:08,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:40:08,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:40:07" (1/3) ... [2019-09-16 16:40:08,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26777ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:08, skipping insertion in model container [2019-09-16 16:40:08,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:40:07" (2/3) ... [2019-09-16 16:40:08,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26777ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:40:08, skipping insertion in model container [2019-09-16 16:40:08,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:40:08" (3/3) ... [2019-09-16 16:40:08,545 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2019-09-16 16:40:08,555 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:40:08,568 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:40:08,586 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:40:08,623 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:40:08,623 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:40:08,624 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:40:08,624 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:40:08,624 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:40:08,624 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:40:08,624 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:40:08,625 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:40:08,625 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:40:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2019-09-16 16:40:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:08,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:08,660 INFO L407 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-09-16 16:40:08,663 INFO L418 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:08,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1427944937, now seen corresponding path program 1 times [2019-09-16 16:40:08,671 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:08,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:08,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:08,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:08,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:09,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:09,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:40:09,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:40:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:40:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:40:09,136 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 5 states. [2019-09-16 16:40:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:10,183 INFO L93 Difference]: Finished difference Result 442 states and 645 transitions. [2019-09-16 16:40:10,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:10,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2019-09-16 16:40:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:10,217 INFO L225 Difference]: With dead ends: 442 [2019-09-16 16:40:10,217 INFO L226 Difference]: Without dead ends: 296 [2019-09-16 16:40:10,223 INFO L636 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-09-16 16:40:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-16 16:40:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 271. [2019-09-16 16:40:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-09-16 16:40:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 363 transitions. [2019-09-16 16:40:10,324 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 363 transitions. Word has length 78 [2019-09-16 16:40:10,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:10,324 INFO L475 AbstractCegarLoop]: Abstraction has 271 states and 363 transitions. [2019-09-16 16:40:10,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:40:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 363 transitions. [2019-09-16 16:40:10,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:10,331 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:10,331 INFO L407 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-09-16 16:40:10,331 INFO L418 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:10,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:10,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1440144215, now seen corresponding path program 1 times [2019-09-16 16:40:10,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:10,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:10,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:10,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:10,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:10,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:10,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:10,483 INFO L87 Difference]: Start difference. First operand 271 states and 363 transitions. Second operand 6 states. [2019-09-16 16:40:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:11,502 INFO L93 Difference]: Finished difference Result 737 states and 1016 transitions. [2019-09-16 16:40:11,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:40:11,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2019-09-16 16:40:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:11,508 INFO L225 Difference]: With dead ends: 737 [2019-09-16 16:40:11,509 INFO L226 Difference]: Without dead ends: 493 [2019-09-16 16:40:11,511 INFO L636 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-09-16 16:40:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2019-09-16 16:40:11,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2019-09-16 16:40:11,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-09-16 16:40:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 562 transitions. [2019-09-16 16:40:11,581 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 562 transitions. Word has length 78 [2019-09-16 16:40:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:11,581 INFO L475 AbstractCegarLoop]: Abstraction has 416 states and 562 transitions. [2019-09-16 16:40:11,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 562 transitions. [2019-09-16 16:40:11,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-16 16:40:11,587 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:11,587 INFO L407 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-09-16 16:40:11,587 INFO L418 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:11,588 INFO L82 PathProgramCache]: Analyzing trace with hash -53358805, now seen corresponding path program 1 times [2019-09-16 16:40:11,588 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:11,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:11,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:11,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:11,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:11,698 INFO L87 Difference]: Start difference. First operand 416 states and 562 transitions. Second operand 4 states. [2019-09-16 16:40:11,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:11,987 INFO L93 Difference]: Finished difference Result 1147 states and 1573 transitions. [2019-09-16 16:40:11,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:11,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-09-16 16:40:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:11,999 INFO L225 Difference]: With dead ends: 1147 [2019-09-16 16:40:11,999 INFO L226 Difference]: Without dead ends: 774 [2019-09-16 16:40:12,002 INFO L636 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-09-16 16:40:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2019-09-16 16:40:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 761. [2019-09-16 16:40:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-16 16:40:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1010 transitions. [2019-09-16 16:40:12,098 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1010 transitions. Word has length 78 [2019-09-16 16:40:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:12,101 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1010 transitions. [2019-09-16 16:40:12,101 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1010 transitions. [2019-09-16 16:40:12,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 16:40:12,111 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:12,112 INFO L407 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-09-16 16:40:12,112 INFO L418 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:12,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1828215755, now seen corresponding path program 1 times [2019-09-16 16:40:12,113 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:12,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:12,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:12,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:12,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:12,245 INFO L87 Difference]: Start difference. First operand 761 states and 1010 transitions. Second operand 6 states. [2019-09-16 16:40:12,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:12,324 INFO L93 Difference]: Finished difference Result 1519 states and 2030 transitions. [2019-09-16 16:40:12,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:12,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-09-16 16:40:12,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:12,331 INFO L225 Difference]: With dead ends: 1519 [2019-09-16 16:40:12,331 INFO L226 Difference]: Without dead ends: 801 [2019-09-16 16:40:12,334 INFO L636 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-09-16 16:40:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2019-09-16 16:40:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 781. [2019-09-16 16:40:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-09-16 16:40:12,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1028 transitions. [2019-09-16 16:40:12,384 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1028 transitions. Word has length 79 [2019-09-16 16:40:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:12,385 INFO L475 AbstractCegarLoop]: Abstraction has 781 states and 1028 transitions. [2019-09-16 16:40:12,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1028 transitions. [2019-09-16 16:40:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-16 16:40:12,387 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:12,387 INFO L407 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-09-16 16:40:12,388 INFO L418 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:12,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1580069261, now seen corresponding path program 1 times [2019-09-16 16:40:12,388 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:12,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:12,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:12,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:12,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:12,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:12,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:40:12,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:40:12,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:40:12,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:40:12,449 INFO L87 Difference]: Start difference. First operand 781 states and 1028 transitions. Second operand 4 states. [2019-09-16 16:40:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:12,714 INFO L93 Difference]: Finished difference Result 2202 states and 2963 transitions. [2019-09-16 16:40:12,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:40:12,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-09-16 16:40:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:12,720 INFO L225 Difference]: With dead ends: 2202 [2019-09-16 16:40:12,721 INFO L226 Difference]: Without dead ends: 751 [2019-09-16 16:40:12,726 INFO L636 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-09-16 16:40:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-09-16 16:40:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 711. [2019-09-16 16:40:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-09-16 16:40:12,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 923 transitions. [2019-09-16 16:40:12,774 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 923 transitions. Word has length 79 [2019-09-16 16:40:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:12,774 INFO L475 AbstractCegarLoop]: Abstraction has 711 states and 923 transitions. [2019-09-16 16:40:12,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:40:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 923 transitions. [2019-09-16 16:40:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 16:40:12,776 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:12,776 INFO L407 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-09-16 16:40:12,777 INFO L418 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:12,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1122686250, now seen corresponding path program 1 times [2019-09-16 16:40:12,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:12,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:12,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:12,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:12,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:12,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:12,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:12,880 INFO L87 Difference]: Start difference. First operand 711 states and 923 transitions. Second operand 6 states. [2019-09-16 16:40:12,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:12,943 INFO L93 Difference]: Finished difference Result 1421 states and 1856 transitions. [2019-09-16 16:40:12,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:40:12,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-16 16:40:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:12,954 INFO L225 Difference]: With dead ends: 1421 [2019-09-16 16:40:12,955 INFO L226 Difference]: Without dead ends: 753 [2019-09-16 16:40:12,958 INFO L636 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-09-16 16:40:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-16 16:40:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 741. [2019-09-16 16:40:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-09-16 16:40:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 953 transitions. [2019-09-16 16:40:13,002 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 953 transitions. Word has length 80 [2019-09-16 16:40:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:13,004 INFO L475 AbstractCegarLoop]: Abstraction has 741 states and 953 transitions. [2019-09-16 16:40:13,004 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:13,005 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 953 transitions. [2019-09-16 16:40:13,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 16:40:13,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:13,009 INFO L407 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-09-16 16:40:13,010 INFO L418 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:13,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:13,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1195072808, now seen corresponding path program 1 times [2019-09-16 16:40:13,010 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:13,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:13,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:13,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:13,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:13,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:13,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:13,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 16:40:13,111 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:40:13,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:40:13,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:40:13,113 INFO L87 Difference]: Start difference. First operand 741 states and 953 transitions. Second operand 6 states. [2019-09-16 16:40:14,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:14,200 INFO L93 Difference]: Finished difference Result 1593 states and 2068 transitions. [2019-09-16 16:40:14,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:40:14,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-09-16 16:40:14,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:14,208 INFO L225 Difference]: With dead ends: 1593 [2019-09-16 16:40:14,208 INFO L226 Difference]: Without dead ends: 897 [2019-09-16 16:40:14,212 INFO L636 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-09-16 16:40:14,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-09-16 16:40:14,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 760. [2019-09-16 16:40:14,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2019-09-16 16:40:14,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 967 transitions. [2019-09-16 16:40:14,281 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 967 transitions. Word has length 80 [2019-09-16 16:40:14,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:14,282 INFO L475 AbstractCegarLoop]: Abstraction has 760 states and 967 transitions. [2019-09-16 16:40:14,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:40:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 967 transitions. [2019-09-16 16:40:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-16 16:40:14,284 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:14,284 INFO L407 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-09-16 16:40:14,285 INFO L418 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:14,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:14,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1704545898, now seen corresponding path program 1 times [2019-09-16 16:40:14,286 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:14,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:14,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:14,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:14,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:14,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:14,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:40:14,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:14,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:14,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:14,352 INFO L87 Difference]: Start difference. First operand 760 states and 967 transitions. Second operand 3 states. [2019-09-16 16:40:14,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:14,456 INFO L93 Difference]: Finished difference Result 2116 states and 2780 transitions. [2019-09-16 16:40:14,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:14,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-16 16:40:14,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:14,467 INFO L225 Difference]: With dead ends: 2116 [2019-09-16 16:40:14,467 INFO L226 Difference]: Without dead ends: 1435 [2019-09-16 16:40:14,471 INFO L636 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-09-16 16:40:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2019-09-16 16:40:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1423. [2019-09-16 16:40:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1423 states. [2019-09-16 16:40:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1848 transitions. [2019-09-16 16:40:14,573 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1848 transitions. Word has length 80 [2019-09-16 16:40:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:14,574 INFO L475 AbstractCegarLoop]: Abstraction has 1423 states and 1848 transitions. [2019-09-16 16:40:14,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:14,575 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1848 transitions. [2019-09-16 16:40:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-16 16:40:14,577 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:40:14,578 INFO L407 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-09-16 16:40:14,578 INFO L418 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:40:14,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:40:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 683659270, now seen corresponding path program 1 times [2019-09-16 16:40:14,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:40:14,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:40:14,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:14,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:40:14,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:40:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:40:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:40:14,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:40:14,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 16:40:14,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 16:40:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 16:40:14,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 16:40:14,629 INFO L87 Difference]: Start difference. First operand 1423 states and 1848 transitions. Second operand 3 states. [2019-09-16 16:40:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:40:14,711 INFO L93 Difference]: Finished difference Result 2666 states and 3520 transitions. [2019-09-16 16:40:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 16:40:14,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-16 16:40:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:40:14,715 INFO L225 Difference]: With dead ends: 2666 [2019-09-16 16:40:14,715 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 16:40:14,725 INFO L636 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-09-16 16:40:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 16:40:14,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 16:40:14,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 16:40:14,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 16:40:14,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2019-09-16 16:40:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:40:14,727 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 16:40:14,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 16:40:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 16:40:14,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 16:40:14,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-16 16:40:17,222 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-09-16 16:40:17,536 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-09-16 16:40:17,962 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 11 [2019-09-16 16:40:18,124 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-09-16 16:40:18,598 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-09-16 16:40:18,838 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 20 [2019-09-16 16:40:19,024 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 13 [2019-09-16 16:40:19,303 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 11 [2019-09-16 16:40:19,588 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-09-16 16:40:19,967 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 34 [2019-09-16 16:40:20,151 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 13 [2019-09-16 16:40:20,262 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 13 [2019-09-16 16:40:20,409 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 9 [2019-09-16 16:40:20,633 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 15 [2019-09-16 16:40:20,806 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2019-09-16 16:40:20,992 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 21 [2019-09-16 16:40:21,216 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 19 [2019-09-16 16:40:21,219 INFO L443 ceAbstractionStarter]: For program point L385(lines 385 389) no Hoare annotation was computed. [2019-09-16 16:40:21,219 INFO L443 ceAbstractionStarter]: For program point L383(line 383) no Hoare annotation was computed. [2019-09-16 16:40:21,219 INFO L443 ceAbstractionStarter]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2019-09-16 16:40:21,219 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2019-09-16 16:40:21,220 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-09-16 16:40:21,220 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-09-16 16:40:21,220 INFO L443 ceAbstractionStarter]: For program point L375-1(line 375) no Hoare annotation was computed. [2019-09-16 16:40:21,220 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-09-16 16:40:21,220 INFO L443 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2019-09-16 16:40:21,221 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2019-09-16 16:40:21,221 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 290) no Hoare annotation was computed. [2019-09-16 16:40:21,221 INFO L443 ceAbstractionStarter]: For program point L281(lines 281 291) no Hoare annotation was computed. [2019-09-16 16:40:21,221 INFO L446 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2019-09-16 16:40:21,221 INFO L446 ceAbstractionStarter]: At program point L293(lines 280 295) the Hoare annotation is: true [2019-09-16 16:40:21,221 INFO L443 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2019-09-16 16:40:21,221 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-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2019-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2019-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2019-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2019-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2019-09-16 16:40:21,222 INFO L443 ceAbstractionStarter]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2019-09-16 16:40:21,222 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-09-16 16:40:21,223 INFO L443 ceAbstractionStarter]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2019-09-16 16:40:21,223 INFO L443 ceAbstractionStarter]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2019-09-16 16:40:21,223 INFO L443 ceAbstractionStarter]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2019-09-16 16:40:21,223 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-09-16 16:40:21,223 INFO L443 ceAbstractionStarter]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2019-09-16 16:40:21,223 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-09-16 16:40:21,223 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2019-09-16 16:40:21,224 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2019-09-16 16:40:21,224 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-09-16 16:40:21,224 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-09-16 16:40:21,224 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-09-16 16:40:21,224 INFO L446 ceAbstractionStarter]: At program point L161(lines 138 182) the Hoare annotation is: true [2019-09-16 16:40:21,224 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-09-16 16:40:21,224 INFO L443 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2019-09-16 16:40:21,225 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-09-16 16:40:21,225 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 149) no Hoare annotation was computed. [2019-09-16 16:40:21,225 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-09-16 16:40:21,225 INFO L443 ceAbstractionStarter]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2019-09-16 16:40:21,225 INFO L446 ceAbstractionStarter]: At program point L154-1(lines 138 182) the Hoare annotation is: true [2019-09-16 16:40:21,225 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 150) no Hoare annotation was computed. [2019-09-16 16:40:21,225 INFO L443 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-09-16 16:40:21,225 INFO L443 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L446 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 130) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L126-2(lines 110 134) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsENTRY(lines 110 134) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 122) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2019-09-16 16:40:21,226 INFO L443 ceAbstractionStarter]: For program point L118-2(lines 118 122) no Hoare annotation was computed. [2019-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point L116-1(line 116) no Hoare annotation was computed. [2019-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point immediate_notify_threadsEXIT(lines 110 134) no Hoare annotation was computed. [2019-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2019-09-16 16:40:21,227 INFO L446 ceAbstractionStarter]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: true [2019-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2019-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:40:21,227 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-09-16 16:40:21,227 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:40:21,228 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-09-16 16:40:21,228 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-09-16 16:40:21,228 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 409) no Hoare annotation was computed. [2019-09-16 16:40:21,228 INFO L443 ceAbstractionStarter]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2019-09-16 16:40:21,228 INFO L443 ceAbstractionStarter]: For program point L403(line 403) no Hoare annotation was computed. [2019-09-16 16:40:21,228 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-09-16 16:40:21,229 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-09-16 16:40:21,229 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 421) no Hoare annotation was computed. [2019-09-16 16:40:21,229 INFO L443 ceAbstractionStarter]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2019-09-16 16:40:21,229 INFO L443 ceAbstractionStarter]: For program point L410(lines 400 440) no Hoare annotation was computed. [2019-09-16 16:40:21,229 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-09-16 16:40:21,229 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 436) no Hoare annotation was computed. [2019-09-16 16:40:21,229 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-09-16 16:40:21,229 INFO L446 ceAbstractionStarter]: At program point L462(lines 451 464) the Hoare annotation is: true [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point L455(lines 455 460) no Hoare annotation was computed. [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2019-09-16 16:40:21,230 INFO L446 ceAbstractionStarter]: At program point L453(line 453) the Hoare annotation is: true [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point L453-1(line 453) no Hoare annotation was computed. [2019-09-16 16:40:21,230 INFO L446 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point L96(lines 96 101) no Hoare annotation was computed. [2019-09-16 16:40:21,230 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2019-09-16 16:40:21,231 INFO L446 ceAbstractionStarter]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2019-09-16 16:40:21,231 INFO L443 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-09-16 16:40:21,231 INFO L443 ceAbstractionStarter]: For program point L85(lines 85 94) no Hoare annotation was computed. [2019-09-16 16:40:21,231 INFO L443 ceAbstractionStarter]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2019-09-16 16:40:21,231 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2019-09-16 16:40:21,231 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-09-16 16:40:21,231 INFO L443 ceAbstractionStarter]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2019-09-16 16:40:21,232 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-09-16 16:40:21,232 INFO L443 ceAbstractionStarter]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2019-09-16 16:40:21,232 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-09-16 16:40:21,232 INFO L443 ceAbstractionStarter]: For program point L248(lines 244 258) no Hoare annotation was computed. [2019-09-16 16:40:21,232 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-09-16 16:40:21,232 INFO L443 ceAbstractionStarter]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2019-09-16 16:40:21,232 INFO L443 ceAbstractionStarter]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2019-09-16 16:40:21,232 INFO L443 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2019-09-16 16:40:21,233 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-09-16 16:40:21,233 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-09-16 16:40:21,233 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-09-16 16:40:21,233 INFO L443 ceAbstractionStarter]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2019-09-16 16:40:21,233 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-09-16 16:40:21,233 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 509) no Hoare annotation was computed. [2019-09-16 16:40:21,233 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-09-16 16:40:21,234 INFO L443 ceAbstractionStarter]: For program point L498(line 498) no Hoare annotation was computed. [2019-09-16 16:40:21,234 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-09-16 16:40:21,234 INFO L446 ceAbstractionStarter]: At program point L519(lines 466 524) the Hoare annotation is: true [2019-09-16 16:40:21,234 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-09-16 16:40:21,234 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 517) no Hoare annotation was computed. [2019-09-16 16:40:21,234 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-09-16 16:40:21,234 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-09-16 16:40:21,234 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-09-16 16:40:21,235 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-09-16 16:40:21,235 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-09-16 16:40:21,235 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-09-16 16:40:21,235 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-09-16 16:40:21,235 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-09-16 16:40:21,235 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-09-16 16:40:21,236 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-09-16 16:40:21,236 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-09-16 16:40:21,236 INFO L443 ceAbstractionStarter]: For program point L489-1(line 489) no Hoare annotation was computed. [2019-09-16 16:40:21,236 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-09-16 16:40:21,236 INFO L443 ceAbstractionStarter]: For program point L485-1(line 485) no Hoare annotation was computed. [2019-09-16 16:40:21,236 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-16 16:40:21,237 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-09-16 16:40:21,237 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 62) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 65) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2019-09-16 16:40:21,237 INFO L443 ceAbstractionStarter]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2019-09-16 16:40:21,237 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-09-16 16:40:21,238 INFO L446 ceAbstractionStarter]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point L67(lines 67 72) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L446 ceAbstractionStarter]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: true [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 231) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 196) no Hoare annotation was computed. [2019-09-16 16:40:21,238 INFO L443 ceAbstractionStarter]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2019-09-16 16:40:21,239 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-09-16 16:40:21,239 INFO L439 ceAbstractionStarter]: At program point L234(line 234) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-09-16 16:40:21,239 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-09-16 16:40:21,239 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-09-16 16:40:21,239 INFO L439 ceAbstractionStarter]: At program point L193(lines 188 242) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-09-16 16:40:21,239 INFO L443 ceAbstractionStarter]: For program point L224(lines 224 236) no Hoare annotation was computed. [2019-09-16 16:40:21,239 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 197) no Hoare annotation was computed. [2019-09-16 16:40:21,240 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-09-16 16:40:21,240 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2019-09-16 16:40:21,240 INFO L439 ceAbstractionStarter]: At program point L229(line 229) the Hoare annotation is: (= 2 |old(~c_dr_pc~0)|) [2019-09-16 16:40:21,240 INFO L443 ceAbstractionStarter]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2019-09-16 16:40:21,240 INFO L443 ceAbstractionStarter]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2019-09-16 16:40:21,240 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-09-16 16:40:21,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 04:40:21 BoogieIcfgContainer [2019-09-16 16:40:21,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 16:40:21,261 INFO L168 Benchmark]: Toolchain (without parser) took 13967.61 ms. Allocated memory was 138.9 MB in the beginning and 432.5 MB in the end (delta: 293.6 MB). Free memory was 85.8 MB in the beginning and 139.7 MB in the end (delta: -53.9 MB). Peak memory consumption was 308.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,262 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,263 INFO L168 Benchmark]: CACSL2BoogieTranslator took 506.75 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 85.6 MB in the beginning and 173.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,264 INFO L168 Benchmark]: Boogie Preprocessor took 62.57 ms. Allocated memory is still 198.7 MB. Free memory was 173.5 MB in the beginning and 171.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,264 INFO L168 Benchmark]: RCFGBuilder took 672.80 ms. Allocated memory is still 198.7 MB. Free memory was 171.7 MB in the beginning and 136.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,265 INFO L168 Benchmark]: TraceAbstraction took 12721.28 ms. Allocated memory was 198.7 MB in the beginning and 432.5 MB in the end (delta: 233.8 MB). Free memory was 136.2 MB in the beginning and 139.7 MB in the end (delta: -3.5 MB). Peak memory consumption was 299.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:40:21,269 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.19 ms. Allocated memory is still 138.9 MB. Free memory was 104.9 MB in the beginning and 104.7 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 506.75 ms. Allocated memory was 138.9 MB in the beginning and 198.7 MB in the end (delta: 59.8 MB). Free memory was 85.6 MB in the beginning and 173.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.57 ms. Allocated memory is still 198.7 MB. Free memory was 173.5 MB in the beginning and 171.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 672.80 ms. Allocated memory is still 198.7 MB. Free memory was 171.7 MB in the beginning and 136.8 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12721.28 ms. Allocated memory was 198.7 MB in the beginning and 432.5 MB in the end (delta: 233.8 MB). Free memory was 136.2 MB in the beginning and 139.7 MB in the end (delta: -3.5 MB). Peak memory consumption was 299.4 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. SAFE Result, 12.6s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 4.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2053 SDtfs, 2196 SDslu, 2586 SDs, 0 SdLazy, 2175 SolverSat, 483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 336 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 2670 PreInvPairs, 3769 NumberOfFragments, 1188 HoareAnnotationTreeSize, 2670 FomulaSimplifications, 18531 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 63 FomulaSimplificationsInter, 29390 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...