/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic NUM_VARIABLES --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -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.25-d623d84 [2020-07-20 18:22:30,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 18:22:30,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 18:22:30,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 18:22:30,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 18:22:30,195 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 18:22:30,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 18:22:30,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 18:22:30,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 18:22:30,214 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 18:22:30,215 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 18:22:30,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 18:22:30,217 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 18:22:30,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 18:22:30,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 18:22:30,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 18:22:30,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 18:22:30,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 18:22:30,228 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 18:22:30,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 18:22:30,238 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 18:22:30,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 18:22:30,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 18:22:30,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 18:22:30,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 18:22:30,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 18:22:30,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 18:22:30,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 18:22:30,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 18:22:30,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 18:22:30,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 18:22:30,252 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 18:22:30,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 18:22:30,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 18:22:30,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 18:22:30,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 18:22:30,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 18:22:30,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 18:22:30,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 18:22:30,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 18:22:30,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 18:22:30,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-20 18:22:30,294 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 18:22:30,294 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 18:22:30,295 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 18:22:30,295 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 18:22:30,296 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 18:22:30,296 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 18:22:30,296 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 18:22:30,298 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 18:22:30,298 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 18:22:30,298 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 18:22:30,299 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 18:22:30,300 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 18:22:30,300 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 18:22:30,300 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 18:22:30,300 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 18:22:30,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 18:22:30,301 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 18:22:30,301 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 18:22:30,301 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 18:22:30,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 18:22:30,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 18:22:30,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:30,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 18:22:30,303 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 18:22:30,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> NUM_VARIABLES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-20 18:22:30,566 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 18:22:30,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 18:22:30,591 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 18:22:30,593 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 18:22:30,594 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 18:22:30,595 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2020-07-20 18:22:30,672 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044a94814/606d466080af4ac6947148ea53ba6b3a/FLAGf8f96b18e [2020-07-20 18:22:31,143 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 18:22:31,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2020-07-20 18:22:31,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044a94814/606d466080af4ac6947148ea53ba6b3a/FLAGf8f96b18e [2020-07-20 18:22:31,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/044a94814/606d466080af4ac6947148ea53ba6b3a [2020-07-20 18:22:31,495 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 18:22:31,497 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 18:22:31,498 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:31,499 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 18:22:31,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 18:22:31,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c380e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31, skipping insertion in model container [2020-07-20 18:22:31,506 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 18:22:31,549 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 18:22:31,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:31,746 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 18:22:31,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 18:22:31,895 INFO L208 MainTranslator]: Completed translation [2020-07-20 18:22:31,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31 WrapperNode [2020-07-20 18:22:31,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 18:22:31,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 18:22:31,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 18:22:31,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 18:22:31,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,937 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... [2020-07-20 18:22:31,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 18:22:31,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 18:22:31,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 18:22:31,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 18:22:31,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 18:22:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 18:22:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 18:22:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-20 18:22:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2020-07-20 18:22:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-20 18:22:32,004 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-20 18:22:32,005 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-20 18:22:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-20 18:22:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-20 18:22:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-20 18:22:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-20 18:22:32,006 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 18:22:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 18:22:32,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 18:22:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-20 18:22:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2020-07-20 18:22:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-20 18:22:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-20 18:22:32,007 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-20 18:22:32,008 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-20 18:22:32,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 18:22:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 18:22:32,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 18:22:32,549 INFO L728 $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; [2020-07-20 18:22:32,549 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2020-07-20 18:22:32,567 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 18:22:32,568 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-20 18:22:32,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:32 BoogieIcfgContainer [2020-07-20 18:22:32,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 18:22:32,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 18:22:32,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 18:22:32,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 18:22:32,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:22:31" (1/3) ... [2020-07-20 18:22:32,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761445a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:32, skipping insertion in model container [2020-07-20 18:22:32,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:22:31" (2/3) ... [2020-07-20 18:22:32,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761445a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:22:32, skipping insertion in model container [2020-07-20 18:22:32,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:22:32" (3/3) ... [2020-07-20 18:22:32,582 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2020-07-20 18:22:32,593 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-20 18:22:32,602 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-20 18:22:32,616 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-20 18:22:32,643 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 18:22:32,643 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 18:22:32,644 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-20 18:22:32,644 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 18:22:32,644 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 18:22:32,644 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 18:22:32,644 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 18:22:32,645 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 18:22:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2020-07-20 18:22:32,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-20 18:22:32,681 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:32,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:32,683 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:32,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:32,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1427944937, now seen corresponding path program 1 times [2020-07-20 18:22:32,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:32,698 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [90661611] [2020-07-20 18:22:32,699 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:32,899 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 18:22:32,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:32,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 18:22:32,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:33,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:33,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:33,005 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [90661611] [2020-07-20 18:22:33,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:33,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:33,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281257033] [2020-07-20 18:22:33,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:33,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:33,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:33,031 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 3 states. [2020-07-20 18:22:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:33,137 INFO L93 Difference]: Finished difference Result 397 states and 561 transitions. [2020-07-20 18:22:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:33,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-07-20 18:22:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:33,156 INFO L225 Difference]: With dead ends: 397 [2020-07-20 18:22:33,157 INFO L226 Difference]: Without dead ends: 254 [2020-07-20 18:22:33,162 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-07-20 18:22:33,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2020-07-20 18:22:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-20 18:22:33,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-07-20 18:22:33,264 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 78 [2020-07-20 18:22:33,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:33,264 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-07-20 18:22:33,265 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:33,265 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-07-20 18:22:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-20 18:22:33,269 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:33,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:33,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:33,478 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -221043853, now seen corresponding path program 1 times [2020-07-20 18:22:33,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:33,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589647934] [2020-07-20 18:22:33,481 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:33,625 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 18:22:33,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:33,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 18:22:33,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:33,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:33,665 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589647934] [2020-07-20 18:22:33,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:33,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:33,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104932923] [2020-07-20 18:22:33,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:33,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:33,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:33,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:33,669 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 3 states. [2020-07-20 18:22:33,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:33,729 INFO L93 Difference]: Finished difference Result 703 states and 946 transitions. [2020-07-20 18:22:33,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:33,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-07-20 18:22:33,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:33,736 INFO L225 Difference]: With dead ends: 703 [2020-07-20 18:22:33,737 INFO L226 Difference]: Without dead ends: 475 [2020-07-20 18:22:33,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2020-07-20 18:22:33,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 471. [2020-07-20 18:22:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2020-07-20 18:22:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 627 transitions. [2020-07-20 18:22:33,811 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 627 transitions. Word has length 79 [2020-07-20 18:22:33,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:33,812 INFO L479 AbstractCegarLoop]: Abstraction has 471 states and 627 transitions. [2020-07-20 18:22:33,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:33,812 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 627 transitions. [2020-07-20 18:22:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-20 18:22:33,818 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:33,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:34,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:34,034 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:34,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:34,035 INFO L82 PathProgramCache]: Analyzing trace with hash 988824594, now seen corresponding path program 1 times [2020-07-20 18:22:34,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:34,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [730419173] [2020-07-20 18:22:34,036 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:34,153 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:34,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:34,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:34,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:34,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:34,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:34,245 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [730419173] [2020-07-20 18:22:34,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:34,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:34,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86623419] [2020-07-20 18:22:34,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:34,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:34,248 INFO L87 Difference]: Start difference. First operand 471 states and 627 transitions. Second operand 5 states. [2020-07-20 18:22:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:34,981 INFO L93 Difference]: Finished difference Result 1479 states and 2043 transitions. [2020-07-20 18:22:34,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:34,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2020-07-20 18:22:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:34,990 INFO L225 Difference]: With dead ends: 1479 [2020-07-20 18:22:34,990 INFO L226 Difference]: Without dead ends: 1027 [2020-07-20 18:22:34,994 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2020-07-20 18:22:35,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 949. [2020-07-20 18:22:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2020-07-20 18:22:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1267 transitions. [2020-07-20 18:22:35,066 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1267 transitions. Word has length 80 [2020-07-20 18:22:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:35,067 INFO L479 AbstractCegarLoop]: Abstraction has 949 states and 1267 transitions. [2020-07-20 18:22:35,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1267 transitions. [2020-07-20 18:22:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-20 18:22:35,070 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:35,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:35,279 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:35,280 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:35,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1740268754, now seen corresponding path program 1 times [2020-07-20 18:22:35,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:35,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109213149] [2020-07-20 18:22:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:35,376 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:35,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:35,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:35,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:35,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:35,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:35,437 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109213149] [2020-07-20 18:22:35,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:35,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 18:22:35,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009506496] [2020-07-20 18:22:35,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:35,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 18:22:35,440 INFO L87 Difference]: Start difference. First operand 949 states and 1267 transitions. Second operand 5 states. [2020-07-20 18:22:36,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:36,068 INFO L93 Difference]: Finished difference Result 3025 states and 4225 transitions. [2020-07-20 18:22:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:36,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2020-07-20 18:22:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:36,085 INFO L225 Difference]: With dead ends: 3025 [2020-07-20 18:22:36,085 INFO L226 Difference]: Without dead ends: 2101 [2020-07-20 18:22:36,090 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2020-07-20 18:22:36,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 1941. [2020-07-20 18:22:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1941 states. [2020-07-20 18:22:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2609 transitions. [2020-07-20 18:22:36,253 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2609 transitions. Word has length 80 [2020-07-20 18:22:36,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:36,254 INFO L479 AbstractCegarLoop]: Abstraction has 1941 states and 2609 transitions. [2020-07-20 18:22:36,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2609 transitions. [2020-07-20 18:22:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-20 18:22:36,258 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:36,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:36,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:36,472 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:36,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash -734766062, now seen corresponding path program 1 times [2020-07-20 18:22:36,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:36,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1653259857] [2020-07-20 18:22:36,475 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:36,577 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:36,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:36,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:36,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:36,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:36,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:36,620 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1653259857] [2020-07-20 18:22:36,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:36,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:36,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928430255] [2020-07-20 18:22:36,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:36,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:36,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:36,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:36,623 INFO L87 Difference]: Start difference. First operand 1941 states and 2609 transitions. Second operand 6 states. [2020-07-20 18:22:36,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:36,748 INFO L93 Difference]: Finished difference Result 3961 states and 5351 transitions. [2020-07-20 18:22:36,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:36,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2020-07-20 18:22:36,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:36,762 INFO L225 Difference]: With dead ends: 3961 [2020-07-20 18:22:36,770 INFO L226 Difference]: Without dead ends: 2061 [2020-07-20 18:22:36,777 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2020-07-20 18:22:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 2001. [2020-07-20 18:22:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2020-07-20 18:22:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2665 transitions. [2020-07-20 18:22:36,897 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2665 transitions. Word has length 80 [2020-07-20 18:22:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:36,897 INFO L479 AbstractCegarLoop]: Abstraction has 2001 states and 2665 transitions. [2020-07-20 18:22:36,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2665 transitions. [2020-07-20 18:22:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-20 18:22:36,900 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:36,900 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:37,113 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:37,114 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1632159340, now seen corresponding path program 1 times [2020-07-20 18:22:37,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:37,116 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1805766823] [2020-07-20 18:22:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:37,293 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:37,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:37,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-20 18:22:37,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:37,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:37,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1805766823] [2020-07-20 18:22:37,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:37,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:37,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664417011] [2020-07-20 18:22:37,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:37,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:37,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:37,331 INFO L87 Difference]: Start difference. First operand 2001 states and 2665 transitions. Second operand 6 states. [2020-07-20 18:22:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:37,438 INFO L93 Difference]: Finished difference Result 4045 states and 5401 transitions. [2020-07-20 18:22:37,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 18:22:37,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2020-07-20 18:22:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:37,460 INFO L225 Difference]: With dead ends: 4045 [2020-07-20 18:22:37,461 INFO L226 Difference]: Without dead ends: 2085 [2020-07-20 18:22:37,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 18:22:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2020-07-20 18:22:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2061. [2020-07-20 18:22:37,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2020-07-20 18:22:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2721 transitions. [2020-07-20 18:22:37,582 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2721 transitions. Word has length 80 [2020-07-20 18:22:37,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:37,584 INFO L479 AbstractCegarLoop]: Abstraction has 2061 states and 2721 transitions. [2020-07-20 18:22:37,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2721 transitions. [2020-07-20 18:22:37,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-20 18:22:37,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:37,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:37,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:37,801 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:37,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:37,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1704545898, now seen corresponding path program 1 times [2020-07-20 18:22:37,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:37,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801194263] [2020-07-20 18:22:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:37,958 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:37,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:37,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:37,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:38,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:38,003 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801194263] [2020-07-20 18:22:38,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:38,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:38,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407143266] [2020-07-20 18:22:38,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:38,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:38,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:38,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:38,005 INFO L87 Difference]: Start difference. First operand 2061 states and 2721 transitions. Second operand 3 states. [2020-07-20 18:22:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:38,214 INFO L93 Difference]: Finished difference Result 5925 states and 7986 transitions. [2020-07-20 18:22:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:38,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-07-20 18:22:38,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:38,242 INFO L225 Difference]: With dead ends: 5925 [2020-07-20 18:22:38,242 INFO L226 Difference]: Without dead ends: 3909 [2020-07-20 18:22:38,251 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:38,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2020-07-20 18:22:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3905. [2020-07-20 18:22:38,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3905 states. [2020-07-20 18:22:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5208 transitions. [2020-07-20 18:22:38,456 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5208 transitions. Word has length 80 [2020-07-20 18:22:38,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:38,457 INFO L479 AbstractCegarLoop]: Abstraction has 3905 states and 5208 transitions. [2020-07-20 18:22:38,457 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5208 transitions. [2020-07-20 18:22:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-20 18:22:38,462 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:38,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:38,676 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:38,677 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:38,678 INFO L82 PathProgramCache]: Analyzing trace with hash 683659270, now seen corresponding path program 1 times [2020-07-20 18:22:38,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:38,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1060252992] [2020-07-20 18:22:38,679 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:38,783 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-20 18:22:38,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:38,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:38,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:38,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:38,812 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1060252992] [2020-07-20 18:22:38,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:38,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:38,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766601301] [2020-07-20 18:22:38,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:38,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:38,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:38,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:38,814 INFO L87 Difference]: Start difference. First operand 3905 states and 5208 transitions. Second operand 3 states. [2020-07-20 18:22:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:39,135 INFO L93 Difference]: Finished difference Result 11205 states and 15235 transitions. [2020-07-20 18:22:39,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:39,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-07-20 18:22:39,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:39,189 INFO L225 Difference]: With dead ends: 11205 [2020-07-20 18:22:39,190 INFO L226 Difference]: Without dead ends: 7361 [2020-07-20 18:22:39,211 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2020-07-20 18:22:39,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 7297. [2020-07-20 18:22:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7297 states. [2020-07-20 18:22:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7297 states to 7297 states and 9732 transitions. [2020-07-20 18:22:39,606 INFO L78 Accepts]: Start accepts. Automaton has 7297 states and 9732 transitions. Word has length 81 [2020-07-20 18:22:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:39,606 INFO L479 AbstractCegarLoop]: Abstraction has 7297 states and 9732 transitions. [2020-07-20 18:22:39,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 7297 states and 9732 transitions. [2020-07-20 18:22:39,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-20 18:22:39,611 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:39,612 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:39,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:39,827 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 477155572, now seen corresponding path program 1 times [2020-07-20 18:22:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:39,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [783123154] [2020-07-20 18:22:39,828 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:39,912 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:39,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:39,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:39,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 18:22:40,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:40,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [783123154] [2020-07-20 18:22:40,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:40,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:40,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957438196] [2020-07-20 18:22:40,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:40,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:40,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:40,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:40,031 INFO L87 Difference]: Start difference. First operand 7297 states and 9732 transitions. Second operand 3 states. [2020-07-20 18:22:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:40,457 INFO L93 Difference]: Finished difference Result 21213 states and 28694 transitions. [2020-07-20 18:22:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:40,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-07-20 18:22:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:40,533 INFO L225 Difference]: With dead ends: 21213 [2020-07-20 18:22:40,533 INFO L226 Difference]: Without dead ends: 10713 [2020-07-20 18:22:40,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:40,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10713 states. [2020-07-20 18:22:41,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10713 to 10713. [2020-07-20 18:22:41,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10713 states. [2020-07-20 18:22:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10713 states to 10713 states and 14299 transitions. [2020-07-20 18:22:41,191 INFO L78 Accepts]: Start accepts. Automaton has 10713 states and 14299 transitions. Word has length 101 [2020-07-20 18:22:41,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:41,193 INFO L479 AbstractCegarLoop]: Abstraction has 10713 states and 14299 transitions. [2020-07-20 18:22:41,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:41,193 INFO L276 IsEmpty]: Start isEmpty. Operand 10713 states and 14299 transitions. [2020-07-20 18:22:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-07-20 18:22:41,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:41,224 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:41,438 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:41,439 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:41,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:41,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1264384807, now seen corresponding path program 1 times [2020-07-20 18:22:41,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:41,440 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [231028111] [2020-07-20 18:22:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:41,514 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:41,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:41,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:41,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:41,556 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-20 18:22:41,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:41,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [231028111] [2020-07-20 18:22:41,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:41,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:41,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588416022] [2020-07-20 18:22:41,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:41,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:41,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:41,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:41,560 INFO L87 Difference]: Start difference. First operand 10713 states and 14299 transitions. Second operand 3 states. [2020-07-20 18:22:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:42,147 INFO L93 Difference]: Finished difference Result 29537 states and 40166 transitions. [2020-07-20 18:22:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:42,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-07-20 18:22:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:42,248 INFO L225 Difference]: With dead ends: 29537 [2020-07-20 18:22:42,248 INFO L226 Difference]: Without dead ends: 18879 [2020-07-20 18:22:42,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18879 states. [2020-07-20 18:22:43,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18879 to 18735. [2020-07-20 18:22:43,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18735 states. [2020-07-20 18:22:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18735 states to 18735 states and 25079 transitions. [2020-07-20 18:22:43,183 INFO L78 Accepts]: Start accepts. Automaton has 18735 states and 25079 transitions. Word has length 185 [2020-07-20 18:22:43,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:43,184 INFO L479 AbstractCegarLoop]: Abstraction has 18735 states and 25079 transitions. [2020-07-20 18:22:43,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18735 states and 25079 transitions. [2020-07-20 18:22:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-07-20 18:22:43,217 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:43,217 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:43,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:43,431 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:43,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1114501609, now seen corresponding path program 1 times [2020-07-20 18:22:43,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:43,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520803256] [2020-07-20 18:22:43,434 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:43,537 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:43,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:43,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:44,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2020-07-20 18:22:44,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:44,259 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520803256] [2020-07-20 18:22:44,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:44,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:44,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242524349] [2020-07-20 18:22:44,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:44,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:44,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:44,261 INFO L87 Difference]: Start difference. First operand 18735 states and 25079 transitions. Second operand 3 states. [2020-07-20 18:22:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:44,750 INFO L93 Difference]: Finished difference Result 37416 states and 50077 transitions. [2020-07-20 18:22:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:44,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-07-20 18:22:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:44,835 INFO L225 Difference]: With dead ends: 37416 [2020-07-20 18:22:44,836 INFO L226 Difference]: Without dead ends: 18717 [2020-07-20 18:22:44,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18717 states. [2020-07-20 18:22:45,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18717 to 18717. [2020-07-20 18:22:45,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18717 states. [2020-07-20 18:22:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18717 states to 18717 states and 25046 transitions. [2020-07-20 18:22:45,802 INFO L78 Accepts]: Start accepts. Automaton has 18717 states and 25046 transitions. Word has length 185 [2020-07-20 18:22:45,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:45,803 INFO L479 AbstractCegarLoop]: Abstraction has 18717 states and 25046 transitions. [2020-07-20 18:22:45,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:45,803 INFO L276 IsEmpty]: Start isEmpty. Operand 18717 states and 25046 transitions. [2020-07-20 18:22:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-07-20 18:22:45,831 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:45,831 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:46,046 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:46,047 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:46,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash 544229803, now seen corresponding path program 1 times [2020-07-20 18:22:46,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:46,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1070522700] [2020-07-20 18:22:46,049 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:46,160 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-20 18:22:46,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:46,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-20 18:22:46,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-07-20 18:22:46,199 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:46,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1070522700] [2020-07-20 18:22:46,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:46,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:46,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277264930] [2020-07-20 18:22:46,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:46,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:46,202 INFO L87 Difference]: Start difference. First operand 18717 states and 25046 transitions. Second operand 3 states. [2020-07-20 18:22:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:46,667 INFO L93 Difference]: Finished difference Result 35929 states and 48451 transitions. [2020-07-20 18:22:46,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:46,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-07-20 18:22:46,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:46,745 INFO L225 Difference]: With dead ends: 35929 [2020-07-20 18:22:46,746 INFO L226 Difference]: Without dead ends: 18853 [2020-07-20 18:22:46,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:46,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states. [2020-07-20 18:22:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 18749. [2020-07-20 18:22:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18749 states. [2020-07-20 18:22:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 24833 transitions. [2020-07-20 18:22:47,757 INFO L78 Accepts]: Start accepts. Automaton has 18749 states and 24833 transitions. Word has length 185 [2020-07-20 18:22:47,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:47,758 INFO L479 AbstractCegarLoop]: Abstraction has 18749 states and 24833 transitions. [2020-07-20 18:22:47,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 18749 states and 24833 transitions. [2020-07-20 18:22:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-20 18:22:47,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:47,792 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:48,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:48,006 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:48,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1137748563, now seen corresponding path program 1 times [2020-07-20 18:22:48,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:48,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [500157098] [2020-07-20 18:22:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:48,080 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:48,080 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:48,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-20 18:22:48,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2020-07-20 18:22:48,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:48,116 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [500157098] [2020-07-20 18:22:48,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:48,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:48,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96304462] [2020-07-20 18:22:48,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:48,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:48,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:48,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:48,118 INFO L87 Difference]: Start difference. First operand 18749 states and 24833 transitions. Second operand 3 states. [2020-07-20 18:22:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:48,527 INFO L93 Difference]: Finished difference Result 37473 states and 50175 transitions. [2020-07-20 18:22:48,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:48,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-07-20 18:22:48,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:48,605 INFO L225 Difference]: With dead ends: 37473 [2020-07-20 18:22:48,605 INFO L226 Difference]: Without dead ends: 18753 [2020-07-20 18:22:48,648 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18753 states. [2020-07-20 18:22:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18753 to 18749. [2020-07-20 18:22:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18749 states. [2020-07-20 18:22:50,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 23953 transitions. [2020-07-20 18:22:50,095 INFO L78 Accepts]: Start accepts. Automaton has 18749 states and 23953 transitions. Word has length 194 [2020-07-20 18:22:50,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:50,096 INFO L479 AbstractCegarLoop]: Abstraction has 18749 states and 23953 transitions. [2020-07-20 18:22:50,096 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 18749 states and 23953 transitions. [2020-07-20 18:22:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-07-20 18:22:50,121 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:50,121 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:50,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:50,335 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:50,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:50,335 INFO L82 PathProgramCache]: Analyzing trace with hash 633321779, now seen corresponding path program 1 times [2020-07-20 18:22:50,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:50,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [918309106] [2020-07-20 18:22:50,336 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:50,472 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:50,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:50,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-20 18:22:50,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 84 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-20 18:22:50,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-20 18:22:50,689 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 18:22:50,692 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 18:22:50,702 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-20 18:22:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2020-07-20 18:22:50,762 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [918309106] [2020-07-20 18:22:50,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-20 18:22:50,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-07-20 18:22:50,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081297770] [2020-07-20 18:22:50,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 18:22:50,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:50,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 18:22:50,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:50,764 INFO L87 Difference]: Start difference. First operand 18749 states and 23953 transitions. Second operand 5 states. [2020-07-20 18:22:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:51,762 INFO L93 Difference]: Finished difference Result 45691 states and 58278 transitions. [2020-07-20 18:22:51,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 18:22:51,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2020-07-20 18:22:51,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:51,856 INFO L225 Difference]: With dead ends: 45691 [2020-07-20 18:22:51,856 INFO L226 Difference]: Without dead ends: 26969 [2020-07-20 18:22:51,888 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 385 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:51,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26969 states. [2020-07-20 18:22:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26969 to 24223. [2020-07-20 18:22:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24223 states. [2020-07-20 18:22:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24223 states to 24223 states and 30863 transitions. [2020-07-20 18:22:52,891 INFO L78 Accepts]: Start accepts. Automaton has 24223 states and 30863 transitions. Word has length 197 [2020-07-20 18:22:52,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:52,892 INFO L479 AbstractCegarLoop]: Abstraction has 24223 states and 30863 transitions. [2020-07-20 18:22:52,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 18:22:52,892 INFO L276 IsEmpty]: Start isEmpty. Operand 24223 states and 30863 transitions. [2020-07-20 18:22:52,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-20 18:22:52,905 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:52,906 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:53,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:53,120 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:53,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -523076207, now seen corresponding path program 1 times [2020-07-20 18:22:53,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:53,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535825619] [2020-07-20 18:22:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:53,194 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-20 18:22:53,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:53,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-20 18:22:53,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:53,253 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-07-20 18:22:53,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:53,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535825619] [2020-07-20 18:22:53,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:53,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 18:22:53,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597508461] [2020-07-20 18:22:53,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 18:22:53,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:53,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 18:22:53,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 18:22:53,255 INFO L87 Difference]: Start difference. First operand 24223 states and 30863 transitions. Second operand 6 states. [2020-07-20 18:22:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:53,835 INFO L93 Difference]: Finished difference Result 48823 states and 64014 transitions. [2020-07-20 18:22:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 18:22:53,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2020-07-20 18:22:53,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:53,928 INFO L225 Difference]: With dead ends: 48823 [2020-07-20 18:22:53,928 INFO L226 Difference]: Without dead ends: 24629 [2020-07-20 18:22:53,970 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-20 18:22:53,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24629 states. [2020-07-20 18:22:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24629 to 22263. [2020-07-20 18:22:55,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22263 states. [2020-07-20 18:22:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22263 states to 22263 states and 28345 transitions. [2020-07-20 18:22:55,856 INFO L78 Accepts]: Start accepts. Automaton has 22263 states and 28345 transitions. Word has length 211 [2020-07-20 18:22:55,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:55,857 INFO L479 AbstractCegarLoop]: Abstraction has 22263 states and 28345 transitions. [2020-07-20 18:22:55,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 18:22:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 22263 states and 28345 transitions. [2020-07-20 18:22:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-20 18:22:55,867 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:55,867 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:56,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:56,082 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:56,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1684278387, now seen corresponding path program 1 times [2020-07-20 18:22:56,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:56,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1045322615] [2020-07-20 18:22:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:56,216 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:56,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:56,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:56,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:56,253 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-07-20 18:22:56,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:56,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1045322615] [2020-07-20 18:22:56,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:56,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:56,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765896735] [2020-07-20 18:22:56,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:56,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:56,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:56,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:56,256 INFO L87 Difference]: Start difference. First operand 22263 states and 28345 transitions. Second operand 3 states. [2020-07-20 18:22:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:57,146 INFO L93 Difference]: Finished difference Result 60387 states and 79437 transitions. [2020-07-20 18:22:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:57,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2020-07-20 18:22:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:57,248 INFO L225 Difference]: With dead ends: 60387 [2020-07-20 18:22:57,248 INFO L226 Difference]: Without dead ends: 38509 [2020-07-20 18:22:57,296 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:57,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38509 states. [2020-07-20 18:22:58,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38509 to 37909. [2020-07-20 18:22:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37909 states. [2020-07-20 18:22:58,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37909 states to 37909 states and 48497 transitions. [2020-07-20 18:22:58,500 INFO L78 Accepts]: Start accepts. Automaton has 37909 states and 48497 transitions. Word has length 218 [2020-07-20 18:22:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:58,500 INFO L479 AbstractCegarLoop]: Abstraction has 37909 states and 48497 transitions. [2020-07-20 18:22:58,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 37909 states and 48497 transitions. [2020-07-20 18:22:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-07-20 18:22:58,718 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 18:22:58,718 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 18:22:58,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:58,919 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 18:22:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 18:22:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -54066853, now seen corresponding path program 1 times [2020-07-20 18:22:58,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-20 18:22:58,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443442096] [2020-07-20 18:22:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:22:59,058 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-20 18:22:59,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 18:22:59,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 864 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-20 18:22:59,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 18:22:59,104 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-07-20 18:22:59,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-20 18:22:59,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443442096] [2020-07-20 18:22:59,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 18:22:59,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 18:22:59,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131552735] [2020-07-20 18:22:59,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 18:22:59,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-20 18:22:59,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 18:22:59,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:59,113 INFO L87 Difference]: Start difference. First operand 37909 states and 48497 transitions. Second operand 3 states. [2020-07-20 18:22:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 18:22:59,746 INFO L93 Difference]: Finished difference Result 55742 states and 72193 transitions. [2020-07-20 18:22:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 18:22:59,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2020-07-20 18:22:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 18:22:59,758 INFO L225 Difference]: With dead ends: 55742 [2020-07-20 18:22:59,758 INFO L226 Difference]: Without dead ends: 0 [2020-07-20 18:22:59,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 18:22:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-20 18:22:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-20 18:22:59,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-20 18:22:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-20 18:22:59,878 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2020-07-20 18:22:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 18:22:59,879 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-20 18:22:59,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 18:22:59,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-20 18:22:59,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-20 18:23:00,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 18:23:00,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-20 18:23:01,584 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 674 DAG size of output: 114 [2020-07-20 18:23:02,707 WARN L193 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2020-07-20 18:23:04,166 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 674 DAG size of output: 114 [2020-07-20 18:23:06,752 WARN L193 SmtUtils]: Spent 961.00 ms on a formula simplification. DAG size of input: 752 DAG size of output: 140 [2020-07-20 18:23:13,485 WARN L193 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 752 DAG size of output: 140 [2020-07-20 18:23:22,103 WARN L193 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 752 DAG size of output: 140 [2020-07-20 18:23:23,150 WARN L193 SmtUtils]: Spent 564.00 ms on a formula simplification. DAG size of input: 752 DAG size of output: 140 [2020-07-20 18:23:27,113 WARN L193 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 672 DAG size of output: 114 [2020-07-20 18:23:27,661 WARN L193 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 752 DAG size of output: 140 [2020-07-20 18:23:28,518 WARN L193 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-07-20 18:23:28,775 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-07-20 18:23:41,101 WARN L193 SmtUtils]: Spent 12.26 s on a formula simplification. DAG size of input: 725 DAG size of output: 98 [2020-07-20 18:23:41,563 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-07-20 18:23:41,691 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2020-07-20 18:23:41,851 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 1 [2020-07-20 18:23:47,512 WARN L193 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 478 DAG size of output: 77 [2020-07-20 18:23:48,643 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 206 DAG size of output: 43 [2020-07-20 18:23:49,174 WARN L193 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2020-07-20 18:23:49,325 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 1 [2020-07-20 18:23:52,692 WARN L193 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 608 DAG size of output: 59 [2020-07-20 18:23:55,843 WARN L193 SmtUtils]: Spent 3.04 s on a formula simplification. DAG size of input: 607 DAG size of output: 54 [2020-07-20 18:23:55,981 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 1 [2020-07-20 18:23:59,088 WARN L193 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 607 DAG size of output: 54 [2020-07-20 18:24:00,186 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 206 DAG size of output: 43 [2020-07-20 18:24:03,493 WARN L193 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 608 DAG size of output: 59 [2020-07-20 18:24:11,831 WARN L193 SmtUtils]: Spent 8.31 s on a formula simplification. DAG size of input: 1041 DAG size of output: 54 [2020-07-20 18:24:12,994 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 333 DAG size of output: 54 [2020-07-20 18:24:16,131 WARN L193 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 607 DAG size of output: 54 [2020-07-20 18:24:17,225 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 206 DAG size of output: 43 [2020-07-20 18:24:18,648 WARN L193 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 376 DAG size of output: 52 [2020-07-20 18:24:19,179 WARN L193 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2020-07-20 18:24:24,011 WARN L193 SmtUtils]: Spent 4.81 s on a formula simplification. DAG size of input: 583 DAG size of output: 86 [2020-07-20 18:24:25,847 WARN L193 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 428 DAG size of output: 49 [2020-07-20 18:24:27,949 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 278 DAG size of output: 49 [2020-07-20 18:24:30,996 WARN L193 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 607 DAG size of output: 54 [2020-07-20 18:24:31,140 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 1 [2020-07-20 18:24:43,387 WARN L193 SmtUtils]: Spent 12.22 s on a formula simplification. DAG size of input: 725 DAG size of output: 98 [2020-07-20 18:24:45,777 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 404 DAG size of output: 38 [2020-07-20 18:24:45,959 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 603 DAG size of output: 1 [2020-07-20 18:24:51,259 WARN L193 SmtUtils]: Spent 5.27 s on a formula simplification. DAG size of input: 1111 DAG size of output: 1 [2020-07-20 18:24:55,329 WARN L193 SmtUtils]: Spent 3.96 s on a formula simplification. DAG size of input: 617 DAG size of output: 87 [2020-07-20 18:24:56,412 WARN L193 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 296 DAG size of output: 43 [2020-07-20 18:25:10,280 WARN L193 SmtUtils]: Spent 13.84 s on a formula simplification. DAG size of input: 717 DAG size of output: 99 [2020-07-20 18:25:17,188 WARN L193 SmtUtils]: Spent 6.88 s on a formula simplification. DAG size of input: 803 DAG size of output: 62 [2020-07-20 18:25:17,405 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2020-07-20 18:25:19,639 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 332 DAG size of output: 51 [2020-07-20 18:25:20,215 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2020-07-20 18:25:21,590 WARN L193 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 377 DAG size of output: 55 [2020-07-20 18:25:22,130 WARN L193 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2020-07-20 18:25:22,674 WARN L193 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 37 [2020-07-20 18:25:25,745 WARN L193 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 607 DAG size of output: 54 [2020-07-20 18:25:28,473 WARN L193 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 605 DAG size of output: 43 [2020-07-20 18:25:39,640 WARN L193 SmtUtils]: Spent 11.14 s on a formula simplification. DAG size of input: 721 DAG size of output: 88 [2020-07-20 18:25:40,115 WARN L193 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 63 [2020-07-20 18:25:40,657 WARN L193 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 61 [2020-07-20 18:25:44,627 WARN L193 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 298 DAG size of output: 57 [2020-07-20 18:25:44,631 INFO L268 CegarLoopResult]: For program point L385(lines 385 389) no Hoare annotation was computed. [2020-07-20 18:25:44,631 INFO L268 CegarLoopResult]: For program point L383(line 383) no Hoare annotation was computed. [2020-07-20 18:25:44,632 INFO L268 CegarLoopResult]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2020-07-20 18:25:44,632 INFO L268 CegarLoopResult]: For program point L377(lines 377 381) no Hoare annotation was computed. [2020-07-20 18:25:44,632 INFO L264 CegarLoopResult]: At program point L375(line 375) the Hoare annotation is: (let ((.cse12 (not (<= ~p_dw_pc~0 0))) (.cse13 (not (<= 2 ~slow_clk_edge~0))) (.cse14 (not (<= 2 ~fast_clk_edge~0))) (.cse5 (not (<= ~q_free~0 0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 ~q_write_ev~0))) (.cse8 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= 0 |old(~p_dw_st~0)|))) (.cse7 (= 0 ~p_dw_st~0)) (.cse4 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse2 .cse3 .cse7 .cse5) (or .cse8 .cse0 .cse4) (or .cse1 .cse2 .cse3 .cse5 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4) (or .cse10 .cse1 .cse2 .cse3 .cse11 .cse9) (or .cse12 .cse13 .cse14 .cse6 .cse2 .cse3 .cse11 .cse4 (and .cse0 .cse7)) (or .cse10 .cse6 .cse2 .cse3 .cse11 .cse7) (or .cse12 .cse8 .cse13 .cse14 .cse6 .cse3 .cse11 .cse7) (or .cse10 .cse8 .cse6 .cse3 .cse11 .cse7) (or .cse8 .cse6 .cse3 .cse7 .cse5) (or .cse8 .cse1 .cse3 .cse9 .cse5) (or .cse10 .cse8 .cse1 .cse3 .cse11 .cse9) (or .cse10 .cse0 .cse6 .cse2 .cse3 .cse11 .cse4) (or .cse8 .cse6 .cse7 .cse4))) [2020-07-20 18:25:44,633 INFO L264 CegarLoopResult]: At program point L377-2(lines 377 381) the Hoare annotation is: (let ((.cse24 (<= 1 ~q_free~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse25 (= ~c_dr_pc~0 1)) (.cse22 (<= 2 ~q_write_ev~0)) (.cse20 (= 0 ~p_dw_st~0))) (let ((.cse10 (and (<= 1 ~p_dw_pc~0) .cse20)) (.cse17 (and .cse24 .cse15 .cse23 .cse25 .cse20 .cse22)) (.cse7 (<= 2 ~c_dr_st~0)) (.cse18 (not (<= ~p_dw_pc~0 0))) (.cse19 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not .cse25)) (.cse5 (not (<= ~q_free~0 0))) (.cse0 (= 0 activate_threads_~tmp~1)) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse6 (not (<= 2 ~q_read_ev~0))) (.cse13 (not .cse15)) (.cse16 (not .cse24)) (.cse2 (not (<= 2 |old(~p_dw_st~0)|))) (.cse21 (and .cse24 .cse15 .cse23 .cse20)) (.cse4 (not .cse23)) (.cse14 (not .cse22)) (.cse11 (<= 2 ~p_dw_st~0)) (.cse12 (not (<= ~c_dr_pc~0 0))) (.cse8 (not (= 0 |old(~p_dw_st~0)|))) (.cse9 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse8 .cse3 .cse4 .cse9 .cse5) (or .cse2 .cse3 .cse4 .cse10 .cse11 .cse5) (or .cse12 .cse7 .cse9) (or .cse13 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11) (or .cse13 .cse0 .cse12 .cse1 .cse8 .cse4 .cse14 .cse6) (or .cse2 .cse3 .cse4 .cse15 .cse11 .cse5 .cse6) (or .cse13 .cse12 .cse1 .cse2 .cse4 .cse11 .cse5) (or .cse13 .cse16 .cse8 .cse17 .cse3 .cse4 .cse14) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6) (or .cse13 .cse12 .cse1 .cse2 .cse4 .cse14 .cse11) (or .cse18 .cse0 .cse12 .cse19 .cse1 .cse8 .cse4 .cse14 .cse6) (or .cse12 .cse2 .cse4 .cse10 .cse5 .cse11) (or .cse13 .cse7 .cse8 .cse3 .cse4 .cse14 .cse9) (or .cse13 .cse16 .cse17 .cse2 .cse3 .cse4 .cse14 .cse11) (or .cse13 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11) (or .cse0 .cse1 .cse8 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse2 .cse3 .cse4 .cse9 .cse5) (or .cse8 .cse3 .cse4 .cse20 .cse5) (or .cse13 .cse16 .cse12 .cse8 .cse21 .cse4 .cse14) (or .cse13 .cse0 .cse12 .cse1 .cse2 .cse4 .cse14 .cse6) (or .cse12 .cse2 .cse4 .cse15 .cse5 .cse11 .cse6) (or .cse0 .cse12 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse13 .cse7 .cse2 .cse3 .cse4 .cse14 .cse9) (or .cse18 .cse19 .cse1 .cse8 .cse3 .cse4 .cse14 .cse9 (and .cse7 .cse20)) (or .cse0 .cse18 .cse19 .cse1 .cse8 .cse3 .cse4 .cse14 .cse9 .cse6) (or .cse0 .cse12 .cse1 .cse8 .cse4 .cse5 .cse6) (or .cse18 .cse12 .cse19 .cse1 .cse8 .cse4 .cse14 .cse20) (or .cse0 .cse13 .cse1 .cse8 .cse3 .cse4 .cse14 .cse6) (or .cse12 .cse8 .cse4 .cse20 .cse5) (or .cse0 .cse12 .cse1 .cse9 .cse6) (or .cse13 .cse16 .cse12 .cse2 .cse21 .cse4 .cse14 .cse11) (or .cse12 .cse8 .cse20 .cse9)))) [2020-07-20 18:25:44,633 INFO L268 CegarLoopResult]: For program point L375-1(line 375) no Hoare annotation was computed. [2020-07-20 18:25:44,633 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 369 393) the Hoare annotation is: (let ((.cse12 (not (<= ~p_dw_pc~0 0))) (.cse13 (not (<= 2 ~slow_clk_edge~0))) (.cse14 (not (<= 2 ~fast_clk_edge~0))) (.cse5 (not (<= ~q_free~0 0))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= 2 ~q_write_ev~0))) (.cse8 (not (<= ~c_dr_pc~0 0))) (.cse6 (not (= 0 |old(~p_dw_st~0)|))) (.cse7 (= 0 ~p_dw_st~0)) (.cse4 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse2 .cse3 .cse7 .cse5) (or .cse8 .cse0 .cse4) (or .cse1 .cse2 .cse3 .cse5 .cse9) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse11 .cse4) (or .cse10 .cse1 .cse2 .cse3 .cse11 .cse9) (or .cse12 .cse13 .cse14 .cse6 .cse2 .cse3 .cse11 .cse4 (and .cse0 .cse7)) (or .cse10 .cse6 .cse2 .cse3 .cse11 .cse7) (or .cse12 .cse8 .cse13 .cse14 .cse6 .cse3 .cse11 .cse7) (or .cse10 .cse8 .cse6 .cse3 .cse11 .cse7) (or .cse8 .cse6 .cse3 .cse7 .cse5) (or .cse8 .cse1 .cse3 .cse9 .cse5) (or .cse10 .cse8 .cse1 .cse3 .cse11 .cse9) (or .cse10 .cse0 .cse6 .cse2 .cse3 .cse11 .cse4) (or .cse8 .cse6 .cse7 .cse4))) [2020-07-20 18:25:44,633 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2020-07-20 18:25:44,634 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2020-07-20 18:25:44,634 INFO L268 CegarLoopResult]: For program point L285(lines 285 290) no Hoare annotation was computed. [2020-07-20 18:25:44,634 INFO L268 CegarLoopResult]: For program point L281(lines 281 291) no Hoare annotation was computed. [2020-07-20 18:25:44,634 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2020-07-20 18:25:44,635 INFO L264 CegarLoopResult]: At program point L293(lines 280 295) the Hoare annotation is: (let ((.cse1 (not (= ~c_dr_pc~0 1))) (.cse9 (not (= 1 ~p_dw_pc~0))) (.cse5 (not (<= ~p_dw_pc~0 0))) (.cse6 (not (<= 2 ~slow_clk_edge~0))) (.cse7 (not (<= 2 ~fast_clk_edge~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse10 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse4 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse0 .cse7 .cse1 .cse2 .cse8 .cse3 (not (<= 2 ~c_dr_st~0))) (or .cse9 .cse0 .cse1 .cse2 .cse8 .cse3) (or .cse9 .cse10 .cse0 .cse2 .cse8 .cse3) (or .cse5 .cse10 .cse6 .cse0 .cse7 .cse2 .cse8 .cse3) (or .cse10 .cse0 .cse2 .cse3 .cse4))) [2020-07-20 18:25:44,635 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2020-07-20 18:25:44,635 INFO L264 CegarLoopResult]: At program point update_fifo_qENTRY(lines 22 41) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~c_dr_st~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not (<= 2 ~fast_clk_edge~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse12 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse6 .cse7) (or .cse10 .cse4 .cse5 .cse6 .cse8 .cse11) (or .cse10 .cse9 .cse2 .cse5 .cse6 .cse8) (or .cse9 .cse5 .cse6 .cse11 .cse12) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (or .cse10 .cse9 .cse5 .cse6 .cse8 .cse11) (or .cse9 .cse2 .cse5 .cse6 .cse12) (or .cse4 .cse5 .cse6 .cse11 .cse12) (or .cse10 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse12))) [2020-07-20 18:25:44,635 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L268 CegarLoopResult]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L268 CegarLoopResult]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L268 CegarLoopResult]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L268 CegarLoopResult]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2020-07-20 18:25:44,636 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 315 332) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~c_dr_st~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not (<= 2 ~fast_clk_edge~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse12 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse6 .cse7) (or .cse10 .cse4 .cse5 .cse6 .cse8 .cse11) (or .cse10 .cse9 .cse2 .cse5 .cse6 .cse8) (or .cse9 .cse5 .cse6 .cse11 .cse12) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (or .cse10 .cse9 .cse5 .cse6 .cse8 .cse11) (or .cse9 .cse2 .cse5 .cse6 .cse12) (or .cse4 .cse5 .cse6 .cse11 .cse12) (or .cse10 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse12))) [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L264 CegarLoopResult]: At program point init_threadsENTRY(lines 259 276) the Hoare annotation is: (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) (not (<= ~c_dr_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) (not (<= 2 ~fast_clk_edge~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (= 1 ~p_dw_i~0)) (not (<= 2 ~q_write_ev~0)) (= 0 ~p_dw_st~0)) [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 544 555) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= |old(~q_free~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= ~q_free~0 0) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L268 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2020-07-20 18:25:44,637 INFO L264 CegarLoopResult]: At program point L549(line 549) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= |old(~q_free~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= ~q_free~0 0) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-20 18:25:44,637 INFO L264 CegarLoopResult]: At program point L549-1(line 549) the Hoare annotation is: (or (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (<= 2 ~q_read_ev~0) (= 1 ~p_dw_i~0) (= 0 ~p_dw_st~0) (<= 2 ~fast_clk_edge~0) (<= 2 ~slow_clk_edge~0) (<= ~c_dr_pc~0 0) (<= 2 ~q_write_ev~0)) (not (= 0 |old(~p_dw_st~0)|)) (not (<= |old(~q_free~0)| 0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-20 18:25:44,638 INFO L264 CegarLoopResult]: At program point L161(lines 138 182) the Hoare annotation is: (let ((.cse7 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (<= 2 ~slow_clk_edge~0))) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (<= 1 |old(~p_dw_pc~0)|)) (.cse8 (not (<= |old(~q_free~0)| 0))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 ~c_dr_st~0)) .cse5) (or (and .cse6 (<= ~q_free~0 0)) .cse7 .cse8 .cse3) (or .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (or .cse6 .cse8 .cse2 .cse3))) [2020-07-20 18:25:44,638 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 135 183) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_pc~0)) (.cse14 (<= 1 ~q_free~0))) (let ((.cse4 (not (<= 2 ~slow_clk_edge~0))) (.cse5 (not (<= 2 ~fast_clk_edge~0))) (.cse8 (and .cse14 (<= ~p_dw_pc~0 0))) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse11 (and .cse14 .cse13)) (.cse6 (not (<= 1 |old(~q_free~0)|))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse3 (and (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1)) (<= ~q_free~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse12 (not (= 1 |old(~p_dw_pc~0)|))) (.cse1 (not (<= |old(~q_free~0)| 0))) (.cse2 (not (= 1 ~p_dw_i~0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse5 .cse6 .cse2 .cse7 .cse8 .cse9) (or .cse4 .cse5 .cse6 .cse10 .cse2 .cse7 .cse8 (not (<= 2 ~c_dr_st~0)) .cse9) (or .cse11 .cse12 .cse6 .cse10 .cse2 .cse7) (or .cse12 .cse1 .cse10 .cse2 .cse13) (or .cse0 .cse11 .cse12 .cse6 .cse2 .cse7) (or .cse1 .cse10 .cse2 .cse3) (or .cse0 .cse12 .cse1 .cse2 .cse13)))) [2020-07-20 18:25:44,638 INFO L268 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-07-20 18:25:44,638 INFO L264 CegarLoopResult]: At program point L178(lines 135 183) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_pc~0)) (.cse15 (<= ~q_free~0 0)) (.cse14 (<= 2 ~p_dw_st~0))) (let ((.cse5 (not (= 1 |old(~p_dw_pc~0)|))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (and (<= 1 |old(~p_dw_pc~0)|) .cse15 .cse14)) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse4 (and .cse13 .cse15 .cse14)) (.cse9 (not (<= 2 ~slow_clk_edge~0))) (.cse10 (not (<= 2 ~fast_clk_edge~0))) (.cse11 (and (<= 1 ~q_free~0) .cse13 .cse14)) (.cse6 (not (<= 1 |old(~q_free~0)|))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse12 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse5 .cse6 .cse7 .cse4 .cse3 .cse8) (or .cse0 .cse5 .cse6 .cse3 .cse8 .cse4) (or .cse0 .cse9 .cse10 .cse11 .cse6 .cse3 .cse8 .cse12) (or .cse1 .cse2 .cse7 .cse3 .cse4) (or .cse9 .cse10 .cse11 .cse6 .cse7 .cse3 .cse8 (not (<= 2 ~c_dr_st~0)) .cse12)))) [2020-07-20 18:25:44,638 INFO L268 CegarLoopResult]: For program point L145(lines 145 149) no Hoare annotation was computed. [2020-07-20 18:25:44,639 INFO L264 CegarLoopResult]: At program point L143(lines 138 182) the Hoare annotation is: (let ((.cse7 (= 1 ~p_dw_pc~0))) (let ((.cse8 (not (<= |old(~q_free~0)| 0))) (.cse6 (<= 1 |old(~p_dw_pc~0)|)) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse10 (and (<= 1 ~q_free~0) .cse7)) (.cse11 (not (= 1 |old(~p_dw_pc~0)|))) (.cse12 (not (<= 1 |old(~q_free~0)|))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (<= 2 ~slow_clk_edge~0))) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (<= |old(~p_dw_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (<= 2 ~c_dr_st~0)) .cse5) (or (and .cse6 .cse7) .cse8 .cse2 .cse3) (or .cse9 .cse8 .cse3 (and .cse6 .cse7 (<= ~q_free~0 0))) (or .cse10 .cse11 .cse12 .cse2 .cse3 .cse4) (or .cse9 .cse10 .cse11 .cse12 .cse3 .cse4) (or .cse9 .cse0 .cse1 .cse3 .cse4 .cse5)))) [2020-07-20 18:25:44,639 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2020-07-20 18:25:44,639 INFO L264 CegarLoopResult]: At program point L154-1(lines 138 182) the Hoare annotation is: (let ((.cse12 (<= ~q_free~0 0)) (.cse13 (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1)))) (let ((.cse4 (not (<= 2 ~slow_clk_edge~0))) (.cse5 (not (<= 2 ~fast_clk_edge~0))) (.cse6 (not (<= 1 |old(~q_free~0)|))) (.cse9 (not (<= |old(~p_dw_pc~0)| 0))) (.cse10 (and .cse13 (<= 1 ~q_free~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= 1 |old(~p_dw_pc~0)|))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse1 (not (<= |old(~q_free~0)| 0))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (and .cse13 .cse12))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7 .cse2 .cse8 (not (<= 2 ~c_dr_st~0)) .cse9 .cse10) (or .cse0 .cse4 .cse5 .cse6 .cse2 .cse8 .cse9 .cse10) (or .cse11 .cse7 .cse2 .cse8 .cse12) (or .cse0 .cse11 .cse2 .cse8 .cse12) (or .cse1 .cse7 .cse2 .cse3)))) [2020-07-20 18:25:44,639 INFO L268 CegarLoopResult]: For program point L142(lines 142 150) no Hoare annotation was computed. [2020-07-20 18:25:44,639 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-20 18:25:44,639 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-20 18:25:44,639 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L126(lines 126 130) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L126-2(lines 110 134) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsENTRY(lines 110 134) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L118(lines 118 122) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L118-2(lines 118 122) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point L116-1(line 116) no Hoare annotation was computed. [2020-07-20 18:25:44,640 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 110 134) no Hoare annotation was computed. [2020-07-20 18:25:44,641 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2020-07-20 18:25:44,641 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: (let ((.cse8 (not (<= ~q_free~0 0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse7 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (<= 2 ~slow_clk_edge~0)) (.cse5 (not (<= 2 |old(~slow_clk_edge~0)|))) (.cse6 (not (<= 2 ~p_dw_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse1 .cse4 .cse5 (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse7 .cse2 .cse3 .cse4 .cse5 .cse6))) [2020-07-20 18:25:44,641 INFO L268 CegarLoopResult]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2020-07-20 18:25:44,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:25:44,641 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1)) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) [2020-07-20 18:25:44,641 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:25:44,641 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 394 446) the Hoare annotation is: (let ((.cse17 (<= ~p_dw_pc~0 0)) (.cse14 (not (<= 2 ~slow_clk_edge~0))) (.cse15 (not (<= 2 ~fast_clk_edge~0))) (.cse19 (not (<= |old(~p_dw_pc~0)| 0))) (.cse12 (<= 2 ~c_dr_st~0)) (.cse18 (<= ~c_dr_pc~0 0)) (.cse16 (not (<= |old(~c_dr_pc~0)| 0))) (.cse13 (not (<= 2 |old(~c_dr_st~0)|))) (.cse6 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse21 (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1))) (.cse11 (= 0 ~p_dw_st~0)) (.cse22 (<= ~q_free~0 0)) (.cse9 (<= 1 ~q_free~0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse20 (<= 2 ~p_dw_st~0)) (.cse0 (not (= 1 |old(~p_dw_pc~0)|))) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (<= 1 |old(~q_free~0)|))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse3 .cse8 (and .cse9 .cse4 .cse10 .cse11) .cse5) (or .cse12 .cse0 .cse1 .cse3 .cse8 .cse13 .cse5) (or .cse14 .cse15 .cse6 .cse7 .cse3 .cse8 .cse16 (and .cse9 .cse17 .cse11 .cse18) .cse19) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (or .cse0 (and .cse9 .cse4 .cse18 .cse20) .cse1 .cse7 .cse3 .cse8 .cse16) (or .cse12 .cse6 .cse2 .cse3 .cse13 .cse5) (or .cse12 .cse1 .cse2 .cse3 .cse13 .cse5) (or .cse12 .cse0 .cse6 .cse3 .cse8 .cse13 .cse5) (or .cse1 .cse2 (and .cse21 .cse18 .cse22 .cse20) .cse3 .cse16) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse16) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (or .cse0 .cse6 .cse7 .cse3 .cse8 .cse16 (and .cse9 .cse4 .cse11 .cse18)) (or .cse6 .cse16 .cse11 .cse13) (or .cse1 .cse2 .cse3 (and .cse21 .cse10 .cse22 .cse20) .cse5) (or (and .cse12 .cse9 .cse17 .cse10 .cse11) .cse14 .cse15 .cse6 .cse7 .cse3 .cse8 .cse13 .cse5 .cse19) (or .cse6 .cse2 .cse3 .cse16 (and .cse21 .cse11 .cse18 .cse22)) (or (and .cse12 .cse18) .cse16 .cse13) (or .cse6 .cse2 .cse3 (and .cse21 .cse10 .cse11 .cse22) .cse5) (or (and .cse9 .cse4 .cse10 .cse20) .cse0 .cse1 .cse7 .cse3 .cse8 .cse5))) [2020-07-20 18:25:44,642 INFO L264 CegarLoopResult]: At program point L417(line 417) the Hoare annotation is: (let ((.cse20 (= 1 ~p_dw_pc~0)) (.cse21 (<= 1 ~q_free~0)) (.cse23 (<= ~p_dw_pc~0 0)) (.cse11 (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1))) (.cse22 (<= 2 ~c_dr_st~0)) (.cse24 (= 1 ~p_dw_i~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse13 (<= ~q_free~0 0))) (let ((.cse15 (and .cse11 .cse22 .cse24 .cse12 .cse13)) (.cse7 (not (= 1 |old(~c_dr_pc~0)|))) (.cse10 (not (<= |old(~q_free~0)| 0))) (.cse19 (not (<= 2 |old(~p_dw_st~0)|))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse0 (not (<= 2 ~slow_clk_edge~0))) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse8 (not (<= |old(~p_dw_pc~0)| 0))) (.cse9 (and .cse22 .cse21 .cse23 .cse24 .cse12)) (.cse17 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not .cse24)) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse18 (and .cse11 .cse22 .cse21 .cse20 .cse24 .cse12)) (.cse14 (<= ~c_dr_pc~0 0)) (.cse16 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse2 .cse10 .cse4 (and .cse11 .cse12 .cse13) .cse7) (or .cse2 (and .cse11 .cse14 .cse13) .cse10 .cse4 .cse15 .cse16) (or .cse2 .cse10 .cse4 .cse15 .cse6 .cse7) (or .cse17 .cse2 .cse3 .cse4 .cse5 .cse18 .cse6 .cse7) (or .cse19 .cse10 .cse4 .cse7) (or .cse19 .cse10 .cse4 .cse16) (or .cse17 .cse19 .cse4 .cse5 .cse7) (or .cse17 .cse2 .cse10 .cse4 .cse20 .cse7) (or .cse17 .cse2 .cse3 (and .cse21 .cse20 .cse12) .cse4 .cse5 .cse7) (or .cse17 .cse2 .cse10 .cse4 .cse20 .cse16) (or .cse17 .cse19 .cse4 .cse5 .cse16) (or (and .cse22 .cse14) .cse16 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (and .cse21 .cse23 .cse14) .cse8 .cse9) (or .cse17 .cse2 .cse3 .cse4 .cse5 .cse18 (and .cse21 .cse20 .cse14) .cse16)))) [2020-07-20 18:25:44,642 INFO L268 CegarLoopResult]: For program point L405(lines 405 409) no Hoare annotation was computed. [2020-07-20 18:25:44,642 INFO L268 CegarLoopResult]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2020-07-20 18:25:44,642 INFO L268 CegarLoopResult]: For program point L403(line 403) no Hoare annotation was computed. [2020-07-20 18:25:44,642 INFO L264 CegarLoopResult]: At program point L401(line 401) the Hoare annotation is: (let ((.cse37 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse23 (or .cse37 (< ~p_dw_pc~0 1))) (.cse38 (= 1 ~p_dw_i~0)) (.cse39 (<= 2 ~q_write_ev~0)) (.cse40 (<= 2 ~slow_clk_edge~0)) (.cse36 (<= 2 ~c_dr_st~0)) (.cse30 (<= ~p_dw_pc~0 0)) (.cse12 (= 0 ~p_dw_st~0)) (.cse10 (<= 1 ~q_free~0)) (.cse31 (<= ~c_dr_pc~0 0)) (.cse4 (= 1 ~p_dw_pc~0)) (.cse11 (= ~c_dr_pc~0 1)) (.cse24 (<= ~q_free~0 0)) (.cse34 (<= 2 ~p_dw_st~0))) (let ((.cse9 (and .cse4 .cse11 .cse24 .cse34)) (.cse15 (and .cse10 .cse4 .cse31 .cse34)) (.cse26 (and .cse36 .cse10 .cse30 .cse11 .cse12)) (.cse27 (not .cse40)) (.cse28 (and .cse36 .cse10 .cse4 .cse38 .cse11 .cse40 .cse34 .cse39)) (.cse29 (not (<= 2 ~fast_clk_edge~0))) (.cse32 (not (<= |old(~p_dw_pc~0)| 0))) (.cse18 (and .cse23 .cse36 .cse10 .cse4 .cse38 .cse11 .cse12)) (.cse19 (and .cse37 .cse36 .cse4 .cse38 .cse11 .cse24 .cse34)) (.cse17 (and .cse23 .cse36 .cse10 .cse4 .cse38 .cse11 .cse34)) (.cse13 (and .cse23 .cse36 .cse38 .cse11 .cse24 .cse34)) (.cse14 (not (<= 2 |old(~c_dr_st~0)|))) (.cse35 (and .cse37 .cse31 .cse24 .cse34)) (.cse21 (and .cse36 .cse4 .cse38 .cse11 .cse24 .cse34)) (.cse20 (and .cse37 .cse36 .cse38 .cse11 .cse24 .cse34)) (.cse33 (and .cse4 .cse31 .cse24 .cse34)) (.cse16 (not (<= |old(~c_dr_pc~0)| 0))) (.cse22 (and .cse23 .cse36 .cse38 .cse11 .cse12 .cse24)) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse7 (not (<= 1 |old(~q_free~0)|))) (.cse8 (not .cse39)) (.cse0 (not (= 1 |old(~p_dw_pc~0)|))) (.cse6 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse3 (not .cse38)) (.cse25 (and .cse37 .cse11 .cse24 .cse34)) (.cse5 (not (= 1 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse6 .cse7 .cse3 .cse8 .cse9 (and .cse10 .cse4 .cse11 .cse12) .cse5) (or .cse13 .cse1 .cse2 .cse3 .cse14 .cse5) (or .cse0 .cse15 .cse1 .cse7 .cse3 .cse8 .cse16 .cse17) (or .cse0 .cse6 .cse7 .cse18 .cse3 .cse8 .cse19 .cse14 .cse5) (or .cse6 .cse2 .cse3 .cse20 .cse21 .cse14 .cse5 .cse22) (or .cse6 .cse2 .cse3 (and .cse23 .cse11 .cse12 .cse24) .cse9 .cse25 .cse5) (or .cse26 .cse27 .cse28 .cse29 .cse6 .cse15 .cse7 .cse3 .cse8 .cse16 (and .cse10 .cse30 .cse12 .cse31) .cse32) (or .cse26 .cse27 .cse28 .cse29 .cse6 .cse7 .cse3 .cse8 .cse14 .cse5 .cse32) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse16) (or .cse0 .cse6 .cse7 .cse18 .cse3 .cse8 .cse33 .cse16 .cse19 (and .cse10 .cse4 .cse12 .cse31)) (or .cse0 .cse1 .cse7 .cse3 .cse8 .cse14 .cse5 .cse17) (or .cse1 .cse2 .cse3 (and .cse23 .cse11 .cse24 .cse34) .cse5) (or .cse13 .cse1 .cse2 (and .cse23 .cse31 .cse24 .cse34) .cse3 .cse16) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse35 .cse20 .cse16) (or (and .cse36 .cse31) .cse16 .cse14) (or .cse6 .cse2 .cse3 .cse35 .cse21 .cse20 .cse33 .cse16 (and .cse23 .cse12 .cse31 .cse24) .cse22) (or (and .cse10 .cse4 .cse11 .cse34) .cse0 .cse1 .cse7 .cse3 .cse8 .cse5) (or .cse0 .cse6 .cse2 .cse3 .cse4 .cse25 .cse5))))) [2020-07-20 18:25:44,642 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse26 (<= 1 |old(~p_dw_pc~0)|)) (.cse7 (<= 1 ~q_free~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse20 (= ~c_dr_pc~0 1)) (.cse22 (<= ~q_free~0 0)) (.cse25 (<= 2 ~p_dw_st~0))) (let ((.cse19 (and .cse8 .cse20 .cse22 .cse25)) (.cse17 (and .cse7 .cse8 .cse10 .cse25)) (.cse15 (not (<= 2 ~slow_clk_edge~0))) (.cse16 (not (<= 2 ~fast_clk_edge~0))) (.cse18 (not (<= |old(~p_dw_pc~0)| 0))) (.cse5 (and .cse8 .cse10 .cse22 .cse25)) (.cse9 (= 0 ~p_dw_st~0)) (.cse24 (and .cse26 .cse10 .cse22 .cse25)) (.cse21 (or .cse26 (< ~p_dw_pc~0 1))) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse11 (not (<= 2 |old(~c_dr_st~0)|))) (.cse13 (not (<= 2 |old(~p_dw_st~0)|))) (.cse2 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse0 (not (= 1 |old(~p_dw_pc~0)|))) (.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse14 (not (<= |old(~q_free~0)| 0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse23 (and .cse26 .cse20 .cse22 .cse25)) (.cse12 (not (= 1 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10)) (or .cse0 .cse1 .cse3 .cse4 .cse11 .cse12) (or .cse0 .cse13 .cse14 .cse3 .cse8 .cse12) (or .cse15 .cse16 .cse1 .cse17 .cse2 .cse3 .cse4 .cse6 (and .cse7 (<= ~p_dw_pc~0 0) .cse9 .cse10) .cse18) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse19 (and .cse7 .cse8 .cse20 .cse9) .cse12) (or .cse13 .cse14 .cse3 .cse11 .cse12) (or .cse1 .cse14 .cse3 (and .cse21 .cse20 .cse9 .cse22) .cse19 .cse23 .cse12) (or .cse0 .cse17 .cse13 .cse2 .cse3 .cse4 .cse6) (or .cse15 .cse16 .cse1 .cse3 .cse4 .cse11 .cse12 .cse18) (or .cse1 .cse14 .cse3 .cse24 .cse5 .cse6 (and .cse21 .cse9 .cse10 .cse22)) (or .cse13 .cse14 (and .cse21 .cse10 .cse22 .cse25) .cse3 .cse6) (or .cse0 .cse13 .cse14 .cse3 .cse8 .cse6) (or .cse0 .cse13 .cse3 .cse4 .cse11 .cse12) (or .cse0 .cse1 .cse14 .cse3 .cse8 .cse24 .cse6) (or .cse13 .cse14 .cse3 (and .cse21 .cse20 .cse22 .cse25) .cse12) (or .cse1 .cse14 .cse3 .cse11 .cse12) (or .cse6 .cse11) (or (and .cse7 .cse8 .cse20 .cse25) .cse0 .cse13 .cse2 .cse3 .cse4 .cse12) (or .cse0 .cse1 .cse14 .cse3 .cse8 .cse23 .cse12)))) [2020-07-20 18:25:44,642 INFO L268 CegarLoopResult]: For program point L414(lines 414 421) no Hoare annotation was computed. [2020-07-20 18:25:44,643 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2020-07-20 18:25:44,643 INFO L268 CegarLoopResult]: For program point L410(lines 400 440) no Hoare annotation was computed. [2020-07-20 18:25:44,643 INFO L264 CegarLoopResult]: At program point L441(lines 394 446) the Hoare annotation is: (let ((.cse0 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse20 (or .cse0 (< ~p_dw_pc~0 1))) (.cse37 (= 1 ~p_dw_i~0)) (.cse38 (<= 2 ~q_write_ev~0)) (.cse39 (<= 2 ~slow_clk_edge~0)) (.cse36 (<= 2 ~c_dr_st~0)) (.cse33 (<= ~p_dw_pc~0 0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse13 (<= 1 ~q_free~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse14 (= ~c_dr_pc~0 1)) (.cse21 (<= ~c_dr_pc~0 0)) (.cse22 (<= ~q_free~0 0)) (.cse35 (<= 2 ~p_dw_st~0))) (let ((.cse15 (and .cse21 .cse22 .cse35)) (.cse12 (and .cse5 .cse14 .cse22 .cse35)) (.cse24 (and .cse13 .cse5 .cse21 .cse35)) (.cse29 (and .cse36 .cse13 .cse33 .cse14 .cse7)) (.cse30 (not .cse39)) (.cse31 (and .cse36 .cse13 .cse5 .cse37 .cse14 .cse39 .cse35 .cse38)) (.cse32 (not (<= 2 ~fast_clk_edge~0))) (.cse34 (not (<= |old(~p_dw_pc~0)| 0))) (.cse25 (and .cse20 .cse36 .cse13 .cse5 .cse37 .cse14 .cse35)) (.cse26 (and .cse20 .cse36 .cse13 .cse5 .cse37 .cse14 .cse7)) (.cse27 (and .cse0 .cse36 .cse5 .cse37 .cse14 .cse22 .cse35)) (.cse17 (and .cse20 .cse36 .cse37 .cse14 .cse22 .cse35)) (.cse6 (not (<= |old(~c_dr_pc~0)| 0))) (.cse19 (and .cse36 .cse5 .cse37 .cse14 .cse22 .cse35)) (.cse16 (and .cse0 .cse36 .cse37 .cse14 .cse22 .cse35)) (.cse18 (not (<= 2 |old(~c_dr_st~0)|))) (.cse23 (and .cse20 .cse36 .cse37 .cse14 .cse7 .cse22)) (.cse9 (not (<= 2 |old(~p_dw_st~0)|))) (.cse11 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not .cse38)) (.cse8 (not (= 1 |old(~p_dw_pc~0)|))) (.cse1 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse3 (not .cse37)) (.cse28 (and .cse0 .cse14 .cse22 .cse35)) (.cse10 (not (= 1 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse2 .cse3 .cse5 .cse10) (or .cse8 .cse1 .cse11 .cse3 .cse4 .cse12 (and .cse13 .cse5 .cse14 .cse7) .cse10) (or .cse15 .cse8 .cse1 .cse2 .cse3 .cse5 .cse16 .cse6) (or .cse17 .cse9 .cse2 .cse3 .cse18 .cse10) (or .cse15 .cse1 .cse2 .cse3 .cse16 .cse19 .cse6 (and .cse20 .cse7 .cse21 .cse22) .cse23) (or .cse8 .cse24 .cse9 .cse11 .cse3 .cse4 .cse6 .cse25) (or .cse8 .cse1 .cse11 .cse26 .cse3 .cse4 .cse27 .cse18 .cse10) (or .cse1 .cse2 .cse3 (and .cse20 .cse14 .cse7 .cse22) .cse12 .cse28 .cse10) (or .cse29 .cse30 .cse31 .cse32 .cse1 .cse24 .cse11 .cse3 .cse4 .cse6 (and .cse13 .cse33 .cse7 .cse21) .cse34) (or .cse29 .cse30 .cse31 .cse32 .cse1 .cse11 .cse3 .cse4 .cse18 .cse10 .cse34) (or .cse8 .cse9 .cse2 .cse3 .cse5 .cse6) (or .cse8 .cse9 .cse11 .cse3 .cse4 .cse18 .cse10 .cse25) (or .cse8 .cse1 .cse11 .cse26 .cse3 .cse4 (and .cse5 .cse21 .cse22 .cse35) .cse6 .cse27 (and .cse13 .cse5 .cse7 .cse21)) (or .cse9 .cse2 .cse3 (and .cse20 .cse14 .cse22 .cse35) .cse10) (or .cse17 .cse9 .cse2 (and .cse20 .cse21 .cse22 .cse35) .cse3 .cse6) (or (and .cse36 .cse21) .cse6 .cse18) (or .cse1 .cse2 .cse3 .cse19 .cse16 .cse18 .cse10 .cse23) (or (and .cse13 .cse5 .cse14 .cse35) .cse8 .cse9 .cse11 .cse3 .cse4 .cse10) (or .cse8 .cse1 .cse2 .cse3 .cse5 .cse28 .cse10))))) [2020-07-20 18:25:44,643 INFO L268 CegarLoopResult]: For program point L429(lines 429 436) no Hoare annotation was computed. [2020-07-20 18:25:44,643 INFO L264 CegarLoopResult]: At program point L425(lines 400 440) the Hoare annotation is: (let ((.cse37 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse39 (<= 2 ~q_write_ev~0)) (.cse40 (<= 2 ~slow_clk_edge~0)) (.cse33 (<= ~p_dw_pc~0 0)) (.cse20 (<= 1 ~q_free~0)) (.cse10 (<= ~c_dr_pc~0 0)) (.cse8 (or .cse37 (< ~p_dw_pc~0 1))) (.cse9 (= 0 ~p_dw_st~0)) (.cse36 (<= 2 ~c_dr_st~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse38 (= 1 ~p_dw_i~0)) (.cse21 (= ~c_dr_pc~0 1)) (.cse11 (<= ~q_free~0 0)) (.cse35 (<= 2 ~p_dw_st~0))) (let ((.cse5 (and .cse36 .cse15 .cse38 .cse21 .cse11 .cse35)) (.cse12 (and .cse8 .cse36 .cse38 .cse21 .cse9 .cse11)) (.cse19 (and .cse15 .cse21 .cse11 .cse35)) (.cse24 (and .cse20 .cse15 .cse10 .cse35)) (.cse29 (and .cse36 .cse20 .cse33 .cse21 .cse9)) (.cse30 (not .cse40)) (.cse31 (and .cse36 .cse20 .cse15 .cse38 .cse21 .cse40 .cse35 .cse39)) (.cse32 (not (<= 2 ~fast_clk_edge~0))) (.cse34 (not (<= |old(~p_dw_pc~0)| 0))) (.cse26 (and .cse8 .cse36 .cse20 .cse15 .cse38 .cse21 .cse9)) (.cse6 (and .cse15 .cse10 .cse11 .cse35)) (.cse27 (and .cse37 .cse36 .cse15 .cse38 .cse21 .cse11 .cse35)) (.cse25 (and .cse8 .cse36 .cse20 .cse15 .cse38 .cse21 .cse35)) (.cse22 (and .cse8 .cse36 .cse38 .cse21 .cse11 .cse35)) (.cse23 (not (<= 2 |old(~c_dr_st~0)|))) (.cse3 (and .cse37 .cse10 .cse11 .cse35)) (.cse4 (and .cse37 .cse36 .cse38 .cse21 .cse11 .cse35)) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse14 (not (<= 2 |old(~p_dw_st~0)|))) (.cse17 (not (<= 1 |old(~q_free~0)|))) (.cse18 (not .cse39)) (.cse13 (not (= 1 |old(~p_dw_pc~0)|))) (.cse0 (not (= 0 |old(~p_dw_st~0)|))) (.cse1 (not (<= |old(~q_free~0)| 0))) (.cse2 (not .cse38)) (.cse28 (and .cse37 .cse21 .cse11 .cse35)) (.cse16 (not (= 1 |old(~c_dr_pc~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11) .cse12) (or .cse13 .cse14 .cse1 .cse2 .cse15 .cse16) (or .cse13 .cse0 .cse17 .cse2 .cse18 .cse19 (and .cse20 .cse15 .cse21 .cse9) .cse16) (or .cse22 .cse14 .cse1 .cse2 .cse23 .cse16) (or .cse13 .cse24 .cse14 .cse17 .cse2 .cse18 .cse7 .cse25) (or .cse13 .cse0 .cse17 .cse26 .cse2 .cse18 .cse27 .cse23 .cse16) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse23 .cse16 .cse12) (or .cse0 .cse1 .cse2 (and .cse8 .cse21 .cse9 .cse11) .cse19 .cse28 .cse16) (or .cse29 .cse30 .cse31 .cse32 .cse0 .cse24 .cse17 .cse2 .cse18 .cse7 (and .cse20 .cse33 .cse9 .cse10) .cse34) (or .cse29 .cse30 .cse31 .cse32 .cse0 .cse17 .cse2 .cse18 .cse23 .cse16 .cse34) (or .cse13 .cse14 .cse1 .cse2 .cse15 .cse7) (or .cse13 .cse0 .cse17 .cse26 .cse2 .cse18 .cse6 .cse7 .cse27 (and .cse20 .cse15 .cse9 .cse10)) (or .cse13 .cse14 .cse17 .cse2 .cse18 .cse23 .cse16 .cse25) (or .cse14 .cse1 .cse2 (and .cse8 .cse21 .cse11 .cse35) .cse16) (or .cse22 .cse14 .cse1 (and .cse8 .cse10 .cse11 .cse35) .cse2 .cse7) (or (and .cse36 .cse10) .cse7 .cse23) (or .cse13 .cse0 .cse1 .cse2 .cse3 .cse15 .cse4 .cse7) (or (and .cse20 .cse15 .cse21 .cse35) .cse13 .cse14 .cse17 .cse2 .cse18 .cse16) (or .cse13 .cse0 .cse1 .cse2 .cse15 .cse28 .cse16))))) [2020-07-20 18:25:44,643 INFO L271 CegarLoopResult]: At program point L462(lines 451 464) the Hoare annotation is: true [2020-07-20 18:25:44,643 INFO L268 CegarLoopResult]: For program point L455(lines 455 460) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L271 CegarLoopResult]: At program point L453(line 453) the Hoare annotation is: true [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point L453-1(line 453) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point L96(lines 96 101) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point L86(lines 86 91) no Hoare annotation was computed. [2020-07-20 18:25:44,644 INFO L268 CegarLoopResult]: For program point L85(lines 85 94) no Hoare annotation was computed. [2020-07-20 18:25:44,645 INFO L268 CegarLoopResult]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2020-07-20 18:25:44,645 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2020-07-20 18:25:44,645 INFO L264 CegarLoopResult]: At program point L106(lines 84 108) the Hoare annotation is: (let ((.cse6 (not (= 1 ~p_dw_pc~0))) (.cse5 (not (<= 2 ~c_dr_st~0))) (.cse11 (not (<= ~p_dw_pc~0 0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse12 (not (<= 2 ~fast_clk_edge~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (<= 2 ~slow_clk_edge~0))) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse8 (not (<= 2 ~p_dw_st~0))) (.cse4 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse3 .cse5) (or .cse6 .cse0 .cse2 .cse7 .cse3 .cse8) (or .cse6 .cse0 .cse1 .cse2 .cse7 .cse3) (or .cse9 .cse1 .cse10 .cse2 .cse3 .cse4) (or .cse6 .cse9 .cse10 .cse2 .cse7 .cse3 .cse8) (or .cse0 .cse2 .cse3 .cse8 .cse4) (or .cse6 .cse9 .cse1 .cse10 .cse2 .cse7 .cse3) (or .cse11 .cse9 .cse1 .cse12 .cse10 .cse2 .cse7 .cse5 .cse3) (or .cse11 .cse0 .cse9 .cse1 .cse12 .cse2 .cse7 .cse3) (or .cse9 .cse10 .cse2 .cse3 .cse8 .cse4))) [2020-07-20 18:25:44,645 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2020-07-20 18:25:44,645 INFO L264 CegarLoopResult]: At program point update_channelsENTRY(lines 244 258) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~c_dr_st~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not (<= 2 ~fast_clk_edge~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse12 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse6 .cse7) (or .cse10 .cse4 .cse5 .cse6 .cse8 .cse11) (or .cse10 .cse9 .cse2 .cse5 .cse6 .cse8) (or .cse9 .cse5 .cse6 .cse11 .cse12) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (or .cse10 .cse9 .cse5 .cse6 .cse8 .cse11) (or .cse9 .cse2 .cse5 .cse6 .cse12) (or .cse4 .cse5 .cse6 .cse11 .cse12) (or .cse10 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse12))) [2020-07-20 18:25:44,645 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2020-07-20 18:25:44,645 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~c_dr_st~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not (<= 2 ~fast_clk_edge~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse12 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse6 .cse7) (or .cse10 .cse4 .cse5 .cse6 .cse8 .cse11) (or .cse10 .cse9 .cse2 .cse5 .cse6 .cse8) (or .cse9 .cse5 .cse6 .cse11 .cse12) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (or .cse10 .cse9 .cse5 .cse6 .cse8 .cse11) (or .cse9 .cse2 .cse5 .cse6 .cse12) (or .cse4 .cse5 .cse6 .cse11 .cse12) (or .cse10 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse12))) [2020-07-20 18:25:44,645 INFO L268 CegarLoopResult]: For program point L248(lines 244 258) no Hoare annotation was computed. [2020-07-20 18:25:44,646 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 297 314) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~c_dr_st~0))) (.cse0 (not (<= ~p_dw_pc~0 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse3 (not (<= 2 ~fast_clk_edge~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse6 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse12 (not (<= ~q_free~0 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse6 .cse7) (or .cse10 .cse4 .cse5 .cse6 .cse8 .cse11) (or .cse10 .cse9 .cse2 .cse5 .cse6 .cse8) (or .cse9 .cse5 .cse6 .cse11 .cse12) (or .cse0 .cse9 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8) (or .cse10 .cse9 .cse5 .cse6 .cse8 .cse11) (or .cse9 .cse2 .cse5 .cse6 .cse12) (or .cse4 .cse5 .cse6 .cse11 .cse12) (or .cse10 .cse2 .cse4 .cse5 .cse6 .cse8) (or .cse2 .cse4 .cse5 .cse6 .cse12))) [2020-07-20 18:25:44,646 INFO L268 CegarLoopResult]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2020-07-20 18:25:44,646 INFO L268 CegarLoopResult]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2020-07-20 18:25:44,646 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2020-07-20 18:25:44,646 INFO L264 CegarLoopResult]: At program point L481-1(lines 478 518) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_free~0 0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~c_dr_st~0)) (.cse8 (<= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse9 (<= 2 ~fast_clk_edge~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse10 (<= 2 ~slow_clk_edge~0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse2) (and .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse7 .cse5) (and .cse1 .cse6 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse4 .cse6) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse8 .cse9 .cse4 .cse10 .cse5 .cse3) (and .cse7 .cse8 .cse1 .cse9 (<= 1 start_simulation_~tmp~4) .cse4 .cse10 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,646 INFO L264 CegarLoopResult]: At program point L477(line 477) the Hoare annotation is: (let ((.cse0 (<= 2 ~fast_clk_edge~0)) (.cse1 (<= 2 ~slow_clk_edge~0)) (.cse2 (<= ~c_dr_pc~0 0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) .cse0 .cse1 .cse2 (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and (<= 2 ~c_dr_st~0) .cse0 .cse1 .cse2))) [2020-07-20 18:25:44,646 INFO L264 CegarLoopResult]: At program point L475(line 475) the Hoare annotation is: (let ((.cse0 (<= 2 ~fast_clk_edge~0)) (.cse1 (<= 2 ~slow_clk_edge~0)) (.cse2 (<= ~c_dr_pc~0 0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) .cse0 .cse1 .cse2 (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and (<= 2 ~c_dr_st~0) .cse0 .cse1 .cse2))) [2020-07-20 18:25:44,646 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2020-07-20 18:25:44,646 INFO L264 CegarLoopResult]: At program point L504(line 504) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse4 (= 0 ~p_dw_st~0)) (.cse6 (<= ~q_free~0 0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse2) (and .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse3) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse5) (and .cse1 .cse6 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse4 .cse6) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,646 INFO L268 CegarLoopResult]: For program point L500(lines 500 509) no Hoare annotation was computed. [2020-07-20 18:25:44,647 INFO L264 CegarLoopResult]: At program point L500-1(lines 500 509) the Hoare annotation is: (let ((.cse7 (= 1 ~p_dw_pc~0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse10 (<= ~q_free~0 0)) (.cse11 (<= 2 ~c_dr_st~0)) (.cse0 (<= ~p_dw_pc~0 0)) (.cse8 (= ~c_dr_pc~0 1)) (.cse1 (<= 2 ~fast_clk_edge~0)) (.cse2 (<= 1 start_simulation_~tmp~4)) (.cse3 (= 0 ~p_dw_st~0)) (.cse4 (<= 2 ~slow_clk_edge~0)) (.cse6 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse6) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse7 .cse8 .cse3 .cse6) (and .cse7 .cse5 .cse9 .cse6) (and .cse5 .cse10 .cse9) (and .cse3 .cse5 .cse10) (and .cse7 .cse3 .cse5 .cse6) (not (= 1 ~p_dw_i~0)) (and .cse11 .cse5) (and .cse8 .cse10 .cse9) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse8 .cse3 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse11 .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse6) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,647 INFO L268 CegarLoopResult]: For program point L498(line 498) no Hoare annotation was computed. [2020-07-20 18:25:44,647 INFO L264 CegarLoopResult]: At program point L494(line 494) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_free~0 0)) (.cse5 (<= ~p_dw_pc~0 0)) (.cse6 (<= 2 ~fast_clk_edge~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 2 ~slow_clk_edge~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse3) (and .cse9 .cse10 .cse2) (and .cse7 .cse9 .cse10) (and .cse0 .cse7 .cse9 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse4 .cse9) (and .cse1 .cse10 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse7 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,647 INFO L271 CegarLoopResult]: At program point L519(lines 466 524) the Hoare annotation is: true [2020-07-20 18:25:44,647 INFO L268 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2020-07-20 18:25:44,647 INFO L268 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 466 524) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= 2 ~fast_clk_edge~0) (<= 2 ~slow_clk_edge~0) (<= ~c_dr_pc~0 0) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|))) [2020-07-20 18:25:44,648 INFO L268 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point L476(line 476) the Hoare annotation is: (let ((.cse0 (<= 2 ~fast_clk_edge~0)) (.cse1 (<= 2 ~slow_clk_edge~0)) (.cse2 (<= ~c_dr_pc~0 0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) .cse0 .cse1 .cse2 (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and (<= 2 ~c_dr_st~0) .cse0 .cse1 .cse2))) [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point L474(line 474) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= 2 ~fast_clk_edge~0) (<= 2 ~slow_clk_edge~0) (<= ~c_dr_pc~0 0) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|))) [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point L474-1(line 474) the Hoare annotation is: (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~0)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= 2 ~fast_clk_edge~0) (<= 2 ~slow_clk_edge~0) (<= ~c_dr_pc~0 0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~q_read_ev~0)|)) (not (<= 2 |old(~fast_clk_edge~0)|))) [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point L503(line 503) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse5 (<= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse2) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse1 .cse5 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,648 INFO L264 CegarLoopResult]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse3 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse5 (<= ~q_free~0 0)) (.cse2 (<= 2 ~p_dw_st~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse4 .cse5 .cse2) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse1 .cse5 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L264 CegarLoopResult]: At program point L495(line 495) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_free~0 0)) (.cse5 (<= ~p_dw_pc~0 0)) (.cse6 (<= 2 ~fast_clk_edge~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 2 ~slow_clk_edge~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse3) (and .cse9 .cse10 .cse2) (and .cse7 .cse9 .cse10) (and .cse0 .cse7 .cse9 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse4 .cse9) (and .cse1 .cse10 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse7 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L264 CegarLoopResult]: At program point L493(line 493) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_free~0 0)) (.cse5 (<= ~p_dw_pc~0 0)) (.cse6 (<= 2 ~fast_clk_edge~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 2 ~slow_clk_edge~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse3) (and .cse9 .cse10 .cse2) (and .cse7 .cse9 .cse10) (and .cse0 .cse7 .cse9 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse4 .cse9) (and .cse1 .cse10 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse7 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L264 CegarLoopResult]: At program point L493-1(line 493) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_free~0 0)) (.cse5 (<= ~p_dw_pc~0 0)) (.cse6 (<= 2 ~fast_clk_edge~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 2 ~slow_clk_edge~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse3) (and .cse9 .cse10 .cse2) (and .cse7 .cse9 .cse10) (and .cse0 .cse7 .cse9 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse4 .cse9) (and .cse1 .cse10 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse7 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L264 CegarLoopResult]: At program point L489(line 489) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse4 (<= 2 ~c_dr_st~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse10 (<= ~q_free~0 0)) (.cse5 (<= ~p_dw_pc~0 0)) (.cse6 (<= 2 ~fast_clk_edge~0)) (.cse7 (= 0 ~p_dw_st~0)) (.cse8 (<= 2 ~slow_clk_edge~0)) (.cse9 (<= ~c_dr_pc~0 0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse6 .cse7 .cse8 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse9 .cse2 .cse3) (and .cse9 .cse10 .cse2) (and .cse7 .cse9 .cse10) (and .cse0 .cse7 .cse9 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse4 .cse9) (and .cse1 .cse10 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse7 .cse10) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L268 CegarLoopResult]: For program point L489-1(line 489) no Hoare annotation was computed. [2020-07-20 18:25:44,649 INFO L264 CegarLoopResult]: At program point L485(line 485) the Hoare annotation is: (let ((.cse0 (= 1 ~p_dw_pc~0)) (.cse2 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_free~0 0)) (.cse5 (<= ~c_dr_pc~0 0)) (.cse7 (<= 2 ~c_dr_st~0)) (.cse8 (<= ~p_dw_pc~0 0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse9 (<= 2 ~fast_clk_edge~0)) (.cse4 (= 0 ~p_dw_st~0)) (.cse10 (<= 2 ~slow_clk_edge~0)) (.cse3 (<= 2 ~q_write_ev~0))) (or (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse1 .cse2 .cse3) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (and .cse0 .cse1 .cse4 .cse3) (and .cse0 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse2) (and .cse4 .cse5 .cse6) (and .cse0 .cse4 .cse5 .cse3) (not (= 1 ~p_dw_i~0)) (and .cse7 .cse5) (and .cse1 .cse6 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse1 .cse4 .cse6) (not (<= 2 |old(~slow_clk_edge~0)|)) (and .cse8 .cse9 .cse4 .cse10 .cse5 .cse3) (and .cse7 .cse8 .cse1 .cse9 (<= 1 start_simulation_~tmp~4) .cse4 .cse10 .cse3) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-20 18:25:44,649 INFO L268 CegarLoopResult]: For program point L485-1(line 485) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= ~q_free~0 0)) [2020-07-20 18:25:44,650 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point L57(lines 57 62) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point L56(lines 56 65) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2020-07-20 18:25:44,650 INFO L264 CegarLoopResult]: At program point L77(lines 55 79) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_pc~0))) (let ((.cse14 (not (<= 2 ~q_read_ev~0))) (.cse6 (not .cse13)) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse2 (<= 1 ~p_dw_pc~0)) (.cse9 (not (<= 2 ~p_dw_st~0))) (.cse5 (not (<= ~q_free~0 0))) (.cse10 (not (<= ~p_dw_pc~0 0))) (.cse11 (not (<= 2 ~slow_clk_edge~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse7 (not (<= 2 ~fast_clk_edge~0))) (.cse3 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse12 (not (= ~c_dr_pc~0 1))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (<= 2 ~c_dr_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse0 .cse7 .cse3 .cse4 .cse8 .cse9) (or .cse6 .cse0 .cse7 .cse3 .cse4 .cse9 .cse5) (or .cse10 .cse0 .cse11 .cse1 .cse7 .cse3 .cse4 .cse8) (or .cse1 .cse3 .cse12 .cse4 .cse13 .cse5 .cse14) (or .cse2 .cse3 .cse12 .cse4 .cse9 .cse5) (or .cse0 .cse7 .cse3 .cse15 .cse14) (or .cse6 .cse1 .cse7 .cse3 .cse12 .cse4 .cse5) (or .cse6 .cse7 .cse3 .cse12 .cse4 .cse8 .cse9) (or .cse0 .cse3 .cse4 .cse13 .cse9 .cse5 .cse14) (or .cse6 .cse1 .cse7 .cse3 .cse12 .cse4 .cse8) (or .cse1 .cse2 .cse12 .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse3 .cse4 .cse13 .cse5 .cse14) (or .cse3 .cse12 .cse4 .cse13 .cse9 .cse5 .cse14) (or .cse6 .cse0 .cse1 .cse7 .cse3 .cse4 .cse8) (or .cse6 .cse7 .cse12 .cse3 .cse4 .cse9 .cse5) (or .cse6 .cse0 .cse1 .cse7 .cse3 .cse4 .cse5) (or .cse0 .cse2 .cse3 .cse4 .cse9 .cse5) (or .cse10 .cse11 .cse1 .cse7 .cse3 .cse12 .cse4 .cse8 .cse15)))) [2020-07-20 18:25:44,650 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point L67(lines 67 72) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: (let ((.cse9 (not (<= ~q_free~0 0))) (.cse8 (not (= ~c_dr_pc~0 1))) (.cse6 (not (<= 2 ~p_dw_st~0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (= 0 ~p_dw_st~0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse4 (<= 2 ~slow_clk_edge~0)) (.cse5 (not (<= 2 |old(~slow_clk_edge~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse2 .cse3 .cse4 .cse5) (or .cse7 .cse8 .cse2 .cse4 .cse5 .cse9) (or .cse8 .cse2 .cse4 .cse5 .cse6 .cse9) (or .cse1 .cse7 .cse2 .cse4 .cse5 .cse9) (or .cse1 .cse4 .cse5 (not (<= 2 ~c_dr_st~0))) (or .cse1 .cse2 .cse4 .cse5 .cse6 .cse9) (or .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse7 .cse2 .cse3 .cse4 .cse5))) [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point L225(lines 225 231) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point L192(lines 192 196) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2020-07-20 18:25:44,651 INFO L264 CegarLoopResult]: At program point L238(lines 185 243) the Hoare annotation is: (let ((.cse20 (<= ~q_free~0 0)) (.cse16 (<= 2 ~p_dw_st~0)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse11 (<= 1 ~q_free~0)) (.cse17 (= 1 ~p_dw_pc~0)) (.cse18 (= 1 ~p_dw_i~0)) (.cse12 (= ~c_dr_pc~0 1)) (.cse19 (= 0 ~p_dw_st~0))) (let ((.cse6 (and .cse10 .cse11 .cse17 .cse18 .cse12 .cse19)) (.cse8 (and .cse10 .cse18 .cse12 .cse20 .cse16)) (.cse5 (not (<= |old(~c_dr_pc~0)| 0))) (.cse1 (not .cse19)) (.cse7 (not (<= |old(~q_free~0)| 0))) (.cse15 (and .cse10 .cse18 .cse12 .cse19 .cse20)) (.cse0 (not .cse17)) (.cse2 (not (<= 1 |old(~q_free~0)|))) (.cse3 (not .cse18)) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse14 (and .cse10 .cse11 .cse17 .cse18 .cse12 .cse16)) (.cse13 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not .cse16))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse5 .cse8 .cse9) (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse1 (not (<= 2 ~fast_clk_edge~0)) .cse2 (and .cse10 .cse11 .cse12) .cse3 .cse4 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse14 .cse9) (or .cse7 .cse3 .cse8 .cse13 .cse9) (or .cse1 .cse7 .cse3 .cse5 .cse15) (or .cse1 .cse7 .cse3 .cse15 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse14 .cse13 .cse9)))) [2020-07-20 18:25:44,651 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (let ((.cse0 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse3 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse4 (not (= 0 ~p_dw_st~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse5) (or .cse6 .cse1 .cse7 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse2) (or .cse6 .cse1 .cse7 .cse5 .cse3) (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse4 (not (<= 2 ~fast_clk_edge~0)) .cse1 .cse7 .cse2) (or .cse6 .cse4 .cse1 .cse7 .cse5) (or .cse0 .cse1 .cse5 .cse3) (or .cse6 .cse4 .cse1 .cse7 .cse2))) [2020-07-20 18:25:44,652 INFO L268 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2020-07-20 18:25:44,652 INFO L264 CegarLoopResult]: At program point L234-1(lines 188 242) the Hoare annotation is: (let ((.cse12 (<= ~q_free~0 0)) (.cse0 (<= 1 ~q_free~0)) (.cse13 (= ~c_dr_pc~0 1))) (let ((.cse7 (and .cse0 .cse13)) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse5 (not (<= |old(~c_dr_pc~0)| 0))) (.cse10 (not (<= |old(~q_free~0)| 0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (and .cse13 .cse12)) (.cse8 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (<= 2 ~p_dw_st~0)))) (and (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse0 .cse1 (not (<= 2 ~fast_clk_edge~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9) (or .cse6 .cse0 .cse2 .cse3 .cse4 .cse5 .cse9) (or .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8) (or .cse1 .cse10 .cse3 .cse11 .cse8) (or .cse6 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse10 .cse3 .cse5 .cse12 .cse9) (or .cse1 .cse10 .cse3 .cse5 .cse12) (or .cse10 .cse3 .cse11 .cse8 .cse9)))) [2020-07-20 18:25:44,652 INFO L264 CegarLoopResult]: At program point L193(lines 188 242) the Hoare annotation is: (let ((.cse0 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse3 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse4 (not (= 0 ~p_dw_st~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse5) (or .cse6 .cse1 .cse7 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse2) (or .cse6 .cse1 .cse7 .cse5 .cse3) (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse4 (not (<= 2 ~fast_clk_edge~0)) .cse1 .cse7 .cse2) (or .cse6 .cse4 .cse1 .cse7 .cse5) (or .cse0 .cse1 .cse5 .cse3) (or .cse6 .cse4 .cse1 .cse7 .cse2))) [2020-07-20 18:25:44,652 INFO L268 CegarLoopResult]: For program point L224(lines 224 236) no Hoare annotation was computed. [2020-07-20 18:25:44,652 INFO L268 CegarLoopResult]: For program point L189(lines 189 197) no Hoare annotation was computed. [2020-07-20 18:25:44,652 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 185 243) the Hoare annotation is: (let ((.cse14 (<= ~q_free~0 0)) (.cse13 (<= ~c_dr_pc~0 0)) (.cse16 (<= 1 ~q_free~0)) (.cse15 (= ~c_dr_pc~0 1))) (let ((.cse4 (and .cse16 .cse15)) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (<= 1 |old(~q_free~0)|))) (.cse3 (not (<= 2 ~q_write_ev~0))) (.cse9 (and .cse16 .cse13)) (.cse7 (not (= 0 ~p_dw_st~0))) (.cse11 (and .cse15 .cse14)) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse10 (not (<= |old(~q_free~0)| 0))) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse12 (and .cse13 .cse14)) (.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse6 (not (<= 2 ~p_dw_st~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse8 .cse9) (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse7 (not (<= 2 ~fast_clk_edge~0)) .cse1 .cse2 .cse3 .cse8 .cse9) (or .cse0 .cse7 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse7 .cse10 .cse2 .cse11 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse8 .cse6 .cse9) (or .cse7 .cse10 .cse2 .cse12 .cse8) (or .cse10 .cse2 .cse11 .cse5 .cse6) (or .cse10 .cse2 .cse12 .cse8 .cse6)))) [2020-07-20 18:25:44,652 INFO L268 CegarLoopResult]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2020-07-20 18:25:44,652 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse0 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse3 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse4 (not (= 0 ~p_dw_st~0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= |old(~c_dr_pc~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse5) (or .cse6 .cse1 .cse7 .cse2 .cse3) (or .cse4 .cse0 .cse1 .cse2) (or .cse6 .cse1 .cse7 .cse5 .cse3) (or (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse4 (not (<= 2 ~fast_clk_edge~0)) .cse1 .cse7 .cse2) (or .cse6 .cse4 .cse1 .cse7 .cse5) (or .cse0 .cse1 .cse5 .cse3) (or .cse6 .cse4 .cse1 .cse7 .cse2))) [2020-07-20 18:25:44,652 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2020-07-20 18:25:44,653 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2020-07-20 18:25:44,653 INFO L264 CegarLoopResult]: At program point init_modelENTRY(lines 525 543) the Hoare annotation is: (or (not (= 0 ~p_dw_st~0)) (not (<= |old(~q_free~0)| 0)) (not (<= |old(~c_dr_pc~0)| 0)) (and (<= ~p_dw_pc~0 0) (<= ~c_dr_pc~0 0) (<= ~q_free~0 0) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-20 18:25:44,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:25:44 BoogieIcfgContainer [2020-07-20 18:25:44,718 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 18:25:44,720 INFO L168 Benchmark]: Toolchain (without parser) took 193223.83 ms. Allocated memory was 138.4 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 102.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,720 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.74 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 180.6 MB in the end (delta: -78.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,721 INFO L168 Benchmark]: Boogie Preprocessor took 44.63 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 177.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,722 INFO L168 Benchmark]: RCFGBuilder took 632.22 ms. Allocated memory is still 202.9 MB. Free memory was 177.9 MB in the beginning and 142.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,722 INFO L168 Benchmark]: TraceAbstraction took 192143.51 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 141.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2020-07-20 18:25:44,724 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 397.74 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 102.0 MB in the beginning and 180.6 MB in the end (delta: -78.5 MB). Peak memory consumption was 27.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.63 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 177.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 632.22 ms. Allocated memory is still 202.9 MB. Free memory was 177.9 MB in the beginning and 142.3 MB in the end (delta: 35.6 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 192143.51 ms. Allocated memory was 202.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 141.6 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.4 GB. 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: ((((((((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st)) && (((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc)))) && ((((!(1 == p_dw_pc) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st))) && (((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0))) && ((((!(1 == p_dw_pc) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st))) && ((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0))) && ((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc)))) && (((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st))) && ((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(c_dr_pc <= 0) || !(0 == p_dw_st)) || 1 <= p_dw_pc) || 0 == __retres1) || !(1 == p_dw_i)) || !(q_free <= 0)) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st))) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0))) && (((((((!(p_dw_pc <= 0) || !(c_dr_pc <= 0)) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && ((((((!(0 == p_dw_st) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((1 <= p_dw_pc || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0))) && ((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(q_free <= 0))) && ((((((!(1 == p_dw_pc) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= p_dw_st))) && ((((((!(c_dr_pc <= 0) || 0 == __retres1) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && (((((!(0 == p_dw_st) || 1 <= p_dw_pc) || !(c_dr_pc == 1)) || 0 == __retres1) || !(1 == p_dw_i)) || !(q_free <= 0))) && ((((((!(c_dr_pc <= 0) || !(0 == p_dw_st)) || 0 == __retres1) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(q_free <= 0)) || !(2 <= q_read_ev))) && ((((((0 == __retres1 || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && ((((((!(1 == p_dw_pc) || !(2 <= fast_clk_edge)) || !(c_dr_pc == 1)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0))) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(q_free <= 0))) && (((((!(c_dr_pc <= 0) || 1 <= p_dw_pc) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0))) && ((((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((1 <= \old(p_dw_pc) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 == p_dw_pc) || !(\old(c_dr_pc) <= 0)) || 0 == p_dw_st) && (((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(1 == \old(c_dr_pc)))) && (((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((c_dr_pc <= 0 && q_free <= 0) && 2 <= p_dw_st) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0))) && (((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && ((((((((((c_dr_pc <= 0 && q_free <= 0) && 2 <= p_dw_st) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 0 == p_dw_st) && c_dr_pc <= 0) && q_free <= 0)) || ((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0))) && (((((((!(1 == \old(p_dw_pc)) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st))) && ((((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && ((((((!(0 == \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0)) || (((1 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= \old(p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((((((((2 <= c_dr_st && 1 <= q_free) && p_dw_pc <= 0) && c_dr_pc == 1) && 0 == p_dw_st) || !(2 <= slow_clk_edge)) || (((((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= slow_clk_edge) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= fast_clk_edge)) || !(0 == \old(p_dw_st))) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((1 <= q_free && p_dw_pc <= 0) && 0 == p_dw_st) && c_dr_pc <= 0)) || !(\old(p_dw_pc) <= 0))) && ((((((((((((((2 <= c_dr_st && 1 <= q_free) && p_dw_pc <= 0) && c_dr_pc == 1) && 0 == p_dw_st) || !(2 <= slow_clk_edge)) || (((((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= slow_clk_edge) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= fast_clk_edge)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) <= 0))) && (((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(\old(c_dr_pc) <= 0))) && (((((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st))) && (((((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= q_free && 1 == p_dw_pc) && 0 == p_dw_st) && c_dr_pc <= 0))) && ((((!(2 <= \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0))) && (((2 <= c_dr_st && c_dr_pc <= 0) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((!(0 == \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0))) && (((((((((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && 2 <= p_dw_st) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc)))) && ((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || (((1 <= \old(p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((!(c_dr_pc <= 0) || ((1 <= \old(p_dw_pc) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((1 == p_dw_pc && q_free <= 0) && 2 <= p_dw_st)) && (((((!(1 == \old(p_dw_pc)) || !(1 <= \old(q_free))) || !(c_dr_pc == 1)) || ((1 == p_dw_pc && q_free <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && (((((!(c_dr_pc <= 0) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((1 == p_dw_pc && q_free <= 0) && 2 <= p_dw_st))) && (((((((!(c_dr_pc <= 0) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || ((1 <= q_free && 1 == p_dw_pc) && 2 <= p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(p_dw_pc) <= 0))) && ((((((1 <= \old(p_dw_pc) && q_free <= 0) && 2 <= p_dw_st) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || ((1 == p_dw_pc && q_free <= 0) && 2 <= p_dw_st))) && ((((((((!(2 <= slow_clk_edge) || !(2 <= fast_clk_edge)) || ((1 <= q_free && 1 == p_dw_pc) && 2 <= p_dw_st)) || !(1 <= \old(q_free))) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || 1 <= q_free) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) && ((((((!(1 == p_dw_pc) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (1 <= q_free && c_dr_pc == 1)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st))) && ((((((!(1 == p_dw_pc) || 1 <= q_free) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (1 <= q_free && c_dr_pc == 1)) || !(1 == \old(c_dr_pc)))) && ((((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (c_dr_pc == 1 && q_free <= 0)) || !(1 == \old(c_dr_pc)))) && ((((((!(1 == p_dw_pc) || 1 <= q_free) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0))) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || q_free <= 0) || !(2 <= p_dw_st))) && ((((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || q_free <= 0)) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || (c_dr_pc == 1 && q_free <= 0)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((!(c_dr_pc <= 0) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((1 <= \old(p_dw_pc) || p_dw_pc < 1) && q_free <= 0)) && ((((((((!(2 <= slow_clk_edge) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) || ((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 1 <= q_free))) && (((((((!(c_dr_pc <= 0) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(p_dw_pc) <= 0)) || ((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 1 <= q_free))) && ((((!(1 == \old(p_dw_pc)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || q_free <= 0)) && ((((!(c_dr_pc <= 0) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || q_free <= 0)) && (((!(\old(q_free) <= 0) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || ((1 <= \old(p_dw_pc) || p_dw_pc < 1) && q_free <= 0)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(2 <= slow_clk_edge) || !(2 <= fast_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) && ((((1 <= \old(p_dw_pc) && 1 == p_dw_pc) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i))) && (((!(c_dr_pc <= 0) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((1 <= \old(p_dw_pc) && 1 == p_dw_pc) && q_free <= 0))) && ((((((1 <= q_free && 1 == p_dw_pc) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && (((((!(c_dr_pc <= 0) || (1 <= q_free && 1 == p_dw_pc)) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev))) && (((((!(c_dr_pc <= 0) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(p_dw_pc) <= 0)) - InvariantResult [Line: 478]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(0 == \old(p_dw_st)) || !(1 <= \old(q_free))) || (((1 == p_dw_pc && c_dr_pc == 1) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || !(2 <= \old(fast_clk_edge))) || (((1 == p_dw_pc && c_dr_pc == 1) && 0 == p_dw_st) && 2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((c_dr_pc <= 0 && q_free <= 0) && 2 <= p_dw_st)) || ((0 == p_dw_st && c_dr_pc <= 0) && q_free <= 0)) || (((1 == p_dw_pc && 0 == p_dw_st) && c_dr_pc <= 0) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || (2 <= c_dr_st && c_dr_pc <= 0)) || ((c_dr_pc == 1 && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((c_dr_pc == 1 && 0 == p_dw_st) && q_free <= 0)) || !(2 <= \old(slow_clk_edge))) || (((((p_dw_pc <= 0 && 2 <= fast_clk_edge) && 0 == p_dw_st) && 2 <= slow_clk_edge) && c_dr_pc <= 0) && 2 <= q_write_ev)) || (((((((2 <= c_dr_st && p_dw_pc <= 0) && c_dr_pc == 1) && 2 <= fast_clk_edge) && 1 <= tmp) && 0 == p_dw_st) && 2 <= slow_clk_edge) && 2 <= q_write_ev)) || !(2 <= \old(q_read_ev)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: ((((((((!(0 == p_dw_st) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(q_free <= 0)) && ((((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(2 <= c_dr_st))) && (((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1)) && (((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1)) && (((((((!(p_dw_pc <= 0) || !(c_dr_pc <= 0)) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1)) && ((((!(c_dr_pc <= 0) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(q_free <= 0)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((!(2 <= slow_clk_edge) || !(2 <= fast_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) && ((((1 <= \old(p_dw_pc) && q_free <= 0) || !(c_dr_pc <= 0)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i))) && (((((!(c_dr_pc <= 0) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(p_dw_pc) <= 0))) && (((1 <= \old(p_dw_pc) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((1 <= \old(p_dw_pc) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 == p_dw_pc && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 0 == p_dw_st) && c_dr_pc <= 0) && q_free <= 0)) || ((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0)) && (((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(1 == \old(c_dr_pc)))) && (((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && (((((((!(1 == \old(p_dw_pc)) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st))) && ((((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc)))) && (((((((!(0 == \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || ((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0))) && ((((((!(0 == \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0)) || (((1 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= \old(p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((((((((2 <= c_dr_st && 1 <= q_free) && p_dw_pc <= 0) && c_dr_pc == 1) && 0 == p_dw_st) || !(2 <= slow_clk_edge)) || (((((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= slow_clk_edge) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= fast_clk_edge)) || !(0 == \old(p_dw_st))) || (((1 <= q_free && 1 == p_dw_pc) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((1 <= q_free && p_dw_pc <= 0) && 0 == p_dw_st) && c_dr_pc <= 0)) || !(\old(p_dw_pc) <= 0))) && ((((((((((((((2 <= c_dr_st && 1 <= q_free) && p_dw_pc <= 0) && c_dr_pc == 1) && 0 == p_dw_st) || !(2 <= slow_clk_edge)) || (((((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= slow_clk_edge) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= fast_clk_edge)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(\old(p_dw_pc) <= 0))) && (((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || !(\old(c_dr_pc) <= 0))) && (((((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((1 <= q_free && 1 == p_dw_pc) && 0 == p_dw_st) && c_dr_pc <= 0))) && (((((((!(1 == \old(p_dw_pc)) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || (((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st))) && ((((!(2 <= \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc)))) && (((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || ((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0))) && (((2 <= c_dr_st && c_dr_pc <= 0) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((1 <= \old(p_dw_pc) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || 1 == p_dw_pc) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0))) && (((((((((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && 2 <= p_dw_st) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc)))) && ((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || 1 == p_dw_pc) || (((1 <= \old(p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: (((((((((((((!(c_dr_pc <= 0) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 0 == __retres1) || !(q_free <= 0)) && ((!(c_dr_pc <= 0) || 0 == __retres1) || !(2 <= c_dr_st))) && (((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1) || !(2 <= p_dw_st))) && (((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1)) && (((((!(2 <= slow_clk_edge) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 0 == __retres1) || !(q_free <= 0))) && ((((((!(1 == p_dw_pc) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1) || !(2 <= p_dw_st))) && ((((!(c_dr_pc <= 0) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(q_free <= 0))) && ((((((!(1 == p_dw_pc) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1)) && ((((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= c_dr_st)) || 0 == __retres1)) && (((((((!(p_dw_pc <= 0) || !(c_dr_pc <= 0)) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1)) && (((((!(2 <= slow_clk_edge) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(q_free <= 0)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= p_dw_st))) && ((((((((!(p_dw_pc <= 0) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || ((2 <= c_dr_st && 1 <= q_free) && c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st)) || !(1 == \old(c_dr_pc)))) && ((((((!(1 == p_dw_pc) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st)) || !(2 <= p_dw_st))) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || ((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st))) && ((((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0))) && ((((!(0 == p_dw_st) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0)) || !(1 == \old(c_dr_pc)))) && ((((((!(1 == p_dw_pc) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.4s, OverallIterations: 17, TraceHistogramMax: 5, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 164.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4007 SDtfs, 2557 SDslu, 4282 SDs, 0 SdLazy, 1287 SolverSat, 311 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2521 GetRequests, 2471 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37909occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 6364 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 69732 PreInvPairs, 79874 NumberOfFragments, 14338 HoareAnnotationTreeSize, 69732 FomulaSimplifications, 282175 FormulaSimplificationTreeSizeReduction, 27.4s HoareSimplificationTime, 63 FomulaSimplificationsInter, 607199 FormulaSimplificationTreeSizeReductionInter, 135.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2333 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 2512 ConstructedInterpolants, 0 QuantifiedInterpolants, 548512 SizeOfPredicates, 17 NumberOfNonLiveVariables, 8404 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 1100/1104 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...