/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 BIGGEST_EQUIVALENCE_CLASS --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-21 23:45:45,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 23:45:45,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 23:45:45,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 23:45:45,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 23:45:45,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 23:45:45,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 23:45:45,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 23:45:45,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 23:45:45,324 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 23:45:45,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 23:45:45,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 23:45:45,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 23:45:45,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 23:45:45,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 23:45:45,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 23:45:45,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 23:45:45,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 23:45:45,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 23:45:45,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 23:45:45,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 23:45:45,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 23:45:45,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 23:45:45,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 23:45:45,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 23:45:45,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 23:45:45,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 23:45:45,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 23:45:45,349 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 23:45:45,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 23:45:45,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 23:45:45,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 23:45:45,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 23:45:45,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 23:45:45,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 23:45:45,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 23:45:45,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 23:45:45,359 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 23:45:45,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 23:45:45,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 23:45:45,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 23:45:45,363 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-21 23:45:45,386 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 23:45:45,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 23:45:45,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 23:45:45,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 23:45:45,389 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 23:45:45,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 23:45:45,390 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 23:45:45,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 23:45:45,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 23:45:45,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 23:45:45,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 23:45:45,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 23:45:45,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 23:45:45,392 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 23:45:45,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 23:45:45,392 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 23:45:45,392 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 23:45:45,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 23:45:45,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 23:45:45,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 23:45:45,393 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 23:45:45,393 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 23:45:45,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 23:45:45,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 23:45:45,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 23:45:45,394 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 23:45:45,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:45,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 23:45:45,395 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 23:45:45,395 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 -> BIGGEST_EQUIVALENCE_CLASS 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-21 23:45:45,675 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 23:45:45,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 23:45:45,694 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 23:45:45,696 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 23:45:45,696 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 23:45:45,697 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-21 23:45:45,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b63d708/a8459b7e7ea54c3fa861aba411e882d1/FLAG25add123f [2020-07-21 23:45:46,234 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 23:45:46,237 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/pc_sfifo_3.cil.c [2020-07-21 23:45:46,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b63d708/a8459b7e7ea54c3fa861aba411e882d1/FLAG25add123f [2020-07-21 23:45:46,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66b63d708/a8459b7e7ea54c3fa861aba411e882d1 [2020-07-21 23:45:46,604 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 23:45:46,606 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 23:45:46,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 23:45:46,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 23:45:46,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 23:45:46,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:45:46" (1/1) ... [2020-07-21 23:45:46,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd78fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:46, skipping insertion in model container [2020-07-21 23:45:46,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 11:45:46" (1/1) ... [2020-07-21 23:45:46,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 23:45:46,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 23:45:46,875 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:45:46,882 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 23:45:47,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 23:45:47,096 INFO L208 MainTranslator]: Completed translation [2020-07-21 23:45:47,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47 WrapperNode [2020-07-21 23:45:47,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 23:45:47,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 23:45:47,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 23:45:47,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 23:45:47,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (1/1) ... [2020-07-21 23:45:47,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 23:45:47,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 23:45:47,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 23:45:47,145 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 23:45:47,146 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (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-21 23:45:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 23:45:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 23:45:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-07-21 23:45:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure update_fifo_q [2020-07-21 23:45:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2020-07-21 23:45:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2020-07-21 23:45:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2020-07-21 23:45:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure do_write_p [2020-07-21 23:45:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure do_read_c [2020-07-21 23:45:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-07-21 23:45:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-07-21 23:45:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-07-21 23:45:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-07-21 23:45:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-07-21 23:45:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-07-21 23:45:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-07-21 23:45:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-07-21 23:45:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-07-21 23:45:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-07-21 23:45:47,219 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-07-21 23:45:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-07-21 23:45:47,220 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 23:45:47,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 23:45:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 23:45:47,221 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-07-21 23:45:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure update_fifo_q [2020-07-21 23:45:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2020-07-21 23:45:47,222 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure do_write_p [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure do_read_c [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-07-21 23:45:47,223 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-07-21 23:45:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-07-21 23:45:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-07-21 23:45:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-07-21 23:45:47,224 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-07-21 23:45:47,225 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-07-21 23:45:47,225 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-07-21 23:45:47,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 23:45:47,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 23:45:47,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 23:45:47,742 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-21 23:45:47,743 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !(1 == ~q_free~0); [2020-07-21 23:45:47,762 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 23:45:47,762 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-21 23:45:47,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:45:47 BoogieIcfgContainer [2020-07-21 23:45:47,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 23:45:47,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 23:45:47,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 23:45:47,778 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 23:45:47,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 11:45:46" (1/3) ... [2020-07-21 23:45:47,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800c8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:45:47, skipping insertion in model container [2020-07-21 23:45:47,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 11:45:47" (2/3) ... [2020-07-21 23:45:47,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4800c8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 11:45:47, skipping insertion in model container [2020-07-21 23:45:47,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 11:45:47" (3/3) ... [2020-07-21 23:45:47,784 INFO L109 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2020-07-21 23:45:47,798 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 23:45:47,812 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 23:45:47,828 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 23:45:47,869 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 23:45:47,870 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 23:45:47,870 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 23:45:47,870 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 23:45:47,870 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 23:45:47,870 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 23:45:47,871 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 23:45:47,871 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 23:45:47,902 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2020-07-21 23:45:47,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-07-21 23:45:47,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:47,916 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-21 23:45:47,916 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:47,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1427944937, now seen corresponding path program 1 times [2020-07-21 23:45:47,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:47,929 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051814320] [2020-07-21 23:45:47,930 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-21 23:45:48,134 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:48,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:48,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:45:48,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:48,241 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-21 23:45:48,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:48,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051814320] [2020-07-21 23:45:48,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:48,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:48,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805803907] [2020-07-21 23:45:48,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:48,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:48,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:48,269 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 3 states. [2020-07-21 23:45:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:48,378 INFO L93 Difference]: Finished difference Result 397 states and 561 transitions. [2020-07-21 23:45:48,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:48,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2020-07-21 23:45:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:48,428 INFO L225 Difference]: With dead ends: 397 [2020-07-21 23:45:48,428 INFO L226 Difference]: Without dead ends: 254 [2020-07-21 23:45:48,434 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-21 23:45:48,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2020-07-21 23:45:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2020-07-21 23:45:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2020-07-21 23:45:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 329 transitions. [2020-07-21 23:45:48,506 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 329 transitions. Word has length 78 [2020-07-21 23:45:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:48,507 INFO L479 AbstractCegarLoop]: Abstraction has 248 states and 329 transitions. [2020-07-21 23:45:48,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:48,507 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 329 transitions. [2020-07-21 23:45:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-21 23:45:48,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:48,512 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-21 23:45:48,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:48,726 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:48,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:48,728 INFO L82 PathProgramCache]: Analyzing trace with hash -221043853, now seen corresponding path program 1 times [2020-07-21 23:45:48,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:48,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [311925203] [2020-07-21 23:45:48,731 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-21 23:45:48,872 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:48,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:48,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:45:48,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:48,931 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-21 23:45:48,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:48,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [311925203] [2020-07-21 23:45:48,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:48,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 23:45:48,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615756874] [2020-07-21 23:45:48,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:45:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:45:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 23:45:48,937 INFO L87 Difference]: Start difference. First operand 248 states and 329 transitions. Second operand 5 states. [2020-07-21 23:45:49,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:49,755 INFO L93 Difference]: Finished difference Result 761 states and 1051 transitions. [2020-07-21 23:45:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:49,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2020-07-21 23:45:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:49,763 INFO L225 Difference]: With dead ends: 761 [2020-07-21 23:45:49,763 INFO L226 Difference]: Without dead ends: 532 [2020-07-21 23:45:49,767 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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-21 23:45:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-07-21 23:45:49,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 491. [2020-07-21 23:45:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2020-07-21 23:45:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 657 transitions. [2020-07-21 23:45:49,840 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 657 transitions. Word has length 79 [2020-07-21 23:45:49,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:49,840 INFO L479 AbstractCegarLoop]: Abstraction has 491 states and 657 transitions. [2020-07-21 23:45:49,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:45:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 657 transitions. [2020-07-21 23:45:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-21 23:45:49,851 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:49,851 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-21 23:45:50,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:50,066 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash -689842193, now seen corresponding path program 1 times [2020-07-21 23:45:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:50,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [764862651] [2020-07-21 23:45:50,068 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-21 23:45:50,180 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:50,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:50,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 23:45:50,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:50,246 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-21 23:45:50,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:50,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [764862651] [2020-07-21 23:45:50,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:50,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 23:45:50,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396156801] [2020-07-21 23:45:50,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:45:50,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:50,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:45:50,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 23:45:50,251 INFO L87 Difference]: Start difference. First operand 491 states and 657 transitions. Second operand 5 states. [2020-07-21 23:45:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:50,929 INFO L93 Difference]: Finished difference Result 1543 states and 2163 transitions. [2020-07-21 23:45:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:50,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2020-07-21 23:45:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:50,947 INFO L225 Difference]: With dead ends: 1543 [2020-07-21 23:45:50,947 INFO L226 Difference]: Without dead ends: 1077 [2020-07-21 23:45:50,952 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 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-21 23:45:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2020-07-21 23:45:51,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 995. [2020-07-21 23:45:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2020-07-21 23:45:51,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1345 transitions. [2020-07-21 23:45:51,082 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1345 transitions. Word has length 79 [2020-07-21 23:45:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:51,085 INFO L479 AbstractCegarLoop]: Abstraction has 995 states and 1345 transitions. [2020-07-21 23:45:51,086 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:45:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1345 transitions. [2020-07-21 23:45:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-21 23:45:51,094 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:51,095 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-21 23:45:51,308 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:51,309 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1957278451, now seen corresponding path program 1 times [2020-07-21 23:45:51,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:51,311 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675442104] [2020-07-21 23:45:51,312 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-21 23:45:51,408 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:45:51,409 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:51,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 23:45:51,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:51,447 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-21 23:45:51,447 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:51,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675442104] [2020-07-21 23:45:51,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:51,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:45:51,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459901019] [2020-07-21 23:45:51,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:45:51,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:51,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:45:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:45:51,449 INFO L87 Difference]: Start difference. First operand 995 states and 1345 transitions. Second operand 6 states. [2020-07-21 23:45:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:51,527 INFO L93 Difference]: Finished difference Result 2009 states and 2729 transitions. [2020-07-21 23:45:51,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:51,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2020-07-21 23:45:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:51,535 INFO L225 Difference]: With dead ends: 2009 [2020-07-21 23:45:51,535 INFO L226 Difference]: Without dead ends: 1055 [2020-07-21 23:45:51,539 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 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-21 23:45:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2020-07-21 23:45:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 1025. [2020-07-21 23:45:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2020-07-21 23:45:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1373 transitions. [2020-07-21 23:45:51,616 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1373 transitions. Word has length 79 [2020-07-21 23:45:51,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:51,616 INFO L479 AbstractCegarLoop]: Abstraction has 1025 states and 1373 transitions. [2020-07-21 23:45:51,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:45:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1373 transitions. [2020-07-21 23:45:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-07-21 23:45:51,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:51,619 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-21 23:45:51,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:51,833 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:51,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2089542351, now seen corresponding path program 1 times [2020-07-21 23:45:51,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:51,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1201614650] [2020-07-21 23:45:51,834 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-21 23:45:51,929 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:51,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:51,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:45:51,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:51,956 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-21 23:45:51,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:51,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1201614650] [2020-07-21 23:45:51,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:51,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:51,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051453953] [2020-07-21 23:45:51,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:51,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:51,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:51,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:51,959 INFO L87 Difference]: Start difference. First operand 1025 states and 1373 transitions. Second operand 3 states. [2020-07-21 23:45:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:52,061 INFO L93 Difference]: Finished difference Result 2989 states and 4028 transitions. [2020-07-21 23:45:52,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:52,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2020-07-21 23:45:52,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:52,075 INFO L225 Difference]: With dead ends: 2989 [2020-07-21 23:45:52,083 INFO L226 Difference]: Without dead ends: 2005 [2020-07-21 23:45:52,088 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-21 23:45:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2020-07-21 23:45:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2001. [2020-07-21 23:45:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2001 states. [2020-07-21 23:45:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2665 transitions. [2020-07-21 23:45:52,197 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2665 transitions. Word has length 79 [2020-07-21 23:45:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:52,198 INFO L479 AbstractCegarLoop]: Abstraction has 2001 states and 2665 transitions. [2020-07-21 23:45:52,198 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:52,198 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2665 transitions. [2020-07-21 23:45:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-21 23:45:52,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:52,206 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-21 23:45:52,419 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:52,420 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:52,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1632159340, now seen corresponding path program 1 times [2020-07-21 23:45:52,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:52,421 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1293321511] [2020-07-21 23:45:52,421 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-21 23:45:52,511 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:45:52,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:52,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-21 23:45:52,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:52,553 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-21 23:45:52,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:52,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1293321511] [2020-07-21 23:45:52,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:52,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:45:52,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758331908] [2020-07-21 23:45:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:45:52,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:45:52,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:45:52,556 INFO L87 Difference]: Start difference. First operand 2001 states and 2665 transitions. Second operand 6 states. [2020-07-21 23:45:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:52,691 INFO L93 Difference]: Finished difference Result 4045 states and 5401 transitions. [2020-07-21 23:45:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 23:45:52,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2020-07-21 23:45:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:52,705 INFO L225 Difference]: With dead ends: 4045 [2020-07-21 23:45:52,705 INFO L226 Difference]: Without dead ends: 2085 [2020-07-21 23:45:52,711 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-21 23:45:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2020-07-21 23:45:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2061. [2020-07-21 23:45:52,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2020-07-21 23:45:52,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2721 transitions. [2020-07-21 23:45:52,825 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2721 transitions. Word has length 80 [2020-07-21 23:45:52,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:52,826 INFO L479 AbstractCegarLoop]: Abstraction has 2061 states and 2721 transitions. [2020-07-21 23:45:52,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:45:52,826 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2721 transitions. [2020-07-21 23:45:52,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-21 23:45:52,829 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:52,829 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-21 23:45:53,042 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:53,043 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:53,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:53,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1704545898, now seen corresponding path program 1 times [2020-07-21 23:45:53,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:53,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1947637497] [2020-07-21 23:45:53,045 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-21 23:45:53,156 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:45:53,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:53,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:45:53,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:53,172 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-21 23:45:53,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:53,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1947637497] [2020-07-21 23:45:53,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:53,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850511846] [2020-07-21 23:45:53,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:53,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:53,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:53,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:53,174 INFO L87 Difference]: Start difference. First operand 2061 states and 2721 transitions. Second operand 3 states. [2020-07-21 23:45:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:53,342 INFO L93 Difference]: Finished difference Result 5925 states and 7986 transitions. [2020-07-21 23:45:53,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:53,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2020-07-21 23:45:53,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:53,368 INFO L225 Difference]: With dead ends: 5925 [2020-07-21 23:45:53,368 INFO L226 Difference]: Without dead ends: 3909 [2020-07-21 23:45:53,377 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-21 23:45:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3909 states. [2020-07-21 23:45:53,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3909 to 3905. [2020-07-21 23:45:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3905 states. [2020-07-21 23:45:53,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3905 states to 3905 states and 5208 transitions. [2020-07-21 23:45:53,644 INFO L78 Accepts]: Start accepts. Automaton has 3905 states and 5208 transitions. Word has length 80 [2020-07-21 23:45:53,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:53,645 INFO L479 AbstractCegarLoop]: Abstraction has 3905 states and 5208 transitions. [2020-07-21 23:45:53,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3905 states and 5208 transitions. [2020-07-21 23:45:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-07-21 23:45:53,648 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:53,648 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-21 23:45:53,863 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:53,864 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 683659270, now seen corresponding path program 1 times [2020-07-21 23:45:53,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:53,865 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2044566802] [2020-07-21 23:45:53,865 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-21 23:45:53,979 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:45:53,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:53,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:45:53,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:54,013 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-21 23:45:54,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:54,014 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2044566802] [2020-07-21 23:45:54,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:54,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:54,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120799618] [2020-07-21 23:45:54,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:54,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:54,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:54,016 INFO L87 Difference]: Start difference. First operand 3905 states and 5208 transitions. Second operand 3 states. [2020-07-21 23:45:54,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:54,359 INFO L93 Difference]: Finished difference Result 11205 states and 15235 transitions. [2020-07-21 23:45:54,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:54,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2020-07-21 23:45:54,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:54,407 INFO L225 Difference]: With dead ends: 11205 [2020-07-21 23:45:54,408 INFO L226 Difference]: Without dead ends: 7361 [2020-07-21 23:45:54,430 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-21 23:45:54,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7361 states. [2020-07-21 23:45:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7361 to 7297. [2020-07-21 23:45:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7297 states. [2020-07-21 23:45:54,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7297 states to 7297 states and 9732 transitions. [2020-07-21 23:45:54,978 INFO L78 Accepts]: Start accepts. Automaton has 7297 states and 9732 transitions. Word has length 81 [2020-07-21 23:45:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:54,978 INFO L479 AbstractCegarLoop]: Abstraction has 7297 states and 9732 transitions. [2020-07-21 23:45:54,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 7297 states and 9732 transitions. [2020-07-21 23:45:54,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-21 23:45:54,984 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:54,984 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-21 23:45:55,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:55,200 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:55,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1401975374, now seen corresponding path program 1 times [2020-07-21 23:45:55,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:55,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [733516363] [2020-07-21 23:45:55,203 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-21 23:45:55,348 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 23:45:55,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:55,350 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:45:55,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-21 23:45:55,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:55,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [733516363] [2020-07-21 23:45:55,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:55,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:55,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91328629] [2020-07-21 23:45:55,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:55,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:55,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:55,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:55,368 INFO L87 Difference]: Start difference. First operand 7297 states and 9732 transitions. Second operand 3 states. [2020-07-21 23:45:55,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:55,688 INFO L93 Difference]: Finished difference Result 14527 states and 19351 transitions. [2020-07-21 23:45:55,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:55,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-07-21 23:45:55,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:55,752 INFO L225 Difference]: With dead ends: 14527 [2020-07-21 23:45:55,752 INFO L226 Difference]: Without dead ends: 7273 [2020-07-21 23:45:55,784 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-21 23:45:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7273 states. [2020-07-21 23:45:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7273 to 7273. [2020-07-21 23:45:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2020-07-21 23:45:56,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 9681 transitions. [2020-07-21 23:45:56,251 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 9681 transitions. Word has length 101 [2020-07-21 23:45:56,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:56,252 INFO L479 AbstractCegarLoop]: Abstraction has 7273 states and 9681 transitions. [2020-07-21 23:45:56,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 9681 transitions. [2020-07-21 23:45:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-21 23:45:56,257 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:56,257 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-21 23:45:56,471 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:56,472 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:56,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:56,472 INFO L82 PathProgramCache]: Analyzing trace with hash 477155572, now seen corresponding path program 1 times [2020-07-21 23:45:56,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:56,473 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1665122156] [2020-07-21 23:45:56,473 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-21 23:45:56,581 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 23:45:56,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:56,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 23:45:56,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:56,608 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-21 23:45:56,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:56,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1665122156] [2020-07-21 23:45:56,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:56,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:56,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592800181] [2020-07-21 23:45:56,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:56,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:56,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:56,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:56,612 INFO L87 Difference]: Start difference. First operand 7273 states and 9681 transitions. Second operand 3 states. [2020-07-21 23:45:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:57,202 INFO L93 Difference]: Finished difference Result 21169 states and 28604 transitions. [2020-07-21 23:45:57,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:57,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2020-07-21 23:45:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:57,285 INFO L225 Difference]: With dead ends: 21169 [2020-07-21 23:45:57,285 INFO L226 Difference]: Without dead ends: 10689 [2020-07-21 23:45:57,321 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-21 23:45:57,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2020-07-21 23:45:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 10689. [2020-07-21 23:45:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10689 states. [2020-07-21 23:45:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10689 states to 10689 states and 14252 transitions. [2020-07-21 23:45:57,943 INFO L78 Accepts]: Start accepts. Automaton has 10689 states and 14252 transitions. Word has length 101 [2020-07-21 23:45:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:45:57,946 INFO L479 AbstractCegarLoop]: Abstraction has 10689 states and 14252 transitions. [2020-07-21 23:45:57,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:45:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 10689 states and 14252 transitions. [2020-07-21 23:45:57,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-07-21 23:45:57,985 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:45:57,985 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-21 23:45:58,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:45:58,200 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:45:58,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:45:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 694113001, now seen corresponding path program 1 times [2020-07-21 23:45:58,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:45:58,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [587547081] [2020-07-21 23:45:58,202 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-21 23:45:58,316 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 23:45:58,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:45:58,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 23:45:58,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:45:58,364 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-21 23:45:58,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:45:58,365 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [587547081] [2020-07-21 23:45:58,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:45:58,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:45:58,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235640107] [2020-07-21 23:45:58,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:45:58,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:45:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:45:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:45:58,367 INFO L87 Difference]: Start difference. First operand 10689 states and 14252 transitions. Second operand 3 states. [2020-07-21 23:45:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:45:59,030 INFO L93 Difference]: Finished difference Result 29513 states and 40119 transitions. [2020-07-21 23:45:59,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:45:59,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-07-21 23:45:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:45:59,126 INFO L225 Difference]: With dead ends: 29513 [2020-07-21 23:45:59,126 INFO L226 Difference]: Without dead ends: 18861 [2020-07-21 23:45:59,161 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-21 23:45:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18861 states. [2020-07-21 23:46:00,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18861 to 18717. [2020-07-21 23:46:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18717 states. [2020-07-21 23:46:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18717 states to 18717 states and 25046 transitions. [2020-07-21 23:46:00,702 INFO L78 Accepts]: Start accepts. Automaton has 18717 states and 25046 transitions. Word has length 185 [2020-07-21 23:46:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:00,702 INFO L479 AbstractCegarLoop]: Abstraction has 18717 states and 25046 transitions. [2020-07-21 23:46:00,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:46:00,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18717 states and 25046 transitions. [2020-07-21 23:46:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2020-07-21 23:46:00,735 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:00,735 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-21 23:46:00,949 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:00,950 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:00,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:00,950 INFO L82 PathProgramCache]: Analyzing trace with hash 544229803, now seen corresponding path program 1 times [2020-07-21 23:46:00,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:00,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [82314087] [2020-07-21 23:46:00,951 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-21 23:46:01,050 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 23:46:01,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:01,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-21 23:46:01,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:01,088 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-21 23:46:01,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:01,089 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [82314087] [2020-07-21 23:46:01,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:01,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:46:01,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30923521] [2020-07-21 23:46:01,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:46:01,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:01,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:46:01,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:46:01,091 INFO L87 Difference]: Start difference. First operand 18717 states and 25046 transitions. Second operand 3 states. [2020-07-21 23:46:01,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:01,769 INFO L93 Difference]: Finished difference Result 35929 states and 48451 transitions. [2020-07-21 23:46:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:46:01,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2020-07-21 23:46:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:01,848 INFO L225 Difference]: With dead ends: 35929 [2020-07-21 23:46:01,848 INFO L226 Difference]: Without dead ends: 18853 [2020-07-21 23:46:01,880 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-21 23:46:01,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18853 states. [2020-07-21 23:46:02,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18853 to 18749. [2020-07-21 23:46:02,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18749 states. [2020-07-21 23:46:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 24833 transitions. [2020-07-21 23:46:02,805 INFO L78 Accepts]: Start accepts. Automaton has 18749 states and 24833 transitions. Word has length 185 [2020-07-21 23:46:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:02,806 INFO L479 AbstractCegarLoop]: Abstraction has 18749 states and 24833 transitions. [2020-07-21 23:46:02,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:46:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 18749 states and 24833 transitions. [2020-07-21 23:46:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2020-07-21 23:46:02,838 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:02,838 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-21 23:46:03,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:03,054 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:03,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1137748563, now seen corresponding path program 1 times [2020-07-21 23:46:03,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:03,055 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1122786044] [2020-07-21 23:46:03,056 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-21 23:46:03,184 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:46:03,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:03,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-21 23:46:03,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:03,225 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-21 23:46:03,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:03,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1122786044] [2020-07-21 23:46:03,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:03,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:46:03,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432096459] [2020-07-21 23:46:03,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:46:03,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:46:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:46:03,229 INFO L87 Difference]: Start difference. First operand 18749 states and 24833 transitions. Second operand 3 states. [2020-07-21 23:46:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:04,287 INFO L93 Difference]: Finished difference Result 37473 states and 50175 transitions. [2020-07-21 23:46:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:46:04,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2020-07-21 23:46:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:04,364 INFO L225 Difference]: With dead ends: 37473 [2020-07-21 23:46:04,365 INFO L226 Difference]: Without dead ends: 18753 [2020-07-21 23:46:04,416 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-21 23:46:04,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18753 states. [2020-07-21 23:46:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18753 to 18749. [2020-07-21 23:46:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18749 states. [2020-07-21 23:46:05,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18749 states to 18749 states and 23953 transitions. [2020-07-21 23:46:05,254 INFO L78 Accepts]: Start accepts. Automaton has 18749 states and 23953 transitions. Word has length 194 [2020-07-21 23:46:05,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:05,255 INFO L479 AbstractCegarLoop]: Abstraction has 18749 states and 23953 transitions. [2020-07-21 23:46:05,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:46:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 18749 states and 23953 transitions. [2020-07-21 23:46:05,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-07-21 23:46:05,290 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:05,290 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-21 23:46:05,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:05,507 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:05,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:05,507 INFO L82 PathProgramCache]: Analyzing trace with hash 633321779, now seen corresponding path program 1 times [2020-07-21 23:46:05,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:05,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [117045986] [2020-07-21 23:46:05,508 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-21 23:46:05,627 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:46:05,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:05,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:46:05,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:05,814 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-21 23:46:05,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 23:46:05,990 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:46:05,993 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:46:06,012 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 23:46:06,081 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-21 23:46:06,082 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [117045986] [2020-07-21 23:46:06,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-21 23:46:06,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2020-07-21 23:46:06,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361290577] [2020-07-21 23:46:06,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:46:06,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:46:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:46:06,084 INFO L87 Difference]: Start difference. First operand 18749 states and 23953 transitions. Second operand 5 states. [2020-07-21 23:46:07,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:07,174 INFO L93 Difference]: Finished difference Result 45691 states and 58278 transitions. [2020-07-21 23:46:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-21 23:46:07,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 197 [2020-07-21 23:46:07,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:07,284 INFO L225 Difference]: With dead ends: 45691 [2020-07-21 23:46:07,285 INFO L226 Difference]: Without dead ends: 26969 [2020-07-21 23:46:07,314 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-21 23:46:07,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26969 states. [2020-07-21 23:46:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26969 to 24223. [2020-07-21 23:46:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24223 states. [2020-07-21 23:46:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24223 states to 24223 states and 30863 transitions. [2020-07-21 23:46:08,284 INFO L78 Accepts]: Start accepts. Automaton has 24223 states and 30863 transitions. Word has length 197 [2020-07-21 23:46:08,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:08,284 INFO L479 AbstractCegarLoop]: Abstraction has 24223 states and 30863 transitions. [2020-07-21 23:46:08,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:46:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 24223 states and 30863 transitions. [2020-07-21 23:46:08,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2020-07-21 23:46:08,312 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:08,313 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-21 23:46:08,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:08,526 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -523076207, now seen corresponding path program 1 times [2020-07-21 23:46:08,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:08,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524144474] [2020-07-21 23:46:08,527 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-21 23:46:08,641 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 23:46:08,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:08,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-21 23:46:08,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-07-21 23:46:08,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:08,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524144474] [2020-07-21 23:46:08,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:08,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-21 23:46:08,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642785966] [2020-07-21 23:46:08,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 23:46:08,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:08,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 23:46:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-21 23:46:08,810 INFO L87 Difference]: Start difference. First operand 24223 states and 30863 transitions. Second operand 6 states. [2020-07-21 23:46:09,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:09,680 INFO L93 Difference]: Finished difference Result 44825 states and 58308 transitions. [2020-07-21 23:46:09,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 23:46:09,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 211 [2020-07-21 23:46:09,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:09,765 INFO L225 Difference]: With dead ends: 44825 [2020-07-21 23:46:09,765 INFO L226 Difference]: Without dead ends: 20631 [2020-07-21 23:46:09,813 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-21 23:46:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20631 states. [2020-07-21 23:46:11,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20631 to 18873. [2020-07-21 23:46:11,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18873 states. [2020-07-21 23:46:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18873 states to 18873 states and 24209 transitions. [2020-07-21 23:46:11,737 INFO L78 Accepts]: Start accepts. Automaton has 18873 states and 24209 transitions. Word has length 211 [2020-07-21 23:46:11,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:11,738 INFO L479 AbstractCegarLoop]: Abstraction has 18873 states and 24209 transitions. [2020-07-21 23:46:11,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 23:46:11,738 INFO L276 IsEmpty]: Start isEmpty. Operand 18873 states and 24209 transitions. [2020-07-21 23:46:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2020-07-21 23:46:11,753 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:11,754 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 23:46:11,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:11,969 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:11,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -258190107, now seen corresponding path program 1 times [2020-07-21 23:46:11,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:11,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1234664486] [2020-07-21 23:46:11,970 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-21 23:46:12,062 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 23:46:12,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:12,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-21 23:46:12,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2020-07-21 23:46:12,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:12,145 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1234664486] [2020-07-21 23:46:12,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:12,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-21 23:46:12,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831760745] [2020-07-21 23:46:12,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-21 23:46:12,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:12,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-21 23:46:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-21 23:46:12,149 INFO L87 Difference]: Start difference. First operand 18873 states and 24209 transitions. Second operand 5 states. [2020-07-21 23:46:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:13,408 INFO L93 Difference]: Finished difference Result 50847 states and 65782 transitions. [2020-07-21 23:46:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-21 23:46:13,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 223 [2020-07-21 23:46:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:13,498 INFO L225 Difference]: With dead ends: 50847 [2020-07-21 23:46:13,498 INFO L226 Difference]: Without dead ends: 31988 [2020-07-21 23:46:13,529 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-21 23:46:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31988 states. [2020-07-21 23:46:14,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31988 to 30540. [2020-07-21 23:46:14,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30540 states. [2020-07-21 23:46:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30540 states to 30540 states and 39192 transitions. [2020-07-21 23:46:14,566 INFO L78 Accepts]: Start accepts. Automaton has 30540 states and 39192 transitions. Word has length 223 [2020-07-21 23:46:14,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:14,566 INFO L479 AbstractCegarLoop]: Abstraction has 30540 states and 39192 transitions. [2020-07-21 23:46:14,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-21 23:46:14,567 INFO L276 IsEmpty]: Start isEmpty. Operand 30540 states and 39192 transitions. [2020-07-21 23:46:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-07-21 23:46:14,573 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:14,574 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-21 23:46:14,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:14,789 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:14,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:14,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1684278387, now seen corresponding path program 1 times [2020-07-21 23:46:14,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:14,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1097926676] [2020-07-21 23:46:14,791 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-21 23:46:14,921 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:46:14,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:14,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:46:14,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:15,123 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-21 23:46:15,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:15,126 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1097926676] [2020-07-21 23:46:15,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:15,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:46:15,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380898363] [2020-07-21 23:46:15,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:46:15,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:15,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:46:15,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:46:15,131 INFO L87 Difference]: Start difference. First operand 30540 states and 39192 transitions. Second operand 3 states. [2020-07-21 23:46:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:16,473 INFO L93 Difference]: Finished difference Result 83576 states and 110780 transitions. [2020-07-21 23:46:16,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:46:16,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2020-07-21 23:46:16,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:16,635 INFO L225 Difference]: With dead ends: 83576 [2020-07-21 23:46:16,636 INFO L226 Difference]: Without dead ends: 53136 [2020-07-21 23:46:16,678 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-21 23:46:16,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53136 states. [2020-07-21 23:46:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53136 to 51634. [2020-07-21 23:46:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51634 states. [2020-07-21 23:46:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51634 states to 51634 states and 66466 transitions. [2020-07-21 23:46:19,781 INFO L78 Accepts]: Start accepts. Automaton has 51634 states and 66466 transitions. Word has length 218 [2020-07-21 23:46:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:19,782 INFO L479 AbstractCegarLoop]: Abstraction has 51634 states and 66466 transitions. [2020-07-21 23:46:19,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:46:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 51634 states and 66466 transitions. [2020-07-21 23:46:19,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2020-07-21 23:46:19,794 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 23:46:19,794 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-21 23:46:20,009 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:20,010 INFO L427 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 23:46:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 23:46:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash -54066853, now seen corresponding path program 1 times [2020-07-21 23:46:20,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 23:46:20,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1619513570] [2020-07-21 23:46:20,011 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:20,142 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 3 check-sat command(s) [2020-07-21 23:46:20,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 23:46:20,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 840 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-21 23:46:20,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 23:46:20,202 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-21 23:46:20,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-07-21 23:46:20,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1619513570] [2020-07-21 23:46:20,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-21 23:46:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-21 23:46:20,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966049786] [2020-07-21 23:46:20,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-21 23:46:20,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 23:46:20,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-21 23:46:20,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-21 23:46:20,209 INFO L87 Difference]: Start difference. First operand 51634 states and 66466 transitions. Second operand 3 states. [2020-07-21 23:46:20,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 23:46:20,734 INFO L93 Difference]: Finished difference Result 61692 states and 79606 transitions. [2020-07-21 23:46:20,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-21 23:46:20,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2020-07-21 23:46:20,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 23:46:20,747 INFO L225 Difference]: With dead ends: 61692 [2020-07-21 23:46:20,747 INFO L226 Difference]: Without dead ends: 0 [2020-07-21 23:46:20,849 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-21 23:46:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-21 23:46:20,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-21 23:46:20,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-21 23:46:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-21 23:46:20,856 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 219 [2020-07-21 23:46:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 23:46:20,856 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-21 23:46:20,856 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-21 23:46:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-21 23:46:20,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-21 23:46:21,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 23:46:21,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-21 23:46:21,785 WARN L193 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 49 [2020-07-21 23:46:21,899 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 39 [2020-07-21 23:46:22,330 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2020-07-21 23:46:24,109 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 307 DAG size of output: 49 [2020-07-21 23:46:26,119 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 39 [2020-07-21 23:46:46,426 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2020-07-21 23:46:46,870 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-21 23:46:55,667 WARN L193 SmtUtils]: Spent 8.75 s on a formula simplification. DAG size of input: 579 DAG size of output: 112 [2020-07-21 23:46:56,018 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 70 [2020-07-21 23:46:56,276 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-21 23:46:56,515 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-07-21 23:47:00,444 WARN L193 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 355 DAG size of output: 85 [2020-07-21 23:47:01,230 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 51 [2020-07-21 23:47:01,484 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-21 23:47:03,833 WARN L193 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 402 DAG size of output: 65 [2020-07-21 23:47:05,120 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 341 DAG size of output: 56 [2020-07-21 23:47:05,714 WARN L193 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 37 [2020-07-21 23:47:06,498 WARN L193 SmtUtils]: Spent 767.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 51 [2020-07-21 23:47:08,522 WARN L193 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 402 DAG size of output: 65 [2020-07-21 23:47:11,187 WARN L193 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 540 DAG size of output: 61 [2020-07-21 23:47:11,304 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-07-21 23:47:11,996 WARN L193 SmtUtils]: Spent 678.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 59 [2020-07-21 23:47:13,028 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 282 DAG size of output: 60 [2020-07-21 23:47:13,782 WARN L193 SmtUtils]: Spent 738.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 51 [2020-07-21 23:47:14,932 WARN L193 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 284 DAG size of output: 62 [2020-07-21 23:47:15,208 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-21 23:47:18,841 WARN L193 SmtUtils]: Spent 3.61 s on a formula simplification. DAG size of input: 468 DAG size of output: 97 [2020-07-21 23:47:20,133 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 209 DAG size of output: 62 [2020-07-21 23:47:20,720 WARN L193 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 57 [2020-07-21 23:47:22,451 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 401 DAG size of output: 60 [2020-07-21 23:47:24,134 WARN L193 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 268 DAG size of output: 55 [2020-07-21 23:47:32,931 WARN L193 SmtUtils]: Spent 8.77 s on a formula simplification. DAG size of input: 579 DAG size of output: 112 [2020-07-21 23:47:34,129 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 565 DAG size of output: 1 [2020-07-21 23:47:34,244 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2020-07-21 23:47:37,264 WARN L193 SmtUtils]: Spent 3.00 s on a formula simplification. DAG size of input: 479 DAG size of output: 94 [2020-07-21 23:47:38,297 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 252 DAG size of output: 49 [2020-07-21 23:47:45,354 WARN L193 SmtUtils]: Spent 7.04 s on a formula simplification. DAG size of input: 474 DAG size of output: 97 [2020-07-21 23:47:48,564 WARN L193 SmtUtils]: Spent 3.19 s on a formula simplification. DAG size of input: 472 DAG size of output: 55 [2020-07-21 23:47:48,839 WARN L193 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2020-07-21 23:47:50,289 WARN L193 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 250 DAG size of output: 59 [2020-07-21 23:47:50,488 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-07-21 23:47:51,582 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 285 DAG size of output: 64 [2020-07-21 23:47:51,748 WARN L193 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-07-21 23:47:52,815 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 252 DAG size of output: 49 [2020-07-21 23:47:54,057 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 343 DAG size of output: 59 [2020-07-21 23:47:56,067 WARN L193 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 467 DAG size of output: 53 [2020-07-21 23:48:01,875 WARN L193 SmtUtils]: Spent 5.79 s on a formula simplification. DAG size of input: 431 DAG size of output: 78 [2020-07-21 23:48:02,191 WARN L193 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2020-07-21 23:48:02,357 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2020-07-21 23:48:05,393 WARN L193 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 230 DAG size of output: 66 [2020-07-21 23:48:05,401 INFO L268 CegarLoopResult]: For program point L385(lines 385 389) no Hoare annotation was computed. [2020-07-21 23:48:05,401 INFO L268 CegarLoopResult]: For program point L383(line 383) no Hoare annotation was computed. [2020-07-21 23:48:05,401 INFO L268 CegarLoopResult]: For program point L385-2(lines 369 393) no Hoare annotation was computed. [2020-07-21 23:48:05,402 INFO L268 CegarLoopResult]: For program point L377(lines 377 381) no Hoare annotation was computed. [2020-07-21 23:48:05,402 INFO L264 CegarLoopResult]: At program point L375(line 375) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (<= 2 ~p_dw_st~0)) (.cse5 (not (<= ~q_free~0 0))) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse13 (= 0 ~p_dw_st~0)) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse12 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse3 .cse8 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse3 .cse4) (or .cse11 .cse12 .cse3 .cse13 .cse4) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse6) (or .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (or .cse7 .cse11 .cse12 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse12 .cse2 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse11 .cse1 .cse3 .cse8 .cse9 .cse10 .cse6) (or .cse7 .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (or .cse7 .cse12 .cse2 .cse3 .cse13 .cse5 .cse6) (or .cse7 .cse11 .cse12 .cse3 .cse13 .cse5 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse11 (not (<= 2 ~slow_clk_edge~0)) (not (<= 2 ~fast_clk_edge~0)) .cse12 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse0 .cse12 .cse2 .cse3 .cse8 .cse4 .cse9 .cse6))) [2020-07-21 23:48:05,402 INFO L264 CegarLoopResult]: At program point L377-2(lines 377 381) the Hoare annotation is: (let ((.cse25 (= ~c_dr_pc~0 1)) (.cse21 (<= ~q_free~0 0)) (.cse18 (= 0 activate_threads_~tmp~1)) (.cse9 (<= 2 ~p_dw_st~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse23 (= 1 ~p_dw_i~0)) (.cse19 (= 0 ~p_dw_st~0)) (.cse26 (<= 1 ~q_free~0))) (let ((.cse11 (not .cse26)) (.cse13 (and .cse26 .cse24 .cse22 .cse23 .cse19)) (.cse15 (and .cse18 .cse9)) (.cse8 (and .cse22 .cse23 .cse25 .cse19 .cse21)) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse16 (not (<= 2 ~fast_clk_edge~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse2 (not .cse25)) (.cse12 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse14 (not .cse24)) (.cse10 (not .cse22)) (.cse7 (not (<= ~c_dr_pc~0 0))) (.cse17 (not (= 0 |old(~p_dw_st~0)|))) (.cse3 (not .cse23)) (.cse20 (and .cse22 .cse19)) (.cse5 (not .cse21)) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse3 .cse4) (or .cse1 .cse2 .cse3 .cse8 .cse5 .cse9 .cse6) (or .cse10 .cse11 .cse7 .cse1 .cse3 .cse12 .cse13 .cse14 .cse9 .cse6) (or .cse10 .cse15 .cse7 .cse16 .cse1 .cse3 .cse12 .cse14 .cse6) (or .cse15 .cse16 .cse1 .cse2 .cse3 .cse5 .cse6) (or (not (<= ~p_dw_pc~0 0)) .cse11 .cse7 (not (<= 2 ~slow_clk_edge~0)) .cse16 .cse17 (and .cse18 .cse19) .cse3 .cse12 .cse14 .cse6) (or .cse7 .cse17 .cse3 .cse19 .cse4) (or .cse10 .cse15 .cse16 .cse1 .cse2 .cse3 .cse12 .cse14 .cse6) (or .cse10 .cse0 .cse1 .cse2 .cse3 .cse12 .cse4 .cse14 .cse6) (or .cse10 .cse0 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse10 .cse17 .cse2 .cse3 .cse12 .cse19 .cse14 .cse6) (or .cse7 .cse1 .cse3 .cse20 .cse5 .cse9 .cse6) (or .cse10 .cse11 .cse7 .cse17 .cse3 .cse12 .cse13 .cse14 .cse6) (or .cse15 .cse7 .cse16 .cse1 .cse3 .cse5 .cse6) (or .cse10 .cse17 .cse2 .cse3 .cse8 .cse5 .cse6) (or .cse10 .cse1 .cse2 .cse3 .cse12 .cse19 .cse14 .cse9 .cse6) (or .cse18 .cse7 .cse16 .cse3 .cse4 .cse6) (or .cse10 .cse0 .cse17 .cse2 .cse3 .cse12 .cse4 .cse14 .cse6) (or .cse10 .cse7 .cse17 .cse3 .cse20 .cse5 .cse6)))) [2020-07-21 23:48:05,403 INFO L268 CegarLoopResult]: For program point L375-1(line 375) no Hoare annotation was computed. [2020-07-21 23:48:05,403 INFO L264 CegarLoopResult]: At program point activate_threadsENTRY(lines 369 393) the Hoare annotation is: (let ((.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse10 (<= 2 ~p_dw_st~0)) (.cse5 (not (<= ~q_free~0 0))) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse13 (= 0 ~p_dw_st~0)) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse0 (<= 2 ~c_dr_st~0)) (.cse12 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse1 .cse2 .cse3 .cse8 .cse9 .cse10 .cse6) (or .cse11 .cse0 .cse3 .cse4) (or .cse11 .cse12 .cse3 .cse13 .cse4) (or .cse7 .cse0 .cse1 .cse2 .cse3 .cse8 .cse4 .cse9 .cse6) (or .cse1 .cse2 .cse3 .cse5 .cse10 .cse6) (or .cse7 .cse11 .cse12 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse12 .cse2 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse11 .cse1 .cse3 .cse8 .cse9 .cse10 .cse6) (or .cse7 .cse0 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse11 .cse1 .cse3 .cse5 .cse10 .cse6) (or .cse7 .cse12 .cse2 .cse3 .cse13 .cse5 .cse6) (or .cse7 .cse11 .cse12 .cse3 .cse13 .cse5 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse11 (not (<= 2 ~slow_clk_edge~0)) (not (<= 2 ~fast_clk_edge~0)) .cse12 .cse3 .cse8 .cse13 .cse9 .cse6) (or .cse7 .cse0 .cse12 .cse2 .cse3 .cse8 .cse4 .cse9 .cse6))) [2020-07-21 23:48:05,403 INFO L268 CegarLoopResult]: For program point activate_threadsEXIT(lines 369 393) no Hoare annotation was computed. [2020-07-21 23:48:05,403 INFO L268 CegarLoopResult]: For program point exists_runnable_threadEXIT(lines 277 296) no Hoare annotation was computed. [2020-07-21 23:48:05,403 INFO L268 CegarLoopResult]: For program point L285(lines 285 290) no Hoare annotation was computed. [2020-07-21 23:48:05,403 INFO L268 CegarLoopResult]: For program point L281(lines 281 291) no Hoare annotation was computed. [2020-07-21 23:48:05,403 INFO L271 CegarLoopResult]: At program point exists_runnable_threadENTRY(lines 277 296) the Hoare annotation is: true [2020-07-21 23:48:05,404 INFO L264 CegarLoopResult]: At program point L293(lines 280 295) the Hoare annotation is: (let ((.cse8 (not (<= ~p_dw_pc~0 0))) (.cse9 (not (<= 1 ~q_free~0))) (.cse11 (not (<= 2 ~slow_clk_edge~0))) (.cse12 (not (<= 2 ~fast_clk_edge~0))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (<= 2 ~c_dr_st~0))) (.cse6 (not (<= ~q_req_up~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse10 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (<= 1 exists_runnable_thread_~__retres1~2)) (.cse14 (not (<= ~q_free~0 0))) (.cse7 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse9 .cse10 .cse11 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse13 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse14 .cse7) (or .cse8 .cse9 .cse11 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse13 .cse6 .cse7) (or .cse0 .cse10 .cse1 .cse3 .cse5 .cse14 .cse7))) [2020-07-21 23:48:05,404 INFO L268 CegarLoopResult]: For program point exists_runnable_threadFINAL(lines 277 296) no Hoare annotation was computed. [2020-07-21 23:48:05,404 INFO L264 CegarLoopResult]: At program point update_fifo_qENTRY(lines 22 41) the Hoare annotation is: (let ((.cse2 (<= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse3 (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (let ((.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse4 (and (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse2 .cse3)) (.cse5 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (<= ~q_free~0 0))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 (and .cse2 .cse3) (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse1 .cse4 .cse5 .cse6 .cse7) (or (not (= ~c_dr_pc~0 1)) .cse1 .cse4 .cse5 .cse6 .cse7)))) [2020-07-21 23:48:05,404 INFO L268 CegarLoopResult]: For program point L31-1(lines 31 35) no Hoare annotation was computed. [2020-07-21 23:48:05,404 INFO L268 CegarLoopResult]: For program point update_fifo_qEXIT(lines 22 41) no Hoare annotation was computed. [2020-07-21 23:48:05,404 INFO L268 CegarLoopResult]: For program point L26-1(lines 25 40) no Hoare annotation was computed. [2020-07-21 23:48:05,404 INFO L268 CegarLoopResult]: For program point update_fifo_qFINAL(lines 22 41) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point reset_delta_eventsEXIT(lines 315 332) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point L319-1(lines 318 331) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L264 CegarLoopResult]: At program point reset_delta_eventsENTRY(lines 315 332) the Hoare annotation is: (let ((.cse7 (not (= ~c_dr_pc~0 1))) (.cse5 (not (<= ~q_free~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= 2 ~p_dw_st~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse9 (not (<= 2 |old(~q_write_ev~0)|))) (.cse10 (not (<= ~q_req_up~0 0))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse1 .cse3 .cse4 (not (<= 2 ~c_dr_st~0))) (or .cse7 .cse3 .cse4 .cse8 .cse5 .cse6) (or .cse0 .cse2 .cse7 .cse3 .cse4 .cse9 .cse10 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse10 .cse6) (or .cse0 .cse2 .cse7 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse3 .cse4 .cse9 .cse10 .cse8 .cse6) (or .cse1 .cse3 .cse4 .cse8 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse9 .cse10 .cse8 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse1 (not (<= 2 ~slow_clk_edge~0)) .cse2 (not (<= 2 ~fast_clk_edge~0)) .cse3 .cse4 .cse9 .cse10 .cse6))) [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point L324-1(lines 315 332) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point L268-1(lines 259 276) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point init_threadsEXIT(lines 259 276) no Hoare annotation was computed. [2020-07-21 23:48:05,405 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) (not (<= ~q_req_up~0 0)) (not (<= 2 ~q_read_ev~0))) [2020-07-21 23:48:05,405 INFO L268 CegarLoopResult]: For program point L263-1(lines 262 275) no Hoare annotation was computed. [2020-07-21 23:48:05,405 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 544 555) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~q_req_up~0 |old(~q_req_up~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 (= 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-21 23:48:05,406 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 544 555) no Hoare annotation was computed. [2020-07-21 23:48:05,406 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 544 555) no Hoare annotation was computed. [2020-07-21 23:48:05,406 INFO L268 CegarLoopResult]: For program point L550(line 550) no Hoare annotation was computed. [2020-07-21 23:48:05,406 INFO L264 CegarLoopResult]: At program point L549(line 549) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (and (<= ~p_dw_pc~0 0) (= 0 ~p_dw_st~0) (<= ~q_req_up~0 |old(~q_req_up~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 (= 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-21 23:48:05,406 INFO L264 CegarLoopResult]: At program point L549-1(line 549) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (not (<= |old(~q_free~0)| 0)) (not (<= |old(~c_dr_pc~0)| 0)) (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) (<= ~q_req_up~0 |old(~q_req_up~0)|) (<= ~c_dr_pc~0 0) (<= 2 ~q_write_ev~0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-21 23:48:05,406 INFO L264 CegarLoopResult]: At program point L161(lines 138 182) the Hoare annotation is: (let ((.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse2 (not (<= 2 ~fast_clk_edge~0))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse11 (not (<= ~c_dr_pc~0 0))) (.cse12 (= 1 ~p_dw_pc~0)) (.cse10 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse9 (not (= 1 |old(~p_dw_pc~0)|))) (.cse13 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~c_dr_st~0)) .cse7 .cse8) (or .cse9 .cse4 .cse5 .cse6 .cse10 .cse8) (or .cse0 .cse11 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse11 .cse9 .cse5 .cse6 .cse8 (and .cse12 .cse10)) (or .cse9 .cse13 .cse4 .cse5 .cse10 .cse8) (or .cse11 (and .cse12 .cse10 (<= ~q_free~0 0)) .cse9 .cse13 .cse5 .cse8))) [2020-07-21 23:48:05,407 INFO L264 CegarLoopResult]: At program point do_write_pENTRY(lines 135 183) the Hoare annotation is: (let ((.cse17 (<= 1 ~q_free~0)) (.cse15 (= 1 ~p_dw_pc~0)) (.cse16 (<= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse1 (and .cse17 .cse15 .cse16)) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse8 (not (<= 2 ~slow_clk_edge~0))) (.cse9 (not (<= 2 ~fast_clk_edge~0))) (.cse10 (and .cse17 (<= ~p_dw_pc~0 0) .cse16)) (.cse4 (not (<= 1 |old(~q_free~0)|))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse12 (not (<= |old(~p_dw_pc~0)| 0))) (.cse2 (not (<= ~c_dr_pc~0 0))) (.cse13 (and .cse15 .cse16 (<= ~q_free~0 0))) (.cse3 (not (= 1 |old(~p_dw_pc~0)|))) (.cse14 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse7 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse8 .cse9 .cse10 .cse4 .cse11 .cse5 .cse6 (not (<= 2 ~c_dr_st~0)) .cse12 .cse7) (or .cse13 .cse3 .cse14 .cse11 .cse5 .cse7) (or .cse1 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7) (or .cse0 .cse2 .cse8 .cse9 .cse10 .cse4 .cse5 .cse6 .cse12 .cse7) (or .cse2 .cse13 .cse3 .cse14 .cse5 .cse7)))) [2020-07-21 23:48:05,407 INFO L268 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-07-21 23:48:05,407 INFO L264 CegarLoopResult]: At program point L178(lines 135 183) the Hoare annotation is: (let ((.cse15 (= 1 ~p_dw_pc~0)) (.cse16 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse18 (<= ~q_free~0 0)) (.cse17 (<= 2 ~p_dw_st~0))) (let ((.cse3 (not (= ~c_dr_pc~0 1))) (.cse1 (and .cse16 .cse18 .cse17)) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse0 (not (= 1 |old(~p_dw_pc~0)|))) (.cse4 (and .cse15 .cse18 .cse17)) (.cse9 (not (<= |old(~q_req_up~0)| 0))) (.cse14 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (<= 2 ~slow_clk_edge~0))) (.cse11 (not (<= 2 ~fast_clk_edge~0))) (.cse7 (not (<= 1 |old(~q_free~0)|))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_write_ev~0))) (.cse12 (and (<= 1 ~q_free~0) .cse15 .cse16 .cse17)) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse3 .cse4 .cse5 .cse8 .cse6) (or .cse9 .cse10 .cse11 .cse7 .cse3 .cse5 .cse8 .cse12 (not (<= 2 ~c_dr_st~0)) .cse13 .cse6) (or .cse14 .cse0 .cse1 .cse2 .cse5 .cse4 .cse6) (or .cse9 .cse14 .cse0 .cse7 .cse5 .cse8 .cse4 .cse6) (or .cse9 .cse14 .cse10 .cse11 .cse7 .cse5 .cse8 .cse12 .cse13 .cse6)))) [2020-07-21 23:48:05,407 INFO L268 CegarLoopResult]: For program point L145(lines 145 149) no Hoare annotation was computed. [2020-07-21 23:48:05,407 INFO L264 CegarLoopResult]: At program point L143(lines 138 182) the Hoare annotation is: (let ((.cse13 (= 1 ~p_dw_pc~0)) (.cse14 (<= ~q_req_up~0 |old(~q_req_up~0)|))) (let ((.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse2 (not (<= 2 ~fast_clk_edge~0))) (.cse7 (not (<= |old(~p_dw_pc~0)| 0))) (.cse9 (and (<= 1 ~q_free~0) .cse13 .cse14)) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse4 (not (= ~c_dr_pc~0 1))) (.cse10 (not (<= ~c_dr_pc~0 0))) (.cse11 (not (= 1 |old(~p_dw_pc~0)|))) (.cse12 (not (<= |old(~q_free~0)| 0))) (.cse5 (not (= 1 ~p_dw_i~0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (<= 2 ~c_dr_st~0)) .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse11 .cse3 .cse5 .cse6 .cse8) (or .cse0 .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (or .cse9 .cse11 .cse3 .cse4 .cse5 .cse6 .cse8) (or .cse11 .cse12 .cse4 .cse5 (and .cse13 .cse14) .cse8) (or .cse10 (and .cse13 .cse14 (<= ~q_free~0 0)) .cse11 .cse12 .cse5 .cse8)))) [2020-07-21 23:48:05,407 INFO L268 CegarLoopResult]: For program point do_write_pEXIT(lines 135 183) no Hoare annotation was computed. [2020-07-21 23:48:05,408 INFO L264 CegarLoopResult]: At program point L154-1(lines 138 182) the Hoare annotation is: (let ((.cse16 (= 1 ~p_dw_i~0)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse15 (<= ~q_free~0 0))) (let ((.cse14 (not (<= |old(~q_free~0)| 0))) (.cse5 (and (<= 1 |old(~p_dw_pc~0)|) (= 1 ~p_dw_pc~0) .cse16 .cse17 .cse15)) (.cse2 (not (= 1 |old(~p_dw_pc~0)|))) (.cse10 (not (= ~c_dr_pc~0 1))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not .cse17)) (.cse7 (not (<= 2 ~slow_clk_edge~0))) (.cse8 (not (<= 2 ~fast_clk_edge~0))) (.cse11 (<= 1 ~q_free~0)) (.cse12 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse9 (not (<= 1 |old(~q_free~0)|))) (.cse3 (not .cse16)) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (<= |old(~p_dw_pc~0)| 0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse7 .cse8 .cse9 .cse10 .cse3 .cse4 (and .cse11 (< ~p_dw_pc~0 1) .cse12) (not (<= 2 ~c_dr_st~0)) .cse13 .cse6) (or .cse2 .cse14 .cse10 .cse3 .cse15 .cse6) (or .cse1 .cse2 .cse14 .cse3 .cse5 .cse6) (or .cse2 .cse10 .cse3 .cse4 .cse15 .cse6) (or .cse0 .cse1 .cse7 .cse8 (and .cse11 (<= ~p_dw_pc~0 0) .cse12) .cse9 .cse3 .cse4 .cse13 .cse6)))) [2020-07-21 23:48:05,408 INFO L268 CegarLoopResult]: For program point L142(lines 142 150) no Hoare annotation was computed. [2020-07-21 23:48:05,408 INFO L268 CegarLoopResult]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2020-07-21 23:48:05,408 INFO L268 CegarLoopResult]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2020-07-21 23:48:05,408 INFO L271 CegarLoopResult]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2020-07-21 23:48:05,408 INFO L268 CegarLoopResult]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L126(lines 126 130) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L124(line 124) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L126-2(lines 110 134) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsENTRY(lines 110 134) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L118(lines 118 122) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L118-2(lines 118 122) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point L116-1(line 116) no Hoare annotation was computed. [2020-07-21 23:48:05,409 INFO L268 CegarLoopResult]: For program point immediate_notify_threadsEXIT(lines 110 134) no Hoare annotation was computed. [2020-07-21 23:48:05,410 INFO L268 CegarLoopResult]: For program point fire_time_eventsEXIT(lines 335 350) no Hoare annotation was computed. [2020-07-21 23:48:05,410 INFO L264 CegarLoopResult]: At program point fire_time_eventsENTRY(lines 335 350) the Hoare annotation is: (let ((.cse9 (not (<= 2 ~p_dw_st~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (<= ~q_req_up~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (<= 2 ~slow_clk_edge~0)) (.cse6 (not (<= 2 |old(~slow_clk_edge~0)|))) (.cse10 (not (<= ~q_free~0 0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse3 .cse5 .cse6 .cse9 .cse10 .cse8) (or .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse11 .cse3 .cse5 .cse6 .cse9 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse1 .cse3 .cse5 .cse6 (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse8) (or .cse0 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse11 .cse3 .cse5 .cse6 .cse10 .cse8))) [2020-07-21 23:48:05,410 INFO L268 CegarLoopResult]: For program point L339-1(lines 335 350) no Hoare annotation was computed. [2020-07-21 23:48:05,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-21 23:48:05,410 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)) (<= ~q_req_up~0 |old(~q_req_up~0)|) (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) [2020-07-21 23:48:05,410 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:48:05,411 INFO L264 CegarLoopResult]: At program point evalENTRY(lines 394 446) the Hoare annotation is: (let ((.cse0 (not (<= 2 ~fast_clk_edge~0))) (.cse15 (not (<= |old(~q_req_up~0)| 0))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse8 (<= 1 ~q_free~0)) (.cse5 (not (<= 2 ~q_write_ev~0))) (.cse7 (<= 2 ~c_dr_st~0)) (.cse19 (not (<= 2 |old(~p_dw_st~0)|))) (.cse22 (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1))) (.cse17 (<= ~c_dr_pc~0 0)) (.cse20 (<= 2 ~p_dw_st~0)) (.cse16 (not (<= |old(~c_dr_pc~0)| 0))) (.cse6 (not (<= 2 |old(~c_dr_st~0)|))) (.cse9 (= 1 ~p_dw_pc~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= 0 ~p_dw_st~0)) (.cse12 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse21 (<= ~q_free~0 0)) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse18 (not (<= |old(~q_free~0)| 0))) (.cse4 (not (= 1 ~p_dw_i~0))) (.cse13 (not (= 1 |old(~c_dr_pc~0)|))) (.cse14 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (or .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 (and .cse8 .cse9 .cse11 .cse12 .cse17) .cse14) (or .cse7 .cse1 .cse2 .cse18 .cse4 .cse6 .cse13 .cse14) (or .cse7 .cse19 .cse18 .cse4 .cse6 .cse13 .cse14) (or .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14) (or .cse1 .cse19 .cse18 .cse4 .cse9 .cse16 .cse14) (or .cse15 .cse7 .cse1 .cse19 .cse4 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6 .cse13 .cse14) (or .cse15 .cse1 .cse19 .cse3 .cse4 .cse5 (and .cse8 .cse9 .cse10 .cse12 .cse20) .cse13 .cse14) (or .cse1 .cse19 .cse18 .cse4 .cse9 .cse13 .cse14) (or .cse1 .cse2 .cse18 .cse4 .cse16 (and .cse9 .cse11 .cse12 .cse17 .cse21) .cse14) (or .cse19 .cse18 .cse4 .cse13 (and .cse22 .cse10 .cse12 .cse21 .cse20) .cse14) (or .cse15 (not (<= 2 ~slow_clk_edge~0)) .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 (not (<= |old(~p_dw_pc~0)| 0)) (and .cse8 (<= ~p_dw_pc~0 0) .cse11 .cse12 .cse17) .cse14) (or .cse15 .cse1 .cse19 .cse3 (and .cse8 .cse9 .cse12 .cse17 .cse20) .cse4 .cse5 .cse16 .cse14) (or .cse4 (and .cse7 .cse17) .cse16 .cse6) (or .cse19 .cse18 .cse4 (and .cse22 .cse12 .cse17 .cse21 .cse20) .cse16 .cse14) (or .cse2 .cse4 .cse16 .cse11 .cse6) (or (and .cse9 .cse10 .cse11 .cse12 .cse21) .cse1 .cse2 .cse18 .cse4 .cse13 .cse14))) [2020-07-21 23:48:05,411 INFO L264 CegarLoopResult]: At program point L417(line 417) the Hoare annotation is: (let ((.cse10 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse23 (<= ~q_free~0 0)) (.cse25 (<= 1 |old(~p_dw_pc~0)|)) (.cse18 (<= 2 ~c_dr_st~0)) (.cse8 (<= 1 ~q_free~0)) (.cse9 (= 1 ~p_dw_pc~0)) (.cse24 (= 1 ~p_dw_i~0)) (.cse19 (= ~c_dr_pc~0 1)) (.cse11 (<= 1 eval_~tmp___1~0))) (let ((.cse14 (not (<= 2 |old(~p_dw_st~0)|))) (.cse1 (and .cse25 .cse18 .cse8 .cse9 .cse24 .cse19 .cse11)) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse17 (not (<= 2 ~fast_clk_edge~0))) (.cse4 (not (<= 1 |old(~q_free~0)|))) (.cse6 (not (<= 2 ~q_write_ev~0))) (.cse15 (not (= 1 |old(~c_dr_pc~0)|))) (.cse2 (not (= 1 |old(~p_dw_pc~0)|))) (.cse3 (not (= 0 |old(~p_dw_st~0)|))) (.cse16 (not (<= |old(~q_free~0)| 0))) (.cse22 (and .cse25 .cse18 .cse9 .cse24 .cse19 .cse10 .cse11 .cse23)) (.cse13 (not (<= 2 ~q_read_ev~0))) (.cse5 (not .cse24)) (.cse12 (<= ~c_dr_pc~0 0)) (.cse7 (not (<= |old(~c_dr_pc~0)| 0))) (.cse20 (not (<= 2 |old(~c_dr_st~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (or .cse0 .cse2 .cse14 .cse5 .cse6 .cse15 .cse13) (or .cse14 .cse16 .cse5 .cse15 .cse13) (or .cse0 .cse2 .cse14 .cse5 .cse6 .cse7 .cse13) (or .cse14 .cse16 .cse5 .cse7 .cse13) (or .cse17 .cse2 .cse3 (and .cse18 .cse8 .cse19 .cse9 .cse11) .cse4 .cse5 .cse6 .cse20 .cse15 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse8 .cse19 .cse9 .cse10 .cse11) .cse15 .cse13) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse15 .cse13) (let ((.cse21 (<= ~p_dw_pc~0 0))) (or .cse0 (not (<= 2 ~slow_clk_edge~0)) .cse17 (and .cse18 .cse8 .cse21 .cse19 .cse10 .cse11) .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse21 .cse10 .cse12 .cse11) (not (<= |old(~p_dw_pc~0)| 0)) .cse13)) (or .cse2 .cse3 .cse16 .cse5 .cse22 .cse20 .cse15 .cse13) (or .cse2 .cse3 .cse16 .cse5 (and .cse9 .cse19 .cse10 .cse11 .cse23) .cse15 .cse13) (or .cse2 .cse3 .cse16 .cse5 .cse7 .cse22 (and .cse9 .cse10 .cse11 .cse12 .cse23) .cse13) (or .cse5 (and .cse18 .cse12) .cse7 .cse20)))) [2020-07-21 23:48:05,411 INFO L268 CegarLoopResult]: For program point L405(lines 405 409) no Hoare annotation was computed. [2020-07-21 23:48:05,411 INFO L268 CegarLoopResult]: For program point L405-1(lines 400 440) no Hoare annotation was computed. [2020-07-21 23:48:05,411 INFO L268 CegarLoopResult]: For program point L403(line 403) no Hoare annotation was computed. [2020-07-21 23:48:05,412 INFO L264 CegarLoopResult]: At program point L401(line 401) the Hoare annotation is: (let ((.cse34 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse36 (<= 2 ~q_write_ev~0)) (.cse33 (<= 2 ~q_read_ev~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse10 (= 0 ~p_dw_st~0)) (.cse24 (<= ~q_free~0 0)) (.cse31 (or .cse34 (< ~p_dw_pc~0 1))) (.cse22 (<= 2 ~c_dr_st~0)) (.cse7 (<= 1 ~q_free~0)) (.cse37 (<= ~q_req_up~0 0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse35 (= 1 ~p_dw_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse11 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse25 (<= 2 ~p_dw_st~0))) (let ((.cse29 (and .cse31 .cse22 .cse7 .cse37 .cse8 .cse35 .cse9 .cse11 .cse25)) (.cse6 (and .cse8 .cse9 .cse24 .cse25)) (.cse26 (and .cse22 .cse35 .cse8 .cse9 .cse24 .cse25)) (.cse27 (and .cse31 .cse22 .cse8 .cse35 .cse9 .cse10 .cse11 .cse24)) (.cse28 (and .cse22 .cse35 .cse9 .cse11 .cse24 .cse25)) (.cse15 (and .cse8 .cse16 .cse24 .cse25)) (.cse21 (not (<= 2 ~fast_clk_edge~0))) (.cse19 (not (<= 2 |old(~p_dw_st~0)|))) (.cse20 (not (<= |old(~q_free~0)| 0))) (.cse17 (not (<= |old(~c_dr_pc~0)| 0))) (.cse30 (and .cse31 .cse22 .cse33 .cse9 .cse35 .cse11 .cse24 .cse25)) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse14 (and .cse31 .cse22 .cse7 .cse37 .cse35 .cse8 .cse9 .cse10 .cse11 .cse36)) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not .cse35)) (.cse5 (not .cse36)) (.cse23 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= 1 |old(~c_dr_pc~0)|))) (.cse18 (and .cse34 .cse22 .cse35 .cse8 .cse9 .cse24 .cse25 .cse36)) (.cse13 (not .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse1 .cse3 .cse4 .cse5 .cse15 (and .cse7 .cse8 .cse10 .cse16 .cse11) .cse17 .cse18 .cse13) (or .cse1 .cse19 .cse20 .cse4 .cse8 .cse17 .cse13) (or .cse21 .cse1 .cse2 .cse3 (and .cse22 .cse7 .cse9 .cse8 .cse10) .cse4 .cse5 .cse23 (and .cse22 .cse8 .cse9 .cse24 .cse25) .cse12 .cse13) (or .cse26 .cse1 .cse2 .cse20 .cse27 .cse4 .cse28 .cse23 .cse12 .cse13) (or .cse1 .cse19 .cse20 .cse4 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 (and .cse7 .cse8 .cse9 .cse11 .cse25) .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse29 .cse23 .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse29 .cse17 (and .cse7 .cse8 .cse16 .cse11 .cse25) .cse13) (or (and .cse8 .cse9 .cse10 .cse11 .cse24) .cse1 .cse2 .cse20 .cse4 .cse6 (and .cse9 .cse11 .cse24 .cse25) .cse12 .cse13) (or .cse19 .cse20 .cse4 .cse23 .cse30 .cse12 .cse13) (or .cse19 .cse20 .cse4 .cse12 (and .cse31 .cse9 .cse11 .cse24 .cse25) .cse13) (or .cse26 .cse2 .cse1 .cse20 .cse27 .cse4 .cse28 .cse15 .cse17 (and .cse11 .cse16 .cse24 .cse25) (and .cse8 .cse10 .cse11 .cse16 .cse24) .cse13) (or .cse4 (and .cse22 .cse16) .cse17 .cse23) (let ((.cse32 (<= ~p_dw_pc~0 0))) (or (not (<= 2 ~slow_clk_edge~0)) .cse21 (and .cse22 .cse7 .cse8 .cse9 .cse11 .cse25) .cse2 .cse3 .cse5 (and .cse7 .cse32 .cse10 .cse16 .cse11) (not (<= |old(~p_dw_pc~0)| 0)) .cse13 .cse0 (and .cse22 .cse7 .cse32 .cse9 .cse10 .cse11 (<= 1 eval_~tmp___1~0)) (and .cse7 .cse8 .cse11 .cse16 .cse25) .cse4 .cse17)) (or (and .cse31 .cse16 .cse11 .cse24 .cse25) .cse19 .cse20 .cse4 .cse17 .cse30 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse12 .cse18 .cse13))))) [2020-07-21 23:48:05,412 INFO L264 CegarLoopResult]: At program point L432(line 432) the Hoare annotation is: (let ((.cse20 (= ~c_dr_pc~0 1)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse7 (<= ~c_dr_pc~0 0)) (.cse24 (<= ~q_free~0 0)) (.cse8 (<= 2 ~p_dw_st~0))) (let ((.cse22 (and .cse5 .cse7 .cse24 .cse8)) (.cse19 (and .cse5 .cse20 .cse24 .cse8)) (.cse11 (= 0 ~p_dw_st~0)) (.cse12 (<= 1 eval_~tmp___1~0)) (.cse23 (or (<= 1 |old(~p_dw_pc~0)|) (< ~p_dw_pc~0 1))) (.cse21 (not (<= |old(~q_free~0)| 0))) (.cse1 (not (<= 2 ~fast_clk_edge~0))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse16 (not (<= 2 |old(~c_dr_st~0)|))) (.cse17 (not (= 1 |old(~c_dr_pc~0)|))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse15 (not (= 1 |old(~p_dw_pc~0)|))) (.cse18 (not (<= 2 |old(~p_dw_st~0)|))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse9 (not (= 1 ~p_dw_i~0))) (.cse10 (not (<= 2 ~q_write_ev~0))) (.cse13 (not (<= |old(~c_dr_pc~0)| 0))) (.cse4 (<= 1 ~q_free~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse14 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 (not (<= 2 ~slow_clk_edge~0)) .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 (and .cse4 (<= ~p_dw_pc~0 0) .cse11 .cse6 .cse7 .cse12) .cse13 (not (<= |old(~p_dw_pc~0)| 0)) .cse14) (or .cse0 .cse15 .cse2 .cse9 .cse10 .cse16 .cse17 .cse14) (or .cse0 .cse15 .cse18 .cse9 .cse10 .cse16 .cse17 .cse14) (or .cse0 .cse15 .cse2 .cse3 .cse9 .cse10 .cse19 (and .cse4 .cse5 .cse20 .cse11 .cse6 .cse12) .cse17 .cse14) (or .cse15 .cse18 .cse21 .cse9 .cse5 .cse13 .cse14) (or .cse0 .cse15 .cse2 (and .cse4 .cse5 .cse11 .cse6 .cse7 .cse12) .cse3 .cse9 .cse10 .cse22 .cse13 .cse14) (or .cse9 .cse13 .cse16) (or .cse15 .cse18 .cse21 .cse9 .cse5 .cse17 .cse14) (or .cse0 .cse15 .cse18 .cse3 .cse9 .cse10 (and .cse4 .cse5 .cse20 .cse6 .cse8) .cse17 .cse14) (or .cse18 .cse21 .cse9 .cse17 (and .cse23 .cse20 .cse6 .cse24 .cse8) .cse14) (or .cse15 .cse2 .cse21 (and .cse5 .cse11 .cse6 .cse12 .cse7 .cse24) .cse9 .cse22 .cse13 (and .cse6 .cse7 .cse24 .cse8) .cse14) (or .cse15 .cse2 .cse21 .cse9 .cse16 .cse17 .cse14) (or .cse15 .cse2 .cse21 .cse9 .cse19 (and .cse5 .cse20 .cse11 .cse6 .cse12 .cse24) (and .cse20 .cse6 .cse24 .cse8) .cse17 .cse14) (or (and .cse23 .cse7 .cse6 .cse24 .cse8) .cse18 .cse21 .cse9 .cse13 .cse14) (or .cse18 .cse21 .cse9 .cse16 .cse17 .cse14) (or .cse1 .cse15 .cse2 .cse9 .cse10 .cse16 .cse17 .cse14) (or .cse0 .cse15 .cse18 .cse3 .cse9 .cse10 .cse13 (and .cse4 .cse5 .cse7 .cse6 .cse8) .cse14)))) [2020-07-21 23:48:05,412 INFO L268 CegarLoopResult]: For program point L414(lines 414 421) no Hoare annotation was computed. [2020-07-21 23:48:05,413 INFO L268 CegarLoopResult]: For program point evalEXIT(lines 394 446) no Hoare annotation was computed. [2020-07-21 23:48:05,413 INFO L268 CegarLoopResult]: For program point L410(lines 400 440) no Hoare annotation was computed. [2020-07-21 23:48:05,413 INFO L264 CegarLoopResult]: At program point L441(lines 394 446) the Hoare annotation is: (let ((.cse31 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse4 (or .cse31 (< ~p_dw_pc~0 1))) (.cse30 (= 1 ~p_dw_i~0)) (.cse20 (<= 1 ~q_free~0)) (.cse5 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse19 (<= 2 ~c_dr_st~0)) (.cse22 (= ~c_dr_pc~0 1)) (.cse21 (= 1 ~p_dw_pc~0)) (.cse6 (<= ~c_dr_pc~0 0)) (.cse7 (<= ~q_free~0 0)) (.cse8 (<= 2 ~p_dw_st~0))) (let ((.cse23 (not (<= 2 ~fast_clk_edge~0))) (.cse25 (and .cse21 .cse6 .cse7 .cse8)) (.cse17 (and .cse31 .cse19 .cse21 .cse22 .cse7 .cse8)) (.cse24 (and .cse20 .cse21 .cse5 .cse6 .cse8)) (.cse28 (and .cse4 .cse19 .cse20 (<= ~q_req_up~0 0) .cse21 .cse30 .cse22 .cse5 .cse8)) (.cse0 (and .cse4 .cse19 .cse22 .cse5 .cse7 .cse8)) (.cse1 (not (<= 2 |old(~p_dw_st~0)|))) (.cse26 (and .cse19 .cse22 .cse5 .cse7 .cse8)) (.cse27 (and .cse19 .cse21 .cse22 .cse7 .cse8)) (.cse11 (not (<= |old(~q_req_up~0)| 0))) (.cse14 (not (<= 1 |old(~q_free~0)|))) (.cse15 (not (<= 2 ~q_write_ev~0))) (.cse9 (not (<= |old(~c_dr_pc~0)| 0))) (.cse16 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= 1 |old(~p_dw_pc~0)|))) (.cse13 (not (= 0 |old(~p_dw_st~0)|))) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse3 (not .cse30)) (.cse29 (and .cse21 .cse22 .cse7 .cse8)) (.cse18 (not (= 1 |old(~c_dr_pc~0)|))) (.cse10 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8) .cse9 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse17 .cse18 .cse10) (or .cse11 (not (<= 2 ~slow_clk_edge~0)) (and .cse19 .cse20 .cse21 .cse22 .cse5 .cse8) .cse23 .cse13 .cse14 .cse24 .cse3 .cse15 .cse9 (not (<= |old(~p_dw_pc~0)| 0)) .cse10) (or (and .cse6 .cse5 .cse7 .cse8) .cse12 .cse13 .cse2 .cse3 .cse25 .cse9 .cse26 .cse27 .cse10) (or .cse12 .cse1 .cse2 .cse3 .cse21 .cse9 .cse10) (or .cse23 .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse27 .cse18 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse25 .cse9 .cse17 .cse10) (or .cse11 .cse12 .cse1 .cse14 .cse3 .cse15 (and .cse20 .cse21 .cse22 .cse5 .cse8) .cse18 .cse10) (or .cse12 .cse1 .cse2 .cse3 .cse21 .cse18 .cse10) (or .cse11 .cse12 .cse1 .cse14 .cse3 .cse15 .cse28 .cse16 .cse18 .cse10) (or .cse1 .cse2 .cse3 .cse18 (and .cse4 .cse22 .cse5 .cse7 .cse8) .cse10) (or .cse11 .cse12 .cse1 .cse14 .cse24 .cse3 .cse15 .cse28 .cse9 .cse10) (or .cse0 .cse1 .cse2 .cse3 .cse16 .cse18 .cse10) (or .cse12 .cse13 .cse2 .cse3 .cse26 .cse16 .cse27 .cse18 .cse10) (or .cse11 .cse12 .cse13 .cse14 .cse3 .cse15 .cse29 .cse18 .cse10) (or .cse3 (and .cse19 .cse6) .cse9 .cse16) (or .cse12 .cse13 .cse2 .cse3 .cse29 (and .cse22 .cse5 .cse7 .cse8) .cse18 .cse10))))) [2020-07-21 23:48:05,413 INFO L268 CegarLoopResult]: For program point L429(lines 429 436) no Hoare annotation was computed. [2020-07-21 23:48:05,413 INFO L264 CegarLoopResult]: At program point L425(lines 400 440) the Hoare annotation is: (let ((.cse34 (<= 1 |old(~p_dw_pc~0)|))) (let ((.cse36 (<= 2 ~q_write_ev~0)) (.cse33 (<= 2 ~q_read_ev~0)) (.cse16 (<= ~c_dr_pc~0 0)) (.cse10 (= 0 ~p_dw_st~0)) (.cse24 (<= ~q_free~0 0)) (.cse31 (or .cse34 (< ~p_dw_pc~0 1))) (.cse22 (<= 2 ~c_dr_st~0)) (.cse7 (<= 1 ~q_free~0)) (.cse37 (<= ~q_req_up~0 0)) (.cse8 (= 1 ~p_dw_pc~0)) (.cse35 (= 1 ~p_dw_i~0)) (.cse9 (= ~c_dr_pc~0 1)) (.cse11 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse25 (<= 2 ~p_dw_st~0))) (let ((.cse29 (and .cse31 .cse22 .cse7 .cse37 .cse8 .cse35 .cse9 .cse11 .cse25)) (.cse6 (and .cse8 .cse9 .cse24 .cse25)) (.cse26 (and .cse22 .cse35 .cse8 .cse9 .cse24 .cse25)) (.cse27 (and .cse31 .cse22 .cse8 .cse35 .cse9 .cse10 .cse11 .cse24)) (.cse28 (and .cse22 .cse35 .cse9 .cse11 .cse24 .cse25)) (.cse15 (and .cse8 .cse16 .cse24 .cse25)) (.cse21 (not (<= 2 ~fast_clk_edge~0))) (.cse19 (not (<= 2 |old(~p_dw_st~0)|))) (.cse20 (not (<= |old(~q_free~0)| 0))) (.cse17 (not (<= |old(~c_dr_pc~0)| 0))) (.cse30 (and .cse31 .cse22 .cse33 .cse9 .cse35 .cse11 .cse24 .cse25)) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse14 (and .cse31 .cse22 .cse7 .cse37 .cse35 .cse8 .cse9 .cse10 .cse11 .cse36)) (.cse1 (not (= 1 |old(~p_dw_pc~0)|))) (.cse2 (not (= 0 |old(~p_dw_st~0)|))) (.cse3 (not (<= 1 |old(~q_free~0)|))) (.cse4 (not .cse35)) (.cse5 (not .cse36)) (.cse23 (not (<= 2 |old(~c_dr_st~0)|))) (.cse12 (not (= 1 |old(~c_dr_pc~0)|))) (.cse18 (and .cse34 .cse22 .cse35 .cse8 .cse9 .cse24 .cse25 .cse36)) (.cse13 (not .cse33))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13) (or .cse0 .cse14 .cse2 .cse1 .cse3 .cse4 .cse5 .cse15 (and .cse7 .cse8 .cse10 .cse16 .cse11) .cse17 .cse18 .cse13) (or .cse1 .cse19 .cse20 .cse4 .cse8 .cse17 .cse13) (or .cse21 .cse1 .cse2 .cse3 (and .cse22 .cse7 .cse9 .cse8 .cse10) .cse4 .cse5 .cse23 (and .cse22 .cse8 .cse9 .cse24 .cse25) .cse12 .cse13) (or .cse26 .cse1 .cse2 .cse20 .cse27 .cse4 .cse28 .cse23 .cse12 .cse13) (or .cse1 .cse19 .cse20 .cse4 .cse8 .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 (and .cse7 .cse8 .cse9 .cse11 .cse25) .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse29 .cse23 .cse12 .cse13) (or .cse0 .cse1 .cse19 .cse3 .cse4 .cse5 .cse29 .cse17 (and .cse7 .cse8 .cse16 .cse11 .cse25) .cse13) (or (and .cse8 .cse9 .cse10 .cse11 .cse24) .cse1 .cse2 .cse20 .cse4 .cse6 (and .cse9 .cse11 .cse24 .cse25) .cse12 .cse13) (or .cse19 .cse20 .cse4 .cse23 .cse30 .cse12 .cse13) (or .cse19 .cse20 .cse4 .cse12 (and .cse31 .cse9 .cse11 .cse24 .cse25) .cse13) (or .cse26 .cse2 .cse1 .cse20 .cse27 .cse4 .cse28 .cse15 .cse17 (and .cse11 .cse16 .cse24 .cse25) (and .cse8 .cse10 .cse11 .cse16 .cse24) .cse13) (or .cse4 (and .cse22 .cse16) .cse17 .cse23) (let ((.cse32 (<= ~p_dw_pc~0 0))) (or (not (<= 2 ~slow_clk_edge~0)) .cse21 (and .cse22 .cse7 .cse8 .cse9 .cse11 .cse25) .cse2 .cse3 .cse5 (and .cse7 .cse32 .cse10 .cse16 .cse11) (not (<= |old(~p_dw_pc~0)| 0)) .cse13 .cse0 (and .cse22 .cse7 .cse32 .cse9 .cse10 .cse11 (<= 1 eval_~tmp___1~0)) (and .cse7 .cse8 .cse11 .cse16 .cse25) .cse4 .cse17)) (or (and .cse31 .cse16 .cse11 .cse24 .cse25) .cse19 .cse20 .cse4 .cse17 .cse30 .cse13) (or .cse0 .cse14 .cse1 .cse2 .cse3 .cse4 .cse5 .cse23 .cse12 .cse18 .cse13))))) [2020-07-21 23:48:05,414 INFO L271 CegarLoopResult]: At program point L462(lines 451 464) the Hoare annotation is: true [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point L455(lines 455 460) no Hoare annotation was computed. [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point stop_simulationEXIT(lines 447 465) no Hoare annotation was computed. [2020-07-21 23:48:05,414 INFO L271 CegarLoopResult]: At program point L453(line 453) the Hoare annotation is: true [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point L453-1(line 453) no Hoare annotation was computed. [2020-07-21 23:48:05,414 INFO L271 CegarLoopResult]: At program point stop_simulationENTRY(lines 447 465) the Hoare annotation is: true [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point stop_simulationFINAL(lines 447 465) no Hoare annotation was computed. [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point L96(lines 96 101) no Hoare annotation was computed. [2020-07-21 23:48:05,414 INFO L268 CegarLoopResult]: For program point L95-1(lines 95 104) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L271 CegarLoopResult]: At program point is_do_read_c_triggeredENTRY(lines 81 109) the Hoare annotation is: true [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point L86(lines 86 91) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point L85(lines 85 94) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point L85-2(lines 84 108) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredFINAL(lines 81 109) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L264 CegarLoopResult]: At program point L106(lines 84 108) the Hoare annotation is: (let ((.cse7 (not (<= 2 ~p_dw_st~0))) (.cse1 (not (<= 2 ~slow_clk_edge~0))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse11 (not (<= ~q_free~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse9 (not (<= ~c_dr_pc~0 0))) (.cse10 (not (= 0 ~p_dw_st~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (= 0 is_do_read_c_triggered_~__retres1~1)) (.cse6 (not (<= ~q_req_up~0 0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse9 .cse1 .cse10 (not (<= 2 ~fast_clk_edge~0)) .cse3 .cse4 .cse5 .cse6 .cse8) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (or .cse9 .cse3 .cse5 .cse7 .cse11 .cse8) (or .cse0 .cse9 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse9 .cse10 .cse3 .cse5 .cse11 .cse8) (or .cse9 .cse3 .cse5 (not (<= 2 ~c_dr_st~0))) (or .cse1 .cse2 .cse3 .cse5 .cse7 .cse11 .cse8) (or .cse0 .cse1 .cse10 .cse2 .cse3 .cse5 .cse11 .cse8) (or .cse0 .cse9 .cse10 .cse3 .cse4 .cse5 .cse6 .cse8))) [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point is_do_read_c_triggeredEXIT(lines 81 109) no Hoare annotation was computed. [2020-07-21 23:48:05,415 INFO L264 CegarLoopResult]: At program point update_channelsENTRY(lines 244 258) the Hoare annotation is: (let ((.cse9 (<= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse10 (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (let ((.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= 1 ~p_dw_pc~0))) (.cse8 (not (<= ~c_dr_pc~0 0))) (.cse5 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (and (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse9 .cse10)) (.cse6 (not (<= 2 ~p_dw_st~0))) (.cse11 (not (<= ~q_free~0 0))) (.cse7 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse3 (and .cse9 .cse10) (not (<= 2 ~c_dr_st~0))) (or .cse8 .cse3 .cse4 .cse6 .cse11 .cse7) (or .cse0 (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse8 (not (<= 2 ~slow_clk_edge~0)) (not (= 0 ~p_dw_st~0)) (not (<= 2 ~fast_clk_edge~0)) .cse3 .cse4 .cse5 .cse7) (or .cse0 .cse1 .cse8 .cse3 .cse5 .cse4 .cse6 .cse7) (or .cse2 .cse3 .cse4 .cse6 .cse11 .cse7)))) [2020-07-21 23:48:05,415 INFO L268 CegarLoopResult]: For program point update_channelsEXIT(lines 244 258) no Hoare annotation was computed. [2020-07-21 23:48:05,416 INFO L264 CegarLoopResult]: At program point L250(line 250) the Hoare annotation is: (let ((.cse7 (<= |old(~q_read_ev~0)| ~q_read_ev~0)) (.cse8 (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (let ((.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= 1 ~p_dw_pc~0))) (.cse9 (not (= ~c_dr_pc~0 1))) (.cse4 (not (<= 2 |old(~q_write_ev~0)|))) (.cse2 (not (<= ~c_dr_pc~0 0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (not (<= 2 ~p_dw_st~0))) (.cse10 (not (<= ~q_free~0 0))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|))) (.cse11 (and (<= 1 |old(~q_req_up~0)|) (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse7 .cse8))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse2 (not (<= 2 ~slow_clk_edge~0)) (not (= 0 ~p_dw_st~0)) (not (<= 2 ~fast_clk_edge~0)) .cse3 .cse4 .cse6) (or .cse2 .cse3 (and .cse7 .cse8) (not (<= 2 ~c_dr_st~0))) (or .cse9 .cse3 .cse5 .cse10 .cse6 .cse11) (or .cse0 .cse1 .cse9 .cse3 .cse4 .cse5 .cse6) (or .cse2 .cse3 .cse5 .cse10 .cse6 .cse11)))) [2020-07-21 23:48:05,416 INFO L268 CegarLoopResult]: For program point L248(lines 244 258) no Hoare annotation was computed. [2020-07-21 23:48:05,416 INFO L264 CegarLoopResult]: At program point fire_delta_eventsENTRY(lines 297 314) the Hoare annotation is: (let ((.cse3 (not (= ~c_dr_pc~0 1))) (.cse5 (not (<= ~q_free~0 0))) (.cse7 (not (= 1 ~p_dw_pc~0))) (.cse4 (not (<= 2 ~p_dw_st~0))) (.cse0 (not (<= ~c_dr_pc~0 0))) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse2 (and (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0))) (.cse8 (not (<= 2 |old(~q_write_ev~0)|))) (.cse9 (not (<= ~q_req_up~0 0))) (.cse6 (not (<= 2 |old(~q_read_ev~0)|)))) (and (or .cse0 .cse1 .cse2 (not (<= 2 ~c_dr_st~0))) (or .cse3 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse1 .cse2 .cse8 .cse9 .cse4 .cse6) (or .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse8 .cse9 .cse4 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse0 (not (<= 2 ~slow_clk_edge~0)) (not (= 0 ~p_dw_st~0)) (not (<= 2 ~fast_clk_edge~0)) .cse1 .cse2 .cse8 .cse9 .cse6))) [2020-07-21 23:48:05,416 INFO L268 CegarLoopResult]: For program point L306-1(lines 297 314) no Hoare annotation was computed. [2020-07-21 23:48:05,416 INFO L268 CegarLoopResult]: For program point L301-1(lines 300 313) no Hoare annotation was computed. [2020-07-21 23:48:05,416 INFO L268 CegarLoopResult]: For program point fire_delta_eventsEXIT(lines 297 314) no Hoare annotation was computed. [2020-07-21 23:48:05,416 INFO L264 CegarLoopResult]: At program point L481-1(lines 478 518) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse11 (<= 2 ~fast_clk_edge~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse10 .cse0 .cse5 .cse1 .cse11 .cse8 .cse7) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) .cse0 .cse11 .cse8 (<= 2 ~slow_clk_edge~0) .cse6 .cse4 .cse7) (not (= 1 ~p_dw_i~0)) (and .cse10 .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,416 INFO L264 CegarLoopResult]: At program point L477(line 477) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_st~0)) (.cse0 (<= 2 ~fast_clk_edge~0)) (.cse2 (<= 2 ~slow_clk_edge~0)) (.cse3 (<= ~c_dr_pc~0 0))) (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse3 (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (and (<= 2 ~c_dr_st~0) .cse1 .cse0 .cse2 .cse3) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,417 INFO L264 CegarLoopResult]: At program point L475(line 475) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_st~0)) (.cse0 (<= 2 ~fast_clk_edge~0)) (.cse2 (<= 2 ~slow_clk_edge~0)) (.cse3 (<= ~c_dr_pc~0 0))) (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse3 (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (and (<= 2 ~c_dr_st~0) .cse1 .cse0 .cse2 .cse3) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,417 INFO L268 CegarLoopResult]: For program point start_simulationEXIT(lines 466 524) no Hoare annotation was computed. [2020-07-21 23:48:05,417 INFO L264 CegarLoopResult]: At program point L504(line 504) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,417 INFO L268 CegarLoopResult]: For program point L500(lines 500 509) no Hoare annotation was computed. [2020-07-21 23:48:05,417 INFO L264 CegarLoopResult]: At program point L500-1(lines 500 509) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse10 .cse0 .cse5 .cse1 (<= 2 ~fast_clk_edge~0) .cse8 .cse7) (not (= 1 ~p_dw_i~0)) (and .cse10 .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,417 INFO L268 CegarLoopResult]: For program point L498(line 498) no Hoare annotation was computed. [2020-07-21 23:48:05,417 INFO L264 CegarLoopResult]: At program point L494(line 494) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,417 INFO L271 CegarLoopResult]: At program point L519(lines 466 524) the Hoare annotation is: true [2020-07-21 23:48:05,418 INFO L268 CegarLoopResult]: For program point L482(line 482) no Hoare annotation was computed. [2020-07-21 23:48:05,418 INFO L268 CegarLoopResult]: For program point L513(lines 513 517) no Hoare annotation was computed. [2020-07-21 23:48:05,418 INFO L264 CegarLoopResult]: At program point start_simulationENTRY(lines 466 524) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (<= 2 ~fast_clk_edge~0) (= 0 ~p_dw_st~0) (<= 2 ~slow_clk_edge~0) (<= ~q_req_up~0 |old(~q_req_up~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 (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,418 INFO L268 CegarLoopResult]: For program point L511(line 511) no Hoare annotation was computed. [2020-07-21 23:48:05,418 INFO L264 CegarLoopResult]: At program point L476(line 476) the Hoare annotation is: (let ((.cse1 (= 0 ~p_dw_st~0)) (.cse0 (<= 2 ~fast_clk_edge~0)) (.cse2 (<= 2 ~slow_clk_edge~0)) (.cse3 (<= ~c_dr_pc~0 0))) (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) .cse0 .cse1 .cse2 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse3 (<= |old(~q_read_ev~0)| ~q_read_ev~0) (<= |old(~q_write_ev~0)| ~q_write_ev~0)) (and (<= 2 ~c_dr_st~0) .cse1 .cse0 .cse2 .cse3) (not (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,418 INFO L264 CegarLoopResult]: At program point L474(line 474) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (<= 2 ~fast_clk_edge~0) (= 0 ~p_dw_st~0) (<= 2 ~slow_clk_edge~0) (<= ~q_req_up~0 |old(~q_req_up~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 (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L474-1(line 474) the Hoare annotation is: (or (not (<= |old(~q_req_up~0)| 0)) (not (= 0 |old(~p_dw_st~0)|)) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) (<= 2 ~fast_clk_edge~0) (= 0 ~p_dw_st~0) (<= 2 ~slow_clk_edge~0) (<= ~q_req_up~0 |old(~q_req_up~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 (<= 1 |old(~q_free~0)|)) (not (= 1 ~p_dw_i~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-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L503(line 503) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L503-1(line 503) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L495(line 495) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L493(line 493) the Hoare annotation is: (let ((.cse2 (<= ~q_free~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse3 .cse6) (and (<= ~q_req_up~0 0) .cse0 .cse5 .cse1 .cse3 .cse6) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L493-1(line 493) the Hoare annotation is: (let ((.cse2 (<= ~q_free~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse3 .cse6) (and (<= ~q_req_up~0 0) .cse0 .cse5 .cse1 .cse3 .cse6) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,419 INFO L264 CegarLoopResult]: At program point L489(line 489) the Hoare annotation is: (let ((.cse2 (<= ~q_free~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse6 (<= 2 ~q_write_ev~0)) (.cse4 (<= ~c_dr_pc~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 (<= ~q_req_up~0 |old(~q_req_up~0)|) .cse4 .cse3 .cse6) (and (<= ~q_req_up~0 0) .cse0 .cse5 .cse1 .cse3 .cse6) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (not (= 1 ~p_dw_i~0)) (and (<= 2 ~c_dr_st~0) .cse4) (not (<= |old(~c_dr_pc~0)| 0)) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L489-1(line 489) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L264 CegarLoopResult]: At program point L485(line 485) the Hoare annotation is: (let ((.cse3 (<= 2 ~p_dw_st~0)) (.cse11 (<= 2 ~fast_clk_edge~0)) (.cse6 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse10 (<= 2 ~c_dr_st~0)) (.cse4 (<= ~c_dr_pc~0 0)) (.cse2 (<= ~q_free~0 0)) (.cse9 (<= ~q_req_up~0 0)) (.cse0 (<= 2 ~q_read_ev~0)) (.cse5 (= 1 ~p_dw_pc~0)) (.cse1 (= ~c_dr_pc~0 1)) (.cse8 (= 0 ~p_dw_st~0)) (.cse7 (<= 2 ~q_write_ev~0))) (or (and .cse0 .cse1 .cse2 .cse3) (not (= 0 |old(~p_dw_st~0)|)) (not (<= 1 |old(~q_free~0)|)) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse5 .cse6 .cse4 .cse3 .cse7) (and .cse0 .cse5 .cse1 .cse8 .cse2) (and .cse9 .cse0 .cse5 .cse1 .cse3 .cse7) (and .cse0 .cse5 .cse8 .cse6 .cse4 .cse7) (not (<= 2 |old(~q_write_ev~0)|)) (not (<= |old(~p_dw_pc~0)| 0)) (not (<= 2 |old(~fast_clk_edge~0)|)) (not (<= |old(~q_req_up~0)| 0)) (and .cse10 .cse0 .cse5 .cse1 .cse11 .cse8 .cse7) (and (<= 1 ~q_free~0) (<= ~p_dw_pc~0 0) .cse0 .cse11 .cse8 (<= 2 ~slow_clk_edge~0) .cse6 .cse4 .cse7) (not (= 1 ~p_dw_i~0)) (and .cse10 .cse4) (and .cse0 .cse5 .cse8 .cse4 .cse2) (not (<= |old(~c_dr_pc~0)| 0)) (and .cse9 .cse0 .cse5 .cse1 .cse8 .cse7) (not (<= 2 |old(~slow_clk_edge~0)|)) (not (<= 2 |old(~q_read_ev~0)|)))) [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L485-1(line 485) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~p_dw_pc~0 0) (<= ~q_req_up~0 0) (= 0 ~p_dw_st~0) (<= ~c_dr_pc~0 0) (<= ~q_free~0 0)) [2020-07-21 23:48:05,420 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L66-1(lines 66 75) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L57(lines 57 62) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L56(lines 56 65) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point L56-2(lines 55 79) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredFINAL(lines 52 80) no Hoare annotation was computed. [2020-07-21 23:48:05,420 INFO L268 CegarLoopResult]: For program point is_do_write_p_triggeredEXIT(lines 52 80) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L264 CegarLoopResult]: At program point L77(lines 55 79) the Hoare annotation is: (let ((.cse3 (= 1 ~p_dw_pc~0))) (let ((.cse9 (not .cse3)) (.cse1 (not (= ~c_dr_pc~0 1))) (.cse4 (not (<= 2 ~p_dw_st~0))) (.cse5 (not (<= ~q_free~0 0))) (.cse8 (not (<= ~c_dr_pc~0 0))) (.cse7 (not (<= 2 ~fast_clk_edge~0))) (.cse0 (= 0 is_do_write_p_triggered_~__retres1~0)) (.cse2 (not (= 1 ~p_dw_i~0))) (.cse10 (not (<= 2 ~q_write_ev~0))) (.cse11 (not (<= ~q_req_up~0 0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse2 .cse4 .cse5 .cse6) (or .cse8 .cse7 .cse0 .cse2 .cse4 .cse5 .cse6) (or .cse8 .cse7 .cse0 .cse2 (not (<= 2 ~c_dr_st~0)) .cse6) (or .cse9 .cse8 .cse7 .cse0 .cse2 .cse10 .cse11 .cse4 .cse6) (or .cse9 .cse7 .cse0 .cse1 .cse2 .cse10 .cse11 .cse4 .cse6) (or .cse8 .cse0 .cse2 .cse3 .cse4 .cse5 .cse6) (or (not (<= ~p_dw_pc~0 0)) (not (<= 1 ~q_free~0)) .cse8 (not (<= 2 ~slow_clk_edge~0)) (not (= 0 ~p_dw_st~0)) .cse7 .cse0 .cse2 .cse10 .cse11 .cse6)))) [2020-07-21 23:48:05,421 INFO L271 CegarLoopResult]: At program point is_do_write_p_triggeredENTRY(lines 52 80) the Hoare annotation is: true [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point L67(lines 67 72) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point reset_time_eventsEXIT(lines 351 368) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point L360-1(lines 351 368) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L264 CegarLoopResult]: At program point reset_time_eventsENTRY(lines 351 368) the Hoare annotation is: (let ((.cse9 (not (<= 2 ~p_dw_st~0))) (.cse1 (not (<= ~c_dr_pc~0 0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse7 (not (<= ~q_req_up~0 0))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse11 (not (= ~c_dr_pc~0 1))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse5 (<= 2 ~slow_clk_edge~0)) (.cse6 (not (<= 2 |old(~slow_clk_edge~0)|))) (.cse10 (not (<= ~q_free~0 0))) (.cse8 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse1 .cse3 .cse5 .cse6 .cse9 .cse10 .cse8) (or .cse0 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse11 .cse3 .cse5 .cse6 .cse9 .cse10 .cse8) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse8) (or .cse1 .cse3 .cse5 .cse6 (not (<= 2 ~c_dr_st~0))) (or .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse10 .cse8) (or .cse0 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse0 .cse2 .cse11 .cse3 .cse5 .cse6 .cse10 .cse8))) [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point L355-1(lines 354 367) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point L225(lines 225 231) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point L192(lines 192 196) no Hoare annotation was computed. [2020-07-21 23:48:05,421 INFO L268 CegarLoopResult]: For program point do_read_cEXIT(lines 185 243) no Hoare annotation was computed. [2020-07-21 23:48:05,422 INFO L264 CegarLoopResult]: At program point L238(lines 185 243) the Hoare annotation is: (let ((.cse21 (= 0 ~p_dw_st~0)) (.cse19 (<= 2 ~q_write_ev~0)) (.cse16 (<= 1 ~q_free~0)) (.cse24 (<= ~q_req_up~0 0)) (.cse22 (= 1 ~p_dw_pc~0)) (.cse20 (= 1 ~p_dw_i~0)) (.cse25 (<= 2 ~p_dw_st~0)) (.cse15 (<= 2 ~c_dr_st~0)) (.cse17 (= ~c_dr_pc~0 1)) (.cse18 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse23 (<= ~q_free~0 0))) (let ((.cse0 (and .cse15 .cse17 .cse18 .cse23)) (.cse11 (and .cse15 .cse16 .cse24 .cse22 .cse20 .cse17 .cse18 .cse25)) (.cse4 (not .cse25)) (.cse14 (and .cse15 .cse16 .cse24 .cse22 .cse20 .cse17 .cse21 .cse18 .cse19)) (.cse7 (not .cse22)) (.cse1 (not (<= |old(~q_free~0)| 0))) (.cse3 (not (= 1 |old(~c_dr_pc~0)|))) (.cse13 (and .cse15 .cse22 .cse20 .cse17 .cse21 .cse18 .cse23)) (.cse6 (not (<= |old(~q_req_up~0)| 0))) (.cse12 (not .cse21)) (.cse8 (not (<= 1 |old(~q_free~0)|))) (.cse2 (not .cse20)) (.cse9 (not .cse19)) (.cse10 (not (<= |old(~c_dr_pc~0)| 0))) (.cse5 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse2 .cse9 .cse10 .cse11 .cse4 .cse5) (or .cse7 .cse12 .cse1 .cse2 .cse10 .cse13 .cse5) (or .cse6 .cse7 .cse14 .cse12 .cse8 .cse2 .cse9 .cse10 .cse5) (or .cse0 .cse1 .cse2 .cse10 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse14 .cse12 .cse8 .cse2 .cse9 .cse3 .cse5) (or .cse7 .cse12 .cse1 .cse2 .cse3 .cse13 .cse5) (or .cse6 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse12 (not (<= 2 ~fast_clk_edge~0)) .cse8 .cse2 .cse9 .cse10 (and .cse15 .cse16 .cse17 .cse18) .cse5)))) [2020-07-21 23:48:05,422 INFO L264 CegarLoopResult]: At program point L234(line 234) the Hoare annotation is: (let ((.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse7 (not (<= |old(~q_free~0)| 0))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= 1 ~p_dw_pc~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse8 .cse6) (or .cse7 .cse3 .cse5 .cse9 .cse6) (or .cse0 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse2 (not (<= 2 ~fast_clk_edge~0)) (not (<= 1 |old(~q_free~0)|)) .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6))) [2020-07-21 23:48:05,422 INFO L268 CegarLoopResult]: For program point L201(line 201) no Hoare annotation was computed. [2020-07-21 23:48:05,422 INFO L264 CegarLoopResult]: At program point L234-1(lines 188 242) the Hoare annotation is: (let ((.cse17 (<= 1 ~q_free~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse15 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse16 (<= ~q_free~0 0))) (let ((.cse4 (and .cse18 .cse15 .cse16)) (.cse8 (and .cse17 .cse15)) (.cse12 (not (<= 2 ~p_dw_st~0))) (.cse7 (not (<= |old(~q_req_up~0)| 0))) (.cse9 (not (<= 1 |old(~q_free~0)|))) (.cse10 (not (<= 2 ~q_write_ev~0))) (.cse13 (and .cse17 .cse18 .cse15)) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse0 (not (= 1 ~p_dw_pc~0))) (.cse1 (not (= 0 ~p_dw_st~0))) (.cse2 (not (<= |old(~q_free~0)| 0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse11 (not (<= |old(~c_dr_pc~0)| 0))) (.cse14 (and .cse15 .cse16)) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse0 .cse1 .cse8 .cse9 .cse3 .cse10 .cse11 .cse6) (or .cse2 .cse3 .cse4 .cse5 .cse12 .cse6) (or .cse7 .cse0 .cse9 .cse3 .cse10 .cse13 .cse5 .cse12 .cse6) (or .cse7 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse1 (not (<= 2 ~fast_clk_edge~0)) .cse9 .cse8 .cse3 .cse10 .cse11 .cse6) (or .cse2 .cse3 .cse11 .cse14 .cse12 .cse6) (or .cse7 .cse0 .cse9 .cse8 .cse3 .cse10 .cse11 .cse12 .cse6) (or .cse7 .cse0 .cse1 .cse9 .cse3 .cse10 .cse13 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse11 .cse14 .cse6)))) [2020-07-21 23:48:05,422 INFO L264 CegarLoopResult]: At program point L193(lines 188 242) the Hoare annotation is: (let ((.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse7 (not (<= |old(~q_free~0)| 0))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= 1 ~p_dw_pc~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse8 .cse6) (or .cse7 .cse3 .cse5 .cse9 .cse6) (or .cse0 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse2 (not (<= 2 ~fast_clk_edge~0)) (not (<= 1 |old(~q_free~0)|)) .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6))) [2020-07-21 23:48:05,422 INFO L268 CegarLoopResult]: For program point L224(lines 224 236) no Hoare annotation was computed. [2020-07-21 23:48:05,422 INFO L268 CegarLoopResult]: For program point L189(lines 189 197) no Hoare annotation was computed. [2020-07-21 23:48:05,422 INFO L264 CegarLoopResult]: At program point do_read_cENTRY(lines 185 243) the Hoare annotation is: (let ((.cse15 (<= 1 ~q_free~0)) (.cse18 (= ~c_dr_pc~0 1)) (.cse16 (<= ~q_req_up~0 |old(~q_req_up~0)|)) (.cse17 (<= ~c_dr_pc~0 0)) (.cse19 (<= ~q_free~0 0))) (let ((.cse4 (and .cse16 .cse17 .cse19)) (.cse0 (not (<= |old(~q_free~0)| 0))) (.cse8 (and .cse18 .cse16 .cse19)) (.cse3 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (= 1 ~p_dw_pc~0))) (.cse14 (and .cse15 .cse18 .cse16)) (.cse9 (not (= 1 |old(~c_dr_pc~0)|))) (.cse10 (not (<= |old(~q_req_up~0)| 0))) (.cse7 (not (= 0 ~p_dw_st~0))) (.cse11 (not (<= 1 |old(~q_free~0)|))) (.cse12 (and .cse15 .cse16 .cse17)) (.cse1 (not (= 1 ~p_dw_i~0))) (.cse13 (not (<= 2 ~q_write_ev~0))) (.cse2 (not (<= |old(~c_dr_pc~0)| 0))) (.cse5 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse0 .cse1 .cse2 .cse4 .cse5) (or .cse6 .cse7 .cse0 .cse1 .cse8 .cse9 .cse5) (or .cse10 .cse6 .cse11 .cse12 .cse1 .cse13 .cse2 .cse3 .cse5) (or .cse0 .cse1 .cse8 .cse9 .cse3 .cse5) (or .cse10 .cse6 .cse11 .cse1 .cse13 .cse14 .cse9 .cse3 .cse5) (or .cse10 .cse6 .cse7 .cse11 .cse12 .cse1 .cse13 .cse2 .cse5) (or .cse10 .cse6 .cse7 .cse11 .cse1 .cse13 .cse14 .cse9 .cse5) (or .cse10 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse7 (not (<= 2 ~fast_clk_edge~0)) .cse11 .cse12 .cse1 .cse13 .cse2 .cse5)))) [2020-07-21 23:48:05,423 INFO L268 CegarLoopResult]: For program point L208-1(lines 208 218) no Hoare annotation was computed. [2020-07-21 23:48:05,423 INFO L264 CegarLoopResult]: At program point L229(line 229) the Hoare annotation is: (let ((.cse8 (not (<= |old(~c_dr_pc~0)| 0))) (.cse2 (not (= 0 ~p_dw_st~0))) (.cse7 (not (<= |old(~q_free~0)| 0))) (.cse0 (not (<= |old(~q_req_up~0)| 0))) (.cse1 (not (= 1 ~p_dw_pc~0))) (.cse3 (not (= 1 ~p_dw_i~0))) (.cse4 (not (<= 2 ~q_write_ev~0))) (.cse5 (not (= 1 |old(~c_dr_pc~0)|))) (.cse9 (not (<= 2 ~p_dw_st~0))) (.cse6 (not (<= 2 ~q_read_ev~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse7 .cse3 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse8 .cse6) (or .cse7 .cse3 .cse5 .cse9 .cse6) (or .cse0 (not (<= ~p_dw_pc~0 0)) (not (<= 2 ~slow_clk_edge~0)) .cse2 (not (<= 2 ~fast_clk_edge~0)) (not (<= 1 |old(~q_free~0)|)) .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse8 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse8 .cse9 .cse6) (or .cse1 .cse2 .cse7 .cse3 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse9 .cse6))) [2020-07-21 23:48:05,423 INFO L268 CegarLoopResult]: For program point init_modelFINAL(lines 525 543) no Hoare annotation was computed. [2020-07-21 23:48:05,423 INFO L268 CegarLoopResult]: For program point init_modelEXIT(lines 525 543) no Hoare annotation was computed. [2020-07-21 23:48:05,423 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 (<= ~q_req_up~0 0)) (not (<= |old(~p_dw_pc~0)| 0))) [2020-07-21 23:48:05,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 11:48:05 BoogieIcfgContainer [2020-07-21 23:48:05,495 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-21 23:48:05,496 INFO L168 Benchmark]: Toolchain (without parser) took 138891.69 ms. Allocated memory was 137.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 101.2 MB in the beginning and 961.2 MB in the end (delta: -860.1 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-07-21 23:48:05,497 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-21 23:48:05,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.41 ms. Allocated memory was 137.4 MB in the beginning and 205.0 MB in the end (delta: 67.6 MB). Free memory was 100.8 MB in the beginning and 181.4 MB in the end (delta: -80.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2020-07-21 23:48:05,498 INFO L168 Benchmark]: Boogie Preprocessor took 47.02 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 178.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2020-07-21 23:48:05,498 INFO L168 Benchmark]: RCFGBuilder took 623.50 ms. Allocated memory is still 205.0 MB. Free memory was 178.4 MB in the beginning and 142.6 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. [2020-07-21 23:48:05,499 INFO L168 Benchmark]: TraceAbstraction took 137720.81 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 142.6 MB in the beginning and 961.2 MB in the end (delta: -818.7 MB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2020-07-21 23:48:05,501 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.23 ms. Allocated memory is still 137.4 MB. Free memory is still 120.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 490.41 ms. Allocated memory was 137.4 MB in the beginning and 205.0 MB in the end (delta: 67.6 MB). Free memory was 100.8 MB in the beginning and 181.4 MB in the end (delta: -80.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.02 ms. Allocated memory is still 205.0 MB. Free memory was 181.4 MB in the beginning and 178.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 623.50 ms. Allocated memory is still 205.0 MB. Free memory was 178.4 MB in the beginning and 142.6 MB in the end (delta: 35.8 MB). Peak memory consumption was 35.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 137720.81 ms. Allocated memory was 205.0 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 142.6 MB in the beginning and 961.2 MB in the end (delta: -818.7 MB). Peak memory consumption was 2.3 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_req_up) <= 0) || !(1 == p_dw_pc)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev)) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && (((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && ((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(p_dw_pc <= 0)) || !(2 <= slow_clk_edge)) || !(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)) || !(2 <= q_read_ev))) && ((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && ((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && (((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((((((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)) && ((((((!(2 <= fast_clk_edge) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && ((((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= c_dr_st)) || !(2 <= q_read_ev))) && ((((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(q_req_up <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(1 == p_dw_pc) || !(2 <= fast_clk_edge)) || 0 == __retres1) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(q_req_up <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((!(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))) && ((((((((((!(p_dw_pc <= 0) || !(1 <= q_free)) || !(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)) || !(q_req_up <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 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) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev)) && (((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || (((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((((((((!(\old(q_req_up) <= 0) || !(2 <= slow_clk_edge)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= fast_clk_edge)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || ((((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev))) && ((((((((((((c_dr_pc <= 0 && q_req_up <= \old(q_req_up)) && 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 && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((2 <= c_dr_st && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || ((((2 <= c_dr_st && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((!(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)) || !(2 <= q_read_ev))) && (((((((((!(2 <= fast_clk_edge) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || ((((2 <= c_dr_st && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(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 <= 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) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(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))) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((!(2 <= \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || (((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || ((((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && ((((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 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))) || !(2 <= q_read_ev))) && ((((((((!(1 == \old(p_dw_pc)) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((2 <= c_dr_st && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || ((((2 <= c_dr_st && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(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 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((!(1 == p_dw_i) || (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 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((c_dr_pc == 1 && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev)) - InvariantResult [Line: 135]: Loop Invariant Derived loop invariant: ((((((((((!(1 == \old(p_dw_pc)) || ((q_req_up <= \old(q_req_up) && q_free <= 0) && 2 <= p_dw_st)) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || ((1 == p_dw_pc && q_free <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_read_ev)) && ((((((!(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)) || !(2 <= q_read_ev))) && ((((((((((!(\old(q_req_up) <= 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)) || (((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev))) && ((((((!(c_dr_pc <= 0) || !(1 == \old(p_dw_pc))) || ((q_req_up <= \old(q_req_up) && 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)) || !(2 <= q_read_ev))) && (((((((!(\old(q_req_up) <= 0) || !(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)) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(c_dr_pc <= 0)) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (((((((((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((c_dr_pc == 1 && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev)) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(0 == p_dw_st)) || (1 <= q_free && q_req_up <= \old(q_req_up))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && (((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || ((c_dr_pc == 1 && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((1 <= q_free && c_dr_pc == 1) && q_req_up <= \old(q_req_up))) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((((!(\old(q_req_up) <= 0) || !(p_dw_pc <= 0)) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(2 <= fast_clk_edge)) || !(1 <= \old(q_free))) || (1 <= q_free && q_req_up <= \old(q_req_up))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && (((((!(\old(q_free) <= 0) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || (q_req_up <= \old(q_req_up) && q_free <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(1 <= \old(q_free))) || (1 <= q_free && q_req_up <= \old(q_req_up))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(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) && q_req_up <= \old(q_req_up))) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || (q_req_up <= \old(q_req_up) && q_free <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((((((((((!(\old(q_req_up) <= 0) || !(c_dr_pc <= 0)) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((1 <= \old(p_dw_pc) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc <= 0) && q_free <= 0)) || !(2 <= q_read_ev)) && ((((((((((!(\old(q_req_up) <= 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)) || ((1 <= q_free && p_dw_pc < 1) && q_req_up <= \old(q_req_up))) || !(2 <= c_dr_st)) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev))) && (((((!(1 == \old(p_dw_pc)) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || q_free <= 0) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || !(1 == \old(p_dw_pc))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || ((((1 <= \old(p_dw_pc) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc <= 0) && q_free <= 0)) || !(2 <= q_read_ev))) && (((((!(1 == \old(p_dw_pc)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || q_free <= 0) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(c_dr_pc <= 0)) || !(2 <= slow_clk_edge)) || !(2 <= fast_clk_edge)) || ((1 <= q_free && p_dw_pc <= 0) && q_req_up <= \old(q_req_up))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(q_req_up) <= 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)) || !(2 <= q_read_ev)) && (((((((!(\old(q_req_up) <= 0) || ((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up))) || !(c_dr_pc <= 0)) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(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)) || !(2 <= q_read_ev))) && ((((((((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= q_read_ev))) && (((((!(1 == \old(p_dw_pc)) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || (1 == p_dw_pc && q_req_up <= \old(q_req_up))) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || ((1 == p_dw_pc && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == \old(p_dw_pc))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= q_read_ev)) - InvariantResult [Line: 478]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((2 <= q_read_ev && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || (((2 <= q_read_ev && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || (((((2 <= q_read_ev && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || ((((2 <= q_read_ev && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st) && q_free <= 0)) || (((((q_req_up <= 0 && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc == 1) && 2 <= p_dw_st) && 2 <= q_write_ev)) || (((((2 <= q_read_ev && 1 == p_dw_pc) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= q_write_ev)) || !(2 <= \old(q_write_ev))) || !(\old(p_dw_pc) <= 0)) || !(2 <= \old(fast_clk_edge))) || !(\old(q_req_up) <= 0)) || ((((((2 <= c_dr_st && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc == 1) && 2 <= fast_clk_edge) && 0 == p_dw_st) && 2 <= q_write_ev)) || ((((((((1 <= q_free && p_dw_pc <= 0) && 2 <= q_read_ev) && 2 <= fast_clk_edge) && 0 == p_dw_st) && 2 <= slow_clk_edge) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= q_write_ev)) || !(1 == p_dw_i)) || (2 <= c_dr_st && c_dr_pc <= 0)) || ((((2 <= q_read_ev && 1 == p_dw_pc) && 0 == p_dw_st) && c_dr_pc <= 0) && q_free <= 0)) || !(\old(c_dr_pc) <= 0)) || (((((q_req_up <= 0 && 2 <= q_read_ev) && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st) && 2 <= q_write_ev)) || !(2 <= \old(slow_clk_edge))) || !(2 <= \old(q_read_ev)) - InvariantResult [Line: 280]: Loop Invariant Derived loop invariant: ((((((((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(2 <= q_read_ev)) && ((((((((((!(p_dw_pc <= 0) || !(1 <= q_free)) || !(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) || !(q_req_up <= 0)) || !(2 <= q_read_ev))) && (((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 1 <= __retres1) || !(q_req_up <= 0)) || !(2 <= q_read_ev))) && ((((((((!(1 == p_dw_pc) || !(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)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((((((((!(p_dw_pc <= 0) || !(1 <= q_free)) || !(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)) || !(q_req_up <= 0)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 1 <= __retres1) || !(q_free <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: (((((((((((((!(\old(q_req_up) <= 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)) || !(2 <= q_read_ev)) && (((((!(1 == \old(p_dw_pc)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || q_req_up <= \old(q_req_up)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(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)) || !(2 <= q_read_ev))) && ((((((!(\old(q_req_up) <= 0) || !(c_dr_pc <= 0)) || !(1 == \old(p_dw_pc))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= q_read_ev)) || (1 == p_dw_pc && q_req_up <= \old(q_req_up)))) && (((((!(1 == \old(p_dw_pc)) || !(\old(q_free) <= 0)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || q_req_up <= \old(q_req_up)) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || ((1 == p_dw_pc && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == \old(p_dw_pc))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= q_read_ev)) - InvariantResult [Line: 400]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(q_req_up) <= 0) || !(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) && q_req_up <= \old(q_req_up))) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev)) && (((((((((((!(\old(q_req_up) <= 0) || ((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && 2 <= q_write_ev)) || !(0 == \old(p_dw_st))) || !(1 == \old(p_dw_pc))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((1 == p_dw_pc && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || ((((1 <= q_free && 1 == p_dw_pc) && 0 == p_dw_st) && c_dr_pc <= 0) && q_req_up <= \old(q_req_up))) || !(\old(c_dr_pc) <= 0)) || (((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= q_read_ev))) && ((((((!(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)) || !(2 <= q_read_ev))) && ((((((((((!(2 <= fast_clk_edge) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || ((((2 <= c_dr_st && 1 <= q_free) && c_dr_pc == 1) && 1 == p_dw_pc) && 0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(2 <= \old(c_dr_st))) || ((((2 <= c_dr_st && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || ((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == p_dw_i)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(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))) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || ((((1 <= q_free && 1 == p_dw_pc) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= \old(c_dr_st))) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((((((!(\old(q_req_up) <= 0) || !(1 == \old(p_dw_pc))) || !(2 <= \old(p_dw_st))) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(\old(c_dr_pc) <= 0)) || ((((1 <= q_free && 1 == p_dw_pc) && c_dr_pc <= 0) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((((((1 == p_dw_pc && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && q_free <= 0) || !(1 == \old(p_dw_pc))) || !(0 == \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || (((1 == p_dw_pc && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st)) || (((c_dr_pc == 1 && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(2 <= \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(2 <= \old(c_dr_st))) || ((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 2 <= q_read_ev) && c_dr_pc == 1) && 1 == p_dw_i) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && (((((!(2 <= \old(p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || (((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((((((((((2 <= c_dr_st && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) || !(0 == \old(p_dw_st))) || !(1 == \old(p_dw_pc))) || !(\old(q_free) <= 0)) || ((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(1 == p_dw_i)) || (((((2 <= c_dr_st && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 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)) || (((q_req_up <= \old(q_req_up) && c_dr_pc <= 0) && q_free <= 0) && 2 <= p_dw_st)) || ((((1 == p_dw_pc && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && q_free <= 0)) || !(2 <= q_read_ev))) && (((!(1 == p_dw_i) || (2 <= c_dr_st && c_dr_pc <= 0)) || !(\old(c_dr_pc) <= 0)) || !(2 <= \old(c_dr_st)))) && (((((((((((((!(2 <= slow_clk_edge) || !(2 <= fast_clk_edge)) || (((((2 <= c_dr_st && 1 <= q_free) && 1 == p_dw_pc) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(0 == \old(p_dw_st))) || !(1 <= \old(q_free))) || !(2 <= q_write_ev)) || ((((1 <= q_free && p_dw_pc <= 0) && 0 == p_dw_st) && c_dr_pc <= 0) && q_req_up <= \old(q_req_up))) || !(\old(p_dw_pc) <= 0)) || !(2 <= q_read_ev)) || !(\old(q_req_up) <= 0)) || ((((((2 <= c_dr_st && 1 <= q_free) && p_dw_pc <= 0) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && 1 <= tmp___1)) || ((((1 <= q_free && 1 == p_dw_pc) && q_req_up <= \old(q_req_up)) && c_dr_pc <= 0) && 2 <= p_dw_st)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0))) && (((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && c_dr_pc <= 0) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st) || !(2 <= \old(p_dw_st))) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 2 <= q_read_ev) && c_dr_pc == 1) && 1 == p_dw_i) && q_req_up <= \old(q_req_up)) && q_free <= 0) && 2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((((!(\old(q_req_up) <= 0) || ((((((((((1 <= \old(p_dw_pc) || p_dw_pc < 1) && 2 <= c_dr_st) && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && 2 <= q_write_ev)) || !(1 == \old(p_dw_pc))) || !(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))) || (((((((1 <= \old(p_dw_pc) && 2 <= c_dr_st) && 1 == p_dw_i) && 1 == p_dw_pc) && c_dr_pc == 1) && q_free <= 0) && 2 <= p_dw_st) && 2 <= q_write_ev)) || !(2 <= q_read_ev)) - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: ((((((((((((((((!(1 == p_dw_pc) || !(2 <= slow_clk_edge)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1) || !(q_req_up <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev)) && ((((((((((!(p_dw_pc <= 0) || !(1 <= q_free)) || !(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) || !(q_req_up <= 0)) || !(2 <= q_read_ev))) && ((((((((!(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) || !(q_req_up <= 0)) || !(2 <= q_read_ev))) && (((((!(c_dr_pc <= 0) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1) || !(q_req_up <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || 0 == __retres1) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((!(c_dr_pc <= 0) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= c_dr_st))) && ((((((!(2 <= slow_clk_edge) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 0 == __retres1) || !(2 <= p_dw_st)) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((((!(1 == p_dw_pc) || !(2 <= slow_clk_edge)) || !(0 == p_dw_st)) || !(c_dr_pc == 1)) || !(1 == p_dw_i)) || 0 == __retres1) || !(q_free <= 0)) || !(2 <= q_read_ev))) && (((((((!(1 == p_dw_pc) || !(c_dr_pc <= 0)) || !(0 == p_dw_st)) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || 0 == __retres1) || !(q_req_up <= 0)) || !(2 <= q_read_ev)) - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((((((((((((((2 <= c_dr_st && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev)) && ((((((((!(\old(q_req_up) <= 0) || !(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) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || ((((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || ((((((((2 <= c_dr_st && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && 2 <= q_write_ev)) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(\old(c_dr_pc) <= 0)) || !(2 <= q_read_ev))) && ((((((((2 <= c_dr_st && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && q_free <= 0) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(\old(c_dr_pc) <= 0)) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || (((((((2 <= c_dr_st && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && q_req_up <= \old(q_req_up)) && 2 <= p_dw_st)) || !(1 == \old(c_dr_pc))) || !(2 <= p_dw_st)) || !(2 <= q_read_ev))) && ((((((((!(\old(q_req_up) <= 0) || !(1 == p_dw_pc)) || ((((((((2 <= c_dr_st && 1 <= q_free) && q_req_up <= 0) && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && 2 <= q_write_ev)) || !(0 == p_dw_st)) || !(1 <= \old(q_free))) || !(1 == p_dw_i)) || !(2 <= q_write_ev)) || !(1 == \old(c_dr_pc))) || !(2 <= q_read_ev))) && ((((((!(1 == p_dw_pc) || !(0 == p_dw_st)) || !(\old(q_free) <= 0)) || !(1 == p_dw_i)) || !(1 == \old(c_dr_pc))) || ((((((2 <= c_dr_st && 1 == p_dw_pc) && 1 == p_dw_i) && c_dr_pc == 1) && 0 == p_dw_st) && q_req_up <= \old(q_req_up)) && q_free <= 0)) || !(2 <= q_read_ev))) && ((((((((((!(\old(q_req_up) <= 0) || !(p_dw_pc <= 0)) || !(2 <= slow_clk_edge)) || !(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)) || (((2 <= c_dr_st && 1 <= q_free) && c_dr_pc == 1) && q_req_up <= \old(q_req_up))) || !(2 <= q_read_ev)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 158 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 33.2s, OverallIterations: 18, TraceHistogramMax: 5, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 104.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4133 SDtfs, 2926 SDslu, 4401 SDs, 0 SdLazy, 1589 SolverSat, 432 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2659 GetRequests, 2603 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51634occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.7s AutomataMinimizationTime, 18 MinimizatonAttempts, 7961 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 78445 PreInvPairs, 84655 NumberOfFragments, 15028 HoareAnnotationTreeSize, 78445 FomulaSimplifications, 215568 FormulaSimplificationTreeSizeReduction, 24.3s HoareSimplificationTime, 63 FomulaSimplificationsInter, 425782 FormulaSimplificationTreeSizeReductionInter, 78.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2469 NumberOfCodeBlocks, 1352 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2647 ConstructedInterpolants, 0 QuantifiedInterpolants, 576159 SizeOfPredicates, 20 NumberOfNonLiveVariables, 10223 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 1154/1158 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...