./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8d31f386 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9ce92743863c5d30c478a48a973506d73113681a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.multireach-323-8d31f38 [2021-07-05 10:16:27,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-05 10:16:27,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-05 10:16:28,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-05 10:16:28,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-05 10:16:28,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-05 10:16:28,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-05 10:16:28,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-05 10:16:28,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-05 10:16:28,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-05 10:16:28,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-05 10:16:28,010 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-05 10:16:28,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-05 10:16:28,011 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-05 10:16:28,012 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-05 10:16:28,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-05 10:16:28,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-05 10:16:28,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-05 10:16:28,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-05 10:16:28,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-05 10:16:28,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-05 10:16:28,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-05 10:16:28,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-05 10:16:28,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-05 10:16:28,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-05 10:16:28,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-05 10:16:28,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-05 10:16:28,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-05 10:16:28,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-05 10:16:28,023 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-05 10:16:28,023 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-05 10:16:28,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-05 10:16:28,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-05 10:16:28,025 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-05 10:16:28,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-05 10:16:28,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-05 10:16:28,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-05 10:16:28,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-05 10:16:28,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-05 10:16:28,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-05 10:16:28,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-05 10:16:28,029 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-07-05 10:16:28,043 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-05 10:16:28,043 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-05 10:16:28,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-05 10:16:28,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-05 10:16:28,045 INFO L138 SettingsManager]: * Use SBE=true [2021-07-05 10:16:28,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-05 10:16:28,045 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-05 10:16:28,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-05 10:16:28,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-05 10:16:28,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-05 10:16:28,046 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-05 10:16:28,047 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-05 10:16:28,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-05 10:16:28,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-05 10:16:28,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-05 10:16:28,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 10:16:28,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-05 10:16:28,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-07-05 10:16:28,049 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ce92743863c5d30c478a48a973506d73113681a [2021-07-05 10:16:28,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-05 10:16:28,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-05 10:16:28,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-05 10:16:28,342 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-05 10:16:28,349 INFO L275 PluginConnector]: CDTParser initialized [2021-07-05 10:16:28,350 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-07-05 10:16:28,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128c59576/404c1585589f45e0b15e0403e4a9c053/FLAG1687f736f [2021-07-05 10:16:28,753 INFO L306 CDTParser]: Found 1 translation units. [2021-07-05 10:16:28,754 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c [2021-07-05 10:16:28,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128c59576/404c1585589f45e0b15e0403e4a9c053/FLAG1687f736f [2021-07-05 10:16:29,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/128c59576/404c1585589f45e0b15e0403e4a9c053 [2021-07-05 10:16:29,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-05 10:16:29,149 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-07-05 10:16:29,150 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-05 10:16:29,150 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-05 10:16:29,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-05 10:16:29,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ddd992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29, skipping insertion in model container [2021-07-05 10:16:29,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-05 10:16:29,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-05 10:16:29,265 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[335,348] [2021-07-05 10:16:29,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 10:16:29,298 INFO L203 MainTranslator]: Completed pre-run [2021-07-05 10:16:29,315 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_3.cil.c[335,348] [2021-07-05 10:16:29,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-05 10:16:29,361 INFO L208 MainTranslator]: Completed translation [2021-07-05 10:16:29,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29 WrapperNode [2021-07-05 10:16:29,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-05 10:16:29,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-05 10:16:29,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-05 10:16:29,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-05 10:16:29,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-05 10:16:29,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-05 10:16:29,411 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-05 10:16:29,411 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-05 10:16:29,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,434 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,447 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-05 10:16:29,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-05 10:16:29,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-05 10:16:29,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-05 10:16:29,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (1/1) ... [2021-07-05 10:16:29,462 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-05 10:16:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-07-05 10:16:29,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-07-05 10:16:29,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-07-05 10:16:29,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-05 10:16:29,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-05 10:16:29,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-05 10:16:29,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-05 10:16:30,033 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##104: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0; [2021-07-05 10:16:30,033 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume !(1 == ~q_free~0); [2021-07-05 10:16:30,038 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-05 10:16:30,038 INFO L299 CfgBuilder]: Removed 70 assume(true) statements. [2021-07-05 10:16:30,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:16:30 BoogieIcfgContainer [2021-07-05 10:16:30,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-05 10:16:30,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-05 10:16:30,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-05 10:16:30,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-05 10:16:30,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.07 10:16:29" (1/3) ... [2021-07-05 10:16:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ca8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 10:16:30, skipping insertion in model container [2021-07-05 10:16:30,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.07 10:16:29" (2/3) ... [2021-07-05 10:16:30,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ca8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.07 10:16:30, skipping insertion in model container [2021-07-05 10:16:30,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:16:30" (3/3) ... [2021-07-05 10:16:30,044 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil.c [2021-07-05 10:16:30,048 INFO L198 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-05 10:16:30,048 INFO L158 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-05 10:16:30,098 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 10:16:30,104 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 10:16:30,104 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 10:16:30,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 128 states have (on average 1.6328125) internal successors, (209), 130 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 10:16:30,127 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:30,127 INFO L525 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] [2021-07-05 10:16:30,127 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:30,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:30,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1011086123, now seen corresponding path program 1 times [2021-07-05 10:16:30,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:30,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109054242] [2021-07-05 10:16:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:30,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:30,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:30,259 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:30,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:30,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:30,269 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109054242] [2021-07-05 10:16:30,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109054242] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:30,270 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:30,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:30,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595198297] [2021-07-05 10:16:30,274 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:30,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:30,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:30,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:30,288 INFO L87 Difference]: Start difference. First operand has 131 states, 128 states have (on average 1.6328125) internal successors, (209), 130 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:30,364 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2021-07-05 10:16:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:30,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 10:16:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:30,372 INFO L225 Difference]: With dead ends: 377 [2021-07-05 10:16:30,372 INFO L226 Difference]: Without dead ends: 244 [2021-07-05 10:16:30,374 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-07-05 10:16:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2021-07-05 10:16:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.5311203319502074) internal successors, (369), 241 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 369 transitions. [2021-07-05 10:16:30,425 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 369 transitions. Word has length 40 [2021-07-05 10:16:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:30,426 INFO L442 AbstractCegarLoop]: Abstraction has 242 states and 369 transitions. [2021-07-05 10:16:30,426 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 369 transitions. [2021-07-05 10:16:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 10:16:30,428 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:30,428 INFO L525 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] [2021-07-05 10:16:30,428 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-05 10:16:30,428 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:30,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:30,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2050545625, now seen corresponding path program 1 times [2021-07-05 10:16:30,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:30,430 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081967615] [2021-07-05 10:16:30,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:30,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:30,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:30,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:30,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:30,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081967615] [2021-07-05 10:16:30,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081967615] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:30,480 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:30,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:30,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899787895] [2021-07-05 10:16:30,481 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:16:30,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:30,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:16:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:30,490 INFO L87 Difference]: Start difference. First operand 242 states and 369 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:30,774 INFO L93 Difference]: Finished difference Result 1037 states and 1564 transitions. [2021-07-05 10:16:30,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:16:30,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 10:16:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:30,779 INFO L225 Difference]: With dead ends: 1037 [2021-07-05 10:16:30,779 INFO L226 Difference]: Without dead ends: 799 [2021-07-05 10:16:30,780 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 43.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:16:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-07-05 10:16:30,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2021-07-05 10:16:30,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2021-07-05 10:16:30,809 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 40 [2021-07-05 10:16:30,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:30,809 INFO L442 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2021-07-05 10:16:30,809 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,809 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2021-07-05 10:16:30,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-07-05 10:16:30,810 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:30,810 INFO L525 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] [2021-07-05 10:16:30,811 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-05 10:16:30,811 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:30,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:30,811 INFO L82 PathProgramCache]: Analyzing trace with hash -246769298, now seen corresponding path program 1 times [2021-07-05 10:16:30,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:30,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692226644] [2021-07-05 10:16:30,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:30,812 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:30,841 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,842 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:30,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,854 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,855 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:30,862 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:30,862 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:30,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:30,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:30,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692226644] [2021-07-05 10:16:30,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692226644] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:30,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:30,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:16:30,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484587907] [2021-07-05 10:16:30,865 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:16:30,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:30,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:16:30,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:30,866 INFO L87 Difference]: Start difference. First operand 773 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:30,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:30,969 INFO L93 Difference]: Finished difference Result 2603 states and 3883 transitions. [2021-07-05 10:16:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:16:30,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-07-05 10:16:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:30,975 INFO L225 Difference]: With dead ends: 2603 [2021-07-05 10:16:30,975 INFO L226 Difference]: Without dead ends: 1845 [2021-07-05 10:16:30,976 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:16:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-07-05 10:16:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 809. [2021-07-05 10:16:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.4591584158415842) internal successors, (1179), 808 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1179 transitions. [2021-07-05 10:16:31,002 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1179 transitions. Word has length 41 [2021-07-05 10:16:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:31,002 INFO L442 AbstractCegarLoop]: Abstraction has 809 states and 1179 transitions. [2021-07-05 10:16:31,003 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1179 transitions. [2021-07-05 10:16:31,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-07-05 10:16:31,004 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:31,004 INFO L525 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] [2021-07-05 10:16:31,004 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-05 10:16:31,004 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:31,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1676458736, now seen corresponding path program 1 times [2021-07-05 10:16:31,005 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:31,005 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933445287] [2021-07-05 10:16:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:31,005 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:31,026 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,027 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:31,051 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,052 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:31,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:31,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:31,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933445287] [2021-07-05 10:16:31,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933445287] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:31,053 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:31,053 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:31,053 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111625279] [2021-07-05 10:16:31,053 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:16:31,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:31,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:16:31,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:31,054 INFO L87 Difference]: Start difference. First operand 809 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:31,243 INFO L93 Difference]: Finished difference Result 2571 states and 3717 transitions. [2021-07-05 10:16:31,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:16:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-07-05 10:16:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:31,249 INFO L225 Difference]: With dead ends: 2571 [2021-07-05 10:16:31,249 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:16:31,250 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 42.6ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:16:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:16:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1720. [2021-07-05 10:16:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.423502036067481) internal successors, (2447), 1719 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2447 transitions. [2021-07-05 10:16:31,305 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2447 transitions. Word has length 41 [2021-07-05 10:16:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:31,306 INFO L442 AbstractCegarLoop]: Abstraction has 1720 states and 2447 transitions. [2021-07-05 10:16:31,306 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2447 transitions. [2021-07-05 10:16:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:16:31,311 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:31,311 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:16:31,311 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-05 10:16:31,312 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:31,313 INFO L82 PathProgramCache]: Analyzing trace with hash -102033812, now seen corresponding path program 1 times [2021-07-05 10:16:31,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:31,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686565709] [2021-07-05 10:16:31,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:31,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:31,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:31,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,375 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-07-05 10:16:31,383 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:31,383 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686565709] [2021-07-05 10:16:31,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686565709] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:31,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:31,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:16:31,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395715110] [2021-07-05 10:16:31,387 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:16:31,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:16:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:31,389 INFO L87 Difference]: Start difference. First operand 1720 states and 2447 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:31,559 INFO L93 Difference]: Finished difference Result 5618 states and 8050 transitions. [2021-07-05 10:16:31,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:16:31,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-07-05 10:16:31,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:31,570 INFO L225 Difference]: With dead ends: 5618 [2021-07-05 10:16:31,570 INFO L226 Difference]: Without dead ends: 3920 [2021-07-05 10:16:31,572 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27.9ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:16:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-07-05 10:16:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 1828. [2021-07-05 10:16:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 1.3946360153256705) internal successors, (2548), 1827 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2548 transitions. [2021-07-05 10:16:31,658 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2548 transitions. Word has length 54 [2021-07-05 10:16:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:31,659 INFO L442 AbstractCegarLoop]: Abstraction has 1828 states and 2548 transitions. [2021-07-05 10:16:31,659 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2548 transitions. [2021-07-05 10:16:31,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:16:31,659 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:31,660 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:16:31,660 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-05 10:16:31,660 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:31,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:31,660 INFO L82 PathProgramCache]: Analyzing trace with hash -174420370, now seen corresponding path program 1 times [2021-07-05 10:16:31,661 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:31,661 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270698688] [2021-07-05 10:16:31,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:31,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:31,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:31,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:31,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:31,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:31,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-07-05 10:16:31,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:31,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270698688] [2021-07-05 10:16:31,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270698688] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:31,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:31,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:31,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565134353] [2021-07-05 10:16:31,689 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:31,689 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:31,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:31,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:31,690 INFO L87 Difference]: Start difference. First operand 1828 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:31,884 INFO L93 Difference]: Finished difference Result 5107 states and 7063 transitions. [2021-07-05 10:16:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:16:31,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-07-05 10:16:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:31,892 INFO L225 Difference]: With dead ends: 5107 [2021-07-05 10:16:31,892 INFO L226 Difference]: Without dead ends: 3303 [2021-07-05 10:16:31,896 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-07-05 10:16:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2255. [2021-07-05 10:16:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2254 states have (on average 1.3589174800354924) internal successors, (3063), 2254 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3063 transitions. [2021-07-05 10:16:31,998 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3063 transitions. Word has length 54 [2021-07-05 10:16:31,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:32,005 INFO L442 AbstractCegarLoop]: Abstraction has 2255 states and 3063 transitions. [2021-07-05 10:16:32,005 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:32,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3063 transitions. [2021-07-05 10:16:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-07-05 10:16:32,006 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:32,006 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:16:32,006 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-05 10:16:32,006 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:32,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:32,007 INFO L82 PathProgramCache]: Analyzing trace with hash 527179504, now seen corresponding path program 1 times [2021-07-05 10:16:32,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:32,007 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755602822] [2021-07-05 10:16:32,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:32,008 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:32,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:32,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:32,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:32,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 10:16:32,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:32,037 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755602822] [2021-07-05 10:16:32,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755602822] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:32,038 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:32,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:32,038 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976682413] [2021-07-05 10:16:32,038 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:32,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:32,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:32,039 INFO L87 Difference]: Start difference. First operand 2255 states and 3063 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:32,185 INFO L93 Difference]: Finished difference Result 6557 states and 8847 transitions. [2021-07-05 10:16:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:32,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2021-07-05 10:16:32,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:32,196 INFO L225 Difference]: With dead ends: 6557 [2021-07-05 10:16:32,196 INFO L226 Difference]: Without dead ends: 4342 [2021-07-05 10:16:32,198 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2021-07-05 10:16:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4340. [2021-07-05 10:16:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 4339 states have (on average 1.3235768610278866) internal successors, (5743), 4339 states have internal predecessors, (5743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 5743 transitions. [2021-07-05 10:16:32,330 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 5743 transitions. Word has length 54 [2021-07-05 10:16:32,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:32,331 INFO L442 AbstractCegarLoop]: Abstraction has 4340 states and 5743 transitions. [2021-07-05 10:16:32,331 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:32,331 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 5743 transitions. [2021-07-05 10:16:32,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-05 10:16:32,332 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:32,332 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:16:32,332 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-05 10:16:32,332 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1312141502, now seen corresponding path program 1 times [2021-07-05 10:16:32,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:32,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655598650] [2021-07-05 10:16:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:32,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:32,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:32,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:32,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:32,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:32,361 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:32,362 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:32,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:32,362 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655598650] [2021-07-05 10:16:32,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655598650] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:32,363 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:32,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:32,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458820367] [2021-07-05 10:16:32,363 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:32,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:32,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:32,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:32,364 INFO L87 Difference]: Start difference. First operand 4340 states and 5743 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:32,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:32,713 INFO L93 Difference]: Finished difference Result 12786 states and 16899 transitions. [2021-07-05 10:16:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:16:32,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2021-07-05 10:16:32,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:32,732 INFO L225 Difference]: With dead ends: 12786 [2021-07-05 10:16:32,733 INFO L226 Difference]: Without dead ends: 8521 [2021-07-05 10:16:32,737 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:32,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2021-07-05 10:16:32,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8519. [2021-07-05 10:16:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8519 states, 8518 states have (on average 1.3068795491899508) internal successors, (11132), 8518 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:33,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8519 states to 8519 states and 11132 transitions. [2021-07-05 10:16:33,009 INFO L78 Accepts]: Start accepts. Automaton has 8519 states and 11132 transitions. Word has length 56 [2021-07-05 10:16:33,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:33,010 INFO L442 AbstractCegarLoop]: Abstraction has 8519 states and 11132 transitions. [2021-07-05 10:16:33,010 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 8519 states and 11132 transitions. [2021-07-05 10:16:33,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-05 10:16:33,012 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:33,012 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:16:33,012 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-05 10:16:33,012 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:33,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:33,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1879426383, now seen corresponding path program 1 times [2021-07-05 10:16:33,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:33,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717531743] [2021-07-05 10:16:33,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:33,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:33,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,028 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:33,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:33,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:33,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:33,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,040 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:33,040 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:33,040 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717531743] [2021-07-05 10:16:33,040 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717531743] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:33,040 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:33,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:33,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120335836] [2021-07-05 10:16:33,041 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:33,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:33,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:33,042 INFO L87 Difference]: Start difference. First operand 8519 states and 11132 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:33,423 INFO L93 Difference]: Finished difference Result 16377 states and 21466 transitions. [2021-07-05 10:16:33,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:16:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-07-05 10:16:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:33,442 INFO L225 Difference]: With dead ends: 16377 [2021-07-05 10:16:33,442 INFO L226 Difference]: Without dead ends: 8328 [2021-07-05 10:16:33,449 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:33,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2021-07-05 10:16:33,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 8322. [2021-07-05 10:16:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8322 states, 8321 states have (on average 1.2895084725393582) internal successors, (10730), 8321 states have internal predecessors, (10730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8322 states to 8322 states and 10730 transitions. [2021-07-05 10:16:33,738 INFO L78 Accepts]: Start accepts. Automaton has 8322 states and 10730 transitions. Word has length 62 [2021-07-05 10:16:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:33,738 INFO L442 AbstractCegarLoop]: Abstraction has 8322 states and 10730 transitions. [2021-07-05 10:16:33,738 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:33,738 INFO L276 IsEmpty]: Start isEmpty. Operand 8322 states and 10730 transitions. [2021-07-05 10:16:33,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-07-05 10:16:33,742 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:33,743 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-07-05 10:16:33,743 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-05 10:16:33,743 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:33,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1590606223, now seen corresponding path program 1 times [2021-07-05 10:16:33,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:33,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209976918] [2021-07-05 10:16:33,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:33,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:33,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:33,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:33,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:33,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 10:16:33,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:33,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 10:16:33,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:33,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209976918] [2021-07-05 10:16:33,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209976918] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:33,781 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:33,781 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:16:33,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586482909] [2021-07-05 10:16:33,781 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:16:33,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:16:33,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:33,782 INFO L87 Difference]: Start difference. First operand 8322 states and 10730 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:34,026 INFO L93 Difference]: Finished difference Result 14032 states and 18089 transitions. [2021-07-05 10:16:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 10:16:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2021-07-05 10:16:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:34,035 INFO L225 Difference]: With dead ends: 14032 [2021-07-05 10:16:34,035 INFO L226 Difference]: Without dead ends: 5819 [2021-07-05 10:16:34,043 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.9ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 10:16:34,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2021-07-05 10:16:34,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5189. [2021-07-05 10:16:34,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5188 states have (on average 1.288550501156515) internal successors, (6685), 5188 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 6685 transitions. [2021-07-05 10:16:34,226 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 6685 transitions. Word has length 97 [2021-07-05 10:16:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:34,226 INFO L442 AbstractCegarLoop]: Abstraction has 5189 states and 6685 transitions. [2021-07-05 10:16:34,226 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 6685 transitions. [2021-07-05 10:16:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-05 10:16:34,228 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:34,229 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:16:34,229 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-05 10:16:34,229 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:34,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1401641950, now seen corresponding path program 1 times [2021-07-05 10:16:34,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:34,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289425995] [2021-07-05 10:16:34,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:34,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:34,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:34,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:34,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:34,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:34,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:16:34,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:34,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289425995] [2021-07-05 10:16:34,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289425995] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:34,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:34,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:34,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084071418] [2021-07-05 10:16:34,257 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:34,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:34,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:34,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:34,258 INFO L87 Difference]: Start difference. First operand 5189 states and 6685 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:34,456 INFO L93 Difference]: Finished difference Result 11498 states and 14796 transitions. [2021-07-05 10:16:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:16:34,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-07-05 10:16:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:34,464 INFO L225 Difference]: With dead ends: 11498 [2021-07-05 10:16:34,465 INFO L226 Difference]: Without dead ends: 6160 [2021-07-05 10:16:34,470 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:34,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6160 states. [2021-07-05 10:16:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 4504. [2021-07-05 10:16:34,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 4503 states have (on average 1.2804796802131913) internal successors, (5766), 4503 states have internal predecessors, (5766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 5766 transitions. [2021-07-05 10:16:34,642 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 5766 transitions. Word has length 100 [2021-07-05 10:16:34,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:34,642 INFO L442 AbstractCegarLoop]: Abstraction has 4504 states and 5766 transitions. [2021-07-05 10:16:34,643 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,643 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 5766 transitions. [2021-07-05 10:16:34,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-05 10:16:34,644 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:34,645 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:16:34,645 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-05 10:16:34,645 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:34,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:34,645 INFO L82 PathProgramCache]: Analyzing trace with hash 976167010, now seen corresponding path program 1 times [2021-07-05 10:16:34,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:34,646 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399851567] [2021-07-05 10:16:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:34,646 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:34,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:34,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:34,672 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:34,676 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:34,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:16:34,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:34,678 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399851567] [2021-07-05 10:16:34,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399851567] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:34,679 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:34,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:34,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715802948] [2021-07-05 10:16:34,680 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:34,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:34,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:34,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:34,680 INFO L87 Difference]: Start difference. First operand 4504 states and 5766 transitions. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:34,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:34,855 INFO L93 Difference]: Finished difference Result 9544 states and 12192 transitions. [2021-07-05 10:16:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:16:34,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-07-05 10:16:34,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:34,863 INFO L225 Difference]: With dead ends: 9544 [2021-07-05 10:16:34,863 INFO L226 Difference]: Without dead ends: 5320 [2021-07-05 10:16:34,867 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:34,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2021-07-05 10:16:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 4500. [2021-07-05 10:16:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4500 states, 4499 states have (on average 1.2667259390975771) internal successors, (5699), 4499 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 5699 transitions. [2021-07-05 10:16:35,053 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 5699 transitions. Word has length 100 [2021-07-05 10:16:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:35,054 INFO L442 AbstractCegarLoop]: Abstraction has 4500 states and 5699 transitions. [2021-07-05 10:16:35,054 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 5699 transitions. [2021-07-05 10:16:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-05 10:16:35,055 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:35,056 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-07-05 10:16:35,056 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-05 10:16:35,056 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:35,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:35,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1163106652, now seen corresponding path program 1 times [2021-07-05 10:16:35,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:35,057 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946472615] [2021-07-05 10:16:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:35,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:35,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,068 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:35,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-07-05 10:16:35,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:35,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946472615] [2021-07-05 10:16:35,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946472615] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:35,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:35,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:35,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352349520] [2021-07-05 10:16:35,074 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:35,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:35,074 INFO L87 Difference]: Start difference. First operand 4500 states and 5699 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:35,233 INFO L93 Difference]: Finished difference Result 8610 states and 10951 transitions. [2021-07-05 10:16:35,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:35,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2021-07-05 10:16:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:35,239 INFO L225 Difference]: With dead ends: 8610 [2021-07-05 10:16:35,239 INFO L226 Difference]: Without dead ends: 4313 [2021-07-05 10:16:35,243 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-07-05 10:16:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4313. [2021-07-05 10:16:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 4312 states have (on average 1.2706400742115027) internal successors, (5479), 4312 states have internal predecessors, (5479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 5479 transitions. [2021-07-05 10:16:35,433 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 5479 transitions. Word has length 100 [2021-07-05 10:16:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:35,434 INFO L442 AbstractCegarLoop]: Abstraction has 4313 states and 5479 transitions. [2021-07-05 10:16:35,434 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 5479 transitions. [2021-07-05 10:16:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-07-05 10:16:35,436 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:35,436 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:16:35,436 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-05 10:16:35,436 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:35,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:35,437 INFO L82 PathProgramCache]: Analyzing trace with hash 141526963, now seen corresponding path program 1 times [2021-07-05 10:16:35,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:35,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573275338] [2021-07-05 10:16:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:35,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:35,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:35,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:16:35,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:35,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573275338] [2021-07-05 10:16:35,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573275338] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:35,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:35,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:35,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437705091] [2021-07-05 10:16:35,464 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:35,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:35,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:35,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:35,465 INFO L87 Difference]: Start difference. First operand 4313 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:35,657 INFO L93 Difference]: Finished difference Result 8235 states and 10485 transitions. [2021-07-05 10:16:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-07-05 10:16:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:35,663 INFO L225 Difference]: With dead ends: 8235 [2021-07-05 10:16:35,664 INFO L226 Difference]: Without dead ends: 4015 [2021-07-05 10:16:35,668 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2021-07-05 10:16:35,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 3962. [2021-07-05 10:16:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 1.2547336531178994) internal successors, (4970), 3961 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 4970 transitions. [2021-07-05 10:16:35,832 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 4970 transitions. Word has length 103 [2021-07-05 10:16:35,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:35,832 INFO L442 AbstractCegarLoop]: Abstraction has 3962 states and 4970 transitions. [2021-07-05 10:16:35,832 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 4970 transitions. [2021-07-05 10:16:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-07-05 10:16:35,833 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:35,833 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:16:35,834 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-05 10:16:35,834 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:35,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:35,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1033388162, now seen corresponding path program 1 times [2021-07-05 10:16:35,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:35,834 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623690483] [2021-07-05 10:16:35,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:35,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:35,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,860 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:35,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:35,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:35,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:16:35,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:35,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623690483] [2021-07-05 10:16:35,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623690483] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:35,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:35,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:16:35,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520028896] [2021-07-05 10:16:35,871 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:16:35,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:35,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:16:35,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:16:35,871 INFO L87 Difference]: Start difference. First operand 3962 states and 4970 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:36,085 INFO L93 Difference]: Finished difference Result 8831 states and 11021 transitions. [2021-07-05 10:16:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:16:36,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2021-07-05 10:16:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:36,092 INFO L225 Difference]: With dead ends: 8831 [2021-07-05 10:16:36,092 INFO L226 Difference]: Without dead ends: 4964 [2021-07-05 10:16:36,097 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:16:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2021-07-05 10:16:36,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3933. [2021-07-05 10:16:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 3932 states have (on average 1.232706002034588) internal successors, (4847), 3932 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 4847 transitions. [2021-07-05 10:16:36,218 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 4847 transitions. Word has length 104 [2021-07-05 10:16:36,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:36,218 INFO L442 AbstractCegarLoop]: Abstraction has 3933 states and 4847 transitions. [2021-07-05 10:16:36,218 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 4847 transitions. [2021-07-05 10:16:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-07-05 10:16:36,220 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:36,220 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:16:36,220 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-05 10:16:36,220 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash 460310211, now seen corresponding path program 1 times [2021-07-05 10:16:36,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:36,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532174149] [2021-07-05 10:16:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:36,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:36,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:36,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:36,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:36,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:16:36,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:36,241 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532174149] [2021-07-05 10:16:36,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532174149] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:36,241 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:36,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:16:36,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016565200] [2021-07-05 10:16:36,242 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:36,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:36,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:36,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:36,243 INFO L87 Difference]: Start difference. First operand 3933 states and 4847 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:36,414 INFO L93 Difference]: Finished difference Result 9898 states and 12147 transitions. [2021-07-05 10:16:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:36,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2021-07-05 10:16:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:36,422 INFO L225 Difference]: With dead ends: 9898 [2021-07-05 10:16:36,422 INFO L226 Difference]: Without dead ends: 6060 [2021-07-05 10:16:36,426 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:36,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2021-07-05 10:16:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 6058. [2021-07-05 10:16:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6058 states, 6057 states have (on average 1.217269275218755) internal successors, (7373), 6057 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6058 states to 6058 states and 7373 transitions. [2021-07-05 10:16:36,652 INFO L78 Accepts]: Start accepts. Automaton has 6058 states and 7373 transitions. Word has length 120 [2021-07-05 10:16:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:36,652 INFO L442 AbstractCegarLoop]: Abstraction has 6058 states and 7373 transitions. [2021-07-05 10:16:36,652 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6058 states and 7373 transitions. [2021-07-05 10:16:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-07-05 10:16:36,656 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:36,656 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:16:36,656 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-05 10:16:36,656 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1451029869, now seen corresponding path program 1 times [2021-07-05 10:16:36,657 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:36,657 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143909795] [2021-07-05 10:16:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:36,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:36,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:36,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:36,671 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:36,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:36,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:36,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-07-05 10:16:36,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:36,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143909795] [2021-07-05 10:16:36,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143909795] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:36,676 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:36,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:36,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571077634] [2021-07-05 10:16:36,676 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:36,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:36,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:36,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:36,677 INFO L87 Difference]: Start difference. First operand 6058 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:36,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:36,865 INFO L93 Difference]: Finished difference Result 12033 states and 14655 transitions. [2021-07-05 10:16:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:36,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-07-05 10:16:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:36,874 INFO L225 Difference]: With dead ends: 12033 [2021-07-05 10:16:36,874 INFO L226 Difference]: Without dead ends: 6058 [2021-07-05 10:16:36,880 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:36,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2021-07-05 10:16:37,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 5834. [2021-07-05 10:16:37,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5834 states, 5833 states have (on average 1.205211726384365) internal successors, (7030), 5833 states have internal predecessors, (7030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 7030 transitions. [2021-07-05 10:16:37,064 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 7030 transitions. Word has length 180 [2021-07-05 10:16:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:37,064 INFO L442 AbstractCegarLoop]: Abstraction has 5834 states and 7030 transitions. [2021-07-05 10:16:37,064 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 7030 transitions. [2021-07-05 10:16:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-07-05 10:16:37,067 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:37,067 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:16:37,068 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-05 10:16:37,068 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1470570991, now seen corresponding path program 1 times [2021-07-05 10:16:37,068 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:37,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268959275] [2021-07-05 10:16:37,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:37,069 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:37,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:37,079 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,079 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:37,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:37,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:37,084 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-07-05 10:16:37,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:37,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268959275] [2021-07-05 10:16:37,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268959275] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:37,085 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:37,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:37,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308470958] [2021-07-05 10:16:37,085 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:37,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:37,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:37,086 INFO L87 Difference]: Start difference. First operand 5834 states and 7030 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:37,306 INFO L93 Difference]: Finished difference Result 11413 states and 13785 transitions. [2021-07-05 10:16:37,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2021-07-05 10:16:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:37,312 INFO L225 Difference]: With dead ends: 11413 [2021-07-05 10:16:37,312 INFO L226 Difference]: Without dead ends: 5642 [2021-07-05 10:16:37,316 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:37,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2021-07-05 10:16:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2021-07-05 10:16:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5641 states have (on average 1.2093600425456479) internal successors, (6822), 5641 states have internal predecessors, (6822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 6822 transitions. [2021-07-05 10:16:37,494 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 6822 transitions. Word has length 180 [2021-07-05 10:16:37,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:37,496 INFO L442 AbstractCegarLoop]: Abstraction has 5642 states and 6822 transitions. [2021-07-05 10:16:37,496 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 6822 transitions. [2021-07-05 10:16:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-07-05 10:16:37,500 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:37,500 INFO L525 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2021-07-05 10:16:37,500 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-05 10:16:37,500 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:37,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:37,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1816791745, now seen corresponding path program 1 times [2021-07-05 10:16:37,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:37,501 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707912893] [2021-07-05 10:16:37,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:37,501 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:37,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:37,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:37,530 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:37,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:37,535 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:37,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:16:37,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:37,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:37,549 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-07-05 10:16:37,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:37,550 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707912893] [2021-07-05 10:16:37,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707912893] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:37,550 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:37,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 10:16:37,550 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910917572] [2021-07-05 10:16:37,551 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 10:16:37,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 10:16:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 10:16:37,552 INFO L87 Difference]: Start difference. First operand 5642 states and 6822 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:37,900 INFO L93 Difference]: Finished difference Result 12574 states and 15185 transitions. [2021-07-05 10:16:37,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 10:16:37,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-07-05 10:16:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:37,908 INFO L225 Difference]: With dead ends: 12574 [2021-07-05 10:16:37,908 INFO L226 Difference]: Without dead ends: 6995 [2021-07-05 10:16:37,913 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 60.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-05 10:16:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2021-07-05 10:16:38,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 5390. [2021-07-05 10:16:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5390 states, 5389 states have (on average 1.1972536648728893) internal successors, (6452), 5389 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5390 states to 5390 states and 6452 transitions. [2021-07-05 10:16:38,170 INFO L78 Accepts]: Start accepts. Automaton has 5390 states and 6452 transitions. Word has length 184 [2021-07-05 10:16:38,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:38,170 INFO L442 AbstractCegarLoop]: Abstraction has 5390 states and 6452 transitions. [2021-07-05 10:16:38,170 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:38,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 6452 transitions. [2021-07-05 10:16:38,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2021-07-05 10:16:38,174 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:16:38,174 INFO L525 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] [2021-07-05 10:16:38,175 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-07-05 10:16:38,175 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:16:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:16:38,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1421790507, now seen corresponding path program 1 times [2021-07-05 10:16:38,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:16:38,176 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168855073] [2021-07-05 10:16:38,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:16:38,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:16:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:16:38,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:38,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:38,199 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:38,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:16:38,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:16:38,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:16:38,204 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-07-05 10:16:38,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:16:38,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168855073] [2021-07-05 10:16:38,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168855073] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:16:38,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:16:38,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:16:38,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980065738] [2021-07-05 10:16:38,205 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:16:38,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:16:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:16:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:38,206 INFO L87 Difference]: Start difference. First operand 5390 states and 6452 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:38,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:16:38,358 INFO L93 Difference]: Finished difference Result 7990 states and 9620 transitions. [2021-07-05 10:16:38,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:16:38,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2021-07-05 10:16:38,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:16:38,359 INFO L225 Difference]: With dead ends: 7990 [2021-07-05 10:16:38,359 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 10:16:38,363 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:16:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 10:16:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 10:16:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 10:16:38,363 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2021-07-05 10:16:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:16:38,364 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 10:16:38,364 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:16:38,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 10:16:38,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 10:16:38,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 10:16:38,378 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,520 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 137 [2021-07-05 10:16:38,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,527 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,831 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:16:38,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,912 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:38,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:39,441 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 629 DAG size of output: 393 [2021-07-05 10:16:39,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:39,902 WARN L205 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 629 DAG size of output: 398 [2021-07-05 10:16:39,904 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,089 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 215 [2021-07-05 10:16:40,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,224 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 153 [2021-07-05 10:16:40,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,317 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,449 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,452 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,592 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:16:40,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,652 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,658 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,793 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 172 [2021-07-05 10:16:40,794 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:40,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,085 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 160 [2021-07-05 10:16:41,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,104 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,459 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 627 DAG size of output: 390 [2021-07-05 10:16:41,460 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,461 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,545 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,601 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,642 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,685 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:41,956 WARN L205 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 521 DAG size of output: 285 [2021-07-05 10:16:41,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,095 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:16:42,096 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,397 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 198 [2021-07-05 10:16:42,398 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:42,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:16:43,137 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 52 [2021-07-05 10:16:43,260 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2021-07-05 10:16:43,850 WARN L205 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:16:44,167 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2021-07-05 10:16:44,354 WARN L205 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-07-05 10:16:45,876 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 324 DAG size of output: 75 [2021-07-05 10:16:47,384 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 322 DAG size of output: 74 [2021-07-05 10:16:48,028 WARN L205 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 61 [2021-07-05 10:16:48,675 WARN L205 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-07-05 10:16:49,192 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2021-07-05 10:16:49,728 WARN L205 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2021-07-05 10:16:50,058 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 46 [2021-07-05 10:16:50,229 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-07-05 10:16:50,335 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-07-05 10:16:50,900 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:16:51,606 WARN L205 SmtUtils]: Spent 702.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2021-07-05 10:16:51,784 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2021-07-05 10:16:52,325 WARN L205 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2021-07-05 10:16:52,636 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2021-07-05 10:16:52,945 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2021-07-05 10:16:53,256 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2021-07-05 10:16:53,914 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2021-07-05 10:16:54,015 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-07-05 10:16:55,366 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 326 DAG size of output: 72 [2021-07-05 10:16:55,924 WARN L205 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2021-07-05 10:16:56,443 WARN L205 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 57 [2021-07-05 10:16:56,897 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-07-05 10:16:57,373 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2021-07-05 10:16:57,525 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2021-07-05 10:16:58,648 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 228 DAG size of output: 74 [2021-07-05 10:16:59,201 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:16:59,495 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 46 [2021-07-05 10:17:00,070 WARN L205 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2021-07-05 10:17:00,771 WARN L205 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 62 [2021-07-05 10:17:01,011 WARN L205 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2021-07-05 10:17:01,237 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 36 [2021-07-05 10:17:01,736 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2021-07-05 10:17:01,739 INFO L762 garLoopResultBuilder]: For program point L68-3(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:01,739 INFO L762 garLoopResultBuilder]: For program point L68-5(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:01,739 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-07-05 10:17:01,739 INFO L758 garLoopResultBuilder]: At program point L465(lines 449 467) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:01,739 INFO L762 garLoopResultBuilder]: For program point L69(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:01,739 INFO L762 garLoopResultBuilder]: For program point L69-1(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L69-2(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L303-1(lines 302 315) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L758 garLoopResultBuilder]: At program point L270-1(lines 303 307) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0))) (or (and .cse0 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) .cse2 .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5))) [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L303-2(lines 303 307) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L303-4(lines 302 315) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L762 garLoopResultBuilder]: For program point L502(lines 502 511) no Hoare annotation was computed. [2021-07-05 10:17:01,740 INFO L758 garLoopResultBuilder]: At program point L502-1(lines 502 511) the Hoare annotation is: (let ((.cse11 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_read_ev~0 2)) (.cse15 (= ~q_req_up~0 0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse9 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse13 (= ~t~0 0)) (.cse10 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse11 .cse0 .cse2 .cse4 .cse14 .cse15 (not .cse1) .cse12) (and .cse11 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse14 .cse15 .cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10))) [2021-07-05 10:17:01,741 INFO L762 garLoopResultBuilder]: For program point L403(line 403) no Hoare annotation was computed. [2021-07-05 10:17:01,741 INFO L762 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2021-07-05 10:17:01,741 INFO L758 garLoopResultBuilder]: At program point L108(lines 86 110) the Hoare annotation is: (let ((.cse4 (= ~c_dr_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse5 .cse6 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9))) [2021-07-05 10:17:01,741 INFO L758 garLoopResultBuilder]: At program point L108-1(lines 86 110) the Hoare annotation is: (let ((.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse17 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse8 (not .cse18)) (.cse9 (not .cse17)) (.cse12 (not .cse15)) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse14 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse15 .cse4 .cse16 .cse14 (not .cse1) .cse10 .cse17 .cse18 .cse11) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse13 .cse15 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse16 .cse14 .cse10 .cse17 .cse18 .cse11)))) [2021-07-05 10:17:01,741 INFO L758 garLoopResultBuilder]: At program point L108-2(lines 86 110) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse18 (not .cse8)) (.cse19 (not .cse7)) (.cse20 (not .cse1)) (.cse0 (not .cse17)) (.cse12 (not (= ~slow_clk_edge~0 1))) (.cse15 (not (= ~fast_clk_edge~0 1))) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~c_dr_i~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse16 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse11) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse9) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse15 .cse16) (and .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse17 .cse18 .cse19 .cse9 .cse20) (and .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse17 .cse18 .cse19 .cse16 .cse20) (and .cse0 .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse15 .cse9) (and .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse6 .cse16)))) [2021-07-05 10:17:01,741 INFO L758 garLoopResultBuilder]: At program point L109(lines 83 111) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9 .cse10) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2021-07-05 10:17:01,742 INFO L758 garLoopResultBuilder]: At program point L109-1(lines 83 111) the Hoare annotation is: (let ((.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse18 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse19 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse12 (not .cse19)) (.cse13 (not .cse18)) (.cse15 (not .cse16)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (= ~q_req_up~0 0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15) (and .cse0 .cse16 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse17 .cse8 .cse14 .cse18 .cse19 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse16 .cse4 .cse17 .cse8 (not .cse2) .cse14 .cse18 .cse19 .cse9 .cse10)))) [2021-07-05 10:17:01,742 INFO L758 garLoopResultBuilder]: At program point L109-2(lines 83 111) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse9 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~fast_clk_edge~0 1))) (.cse0 (not .cse18)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse17 (not (= ~slow_clk_edge~0 1))) (.cse19 (not .cse10)) (.cse20 (not .cse9)) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse21 (not .cse2)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~c_dr_i~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse16 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse15 .cse11 .cse12) (and .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse18 .cse19 .cse20 .cse16 .cse21) (and .cse0 .cse2 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse18 .cse19 .cse20 .cse11 .cse12 .cse21) (and .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse8 .cse16)))) [2021-07-05 10:17:01,742 INFO L762 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2021-07-05 10:17:01,742 INFO L762 garLoopResultBuilder]: For program point L407-1(lines 402 442) no Hoare annotation was computed. [2021-07-05 10:17:01,742 INFO L762 garLoopResultBuilder]: For program point L341(lines 341 348) no Hoare annotation was computed. [2021-07-05 10:17:01,742 INFO L758 garLoopResultBuilder]: At program point L308-1(lines 299 316) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0))) (or (and (not .cse0) .cse1 .cse2 (not .cse3) .cse4 .cse5) (and .cse3 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)))) [2021-07-05 10:17:01,743 INFO L758 garLoopResultBuilder]: At program point L341-2(lines 337 352) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse9 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse14 (= ~t~0 0)) (.cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse12 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse14) (and .cse13 .cse0 .cse2 .cse4 .cse15 .cse16 (not .cse1) .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12) (and .cse13 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse15 .cse16 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7))) [2021-07-05 10:17:01,743 INFO L758 garLoopResultBuilder]: At program point L308-3(lines 299 316) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse9 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse9 (not .cse2) .cse11))) [2021-07-05 10:17:01,743 INFO L762 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-07-05 10:17:01,743 INFO L762 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-07-05 10:17:01,743 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 220) no Hoare annotation was computed. [2021-07-05 10:17:01,743 INFO L762 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2021-07-05 10:17:01,743 INFO L758 garLoopResultBuilder]: At program point L12-1(lines 190 244) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0))) (let ((.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse13 (not .cse7)) (.cse14 (not (= ~q_write_ev~0 0))) (.cse19 (= ~c_dr_pc~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse17 (not (= ~slow_clk_edge~0 1))) (.cse1 (not (= ~c_dr_st~0 0))) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse0 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~slow_clk_edge~0 ~q_read_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 (not .cse15) .cse8 .cse9 .cse10) (and .cse13 .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse8 .cse9 .cse10) (and .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 (not .cse12) (not .cse11) .cse8 .cse9 .cse10 (not .cse0))))) [2021-07-05 10:17:01,743 INFO L758 garLoopResultBuilder]: At program point L145(lines 140 184) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse10 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse11 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse14 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_st~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t~0 0) .cse12 .cse13 .cse14))) [2021-07-05 10:17:01,744 INFO L758 garLoopResultBuilder]: At program point L79(lines 57 81) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~q_req_up~0 0)) (.cse6 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse3 .cse4 .cse5 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse6) (and (not .cse5) .cse1 .cse2 (not .cse0) .cse3 .cse4 .cse6))) [2021-07-05 10:17:01,744 INFO L758 garLoopResultBuilder]: At program point L79-1(lines 57 81) the Hoare annotation is: (let ((.cse10 (= ~q_read_ev~0 2)) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 .cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:01,744 INFO L758 garLoopResultBuilder]: At program point L79-2(lines 57 81) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse10 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (= ~q_req_up~0 0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse8 (= ~t~0 0)) (.cse15 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse9 (not (= ~slow_clk_edge~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse16 (not .cse13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse11 .cse12 .cse7 .cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse14 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse12 (not .cse2) .cse7 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse16)))) [2021-07-05 10:17:01,744 INFO L758 garLoopResultBuilder]: At program point L443(lines 396 448) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~slow_clk_edge~0 1)) .cse4 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (not (= ~fast_clk_edge~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not .cse2) .cse7) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,744 INFO L758 garLoopResultBuilder]: At program point L80(lines 54 82) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5 .cse7))) [2021-07-05 10:17:01,745 INFO L758 garLoopResultBuilder]: At program point L80-1(lines 54 82) the Hoare annotation is: (let ((.cse12 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~q_req_up~0 0)) (.cse9 (not .cse15)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (not .cse12)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse5 .cse13 .cse14 (not .cse2) .cse10 .cse15) (and .cse0 .cse12 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse13 .cse14 .cse10 .cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15)))) [2021-07-05 10:17:01,745 INFO L758 garLoopResultBuilder]: At program point L80-2(lines 54 82) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse12 (not .cse10)) (.cse15 (not .cse2)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse14 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse5 (not (= ~slow_clk_edge~0 1))) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse3 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 (or (and .cse1 .cse4 .cse6 .cse7 .cse11 .cse8 .cse12 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13 .cse15))) (and .cse0 .cse2 .cse4 (= ~c_dr_pc~0 ~q_req_up~0) .cse6 .cse16 .cse17 .cse9 .cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse16 .cse17 (not .cse3) .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse14 .cse10) (and .cse3 (or (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse12 .cse9 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse15))) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9 .cse13 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10)))) [2021-07-05 10:17:01,745 INFO L758 garLoopResultBuilder]: At program point L543(lines 527 545) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) [2021-07-05 10:17:01,745 INFO L762 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2021-07-05 10:17:01,745 INFO L758 garLoopResultBuilder]: At program point L412(lines 402 442) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse14 (= ~c_dr_st~0 0)) (.cse29 (= ~p_dw_st~0 0)) (.cse28 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse30 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse31 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse15 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse21 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse25 (not .cse31)) (.cse26 (not .cse30)) (.cse27 (not .cse28)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse13 (= ~t~0 0)) (.cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse12 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse0 (not .cse29)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse18 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (not .cse14)) (.cse19 (= ~q_read_ev~0 2)) (.cse20 (= ~q_req_up~0 0)) (.cse10 (not .cse17)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse24 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse14 .cse0 .cse15 .cse16 .cse17 .cse18 .cse6 .cse9 .cse7 .cse19 .cse20 .cse21 .cse13 .cse11 .cse12 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse25 .cse26 .cse13 .cse11 .cse12 .cse27) (and .cse0 .cse1 .cse3 .cse5 .cse19 .cse20 (not .cse2) .cse10) (and .cse14 .cse28 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16 .cse18 .cse6 .cse9 .cse7 .cse19 .cse20 .cse29 .cse21 .cse13 .cse11 .cse12 .cse30 .cse22 .cse31 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse25 .cse26 .cse11 .cse12 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse11 .cse12) (and .cse0 .cse3 .cse18 .cse5 .cse19 .cse20 .cse10 .cse22 .cse23 .cse24)))) [2021-07-05 10:17:01,745 INFO L762 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L379-2(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L379-3(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L379-5(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L379-6(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L379-8(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L283(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L250(lines 250 256) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L283-1(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:01,746 INFO L758 garLoopResultBuilder]: At program point L250-1(lines 265 269) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) [2021-07-05 10:17:01,746 INFO L762 garLoopResultBuilder]: For program point L283-2(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:01,747 INFO L762 garLoopResultBuilder]: For program point L250-2(lines 250 256) no Hoare annotation was computed. [2021-07-05 10:17:01,747 INFO L758 garLoopResultBuilder]: At program point L250-3(lines 246 260) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse9 (not .cse2) .cse11) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse9 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,747 INFO L762 garLoopResultBuilder]: For program point L515(lines 515 519) no Hoare annotation was computed. [2021-07-05 10:17:01,747 INFO L762 garLoopResultBuilder]: For program point L416(lines 416 423) no Hoare annotation was computed. [2021-07-05 10:17:01,747 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 10:17:01,747 INFO L758 garLoopResultBuilder]: At program point L483-1(lines 317 520) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0)) (.cse19 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse24 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~c_dr_st~0 0))) (let ((.cse20 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse23 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse25 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse26 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not .cse18)) (.cse13 (not .cse24)) (.cse14 (not .cse22)) (.cse15 (not .cse19)) (.cse0 (not .cse21)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse18 .cse19 (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse20 .cse6 .cse7 .cse16 .cse17 .cse21 (= ~slow_clk_edge~0 ~q_read_ev~0) .cse11 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse3 .cse20 .cse5 .cse16 .cse17 .cse10 .cse23 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12)))) [2021-07-05 10:17:01,747 INFO L762 garLoopResultBuilder]: For program point L87(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L87-2(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L87-3(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L87-5(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L87-6(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L87-8(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L484(line 484) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L88(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L88-1(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L88-2(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:01,748 INFO L762 garLoopResultBuilder]: For program point L287(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L287-1(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L287-2(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L758 garLoopResultBuilder]: At program point L387-2(lines 321 325) the Hoare annotation is: (let ((.cse4 (= ~c_dr_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse5 .cse6 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L321-1(lines 320 333) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L387-3(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:01,749 INFO L758 garLoopResultBuilder]: At program point L387-5(lines 321 325) the Hoare annotation is: (let ((.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse15 (not .cse14)) (.cse16 (not .cse13)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse17 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse11 .cse9 .cse12 .cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse10 .cse5 .cse11 .cse9 (not .cse2) .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse16 .cse12 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse12 .cse17)))) [2021-07-05 10:17:01,749 INFO L762 garLoopResultBuilder]: For program point L321-3(lines 320 333) no Hoare annotation was computed. [2021-07-05 10:17:01,750 INFO L762 garLoopResultBuilder]: For program point L387-6(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:01,750 INFO L758 garLoopResultBuilder]: At program point L156-1(lines 140 184) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse5 (= ~c_dr_st~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse12 (= ~t~0 0)) (.cse10 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse11 (= ULTIMATE.start_eval_~tmp___1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse11) (and .cse5 .cse0 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) .cse6 .cse7 .cse8 (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (not (= ~p_dw_pc~0 1)) .cse12 .cse10 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,750 INFO L758 garLoopResultBuilder]: At program point L387-8(lines 357 361) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 0)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse16 (not .cse14)) (.cse17 (not .cse13)) (.cse18 (not .cse9)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse0 (not .cse15)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse19 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse12 .cse13 .cse14) (and .cse0 .cse9 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse16 .cse17 .cse19 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse19) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse12 .cse19)))) [2021-07-05 10:17:01,750 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 10:17:01,750 INFO L762 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2021-07-05 10:17:01,750 INFO L762 garLoopResultBuilder]: For program point L58(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:01,750 INFO L762 garLoopResultBuilder]: For program point L58-2(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L58-3(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L58-5(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L58-6(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L58-8(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L765 garLoopResultBuilder]: At program point L521(lines 468 526) the Hoare annotation is: true [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L191(lines 191 199) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L59-1(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L762 garLoopResultBuilder]: For program point L59-2(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:01,751 INFO L765 garLoopResultBuilder]: At program point L555(lines 546 557) the Hoare annotation is: true [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L357-1(lines 356 369) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L457(lines 457 462) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L226(lines 226 238) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L28-3(lines 28 32) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L28-5(lines 27 42) no Hoare annotation was computed. [2021-07-05 10:17:01,752 INFO L762 garLoopResultBuilder]: For program point L227(lines 227 233) no Hoare annotation was computed. [2021-07-05 10:17:01,753 INFO L758 garLoopResultBuilder]: At program point L326-3(lines 317 334) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse9 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse9 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,753 INFO L762 garLoopResultBuilder]: For program point L194(lines 194 198) no Hoare annotation was computed. [2021-07-05 10:17:01,753 INFO L758 garLoopResultBuilder]: At program point L195(lines 190 244) the Hoare annotation is: false [2021-07-05 10:17:01,753 INFO L758 garLoopResultBuilder]: At program point L427(lines 402 442) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0)) (.cse27 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse29 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse30 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~c_dr_st~0 0)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse10 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse20 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse22 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse23 (not .cse12)) (.cse5 (not .cse9)) (.cse24 (not .cse30)) (.cse25 (not .cse29)) (.cse26 (not .cse27)) (.cse0 (not .cse28)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse18 (= ~t~0 0)) (.cse19 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse23 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse24 .cse25 .cse18 .cse19 .cse26) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse16 (not .cse2) .cse23) (and .cse9 .cse27 (= ~q_req_up~0 ~p_dw_pc~0) .cse10 .cse11 .cse13 .cse6 .cse7 .cse15 .cse16 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse3 .cse13 .cse5 .cse15 .cse16 .cse23 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse23 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse24 .cse25 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse18 .cse19)))) [2021-07-05 10:17:01,753 INFO L758 garLoopResultBuilder]: At program point L295(lines 282 297) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse14 (= ~c_dr_st~0 0)) (.cse27 (= ~p_dw_st~0 0)) (.cse26 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse28 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse29 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse15 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse21 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse11 (not .cse29)) (.cse12 (not .cse28)) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (not .cse26)) (.cse0 (not .cse27)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse18 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (not .cse14)) (.cse19 (= ~q_read_ev~0 2)) (.cse20 (= ~q_req_up~0 0)) (.cse25 (not .cse17)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse24 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse14 .cse0 .cse15 .cse16 .cse17 .cse18 .cse5 .cse6 .cse19 .cse20 .cse21 .cse8 .cse9 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse10 .cse19 .cse20 (not .cse2) .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse25 .cse9) (and .cse14 .cse26 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16 .cse18 .cse5 .cse6 .cse19 .cse20 .cse27 .cse21 .cse8 .cse9 .cse28 .cse22 .cse29 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse0 .cse3 .cse18 .cse10 .cse19 .cse20 .cse25 .cse22 .cse23 .cse24)))) [2021-07-05 10:17:01,753 INFO L758 garLoopResultBuilder]: At program point L295-1(lines 282 297) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse9 .cse10 (not .cse2) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse9 .cse10 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,754 INFO L758 garLoopResultBuilder]: At program point L295-2(lines 282 297) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse11 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse12 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse10 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse14 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse10 .cse15 .cse16 (not .cse2) .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse10 .cse15 .cse16 .cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,754 INFO L758 garLoopResultBuilder]: At program point L163(lines 140 184) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~c_dr_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t~0 0) .cse9 .cse10))) [2021-07-05 10:17:01,754 INFO L762 garLoopResultBuilder]: For program point L97-1(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:01,754 INFO L762 garLoopResultBuilder]: For program point L97-3(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:01,754 INFO L762 garLoopResultBuilder]: For program point L97-5(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:01,754 INFO L758 garLoopResultBuilder]: At program point L296(lines 279 298) the Hoare annotation is: (let ((.cse25 (= ~p_dw_st~0 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse26 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~c_dr_st~0 0)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse10 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse20 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse22 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse23 (not .cse12)) (.cse5 (not .cse9)) (.cse28 (not .cse27)) (.cse29 (not .cse26)) (.cse30 (not .cse24)) (.cse0 (not .cse25)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse18 (= ~t~0 0)) (.cse19 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse23 .cse18 .cse19) (and .cse9 .cse24 (= ~q_req_up~0 ~p_dw_pc~0) .cse10 .cse11 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse28 .cse29 .cse18 .cse19 .cse30) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse16 (not .cse2) .cse23) (and .cse0 .cse3 .cse13 .cse5 .cse15 .cse16 .cse23 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse23 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse28 .cse29 .cse19 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse18 .cse19)))) [2021-07-05 10:17:01,755 INFO L758 garLoopResultBuilder]: At program point L296-1(lines 279 298) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse9 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1) .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:01,755 INFO L758 garLoopResultBuilder]: At program point L296-2(lines 279 298) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L98(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L98-1(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L98-2(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L33-1(lines 33 37) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L33-3(lines 33 37) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L758 garLoopResultBuilder]: At program point L464(lines 453 466) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L431(lines 431 438) no Hoare annotation was computed. [2021-07-05 10:17:01,755 INFO L762 garLoopResultBuilder]: For program point L68-1(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:01,756 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-07-05 10:17:01,756 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 10:17:01,758 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/2) [2021-07-05 10:17:01,759 INFO L328 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2021-07-05 10:17:01,760 INFO L329 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mLimitAnalysisTime=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-07-05 10:17:01,760 INFO L330 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-05 10:17:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 128 states have (on average 1.6328125) internal successors, (209), 130 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-05 10:17:01,761 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:01,761 INFO L525 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] [2021-07-05 10:17:01,762 INFO L374 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:01,762 INFO L82 PathProgramCache]: Analyzing trace with hash -660120607, now seen corresponding path program 1 times [2021-07-05 10:17:01,762 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:01,762 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049980046] [2021-07-05 10:17:01,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:01,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:01,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:01,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:01,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:01,776 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:01,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049980046] [2021-07-05 10:17:01,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049980046] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:01,777 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:01,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:01,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100643045] [2021-07-05 10:17:01,777 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:01,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:01,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:01,778 INFO L87 Difference]: Start difference. First operand has 131 states, 128 states have (on average 1.6328125) internal successors, (209), 130 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:01,815 INFO L93 Difference]: Finished difference Result 377 states and 602 transitions. [2021-07-05 10:17:01,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-07-05 10:17:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:01,817 INFO L225 Difference]: With dead ends: 377 [2021-07-05 10:17:01,817 INFO L226 Difference]: Without dead ends: 244 [2021-07-05 10:17:01,817 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-07-05 10:17:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2021-07-05 10:17:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 1.5311203319502074) internal successors, (369), 241 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 369 transitions. [2021-07-05 10:17:01,820 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 369 transitions. Word has length 39 [2021-07-05 10:17:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:01,820 INFO L442 AbstractCegarLoop]: Abstraction has 242 states and 369 transitions. [2021-07-05 10:17:01,820 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 369 transitions. [2021-07-05 10:17:01,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-07-05 10:17:01,821 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:01,821 INFO L525 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] [2021-07-05 10:17:01,821 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-07-05 10:17:01,821 INFO L374 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:01,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:01,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1873516389, now seen corresponding path program 1 times [2021-07-05 10:17:01,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:01,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370984680] [2021-07-05 10:17:01,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:01,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:01,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:01,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:01,834 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:01,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:01,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:01,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:01,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:01,847 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370984680] [2021-07-05 10:17:01,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370984680] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:01,847 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:01,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:01,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370312781] [2021-07-05 10:17:01,848 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:01,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:01,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:01,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:01,849 INFO L87 Difference]: Start difference. First operand 242 states and 369 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:01,970 INFO L93 Difference]: Finished difference Result 1037 states and 1564 transitions. [2021-07-05 10:17:01,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:01,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2021-07-05 10:17:01,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:01,971 INFO L225 Difference]: With dead ends: 1037 [2021-07-05 10:17:01,972 INFO L226 Difference]: Without dead ends: 799 [2021-07-05 10:17:01,973 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2021-07-05 10:17:01,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 773. [2021-07-05 10:17:01,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.4896373056994818) internal successors, (1150), 772 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1150 transitions. [2021-07-05 10:17:01,980 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1150 transitions. Word has length 39 [2021-07-05 10:17:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:01,980 INFO L442 AbstractCegarLoop]: Abstraction has 773 states and 1150 transitions. [2021-07-05 10:17:01,980 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1150 transitions. [2021-07-05 10:17:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 10:17:01,981 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:01,981 INFO L525 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] [2021-07-05 10:17:01,981 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-07-05 10:17:01,982 INFO L374 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:01,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1793155390, now seen corresponding path program 1 times [2021-07-05 10:17:01,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:01,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807545902] [2021-07-05 10:17:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:01,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:02,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,019 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807545902] [2021-07-05 10:17:02,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807545902] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,019 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:02,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097336461] [2021-07-05 10:17:02,019 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:02,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:02,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:02,020 INFO L87 Difference]: Start difference. First operand 773 states and 1150 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:02,090 INFO L93 Difference]: Finished difference Result 2603 states and 3883 transitions. [2021-07-05 10:17:02,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:02,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 10:17:02,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:02,093 INFO L225 Difference]: With dead ends: 2603 [2021-07-05 10:17:02,093 INFO L226 Difference]: Without dead ends: 1845 [2021-07-05 10:17:02,094 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2021-07-05 10:17:02,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 809. [2021-07-05 10:17:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 808 states have (on average 1.4591584158415842) internal successors, (1179), 808 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1179 transitions. [2021-07-05 10:17:02,105 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1179 transitions. Word has length 40 [2021-07-05 10:17:02,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:02,105 INFO L442 AbstractCegarLoop]: Abstraction has 809 states and 1179 transitions. [2021-07-05 10:17:02,105 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,105 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1179 transitions. [2021-07-05 10:17:02,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-07-05 10:17:02,106 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:02,106 INFO L525 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] [2021-07-05 10:17:02,106 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-07-05 10:17:02,106 INFO L374 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:02,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1855195004, now seen corresponding path program 1 times [2021-07-05 10:17:02,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:02,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486640007] [2021-07-05 10:17:02,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:02,107 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,119 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:02,132 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:02,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,133 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486640007] [2021-07-05 10:17:02,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486640007] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,133 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:02,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916984507] [2021-07-05 10:17:02,133 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:02,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:02,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:02,134 INFO L87 Difference]: Start difference. First operand 809 states and 1179 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:02,262 INFO L93 Difference]: Finished difference Result 2571 states and 3717 transitions. [2021-07-05 10:17:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:02,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2021-07-05 10:17:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:02,267 INFO L225 Difference]: With dead ends: 2571 [2021-07-05 10:17:02,267 INFO L226 Difference]: Without dead ends: 1779 [2021-07-05 10:17:02,268 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2021-07-05 10:17:02,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1720. [2021-07-05 10:17:02,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1719 states have (on average 1.423502036067481) internal successors, (2447), 1719 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2447 transitions. [2021-07-05 10:17:02,290 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2447 transitions. Word has length 40 [2021-07-05 10:17:02,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:02,290 INFO L442 AbstractCegarLoop]: Abstraction has 1720 states and 2447 transitions. [2021-07-05 10:17:02,291 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2447 transitions. [2021-07-05 10:17:02,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 10:17:02,291 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:02,291 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:17:02,292 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-07-05 10:17:02,292 INFO L374 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:02,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:02,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1105087616, now seen corresponding path program 1 times [2021-07-05 10:17:02,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:02,292 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760936281] [2021-07-05 10:17:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:02,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,324 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-07-05 10:17:02,324 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760936281] [2021-07-05 10:17:02,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760936281] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:02,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102391707] [2021-07-05 10:17:02,325 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:02,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:02,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:02,326 INFO L87 Difference]: Start difference. First operand 1720 states and 2447 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:02,423 INFO L93 Difference]: Finished difference Result 5618 states and 8050 transitions. [2021-07-05 10:17:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-05 10:17:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 10:17:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:02,427 INFO L225 Difference]: With dead ends: 5618 [2021-07-05 10:17:02,427 INFO L226 Difference]: Without dead ends: 3920 [2021-07-05 10:17:02,429 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.4ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-07-05 10:17:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2021-07-05 10:17:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 1828. [2021-07-05 10:17:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1828 states, 1827 states have (on average 1.3946360153256705) internal successors, (2548), 1827 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2548 transitions. [2021-07-05 10:17:02,465 INFO L78 Accepts]: Start accepts. Automaton has 1828 states and 2548 transitions. Word has length 53 [2021-07-05 10:17:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:02,465 INFO L442 AbstractCegarLoop]: Abstraction has 1828 states and 2548 transitions. [2021-07-05 10:17:02,465 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1828 states and 2548 transitions. [2021-07-05 10:17:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 10:17:02,466 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:02,466 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:17:02,466 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2021-07-05 10:17:02,466 INFO L374 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1379847230, now seen corresponding path program 1 times [2021-07-05 10:17:02,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:02,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118005986] [2021-07-05 10:17:02,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:02,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,474 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:02,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-07-05 10:17:02,484 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118005986] [2021-07-05 10:17:02,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118005986] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:02,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170523626] [2021-07-05 10:17:02,485 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:02,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:02,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:02,486 INFO L87 Difference]: Start difference. First operand 1828 states and 2548 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:02,608 INFO L93 Difference]: Finished difference Result 5107 states and 7063 transitions. [2021-07-05 10:17:02,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:02,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 10:17:02,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:02,611 INFO L225 Difference]: With dead ends: 5107 [2021-07-05 10:17:02,611 INFO L226 Difference]: Without dead ends: 3303 [2021-07-05 10:17:02,613 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2021-07-05 10:17:02,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 2255. [2021-07-05 10:17:02,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2255 states, 2254 states have (on average 1.3589174800354924) internal successors, (3063), 2254 states have internal predecessors, (3063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2255 states to 2255 states and 3063 transitions. [2021-07-05 10:17:02,654 INFO L78 Accepts]: Start accepts. Automaton has 2255 states and 3063 transitions. Word has length 53 [2021-07-05 10:17:02,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:02,654 INFO L442 AbstractCegarLoop]: Abstraction has 2255 states and 3063 transitions. [2021-07-05 10:17:02,655 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2255 states and 3063 transitions. [2021-07-05 10:17:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-07-05 10:17:02,655 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:02,655 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:17:02,655 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2021-07-05 10:17:02,656 INFO L374 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:02,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1402479484, now seen corresponding path program 1 times [2021-07-05 10:17:02,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:02,656 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779748372] [2021-07-05 10:17:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:02,657 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,687 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 10:17:02,688 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779748372] [2021-07-05 10:17:02,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779748372] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:02,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183350471] [2021-07-05 10:17:02,688 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:02,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:02,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:02,689 INFO L87 Difference]: Start difference. First operand 2255 states and 3063 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:02,779 INFO L93 Difference]: Finished difference Result 6557 states and 8847 transitions. [2021-07-05 10:17:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2021-07-05 10:17:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:02,782 INFO L225 Difference]: With dead ends: 6557 [2021-07-05 10:17:02,782 INFO L226 Difference]: Without dead ends: 4342 [2021-07-05 10:17:02,784 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:02,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2021-07-05 10:17:02,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4340. [2021-07-05 10:17:02,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4340 states, 4339 states have (on average 1.3235768610278866) internal successors, (5743), 4339 states have internal predecessors, (5743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4340 states to 4340 states and 5743 transitions. [2021-07-05 10:17:02,881 INFO L78 Accepts]: Start accepts. Automaton has 4340 states and 5743 transitions. Word has length 53 [2021-07-05 10:17:02,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:02,881 INFO L442 AbstractCegarLoop]: Abstraction has 4340 states and 5743 transitions. [2021-07-05 10:17:02,881 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:02,881 INFO L276 IsEmpty]: Start isEmpty. Operand 4340 states and 5743 transitions. [2021-07-05 10:17:02,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-07-05 10:17:02,882 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:02,883 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:17:02,883 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-07-05 10:17:02,883 INFO L374 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:02,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:02,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1150705430, now seen corresponding path program 1 times [2021-07-05 10:17:02,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:02,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950295345] [2021-07-05 10:17:02,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:02,884 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:02,893 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:02,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,898 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:02,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:02,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:02,903 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:02,903 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950295345] [2021-07-05 10:17:02,903 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950295345] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:02,903 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:02,903 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:02,903 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435487849] [2021-07-05 10:17:02,903 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:02,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:02,904 INFO L87 Difference]: Start difference. First operand 4340 states and 5743 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:03,105 INFO L93 Difference]: Finished difference Result 12786 states and 16899 transitions. [2021-07-05 10:17:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:03,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2021-07-05 10:17:03,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:03,112 INFO L225 Difference]: With dead ends: 12786 [2021-07-05 10:17:03,112 INFO L226 Difference]: Without dead ends: 8521 [2021-07-05 10:17:03,115 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:03,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8521 states. [2021-07-05 10:17:03,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8521 to 8519. [2021-07-05 10:17:03,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8519 states, 8518 states have (on average 1.3068795491899508) internal successors, (11132), 8518 states have internal predecessors, (11132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8519 states to 8519 states and 11132 transitions. [2021-07-05 10:17:03,283 INFO L78 Accepts]: Start accepts. Automaton has 8519 states and 11132 transitions. Word has length 55 [2021-07-05 10:17:03,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:03,283 INFO L442 AbstractCegarLoop]: Abstraction has 8519 states and 11132 transitions. [2021-07-05 10:17:03,283 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 8519 states and 11132 transitions. [2021-07-05 10:17:03,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-05 10:17:03,285 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:03,285 INFO L525 BasicCegarLoop]: trace histogram [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] [2021-07-05 10:17:03,285 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-07-05 10:17:03,285 INFO L374 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:03,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:03,286 INFO L82 PathProgramCache]: Analyzing trace with hash 216468379, now seen corresponding path program 1 times [2021-07-05 10:17:03,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:03,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547781217] [2021-07-05 10:17:03,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:03,286 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:03,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:03,295 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:03,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:03,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:03,303 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,303 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:03,304 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:03,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547781217] [2021-07-05 10:17:03,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547781217] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:03,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:03,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:03,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732966992] [2021-07-05 10:17:03,305 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:03,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:03,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:03,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:03,305 INFO L87 Difference]: Start difference. First operand 8519 states and 11132 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:03,576 INFO L93 Difference]: Finished difference Result 16377 states and 21466 transitions. [2021-07-05 10:17:03,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:03,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-07-05 10:17:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:03,584 INFO L225 Difference]: With dead ends: 16377 [2021-07-05 10:17:03,584 INFO L226 Difference]: Without dead ends: 8328 [2021-07-05 10:17:03,588 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:03,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8328 states. [2021-07-05 10:17:03,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8328 to 8322. [2021-07-05 10:17:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8322 states, 8321 states have (on average 1.2895084725393582) internal successors, (10730), 8321 states have internal predecessors, (10730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8322 states to 8322 states and 10730 transitions. [2021-07-05 10:17:03,748 INFO L78 Accepts]: Start accepts. Automaton has 8322 states and 10730 transitions. Word has length 61 [2021-07-05 10:17:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:03,748 INFO L442 AbstractCegarLoop]: Abstraction has 8322 states and 10730 transitions. [2021-07-05 10:17:03,748 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 8322 states and 10730 transitions. [2021-07-05 10:17:03,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-07-05 10:17:03,752 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:03,752 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-07-05 10:17:03,752 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-07-05 10:17:03,752 INFO L374 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:03,753 INFO L82 PathProgramCache]: Analyzing trace with hash 918521819, now seen corresponding path program 1 times [2021-07-05 10:17:03,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:03,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544003584] [2021-07-05 10:17:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:03,753 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:03,762 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,763 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:03,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,766 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:03,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:03,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 5 [2021-07-05 10:17:03,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:03,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:03,780 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-07-05 10:17:03,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:03,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544003584] [2021-07-05 10:17:03,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544003584] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:03,780 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:03,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-07-05 10:17:03,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899235575] [2021-07-05 10:17:03,781 INFO L425 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-07-05 10:17:03,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-07-05 10:17:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:03,781 INFO L87 Difference]: Start difference. First operand 8322 states and 10730 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:03,967 INFO L93 Difference]: Finished difference Result 14032 states and 18089 transitions. [2021-07-05 10:17:03,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-05 10:17:03,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-07-05 10:17:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:03,972 INFO L225 Difference]: With dead ends: 14032 [2021-07-05 10:17:03,972 INFO L226 Difference]: Without dead ends: 5819 [2021-07-05 10:17:03,977 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31.2ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-07-05 10:17:03,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5819 states. [2021-07-05 10:17:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5819 to 5189. [2021-07-05 10:17:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5188 states have (on average 1.288550501156515) internal successors, (6685), 5188 states have internal predecessors, (6685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 6685 transitions. [2021-07-05 10:17:04,092 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 6685 transitions. Word has length 96 [2021-07-05 10:17:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:04,092 INFO L442 AbstractCegarLoop]: Abstraction has 5189 states and 6685 transitions. [2021-07-05 10:17:04,092 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 6685 transitions. [2021-07-05 10:17:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-07-05 10:17:04,094 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:04,094 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:17:04,094 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-07-05 10:17:04,095 INFO L374 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:04,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1430687950, now seen corresponding path program 1 times [2021-07-05 10:17:04,095 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:04,095 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051038786] [2021-07-05 10:17:04,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:04,095 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:04,106 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,107 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:04,110 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,111 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:04,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:17:04,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:04,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051038786] [2021-07-05 10:17:04,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051038786] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:04,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:04,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:04,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659542426] [2021-07-05 10:17:04,116 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:04,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:04,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:04,117 INFO L87 Difference]: Start difference. First operand 5189 states and 6685 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:04,304 INFO L93 Difference]: Finished difference Result 11498 states and 14796 transitions. [2021-07-05 10:17:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-07-05 10:17:04,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-07-05 10:17:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:04,309 INFO L225 Difference]: With dead ends: 11498 [2021-07-05 10:17:04,310 INFO L226 Difference]: Without dead ends: 6160 [2021-07-05 10:17:04,313 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6160 states. [2021-07-05 10:17:04,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6160 to 4504. [2021-07-05 10:17:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 4503 states have (on average 1.2804796802131913) internal successors, (5766), 4503 states have internal predecessors, (5766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 5766 transitions. [2021-07-05 10:17:04,435 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 5766 transitions. Word has length 99 [2021-07-05 10:17:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:04,435 INFO L442 AbstractCegarLoop]: Abstraction has 4504 states and 5766 transitions. [2021-07-05 10:17:04,436 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 5766 transitions. [2021-07-05 10:17:04,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-07-05 10:17:04,437 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:04,438 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:17:04,438 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-07-05 10:17:04,438 INFO L374 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -661247030, now seen corresponding path program 1 times [2021-07-05 10:17:04,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:04,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265012927] [2021-07-05 10:17:04,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:04,439 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:04,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:04,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,451 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:04,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,455 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:04,459 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,459 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:17:04,459 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:04,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265012927] [2021-07-05 10:17:04,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265012927] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:04,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:04,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:04,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691717655] [2021-07-05 10:17:04,460 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:04,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:04,461 INFO L87 Difference]: Start difference. First operand 4504 states and 5766 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:04,638 INFO L93 Difference]: Finished difference Result 9544 states and 12192 transitions. [2021-07-05 10:17:04,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:04,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-07-05 10:17:04,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:04,644 INFO L225 Difference]: With dead ends: 9544 [2021-07-05 10:17:04,644 INFO L226 Difference]: Without dead ends: 5320 [2021-07-05 10:17:04,647 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2021-07-05 10:17:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 4500. [2021-07-05 10:17:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4500 states, 4499 states have (on average 1.2667259390975771) internal successors, (5699), 4499 states have internal predecessors, (5699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 5699 transitions. [2021-07-05 10:17:04,791 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 5699 transitions. Word has length 99 [2021-07-05 10:17:04,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:04,791 INFO L442 AbstractCegarLoop]: Abstraction has 4500 states and 5699 transitions. [2021-07-05 10:17:04,791 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 5699 transitions. [2021-07-05 10:17:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-07-05 10:17:04,792 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:04,793 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2021-07-05 10:17:04,793 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2021-07-05 10:17:04,793 INFO L374 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1763595376, now seen corresponding path program 1 times [2021-07-05 10:17:04,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:04,793 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130238666] [2021-07-05 10:17:04,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:04,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:04,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,803 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:04,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:04,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:04,807 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-07-05 10:17:04,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:04,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130238666] [2021-07-05 10:17:04,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130238666] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:04,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:04,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:04,808 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340050814] [2021-07-05 10:17:04,808 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:04,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:04,809 INFO L87 Difference]: Start difference. First operand 4500 states and 5699 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:04,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:04,922 INFO L93 Difference]: Finished difference Result 8610 states and 10951 transitions. [2021-07-05 10:17:04,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:04,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2021-07-05 10:17:04,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:04,927 INFO L225 Difference]: With dead ends: 8610 [2021-07-05 10:17:04,927 INFO L226 Difference]: Without dead ends: 4313 [2021-07-05 10:17:04,930 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2021-07-05 10:17:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4313. [2021-07-05 10:17:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4313 states, 4312 states have (on average 1.2706400742115027) internal successors, (5479), 4312 states have internal predecessors, (5479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4313 states to 4313 states and 5479 transitions. [2021-07-05 10:17:05,046 INFO L78 Accepts]: Start accepts. Automaton has 4313 states and 5479 transitions. Word has length 99 [2021-07-05 10:17:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:05,046 INFO L442 AbstractCegarLoop]: Abstraction has 4313 states and 5479 transitions. [2021-07-05 10:17:05,046 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,046 INFO L276 IsEmpty]: Start isEmpty. Operand 4313 states and 5479 transitions. [2021-07-05 10:17:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-07-05 10:17:05,047 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:05,047 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:17:05,048 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2021-07-05 10:17:05,048 INFO L374 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1242360231, now seen corresponding path program 1 times [2021-07-05 10:17:05,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:05,048 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478989180] [2021-07-05 10:17:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:05,049 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:05,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:05,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:05,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-05 10:17:05,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:05,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478989180] [2021-07-05 10:17:05,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478989180] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:05,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:05,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:05,069 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978497795] [2021-07-05 10:17:05,069 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:05,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:05,070 INFO L87 Difference]: Start difference. First operand 4313 states and 5479 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:05,213 INFO L93 Difference]: Finished difference Result 8235 states and 10485 transitions. [2021-07-05 10:17:05,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-07-05 10:17:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:05,216 INFO L225 Difference]: With dead ends: 8235 [2021-07-05 10:17:05,216 INFO L226 Difference]: Without dead ends: 4015 [2021-07-05 10:17:05,219 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4015 states. [2021-07-05 10:17:05,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4015 to 3962. [2021-07-05 10:17:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 1.2547336531178994) internal successors, (4970), 3961 states have internal predecessors, (4970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 4970 transitions. [2021-07-05 10:17:05,322 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 4970 transitions. Word has length 102 [2021-07-05 10:17:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:05,323 INFO L442 AbstractCegarLoop]: Abstraction has 3962 states and 4970 transitions. [2021-07-05 10:17:05,323 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 4970 transitions. [2021-07-05 10:17:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2021-07-05 10:17:05,324 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:05,324 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:17:05,324 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-07-05 10:17:05,324 INFO L374 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:05,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash -310429394, now seen corresponding path program 1 times [2021-07-05 10:17:05,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:05,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849770231] [2021-07-05 10:17:05,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:05,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:05,350 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:05,351 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:05,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:05,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:05,360 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:17:05,360 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:05,360 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849770231] [2021-07-05 10:17:05,360 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849770231] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:05,361 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:05,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-07-05 10:17:05,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881684652] [2021-07-05 10:17:05,361 INFO L425 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-07-05 10:17:05,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-07-05 10:17:05,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-07-05 10:17:05,364 INFO L87 Difference]: Start difference. First operand 3962 states and 4970 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:05,594 INFO L93 Difference]: Finished difference Result 8831 states and 11021 transitions. [2021-07-05 10:17:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-07-05 10:17:05,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2021-07-05 10:17:05,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:05,599 INFO L225 Difference]: With dead ends: 8831 [2021-07-05 10:17:05,599 INFO L226 Difference]: Without dead ends: 4964 [2021-07-05 10:17:05,601 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-07-05 10:17:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4964 states. [2021-07-05 10:17:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4964 to 3933. [2021-07-05 10:17:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3933 states, 3932 states have (on average 1.232706002034588) internal successors, (4847), 3932 states have internal predecessors, (4847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3933 states to 3933 states and 4847 transitions. [2021-07-05 10:17:05,720 INFO L78 Accepts]: Start accepts. Automaton has 3933 states and 4847 transitions. Word has length 103 [2021-07-05 10:17:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:05,720 INFO L442 AbstractCegarLoop]: Abstraction has 3933 states and 4847 transitions. [2021-07-05 10:17:05,720 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3933 states and 4847 transitions. [2021-07-05 10:17:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2021-07-05 10:17:05,721 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:05,721 INFO L525 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-07-05 10:17:05,721 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2021-07-05 10:17:05,721 INFO L374 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:05,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:05,721 INFO L82 PathProgramCache]: Analyzing trace with hash 291943753, now seen corresponding path program 1 times [2021-07-05 10:17:05,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:05,722 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131394191] [2021-07-05 10:17:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:05,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:05,736 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,736 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:05,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:05,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:05,743 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-07-05 10:17:05,743 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:05,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131394191] [2021-07-05 10:17:05,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131394191] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:05,744 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:05,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-05 10:17:05,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532669876] [2021-07-05 10:17:05,744 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:05,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:05,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:05,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:05,745 INFO L87 Difference]: Start difference. First operand 3933 states and 4847 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:05,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:05,913 INFO L93 Difference]: Finished difference Result 9898 states and 12147 transitions. [2021-07-05 10:17:05,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:05,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2021-07-05 10:17:05,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:05,919 INFO L225 Difference]: With dead ends: 9898 [2021-07-05 10:17:05,919 INFO L226 Difference]: Without dead ends: 6060 [2021-07-05 10:17:05,922 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6060 states. [2021-07-05 10:17:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6060 to 6058. [2021-07-05 10:17:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6058 states, 6057 states have (on average 1.217269275218755) internal successors, (7373), 6057 states have internal predecessors, (7373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6058 states to 6058 states and 7373 transitions. [2021-07-05 10:17:06,134 INFO L78 Accepts]: Start accepts. Automaton has 6058 states and 7373 transitions. Word has length 119 [2021-07-05 10:17:06,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:06,134 INFO L442 AbstractCegarLoop]: Abstraction has 6058 states and 7373 transitions. [2021-07-05 10:17:06,135 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6058 states and 7373 transitions. [2021-07-05 10:17:06,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-07-05 10:17:06,137 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:06,137 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:06,137 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2021-07-05 10:17:06,137 INFO L374 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -368834209, now seen corresponding path program 1 times [2021-07-05 10:17:06,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:06,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231114315] [2021-07-05 10:17:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:06,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:06,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:06,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,171 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:06,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2021-07-05 10:17:06,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:06,175 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231114315] [2021-07-05 10:17:06,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231114315] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:06,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:06,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:06,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601942001] [2021-07-05 10:17:06,176 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:06,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:06,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:06,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:06,176 INFO L87 Difference]: Start difference. First operand 6058 states and 7373 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:06,371 INFO L93 Difference]: Finished difference Result 12033 states and 14655 transitions. [2021-07-05 10:17:06,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:06,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-07-05 10:17:06,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:06,376 INFO L225 Difference]: With dead ends: 12033 [2021-07-05 10:17:06,376 INFO L226 Difference]: Without dead ends: 6058 [2021-07-05 10:17:06,380 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:06,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6058 states. [2021-07-05 10:17:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6058 to 5834. [2021-07-05 10:17:06,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5834 states, 5833 states have (on average 1.205211726384365) internal successors, (7030), 5833 states have internal predecessors, (7030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5834 states to 5834 states and 7030 transitions. [2021-07-05 10:17:06,550 INFO L78 Accepts]: Start accepts. Automaton has 5834 states and 7030 transitions. Word has length 179 [2021-07-05 10:17:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:06,551 INFO L442 AbstractCegarLoop]: Abstraction has 5834 states and 7030 transitions. [2021-07-05 10:17:06,551 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states and 7030 transitions. [2021-07-05 10:17:06,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-07-05 10:17:06,553 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:06,553 INFO L525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-05 10:17:06,553 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2021-07-05 10:17:06,553 INFO L374 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:06,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:06,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1199487843, now seen corresponding path program 1 times [2021-07-05 10:17:06,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:06,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576106664] [2021-07-05 10:17:06,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:06,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:06,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,566 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:06,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-07-05 10:17:06,570 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:06,570 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576106664] [2021-07-05 10:17:06,570 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576106664] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:06,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:06,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:06,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893955991] [2021-07-05 10:17:06,571 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:06,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:06,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:06,571 INFO L87 Difference]: Start difference. First operand 5834 states and 7030 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:06,748 INFO L93 Difference]: Finished difference Result 11413 states and 13785 transitions. [2021-07-05 10:17:06,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:06,748 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2021-07-05 10:17:06,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:06,755 INFO L225 Difference]: With dead ends: 11413 [2021-07-05 10:17:06,755 INFO L226 Difference]: Without dead ends: 5642 [2021-07-05 10:17:06,759 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2021-07-05 10:17:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2021-07-05 10:17:06,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5642 states, 5641 states have (on average 1.2093600425456479) internal successors, (6822), 5641 states have internal predecessors, (6822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 6822 transitions. [2021-07-05 10:17:06,946 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 6822 transitions. Word has length 179 [2021-07-05 10:17:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:06,946 INFO L442 AbstractCegarLoop]: Abstraction has 5642 states and 6822 transitions. [2021-07-05 10:17:06,946 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:06,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 6822 transitions. [2021-07-05 10:17:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-07-05 10:17:06,949 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:06,949 INFO L525 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 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] [2021-07-05 10:17:06,949 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2021-07-05 10:17:06,949 INFO L374 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:06,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:06,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1582627211, now seen corresponding path program 1 times [2021-07-05 10:17:06,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:06,950 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820497861] [2021-07-05 10:17:06,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:06,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:06,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:06,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,972 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:06,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:06,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-07-05 10:17:06,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:06,991 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-07-05 10:17:06,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:06,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820497861] [2021-07-05 10:17:06,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820497861] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:06,992 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:06,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-05 10:17:06,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748718237] [2021-07-05 10:17:06,993 INFO L425 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-05 10:17:06,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-05 10:17:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-05 10:17:06,994 INFO L87 Difference]: Start difference. First operand 5642 states and 6822 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:07,425 INFO L93 Difference]: Finished difference Result 12574 states and 15185 transitions. [2021-07-05 10:17:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-05 10:17:07,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-07-05 10:17:07,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:07,431 INFO L225 Difference]: With dead ends: 12574 [2021-07-05 10:17:07,431 INFO L226 Difference]: Without dead ends: 6995 [2021-07-05 10:17:07,434 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 60.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-05 10:17:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6995 states. [2021-07-05 10:17:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6995 to 5390. [2021-07-05 10:17:07,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5390 states, 5389 states have (on average 1.1972536648728893) internal successors, (6452), 5389 states have internal predecessors, (6452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5390 states to 5390 states and 6452 transitions. [2021-07-05 10:17:07,619 INFO L78 Accepts]: Start accepts. Automaton has 5390 states and 6452 transitions. Word has length 183 [2021-07-05 10:17:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:07,619 INFO L442 AbstractCegarLoop]: Abstraction has 5390 states and 6452 transitions. [2021-07-05 10:17:07,619 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,619 INFO L276 IsEmpty]: Start isEmpty. Operand 5390 states and 6452 transitions. [2021-07-05 10:17:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-07-05 10:17:07,621 INFO L517 BasicCegarLoop]: Found error trace [2021-07-05 10:17:07,621 INFO L525 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] [2021-07-05 10:17:07,621 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2021-07-05 10:17:07,622 INFO L374 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-07-05 10:17:07,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-05 10:17:07,622 INFO L82 PathProgramCache]: Analyzing trace with hash 646872823, now seen corresponding path program 1 times [2021-07-05 10:17:07,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-05 10:17:07,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274184917] [2021-07-05 10:17:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-05 10:17:07,622 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-07-05 10:17:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-05 10:17:07,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:07,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:07,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:07,638 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-05 10:17:07,641 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-05 10:17:07,641 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-05 10:17:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-07-05 10:17:07,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-05 10:17:07,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274184917] [2021-07-05 10:17:07,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274184917] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-05 10:17:07,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-05 10:17:07,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-05 10:17:07,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172799308] [2021-07-05 10:17:07,643 INFO L425 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-05 10:17:07,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-05 10:17:07,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-05 10:17:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:07,643 INFO L87 Difference]: Start difference. First operand 5390 states and 6452 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-05 10:17:07,762 INFO L93 Difference]: Finished difference Result 7990 states and 9620 transitions. [2021-07-05 10:17:07,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-05 10:17:07,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2021-07-05 10:17:07,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-05 10:17:07,763 INFO L225 Difference]: With dead ends: 7990 [2021-07-05 10:17:07,763 INFO L226 Difference]: Without dead ends: 0 [2021-07-05 10:17:07,767 INFO L795 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-05 10:17:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-07-05 10:17:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-07-05 10:17:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-07-05 10:17:07,768 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2021-07-05 10:17:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-05 10:17:07,768 INFO L442 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-07-05 10:17:07,768 INFO L443 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-05 10:17:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-07-05 10:17:07,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-07-05 10:17:07,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-07-05 10:17:07,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:07,839 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:07,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:07,997 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:17:07,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:08,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:08,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:08,057 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:08,443 WARN L205 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 629 DAG size of output: 393 [2021-07-05 10:17:08,445 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:08,844 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 629 DAG size of output: 398 [2021-07-05 10:17:08,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,029 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 215 [2021-07-05 10:17:09,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,031 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,332 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,476 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:17:09,477 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,478 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,536 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,679 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 172 [2021-07-05 10:17:09,680 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,781 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,970 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 160 [2021-07-05 10:17:09,971 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:09,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,361 WARN L205 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 627 DAG size of output: 390 [2021-07-05 10:17:10,362 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,447 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,575 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,618 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,620 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:10,885 WARN L205 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 521 DAG size of output: 285 [2021-07-05 10:17:10,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,029 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 385 DAG size of output: 159 [2021-07-05 10:17:11,030 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,336 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 198 [2021-07-05 10:17:11,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,397 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:11,438 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-07-05 10:17:12,019 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 52 [2021-07-05 10:17:12,138 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2021-07-05 10:17:12,694 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:17:13,006 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 59 [2021-07-05 10:17:13,185 WARN L205 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2021-07-05 10:17:14,662 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 324 DAG size of output: 75 [2021-07-05 10:17:16,099 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 322 DAG size of output: 74 [2021-07-05 10:17:16,751 WARN L205 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 61 [2021-07-05 10:17:17,382 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 59 [2021-07-05 10:17:17,899 WARN L205 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2021-07-05 10:17:18,455 WARN L205 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 55 [2021-07-05 10:17:18,800 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 46 [2021-07-05 10:17:18,965 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 42 [2021-07-05 10:17:19,075 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2021-07-05 10:17:19,640 WARN L205 SmtUtils]: Spent 563.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:17:20,348 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 68 [2021-07-05 10:17:20,521 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 34 [2021-07-05 10:17:21,079 WARN L205 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 63 [2021-07-05 10:17:21,383 WARN L205 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 55 [2021-07-05 10:17:21,683 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2021-07-05 10:17:21,993 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 57 [2021-07-05 10:17:22,652 WARN L205 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2021-07-05 10:17:22,753 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-07-05 10:17:24,109 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 326 DAG size of output: 72 [2021-07-05 10:17:24,677 WARN L205 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 57 [2021-07-05 10:17:25,185 WARN L205 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 57 [2021-07-05 10:17:25,642 WARN L205 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2021-07-05 10:17:26,120 WARN L205 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2021-07-05 10:17:26,270 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2021-07-05 10:17:27,399 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 228 DAG size of output: 74 [2021-07-05 10:17:27,946 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 65 [2021-07-05 10:17:28,259 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 46 [2021-07-05 10:17:28,827 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2021-07-05 10:17:29,533 WARN L205 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 62 [2021-07-05 10:17:29,769 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 45 [2021-07-05 10:17:29,992 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 36 [2021-07-05 10:17:30,487 WARN L205 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 49 [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L68-3(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L68-5(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L758 garLoopResultBuilder]: At program point L465(lines 449 467) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L69(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L69-1(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L69-2(lines 69 74) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L203(line 203) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L303-1(lines 302 315) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L758 garLoopResultBuilder]: At program point L270-1(lines 303 307) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0))) (or (and .cse0 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) .cse2 .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5))) [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L303-2(lines 303 307) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L303-4(lines 302 315) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L762 garLoopResultBuilder]: For program point L502(lines 502 511) no Hoare annotation was computed. [2021-07-05 10:17:30,488 INFO L758 garLoopResultBuilder]: At program point L502-1(lines 502 511) the Hoare annotation is: (let ((.cse11 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse14 (= ~q_read_ev~0 2)) (.cse15 (= ~q_req_up~0 0)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse9 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse13 (= ~t~0 0)) (.cse10 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse13) (and .cse11 .cse0 .cse2 .cse4 .cse14 .cse15 (not .cse1) .cse12) (and .cse11 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse14 .cse15 .cse12 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10))) [2021-07-05 10:17:30,489 INFO L762 garLoopResultBuilder]: For program point L403(line 403) no Hoare annotation was computed. [2021-07-05 10:17:30,489 INFO L762 garLoopResultBuilder]: For program point L141(lines 141 153) no Hoare annotation was computed. [2021-07-05 10:17:30,489 INFO L758 garLoopResultBuilder]: At program point L108(lines 86 110) the Hoare annotation is: (let ((.cse4 (= ~c_dr_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse4 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse5 .cse6 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9))) [2021-07-05 10:17:30,489 INFO L758 garLoopResultBuilder]: At program point L108-1(lines 86 110) the Hoare annotation is: (let ((.cse15 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse17 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse18 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse8 (not .cse18)) (.cse9 (not .cse17)) (.cse12 (not .cse15)) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse16 (= ~q_read_ev~0 2)) (.cse14 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse11) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse15 .cse4 .cse16 .cse14 (not .cse1) .cse10 .cse17 .cse18 .cse11) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11) (and .cse13 .cse15 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse16 .cse14 .cse10 .cse17 .cse18 .cse11)))) [2021-07-05 10:17:30,489 INFO L758 garLoopResultBuilder]: At program point L108-2(lines 86 110) the Hoare annotation is: (let ((.cse17 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse18 (not .cse8)) (.cse19 (not .cse7)) (.cse20 (not .cse1)) (.cse0 (not .cse17)) (.cse12 (not (= ~slow_clk_edge~0 1))) (.cse15 (not (= ~fast_clk_edge~0 1))) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (not (= ~q_write_ev~0 0))) (.cse11 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~c_dr_i~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse6 (not (= ~p_dw_pc~0 1))) (.cse16 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse11) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse6 .cse9) (and .cse0 .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse15 .cse16) (and .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse17 .cse18 .cse19 .cse9 .cse20) (and .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse17 .cse18 .cse19 .cse16 .cse20) (and .cse0 .cse10 .cse11 .cse2 .cse12 .cse3 .cse13 .cse14 .cse15 .cse9) (and .cse10 .cse11 .cse2 .cse3 .cse13 .cse14 .cse6 .cse16)))) [2021-07-05 10:17:30,489 INFO L758 garLoopResultBuilder]: At program point L109(lines 83 111) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9 .cse10) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5 .cse7 .cse8 .cse9 .cse10))) [2021-07-05 10:17:30,489 INFO L758 garLoopResultBuilder]: At program point L109-1(lines 83 111) the Hoare annotation is: (let ((.cse16 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse18 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse19 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse12 (not .cse19)) (.cse13 (not .cse18)) (.cse15 (not .cse16)) (.cse11 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse17 (= ~q_read_ev~0 2)) (.cse8 (= ~q_req_up~0 0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse14 (not (= ~p_dw_pc~0 1))) (.cse9 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse10 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15) (and .cse0 .cse16 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse17 .cse8 .cse14 .cse18 .cse19 .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse16 .cse4 .cse17 .cse8 (not .cse2) .cse14 .cse18 .cse19 .cse9 .cse10)))) [2021-07-05 10:17:30,490 INFO L758 garLoopResultBuilder]: At program point L109-2(lines 83 111) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse9 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse10 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~p_dw_st~0 0))) (let ((.cse15 (not (= ~fast_clk_edge~0 1))) (.cse0 (not .cse18)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse17 (not (= ~slow_clk_edge~0 1))) (.cse19 (not .cse10)) (.cse20 (not .cse9)) (.cse11 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse12 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse21 (not .cse2)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse7 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse13 (= 1 ~c_dr_i~0)) (.cse14 (= ~p_dw_i~0 1)) (.cse8 (not (= ~p_dw_pc~0 1))) (.cse16 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not .cse7) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse15 .cse16) (and .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse15 .cse11 .cse12) (and .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse18 .cse19 .cse20 .cse16 .cse21) (and .cse0 .cse2 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse7 .cse3 .cse17 .cse4 .cse13 .cse14 .cse18 .cse19 .cse20 .cse11 .cse12 .cse21) (and .cse1 .cse7 .cse3 .cse4 .cse13 .cse14 .cse8 .cse16)))) [2021-07-05 10:17:30,490 INFO L762 garLoopResultBuilder]: For program point L407(lines 407 411) no Hoare annotation was computed. [2021-07-05 10:17:30,490 INFO L762 garLoopResultBuilder]: For program point L407-1(lines 402 442) no Hoare annotation was computed. [2021-07-05 10:17:30,490 INFO L762 garLoopResultBuilder]: For program point L341(lines 341 348) no Hoare annotation was computed. [2021-07-05 10:17:30,490 INFO L758 garLoopResultBuilder]: At program point L308-1(lines 299 316) the Hoare annotation is: (let ((.cse3 (= ~c_dr_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0))) (or (and (not .cse0) .cse1 .cse2 (not .cse3) .cse4 .cse5) (and .cse3 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)))) [2021-07-05 10:17:30,490 INFO L758 garLoopResultBuilder]: At program point L341-2(lines 337 352) the Hoare annotation is: (let ((.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse9 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse14 (= ~t~0 0)) (.cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse12 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse13 (not (= ~p_dw_st~0 0))) (.cse0 (not (= ~q_write_ev~0 0))) (.cse1 (= ~c_dr_pc~0 1)) (.cse2 (not (= ~q_write_ev~0 1))) (.cse3 (not (= ~slow_clk_edge~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse14) (and .cse13 .cse0 .cse2 .cse4 .cse15 .cse16 (not .cse1) .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12) (and .cse13 .cse2 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse15 .cse16 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7))) [2021-07-05 10:17:30,490 INFO L758 garLoopResultBuilder]: At program point L308-3(lines 299 316) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse2 (= ~c_dr_pc~0 1)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse9 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse9 (not .cse2) .cse11))) [2021-07-05 10:17:30,491 INFO L762 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-07-05 10:17:30,491 INFO L762 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-07-05 10:17:30,491 INFO L762 garLoopResultBuilder]: For program point L210-1(lines 210 220) no Hoare annotation was computed. [2021-07-05 10:17:30,491 INFO L762 garLoopResultBuilder]: For program point L144(lines 144 152) no Hoare annotation was computed. [2021-07-05 10:17:30,491 INFO L758 garLoopResultBuilder]: At program point L12-1(lines 190 244) the Hoare annotation is: (let ((.cse7 (= ~p_dw_st~0 0))) (let ((.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse15 (= ~p_dw_pc~0 1)) (.cse13 (not .cse7)) (.cse14 (not (= ~q_write_ev~0 0))) (.cse19 (= ~c_dr_pc~0 1)) (.cse16 (not (= ~q_write_ev~0 1))) (.cse17 (not (= ~slow_clk_edge~0 1))) (.cse1 (not (= ~c_dr_st~0 0))) (.cse2 (= 1 ~c_dr_i~0)) (.cse3 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse4 (= ~p_dw_i~0 1)) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse12 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse11 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse0 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (or (and .cse0 (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~slow_clk_edge~0 ~q_read_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse13 .cse14 .cse15 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse8 .cse9 .cse10) (and .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 (not .cse15) .cse8 .cse9 .cse10) (and .cse13 .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 .cse8 .cse9 .cse10) (and .cse14 .cse19 .cse16 .cse17 .cse1 .cse2 .cse3 .cse4 .cse18 (not .cse12) (not .cse11) .cse8 .cse9 .cse10 (not .cse0))))) [2021-07-05 10:17:30,491 INFO L758 garLoopResultBuilder]: At program point L145(lines 140 184) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (= ~p_dw_pc~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse10 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse11 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse14 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~c_dr_st~0 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~t~0 0) .cse12 .cse13 .cse14))) [2021-07-05 10:17:30,491 INFO L758 garLoopResultBuilder]: At program point L79(lines 57 81) the Hoare annotation is: (let ((.cse5 (= ~p_dw_st~0 0)) (.cse1 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse2 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse3 (= ~q_read_ev~0 2)) (.cse4 (= ~q_req_up~0 0)) (.cse6 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse3 .cse4 .cse5 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse6) (and (not .cse5) .cse1 .cse2 (not .cse0) .cse3 .cse4 .cse6))) [2021-07-05 10:17:30,491 INFO L758 garLoopResultBuilder]: At program point L79-1(lines 57 81) the Hoare annotation is: (let ((.cse10 (= ~q_read_ev~0 2)) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~q_req_up~0 0)) (.cse12 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 .cse12 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L79-2(lines 57 81) the Hoare annotation is: (let ((.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse10 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~q_read_ev~0 2)) (.cse12 (= ~q_req_up~0 0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (not (= ~p_dw_pc~0 1))) (.cse8 (= ~t~0 0)) (.cse15 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse9 (not (= ~slow_clk_edge~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse16 (not .cse13))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse11 .cse12 .cse7 .cse13 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse14 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse16 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10 .cse8) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse12 (not .cse2) .cse7 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse14 .cse6 .cse7 .cse8 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6 .cse16)))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L443(lines 396 448) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~c_dr_st~0 0))) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse7 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (not (= ~slow_clk_edge~0 1)) .cse4 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (not (= ~fast_clk_edge~0 1))) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not .cse2) .cse7) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L80(lines 54 82) the Hoare annotation is: (let ((.cse6 (= ~p_dw_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse0 (= ~c_dr_st~0 0)) (.cse4 (= ~q_read_ev~0 2)) (.cse5 (= ~q_req_up~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (or (and .cse0 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse4 .cse5 .cse6 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7) (and (not .cse6) .cse1 .cse2 .cse3 (not .cse0) .cse4 .cse5 .cse7))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L80-1(lines 54 82) the Hoare annotation is: (let ((.cse12 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse15 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse13 (= ~q_read_ev~0 2)) (.cse14 (= ~q_req_up~0 0)) (.cse9 (not .cse15)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse11 (not .cse12)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse5 .cse13 .cse14 (not .cse2) .cse10 .cse15) (and .cse0 .cse12 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse13 .cse14 .cse10 .cse15 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse12 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse14 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15)))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L80-2(lines 54 82) the Hoare annotation is: (let ((.cse2 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse10 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse12 (not .cse10)) (.cse15 (not .cse2)) (.cse11 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse14 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse5 (not (= ~slow_clk_edge~0 1))) (.cse18 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse3 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~q_write_ev~0 1))) (.cse6 (not (= ~c_dr_st~0 0))) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= ~p_dw_i~0 1)) (.cse9 (not (= ~p_dw_pc~0 1))) (.cse13 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse3 (or (and .cse1 .cse4 .cse6 .cse7 .cse11 .cse8 .cse12 .cse9 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8 .cse12 .cse13 .cse15))) (and .cse0 .cse2 .cse4 (= ~c_dr_pc~0 ~q_req_up~0) .cse6 .cse16 .cse17 .cse9 .cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse18 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse16 .cse17 (not .cse3) .cse9 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse9 .cse14 .cse10) (and .cse3 (or (and .cse1 .cse4 .cse5 .cse6 .cse7 .cse11 .cse8 .cse12 .cse9 .cse14 .cse15) (and .cse0 .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 .cse12 .cse15))) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse11 .cse8 .cse9 .cse13 .cse14 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse18 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse13 .cse10)))) [2021-07-05 10:17:30,492 INFO L758 garLoopResultBuilder]: At program point L543(lines 527 545) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L147(lines 147 151) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L758 garLoopResultBuilder]: At program point L412(lines 402 442) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse14 (= ~c_dr_st~0 0)) (.cse29 (= ~p_dw_st~0 0)) (.cse28 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse30 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse31 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse15 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse21 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse25 (not .cse31)) (.cse26 (not .cse30)) (.cse27 (not .cse28)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse13 (= ~t~0 0)) (.cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse12 (= ULTIMATE.start_eval_~tmp___1~0 1)) (.cse0 (not .cse29)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse18 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (not .cse14)) (.cse19 (= ~q_read_ev~0 2)) (.cse20 (= ~q_req_up~0 0)) (.cse10 (not .cse17)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse24 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse13 .cse11 .cse12) (and .cse14 .cse0 .cse15 .cse16 .cse17 .cse18 .cse6 .cse9 .cse7 .cse19 .cse20 .cse21 .cse13 .cse11 .cse12 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse25 .cse26 .cse13 .cse11 .cse12 .cse27) (and .cse0 .cse1 .cse3 .cse5 .cse19 .cse20 (not .cse2) .cse10) (and .cse14 .cse28 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16 .cse18 .cse6 .cse9 .cse7 .cse19 .cse20 .cse29 .cse21 .cse13 .cse11 .cse12 .cse30 .cse22 .cse31 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse25 .cse26 .cse11 .cse12 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse11 .cse12) (and .cse0 .cse3 .cse18 .cse5 .cse19 .cse20 .cse10 .cse22 .cse23 .cse24)))) [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379-2(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379-3(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379-5(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379-6(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L379-8(lines 379 383) no Hoare annotation was computed. [2021-07-05 10:17:30,493 INFO L762 garLoopResultBuilder]: For program point L283(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L250(lines 250 256) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L283-1(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L758 garLoopResultBuilder]: At program point L250-1(lines 265 269) the Hoare annotation is: (and (= ~c_dr_st~0 0) (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~p_dw_st~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0)) [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L283-2(lines 283 293) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L250-2(lines 250 256) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L758 garLoopResultBuilder]: At program point L250-3(lines 246 260) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse9 (not .cse2) .cse11) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse9 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L515(lines 515 519) no Hoare annotation was computed. [2021-07-05 10:17:30,494 INFO L762 garLoopResultBuilder]: For program point L416(lines 416 423) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L758 garLoopResultBuilder]: At program point L483-1(lines 317 520) the Hoare annotation is: (let ((.cse21 (= ~p_dw_st~0 0)) (.cse19 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse22 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse24 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse18 (= ~c_dr_st~0 0))) (let ((.cse20 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse23 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse25 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse26 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not .cse18)) (.cse13 (not .cse24)) (.cse14 (not .cse22)) (.cse15 (not .cse19)) (.cse0 (not .cse21)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse18 .cse19 (= ~q_req_up~0 ~p_dw_pc~0) (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse20 .cse6 .cse7 .cse16 .cse17 .cse21 (= ~slow_clk_edge~0 ~q_read_ev~0) .cse11 .cse22 .cse23 .cse24 .cse25 .cse26) (and .cse0 .cse3 .cse20 .cse5 .cse16 .cse17 .cse10 .cse23 .cse25 .cse26) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12)))) [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87-2(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87-3(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87-5(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87-6(lines 87 96) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L87-8(lines 86 110) no Hoare annotation was computed. [2021-07-05 10:17:30,495 INFO L762 garLoopResultBuilder]: For program point L484(line 484) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L88(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L88-1(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L88-2(lines 88 93) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L287(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L287-1(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L287-2(lines 287 292) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L387(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L758 garLoopResultBuilder]: At program point L387-2(lines 321 325) the Hoare annotation is: (let ((.cse4 (= ~c_dr_st~0 0)) (.cse1 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse2 (= ~q_req_up~0 ~p_dw_pc~0)) (.cse3 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse5 (= ~q_read_ev~0 2)) (.cse6 (= ~q_req_up~0 0)) (.cse0 (= ~p_dw_st~0 0)) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse8 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse9 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse10 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse11 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and (not .cse0) .cse1 .cse2 .cse3 (not .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse4 .cse1 .cse2 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) .cse3 (= 1 ~c_dr_i~0) (= ~p_dw_i~0 1) .cse5 .cse6 .cse0 (= ~slow_clk_edge~0 ~q_read_ev~0) (= ~t~0 0) .cse7 .cse8 .cse9 .cse10 .cse11))) [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L321-1(lines 320 333) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L387-3(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L758 garLoopResultBuilder]: At program point L387-5(lines 321 325) the Hoare annotation is: (let ((.cse10 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse11 (= ~q_read_ev~0 2)) (.cse9 (= ~q_req_up~0 0)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse15 (not .cse14)) (.cse16 (not .cse13)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse17 (not .cse10))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse10 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse11 .cse9 .cse12 .cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse0 .cse1 .cse10 .cse5 .cse11 .cse9 (not .cse2) .cse12 .cse13 .cse14) (and .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse15 .cse16 .cse12 .cse17) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse15 .cse16 .cse12 .cse17)))) [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L321-3(lines 320 333) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L762 garLoopResultBuilder]: For program point L387-6(lines 387 391) no Hoare annotation was computed. [2021-07-05 10:17:30,496 INFO L758 garLoopResultBuilder]: At program point L156-1(lines 140 184) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse9 (not (= ~fast_clk_edge~0 1))) (.cse5 (= ~c_dr_st~0 0)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse8 (= ~p_dw_i~0 1)) (.cse12 (= ~t~0 0)) (.cse10 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse11 (= ULTIMATE.start_eval_~tmp___1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse12 .cse10 .cse11) (and .cse5 .cse0 (= ~q_read_ev~0 ~fast_clk_edge~0) (= ~q_write_ev~0 ~q_read_ev~0) (= ~c_dr_pc~0 ~q_req_up~0) .cse6 .cse7 .cse8 (= ~q_read_ev~0 2) (= ~q_req_up~0 0) (= ~slow_clk_edge~0 ~q_read_ev~0) (not (= ~p_dw_pc~0 1)) .cse12 .cse10 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,496 INFO L758 garLoopResultBuilder]: At program point L387-8(lines 357 361) the Hoare annotation is: (let ((.cse15 (= ~p_dw_st~0 0)) (.cse9 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse13 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse14 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse16 (not .cse14)) (.cse17 (not .cse13)) (.cse18 (not .cse9)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse0 (not .cse15)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse12 (not (= ~p_dw_pc~0 1))) (.cse19 (= ~t~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse12 .cse13 .cse14) (and .cse0 .cse9 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse12 .cse13 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) .cse14 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse15 .cse16 .cse17 .cse19 .cse18) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8 .cse19) (and .cse1 .cse2 .cse3 .cse6 .cse7 .cse12 .cse19)))) [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L157(line 157) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58-2(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58-3(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58-5(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58-6(lines 58 67) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L58-8(lines 57 81) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L765 garLoopResultBuilder]: At program point L521(lines 468 526) the Hoare annotation is: true [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L191(lines 191 199) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L59(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L59-1(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L59-2(lines 59 64) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L765 garLoopResultBuilder]: At program point L555(lines 546 557) the Hoare annotation is: true [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L357-1(lines 356 369) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L457(lines 457 462) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point L226(lines 226 238) no Hoare annotation was computed. [2021-07-05 10:17:30,497 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L28-3(lines 28 32) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L28-5(lines 27 42) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L227(lines 227 233) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L326-3(lines 317 334) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse9 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse9 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,498 INFO L762 garLoopResultBuilder]: For program point L194(lines 194 198) no Hoare annotation was computed. [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L195(lines 190 244) the Hoare annotation is: false [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L427(lines 402 442) the Hoare annotation is: (let ((.cse28 (= ~p_dw_st~0 0)) (.cse27 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse29 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse30 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~c_dr_st~0 0)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse10 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse20 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse22 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse23 (not .cse12)) (.cse5 (not .cse9)) (.cse24 (not .cse30)) (.cse25 (not .cse29)) (.cse26 (not .cse27)) (.cse0 (not .cse28)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse18 (= ~t~0 0)) (.cse19 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse23 .cse18 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse24 .cse25 .cse18 .cse19 .cse26) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse16 (not .cse2) .cse23) (and .cse9 .cse27 (= ~q_req_up~0 ~p_dw_pc~0) .cse10 .cse11 .cse13 .cse6 .cse7 .cse15 .cse16 .cse28 .cse17 .cse18 .cse29 .cse20 .cse30 .cse21 .cse22) (and .cse0 .cse3 .cse13 .cse5 .cse15 .cse16 .cse23 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse23 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse24 .cse25 .cse19 .cse26) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse18 .cse19)))) [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L295(lines 282 297) the Hoare annotation is: (let ((.cse17 (= ~p_dw_pc~0 1)) (.cse14 (= ~c_dr_st~0 0)) (.cse27 (= ~p_dw_st~0 0)) (.cse26 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse28 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse29 (= ULTIMATE.start_activate_threads_~tmp~1 0))) (let ((.cse15 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse16 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse21 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse11 (not .cse29)) (.cse12 (not .cse28)) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (not .cse26)) (.cse0 (not .cse27)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse18 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse10 (not .cse14)) (.cse19 (= ~q_read_ev~0 2)) (.cse20 (= ~q_req_up~0 0)) (.cse25 (not .cse17)) (.cse22 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse23 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse24 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse14 .cse0 .cse15 .cse16 .cse17 .cse18 .cse5 .cse6 .cse19 .cse20 .cse21 .cse8 .cse9 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse25 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse10 .cse19 .cse20 (not .cse2) .cse25) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse25 .cse9) (and .cse14 .cse26 (= ~q_req_up~0 ~p_dw_pc~0) .cse15 .cse16 .cse18 .cse5 .cse6 .cse19 .cse20 .cse27 .cse21 .cse8 .cse9 .cse28 .cse22 .cse29 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse0 .cse3 .cse18 .cse10 .cse19 .cse20 .cse25 .cse22 .cse23 .cse24)))) [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L295-1(lines 282 297) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse9 (= ~q_read_ev~0 2)) (.cse10 (= ~q_req_up~0 0)) (.cse11 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse5 .cse9 .cse10 (not .cse2) .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse11 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse9 .cse10 .cse11 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,498 INFO L758 garLoopResultBuilder]: At program point L295-2(lines 282 297) the Hoare annotation is: (let ((.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= ~p_dw_i~0 1)) (.cse7 (not (= ~fast_clk_edge~0 1))) (.cse11 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse12 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse8 (= ~t~0 0)) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse13 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse10 (not (= ~c_dr_st~0 0))) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse14 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse11 .cse12 .cse9 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse14 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse10 .cse15 .cse16 (not .cse2) .cse14) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6 .cse7 .cse14 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse11 .cse12 .cse8 .cse9 .cse13) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse10 .cse15 .cse16 .cse14 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,499 INFO L758 garLoopResultBuilder]: At program point L163(lines 140 184) the Hoare annotation is: (let ((.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse5 (= 1 ~c_dr_i~0)) (.cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1)) (.cse10 (= ULTIMATE.start_eval_~tmp___1~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~c_dr_st~0 0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~t~0 0) .cse9 .cse10))) [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L97-1(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L97-3(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L97-5(lines 97 106) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L758 garLoopResultBuilder]: At program point L296(lines 279 298) the Hoare annotation is: (let ((.cse25 (= ~p_dw_st~0 0)) (.cse24 (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|)) (.cse26 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) (.cse27 (= ULTIMATE.start_activate_threads_~tmp~1 0)) (.cse9 (= ~c_dr_st~0 0)) (.cse12 (= ~p_dw_pc~0 1))) (let ((.cse10 (= ~q_read_ev~0 ~fast_clk_edge~0)) (.cse11 (= ~q_write_ev~0 ~q_read_ev~0)) (.cse17 (= ~slow_clk_edge~0 ~q_read_ev~0)) (.cse13 (= ~c_dr_pc~0 ~q_req_up~0)) (.cse15 (= ~q_read_ev~0 2)) (.cse16 (= ~q_req_up~0 0)) (.cse20 (= ULTIMATE.start_activate_threads_~tmp___0~1 0)) (.cse21 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0)) (.cse22 (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (.cse23 (not .cse12)) (.cse5 (not .cse9)) (.cse28 (not .cse27)) (.cse29 (not .cse26)) (.cse30 (not .cse24)) (.cse0 (not .cse25)) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse14 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse18 (= ~t~0 0)) (.cse19 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse0 .cse10 .cse11 .cse12 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse17 .cse18 .cse19 (= ULTIMATE.start_eval_~tmp___1~0 1) .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse23 .cse18 .cse19) (and .cse9 .cse24 (= ~q_req_up~0 ~p_dw_pc~0) .cse10 .cse11 .cse13 .cse6 .cse14 .cse7 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse26 .cse20 .cse27 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse28 .cse29 .cse18 .cse19 .cse30) (and .cse0 .cse1 .cse3 .cse5 .cse15 .cse16 (not .cse2) .cse23) (and .cse0 .cse3 .cse13 .cse5 .cse15 .cse16 .cse23 .cse20 .cse21 .cse22) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse23 .cse19) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse14 .cse7 .cse8 .cse28 .cse29 .cse19 .cse30) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse14 .cse7 .cse8 .cse18 .cse19)))) [2021-07-05 10:17:30,499 INFO L758 garLoopResultBuilder]: At program point L296-1(lines 279 298) the Hoare annotation is: (let ((.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse0 (not (= ~p_dw_st~0 0))) (.cse3 (not (= ~q_write_ev~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse10 (= ~q_read_ev~0 2)) (.cse11 (= ~q_req_up~0 0)) (.cse9 (not (= ~p_dw_pc~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |ULTIMATE.start_exists_runnable_thread_#res| 1) .cse7 .cse8 (not (= ULTIMATE.start_activate_threads_~tmp~1 0)) (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0)) .cse9 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1) (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (and .cse0 .cse1 .cse3 .cse5 .cse10 .cse11 (not .cse2) .cse9) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse10 .cse11 .cse9 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)))) [2021-07-05 10:17:30,499 INFO L758 garLoopResultBuilder]: At program point L296-2(lines 279 298) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L98(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L98-1(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L98-2(lines 98 103) no Hoare annotation was computed. [2021-07-05 10:17:30,499 INFO L762 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point L33-1(lines 33 37) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point L33-3(lines 33 37) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point L265-1(lines 264 277) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L758 garLoopResultBuilder]: At program point L464(lines 453 466) the Hoare annotation is: (let ((.cse16 (= ~q_read_ev~0 2)) (.cse17 (= ~q_req_up~0 0)) (.cse10 (not (= ~p_dw_pc~0 1))) (.cse5 (not (= ~c_dr_st~0 0))) (.cse13 (not (= ULTIMATE.start_activate_threads_~tmp~1 0))) (.cse14 (not (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 0))) (.cse15 (not (= 0 |ULTIMATE.start_is_do_write_p_triggered_#res|))) (.cse0 (not (= ~p_dw_st~0 0))) (.cse1 (not (= ~q_write_ev~0 0))) (.cse2 (= ~c_dr_pc~0 1)) (.cse3 (not (= ~q_write_ev~0 1))) (.cse4 (not (= ~slow_clk_edge~0 1))) (.cse6 (= 1 ~c_dr_i~0)) (.cse9 (= |ULTIMATE.start_exists_runnable_thread_#res| 1)) (.cse7 (= ~p_dw_i~0 1)) (.cse8 (not (= ~fast_clk_edge~0 1))) (.cse11 (= ~t~0 0)) (.cse12 (= ULTIMATE.start_exists_runnable_thread_~__retres1~2 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse10 .cse11 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse11 .cse12 .cse15) (and .cse0 .cse1 .cse3 .cse5 .cse16 .cse17 (not .cse2) .cse10) (and .cse0 .cse3 (= ~c_dr_pc~0 ~q_req_up~0) .cse5 .cse16 .cse17 .cse10 (= ULTIMATE.start_activate_threads_~tmp___0~1 0) (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 0) (= |ULTIMATE.start_is_do_read_c_triggered_#res| 0)) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse10 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse9 .cse7 .cse8 .cse13 .cse14 .cse12 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse9 .cse7 .cse8 .cse11 .cse12))) [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point L431(lines 431 438) no Hoare annotation was computed. [2021-07-05 10:17:30,500 INFO L762 garLoopResultBuilder]: For program point L68-1(lines 68 77) no Hoare annotation was computed. [2021-07-05 10:17:30,500 WARN L471 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2021-07-05 10:17:30,501 WARN L182 nStatisticsGenerator]: total relevant statements: 0 [2021-07-05 10:17:30,501 INFO L303 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/2) [2021-07-05 10:17:30,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.07 10:17:30 BoogieIcfgContainer [2021-07-05 10:17:30,558 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-05 10:17:30,558 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-07-05 10:17:30,558 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-07-05 10:17:30,559 INFO L275 PluginConnector]: Witness Printer initialized [2021-07-05 10:17:30,559 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.07 10:16:30" (3/4) ... [2021-07-05 10:17:30,561 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-07-05 10:17:30,572 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-07-05 10:17:30,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-07-05 10:17:30,573 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 10:17:30,574 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-07-05 10:17:30,591 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) || (((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) [2021-07-05 10:17:30,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) || (((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) [2021-07-05 10:17:30,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || ((((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,592 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || ((((((((!(p_dw_st == 0) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,593 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result))) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) || ((((((((!(p_dw_st == 0) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0) [2021-07-05 10:17:30,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0)) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) [2021-07-05 10:17:30,594 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 1) && tmp___1 == 1) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) || (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) [2021-07-05 10:17:30,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 1) && tmp___1 == 1) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1) [2021-07-05 10:17:30,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == \result && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && __retres1 == 0) && tmp == 0) || ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_read_ev == 2) && q_req_up == 0) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) [2021-07-05 10:17:30,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && !(0 == \result)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) [2021-07-05 10:17:30,595 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0) && \result == 0) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) && \result == 0)) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || (((((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result)) [2021-07-05 10:17:30,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,596 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0)) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1))) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result)) [2021-07-05 10:17:30,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && t == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) [2021-07-05 10:17:30,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) [2021-07-05 10:17:30,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1))) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && t == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) [2021-07-05 10:17:30,597 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0) || (c_dr_pc == 1 && (((((((((((!(q_write_ev == 0) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && t == 0) && !(0 == \result))))) || ((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((((!(q_write_ev == 0) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 1) && __retres1 == 0)) || (c_dr_pc == 1 && (((((((((((!(q_write_ev == 0) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && !(0 == \result))))) || (((((((((((!(q_write_ev == 0) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && __retres1 == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 0) [2021-07-05 10:17:30,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) [2021-07-05 10:17:30,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0)) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 0) && !(0 == \result))) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) [2021-07-05 10:17:30,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) [2021-07-05 10:17:30,598 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0)) || ((((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(0 == \result))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || ((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) [2021-07-05 10:17:30,616 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-07-05 10:17:30,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-07-05 10:17:30,616 INFO L168 Benchmark]: Toolchain (without parser) took 61467.15 ms. Allocated memory was 60.8 MB in the beginning and 2.2 GB in the end (delta: 2.2 GB). Free memory was 41.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 513.0 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 60.8 MB. Free memory is still 42.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.73 ms. Allocated memory is still 60.8 MB. Free memory was 41.1 MB in the beginning and 42.0 MB in the end (delta: -952.2 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 60.8 MB. Free memory was 42.0 MB in the beginning and 39.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: Boogie Preprocessor took 45.34 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 37.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: RCFGBuilder took 582.66 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 37.5 MB in the beginning and 48.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: TraceAbstraction took 60517.86 ms. Allocated memory was 73.4 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 48.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,617 INFO L168 Benchmark]: Witness Printer took 57.53 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-07-05 10:17:30,618 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 60.8 MB. Free memory is still 42.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 211.73 ms. Allocated memory is still 60.8 MB. Free memory was 41.1 MB in the beginning and 42.0 MB in the end (delta: -952.2 kB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 47.77 ms. Allocated memory is still 60.8 MB. Free memory was 42.0 MB in the beginning and 39.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.34 ms. Allocated memory is still 60.8 MB. Free memory was 39.5 MB in the beginning and 37.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 582.66 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 37.5 MB in the beginning and 48.7 MB in the end (delta: -11.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 60517.86 ms. Allocated memory was 73.4 MB in the beginning and 2.2 GB in the end (delta: 2.1 GB). Free memory was 48.3 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.4 GB. Max. memory is 16.1 GB. * Witness Printer took 57.53 ms. Allocated memory is still 2.2 GB. Free memory was 1.7 GB in the beginning and 1.7 GB in the end (delta: 9.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 131 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 31661.3ms, OverallIterations: 20, TraceHistogramMax: 5, EmptinessCheckTime: 46.5ms, AutomataDifference: 4438.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 23372.1ms, InitialAbstractionConstructionTime: 14.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3848 SDtfs, 6732 SDslu, 5427 SDs, 0 SdLazy, 617 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 735.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 351.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8519occurred in iteration=8, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2887.7ms AutomataMinimizationTime, 20 MinimizatonAttempts, 10294 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 1302 NumberOfFragments, 8750 HoareAnnotationTreeSize, 43 FomulaSimplifications, 1457431 FormulaSimplificationTreeSizeReduction, 4163.3ms HoareSimplificationTime, 43 FomulaSimplificationsInter, 122750 FormulaSimplificationTreeSizeReductionInter, 19171.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 39.0ms SsaConstructionTime, 119.3ms SatisfiabilityAnalysisTime, 526.4ms InterpolantComputationTime, 1894 NumberOfCodeBlocks, 1894 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1874 ConstructedInterpolants, 0 QuantifiedInterpolants, 2928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 675/675 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION CFG has 1 procedures, 131 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 28741.2ms, OverallIterations: 20, TraceHistogramMax: 5, EmptinessCheckTime: 24.9ms, AutomataDifference: 3420.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 22718.8ms, InitialAbstractionConstructionTime: 0.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3848 SDtfs, 6732 SDslu, 5427 SDs, 0 SdLazy, 617 SolverSat, 205 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 600.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 288.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=8519occurred in iteration=8, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2015.8ms AutomataMinimizationTime, 20 MinimizatonAttempts, 10294 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 43 LocationsWithAnnotation, 43 PreInvPairs, 1302 NumberOfFragments, 8750 HoareAnnotationTreeSize, 43 FomulaSimplifications, 1457431 FormulaSimplificationTreeSizeReduction, 3702.4ms HoareSimplificationTime, 43 FomulaSimplificationsInter, 122750 FormulaSimplificationTreeSizeReductionInter, 18988.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 28.7ms SsaConstructionTime, 66.5ms SatisfiabilityAnalysisTime, 362.8ms InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1854 ConstructedInterpolants, 0 QuantifiedInterpolants, 2908 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 675/675 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0)) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) || (((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: (((((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0)) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1))) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result)) - InvariantResult [Line: 468]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == \result && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && __retres1 == 0) && tmp == 0) || ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_read_ev == 2) && q_req_up == 0) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || ((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0) && \result == 0) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && \result == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0) && \result == 0)) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 303]: Loop Invariant Derived loop invariant: (((((((((((c_dr_st == 0 && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) || ((((((!(p_dw_st == 0) && q_req_up == p_dw_pc) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) - InvariantResult [Line: 83]: Loop Invariant Derived loop invariant: ((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) || ((((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 453]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0) || (c_dr_pc == 1 && (((((((((((!(q_write_ev == 0) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && t == 0) && !(0 == \result))))) || ((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((((!(q_write_ev == 0) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 1) && __retres1 == 0)) || (c_dr_pc == 1 && (((((((((((!(q_write_ev == 0) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && !(0 == \result))))) || (((((((((((!(q_write_ev == 0) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && __retres1 == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 0) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 0 && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((c_dr_st == 0 && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) || ((((((!(p_dw_st == 0) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 1) && tmp___1 == 1) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) || (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && p_dw_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result)) - InvariantResult [Line: 317]: Loop Invariant Derived loop invariant: (((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: ((((((((((c_dr_st == 0 && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0)) || ((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 0) && !(0 == \result))) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) - InvariantResult [Line: 321]: Loop Invariant Derived loop invariant: ((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || (((((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result))) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && !(0 == \result)) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: (((((!(p_dw_st == 0) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) || (((((((((((c_dr_st == 0 && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) - InvariantResult [Line: 337]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 1) && !(0 == \result)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && t == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: ((((((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && !(0 == \result)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(p_dw_pc == 1)) && __retres1 == 0) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && 0 == \result) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0) && __retres1 == 0) - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: (((((((((!(p_dw_st == 0) && 0 == \result) && q_req_up == p_dw_pc) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) || (((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 0) && tmp == 0) && __retres1 == 0) - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((((((((((c_dr_st == 0 && !(p_dw_st == 0)) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && p_dw_pc == 1) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || ((((((((((((((((((((c_dr_st == 0 && 0 == \result) && q_req_up == p_dw_pc) && q_read_ev == fast_clk_edge) && q_write_ev == q_read_ev) && c_dr_pc == q_req_up) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && q_read_ev == 2) && q_req_up == 0) && p_dw_st == 0) && slow_clk_edge == q_read_ev) && t == 0) && __retres1 == 1) && tmp___1 == 1) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || (((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && tmp___1 == 1) && !(0 == \result))) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 299]: Loop Invariant Derived loop invariant: ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0)) || ((((((((!(p_dw_st == 0) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) - InvariantResult [Line: 449]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && __retres1 == 1) && !(0 == \result))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(tmp == 0)) && !(__retres1 == 0)) && __retres1 == 1) && !(0 == \result))) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && __retres1 == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1))) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) && t == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) && __retres1 == 1)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(__retres1 == 0)) - InvariantResult [Line: 396]: Loop Invariant Derived loop invariant: (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && tmp___0 == 0) && __retres1 == 0) && \result == 0) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ((((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) || ((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && 0 == \result) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp == 0)) || ((((((((((((!(p_dw_st == 0) && 0 == \result) && !(q_write_ev == 1)) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && tmp___0 == 0) && tmp == 0) && __retres1 == 0) && \result == 0)) || ((((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && !(0 == \result))) || (((((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && p_dw_st == 0) && !(tmp == 0)) && !(__retres1 == 0)) && t == 0) && !(0 == \result))) || (((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1))) || (((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0)) || ((((((!(q_write_ev == 0) && c_dr_pc == 1) && !(q_write_ev == 1)) && 1 == c_dr_i) && p_dw_i == 1) && !(p_dw_pc == 1)) && t == 0) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 1) && tmp___1 == 1) || (((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && 1 == c_dr_i) && \result == 1) && p_dw_i == 1) && !(fast_clk_edge == 1)) && t == 0) && __retres1 == 1) && tmp___1 == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && !(p_dw_pc == 1)) || ((((((((!(p_dw_st == 0) && c_dr_pc == q_req_up) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(p_dw_pc == 1)) && __retres1 == 0) && __retres1 == 0) && \result == 0)) || ((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && !(q_write_ev == 1)) && !(c_dr_st == 0)) && q_read_ev == 2) && q_req_up == 0) && !(c_dr_pc == 1)) && !(p_dw_pc == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && !(p_dw_pc == 1))) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(q_write_ev == 1)) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && __retres1 == 0)) || (((((((((!(p_dw_st == 0) && !(q_write_ev == 0)) && c_dr_pc == 1) && !(slow_clk_edge == 1)) && !(c_dr_st == 0)) && 1 == c_dr_i) && p_dw_i == 1) && !(fast_clk_edge == 1)) && q_req_up == 0) && __retres1 == 0) RESULT: Ultimate proved your program to be correct! [2021-07-05 10:17:30,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...