./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/toy.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be --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 e8a051df57e56efae0cb5613a57ca5c3282a2fa11253acd8ce156f1494498073 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 20:11:43,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 20:11:43,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 20:11:44,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 20:11:44,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 20:11:44,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 20:11:44,059 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 20:11:44,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 20:11:44,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 20:11:44,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 20:11:44,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 20:11:44,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 20:11:44,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 20:11:44,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 20:11:44,086 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 20:11:44,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 20:11:44,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 20:11:44,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 20:11:44,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 20:11:44,109 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 20:11:44,111 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 20:11:44,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 20:11:44,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 20:11:44,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 20:11:44,122 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 20:11:44,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 20:11:44,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 20:11:44,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 20:11:44,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 20:11:44,127 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 20:11:44,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 20:11:44,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 20:11:44,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 20:11:44,133 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 20:11:44,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 20:11:44,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 20:11:44,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 20:11:44,137 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 20:11:44,137 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 20:11:44,138 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 20:11:44,139 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 20:11:44,140 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 20:11:44,191 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 20:11:44,192 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 20:11:44,192 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 20:11:44,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 20:11:44,194 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 20:11:44,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 20:11:44,195 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 20:11:44,195 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 20:11:44,196 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 20:11:44,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 20:11:44,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 20:11:44,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 20:11:44,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 20:11:44,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 20:11:44,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 20:11:44,198 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 20:11:44,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 20:11:44,199 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 20:11:44,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 20:11:44,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 20:11:44,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 20:11:44,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 20:11:44,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:11:44,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 20:11:44,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 20:11:44,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 20:11:44,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 20:11:44,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 20:11:44,202 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 20:11:44,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 20:11:44,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 20:11:44,202 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 20:11:44,203 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be 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 -> e8a051df57e56efae0cb5613a57ca5c3282a2fa11253acd8ce156f1494498073 [2021-10-21 20:11:44,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 20:11:44,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 20:11:44,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 20:11:44,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 20:11:44,540 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 20:11:44,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/systemc/toy.cil.c [2021-10-21 20:11:44,612 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/data/de3e8be5b/84aa4e89bf324c52952dc5c713888731/FLAGaa80421f1 [2021-10-21 20:11:45,253 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 20:11:45,254 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/sv-benchmarks/c/systemc/toy.cil.c [2021-10-21 20:11:45,277 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/data/de3e8be5b/84aa4e89bf324c52952dc5c713888731/FLAGaa80421f1 [2021-10-21 20:11:45,541 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/data/de3e8be5b/84aa4e89bf324c52952dc5c713888731 [2021-10-21 20:11:45,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 20:11:45,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 20:11:45,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 20:11:45,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 20:11:45,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 20:11:45,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:45,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40234772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45, skipping insertion in model container [2021-10-21 20:11:45,555 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:45,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 20:11:45,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 20:11:45,809 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-21 20:11:45,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:11:45,921 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 20:11:45,935 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/sv-benchmarks/c/systemc/toy.cil.c[392,405] [2021-10-21 20:11:45,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 20:11:45,996 INFO L208 MainTranslator]: Completed translation [2021-10-21 20:11:45,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45 WrapperNode [2021-10-21 20:11:45,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 20:11:45,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 20:11:45,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 20:11:45,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 20:11:46,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 20:11:46,082 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 20:11:46,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 20:11:46,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 20:11:46,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 20:11:46,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 20:11:46,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 20:11:46,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 20:11:46,164 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (1/1) ... [2021-10-21 20:11:46,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 20:11:46,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:11:46,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 20:11:46,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 20:11:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 20:11:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 20:11:46,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 20:11:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 20:11:46,869 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 20:11:46,869 INFO L299 CfgBuilder]: Removed 26 assume(true) statements. [2021-10-21 20:11:46,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:46 BoogieIcfgContainer [2021-10-21 20:11:46,872 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 20:11:46,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 20:11:46,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 20:11:46,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 20:11:46,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 08:11:45" (1/3) ... [2021-10-21 20:11:46,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65240b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:11:46, skipping insertion in model container [2021-10-21 20:11:46,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 08:11:45" (2/3) ... [2021-10-21 20:11:46,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65240b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 08:11:46, skipping insertion in model container [2021-10-21 20:11:46,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:46" (3/3) ... [2021-10-21 20:11:46,881 INFO L111 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2021-10-21 20:11:46,887 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 20:11:46,888 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 20:11:46,945 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 20:11:46,952 INFO L339 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 20:11:46,953 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 20:11:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 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-10-21 20:11:46,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:46,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:46,982 INFO L512 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] [2021-10-21 20:11:46,982 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:46,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:46,988 INFO L82 PathProgramCache]: Analyzing trace with hash -895776564, now seen corresponding path program 1 times [2021-10-21 20:11:46,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:46,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680997187] [2021-10-21 20:11:46,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:47,000 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:47,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:47,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:47,216 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680997187] [2021-10-21 20:11:47,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680997187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:47,217 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:47,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:47,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088226723] [2021-10-21 20:11:47,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:47,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:47,296 INFO L87 Difference]: Start difference. First operand has 126 states, 124 states have (on average 1.8790322580645162) internal successors, (233), 125 states have internal predecessors, (233), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:47,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:47,393 INFO L93 Difference]: Finished difference Result 244 states and 453 transitions. [2021-10-21 20:11:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:47,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:47,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:47,415 INFO L225 Difference]: With dead ends: 244 [2021-10-21 20:11:47,415 INFO L226 Difference]: Without dead ends: 122 [2021-10-21 20:11:47,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:47,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-10-21 20:11:47,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-10-21 20:11:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.7768595041322315) internal successors, (215), 121 states have internal predecessors, (215), 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-10-21 20:11:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 215 transitions. [2021-10-21 20:11:47,482 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 215 transitions. Word has length 36 [2021-10-21 20:11:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:47,482 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 215 transitions. [2021-10-21 20:11:47,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:47,483 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 215 transitions. [2021-10-21 20:11:47,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:47,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:47,485 INFO L512 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] [2021-10-21 20:11:47,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 20:11:47,486 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:47,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1597376438, now seen corresponding path program 1 times [2021-10-21 20:11:47,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:47,487 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717975988] [2021-10-21 20:11:47,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:47,488 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:47,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:47,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:47,563 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717975988] [2021-10-21 20:11:47,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717975988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:47,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:47,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:47,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311580575] [2021-10-21 20:11:47,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:47,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:47,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:47,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:47,567 INFO L87 Difference]: Start difference. First operand 122 states and 215 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:47,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:47,663 INFO L93 Difference]: Finished difference Result 328 states and 577 transitions. [2021-10-21 20:11:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:11:47,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:47,673 INFO L225 Difference]: With dead ends: 328 [2021-10-21 20:11:47,673 INFO L226 Difference]: Without dead ends: 209 [2021-10-21 20:11:47,675 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-21 20:11:47,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2021-10-21 20:11:47,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7609756097560976) internal successors, (361), 205 states have internal predecessors, (361), 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-10-21 20:11:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 361 transitions. [2021-10-21 20:11:47,711 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 361 transitions. Word has length 36 [2021-10-21 20:11:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:47,712 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 361 transitions. [2021-10-21 20:11:47,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 361 transitions. [2021-10-21 20:11:47,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:47,717 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:47,717 INFO L512 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] [2021-10-21 20:11:47,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 20:11:47,718 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -211173044, now seen corresponding path program 1 times [2021-10-21 20:11:47,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:47,719 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648412980] [2021-10-21 20:11:47,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:47,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:47,816 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:47,817 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648412980] [2021-10-21 20:11:47,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648412980] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:47,817 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:47,817 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:47,818 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26951668] [2021-10-21 20:11:47,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:47,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:47,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:47,820 INFO L87 Difference]: Start difference. First operand 206 states and 361 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:47,885 INFO L93 Difference]: Finished difference Result 403 states and 709 transitions. [2021-10-21 20:11:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:47,889 INFO L225 Difference]: With dead ends: 403 [2021-10-21 20:11:47,889 INFO L226 Difference]: Without dead ends: 206 [2021-10-21 20:11:47,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-10-21 20:11:47,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2021-10-21 20:11:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.7024390243902439) internal successors, (349), 205 states have internal predecessors, (349), 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-10-21 20:11:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 349 transitions. [2021-10-21 20:11:47,936 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 349 transitions. Word has length 36 [2021-10-21 20:11:47,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:47,937 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 349 transitions. [2021-10-21 20:11:47,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:47,937 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 349 transitions. [2021-10-21 20:11:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:47,939 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:47,939 INFO L512 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] [2021-10-21 20:11:47,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 20:11:47,940 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1741714488, now seen corresponding path program 1 times [2021-10-21 20:11:47,946 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:47,946 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997771637] [2021-10-21 20:11:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:47,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:48,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:48,024 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997771637] [2021-10-21 20:11:48,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997771637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:48,024 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:48,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:48,025 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527984581] [2021-10-21 20:11:48,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:48,026 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:48,027 INFO L87 Difference]: Start difference. First operand 206 states and 349 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:48,180 INFO L93 Difference]: Finished difference Result 559 states and 950 transitions. [2021-10-21 20:11:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:48,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:48,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:48,187 INFO L225 Difference]: With dead ends: 559 [2021-10-21 20:11:48,187 INFO L226 Difference]: Without dead ends: 363 [2021-10-21 20:11:48,193 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-10-21 20:11:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2021-10-21 20:11:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 206. [2021-10-21 20:11:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.6878048780487804) internal successors, (346), 205 states have internal predecessors, (346), 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-10-21 20:11:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 346 transitions. [2021-10-21 20:11:48,233 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 346 transitions. Word has length 36 [2021-10-21 20:11:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:48,234 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 346 transitions. [2021-10-21 20:11:48,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 346 transitions. [2021-10-21 20:11:48,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:48,236 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:48,236 INFO L512 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] [2021-10-21 20:11:48,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 20:11:48,236 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:48,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:48,237 INFO L82 PathProgramCache]: Analyzing trace with hash 181513546, now seen corresponding path program 1 times [2021-10-21 20:11:48,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:48,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070159902] [2021-10-21 20:11:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:48,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:48,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:48,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:48,319 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070159902] [2021-10-21 20:11:48,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070159902] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:48,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:48,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:48,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68430339] [2021-10-21 20:11:48,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:48,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:48,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:48,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:48,322 INFO L87 Difference]: Start difference. First operand 206 states and 346 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:48,401 INFO L93 Difference]: Finished difference Result 562 states and 946 transitions. [2021-10-21 20:11:48,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:48,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:48,404 INFO L225 Difference]: With dead ends: 562 [2021-10-21 20:11:48,404 INFO L226 Difference]: Without dead ends: 367 [2021-10-21 20:11:48,405 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:48,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2021-10-21 20:11:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 206. [2021-10-21 20:11:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 205 states have (on average 1.673170731707317) internal successors, (343), 205 states have internal predecessors, (343), 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-10-21 20:11:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 343 transitions. [2021-10-21 20:11:48,423 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 343 transitions. Word has length 36 [2021-10-21 20:11:48,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:48,424 INFO L470 AbstractCegarLoop]: Abstraction has 206 states and 343 transitions. [2021-10-21 20:11:48,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,424 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 343 transitions. [2021-10-21 20:11:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:48,426 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:48,426 INFO L512 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] [2021-10-21 20:11:48,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 20:11:48,427 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:48,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:48,427 INFO L82 PathProgramCache]: Analyzing trace with hash 243553160, now seen corresponding path program 1 times [2021-10-21 20:11:48,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:48,428 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060872919] [2021-10-21 20:11:48,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:48,428 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:48,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:48,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060872919] [2021-10-21 20:11:48,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060872919] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:48,474 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:48,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:48,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547151194] [2021-10-21 20:11:48,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:48,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:48,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:48,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:48,477 INFO L87 Difference]: Start difference. First operand 206 states and 343 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:48,560 INFO L93 Difference]: Finished difference Result 574 states and 957 transitions. [2021-10-21 20:11:48,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:48,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:48,564 INFO L225 Difference]: With dead ends: 574 [2021-10-21 20:11:48,565 INFO L226 Difference]: Without dead ends: 380 [2021-10-21 20:11:48,565 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2021-10-21 20:11:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 212. [2021-10-21 20:11:48,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.6445497630331753) internal successors, (347), 211 states have internal predecessors, (347), 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-10-21 20:11:48,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 347 transitions. [2021-10-21 20:11:48,582 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 347 transitions. Word has length 36 [2021-10-21 20:11:48,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:48,582 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 347 transitions. [2021-10-21 20:11:48,583 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,583 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 347 transitions. [2021-10-21 20:11:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:48,584 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:48,584 INFO L512 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] [2021-10-21 20:11:48,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 20:11:48,585 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:48,586 INFO L82 PathProgramCache]: Analyzing trace with hash 384101770, now seen corresponding path program 1 times [2021-10-21 20:11:48,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:48,586 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190570019] [2021-10-21 20:11:48,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:48,587 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:48,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:48,630 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190570019] [2021-10-21 20:11:48,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190570019] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:48,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:48,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:48,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683946467] [2021-10-21 20:11:48,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:48,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:48,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:48,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:48,633 INFO L87 Difference]: Start difference. First operand 212 states and 347 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:48,729 INFO L93 Difference]: Finished difference Result 721 states and 1181 transitions. [2021-10-21 20:11:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:48,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:48,734 INFO L225 Difference]: With dead ends: 721 [2021-10-21 20:11:48,734 INFO L226 Difference]: Without dead ends: 522 [2021-10-21 20:11:48,735 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:48,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2021-10-21 20:11:48,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 345. [2021-10-21 20:11:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.6337209302325582) internal successors, (562), 344 states have internal predecessors, (562), 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-10-21 20:11:48,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 562 transitions. [2021-10-21 20:11:48,781 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 562 transitions. Word has length 36 [2021-10-21 20:11:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:48,782 INFO L470 AbstractCegarLoop]: Abstraction has 345 states and 562 transitions. [2021-10-21 20:11:48,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:48,782 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 562 transitions. [2021-10-21 20:11:48,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:48,786 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:48,787 INFO L512 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] [2021-10-21 20:11:48,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 20:11:48,787 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:48,788 INFO L82 PathProgramCache]: Analyzing trace with hash 250088264, now seen corresponding path program 1 times [2021-10-21 20:11:48,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:48,789 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690020340] [2021-10-21 20:11:48,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:48,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:48,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:48,866 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690020340] [2021-10-21 20:11:48,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690020340] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:48,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:48,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:48,867 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626285162] [2021-10-21 20:11:48,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:48,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:48,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:48,869 INFO L87 Difference]: Start difference. First operand 345 states and 562 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:48,926 INFO L93 Difference]: Finished difference Result 822 states and 1345 transitions. [2021-10-21 20:11:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:48,931 INFO L225 Difference]: With dead ends: 822 [2021-10-21 20:11:48,931 INFO L226 Difference]: Without dead ends: 501 [2021-10-21 20:11:48,932 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:48,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-21 20:11:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 499. [2021-10-21 20:11:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6305220883534137) internal successors, (812), 498 states have internal predecessors, (812), 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-10-21 20:11:48,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 812 transitions. [2021-10-21 20:11:48,975 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 812 transitions. Word has length 36 [2021-10-21 20:11:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:48,976 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 812 transitions. [2021-10-21 20:11:48,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:48,976 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 812 transitions. [2021-10-21 20:11:48,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:48,977 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:48,977 INFO L512 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] [2021-10-21 20:11:48,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 20:11:48,978 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:48,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:48,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1539793604, now seen corresponding path program 1 times [2021-10-21 20:11:48,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:48,979 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851150634] [2021-10-21 20:11:48,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:48,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:49,057 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:49,057 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851150634] [2021-10-21 20:11:49,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851150634] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:49,058 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:49,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:49,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47528938] [2021-10-21 20:11:49,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:49,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:49,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:49,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:49,062 INFO L87 Difference]: Start difference. First operand 499 states and 812 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:49,188 INFO L93 Difference]: Finished difference Result 1271 states and 2069 transitions. [2021-10-21 20:11:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:11:49,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:49,195 INFO L225 Difference]: With dead ends: 1271 [2021-10-21 20:11:49,195 INFO L226 Difference]: Without dead ends: 789 [2021-10-21 20:11:49,202 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-21 20:11:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2021-10-21 20:11:49,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 499. [2021-10-21 20:11:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.6144578313253013) internal successors, (804), 498 states have internal predecessors, (804), 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-10-21 20:11:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 804 transitions. [2021-10-21 20:11:49,254 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 804 transitions. Word has length 36 [2021-10-21 20:11:49,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:49,254 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 804 transitions. [2021-10-21 20:11:49,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,255 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 804 transitions. [2021-10-21 20:11:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:49,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:49,255 INFO L512 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] [2021-10-21 20:11:49,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 20:11:49,256 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -48554298, now seen corresponding path program 1 times [2021-10-21 20:11:49,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:49,258 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542038767] [2021-10-21 20:11:49,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:49,259 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:49,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:49,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:49,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542038767] [2021-10-21 20:11:49,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542038767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:49,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:49,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:49,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249809312] [2021-10-21 20:11:49,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:49,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:49,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:49,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:49,340 INFO L87 Difference]: Start difference. First operand 499 states and 804 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:49,472 INFO L93 Difference]: Finished difference Result 1267 states and 2042 transitions. [2021-10-21 20:11:49,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:11:49,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:49,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:49,478 INFO L225 Difference]: With dead ends: 1267 [2021-10-21 20:11:49,479 INFO L226 Difference]: Without dead ends: 791 [2021-10-21 20:11:49,480 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2021-10-21 20:11:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 499. [2021-10-21 20:11:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 498 states have (on average 1.5983935742971886) internal successors, (796), 498 states have internal predecessors, (796), 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-10-21 20:11:49,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 796 transitions. [2021-10-21 20:11:49,521 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 796 transitions. Word has length 36 [2021-10-21 20:11:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:49,521 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 796 transitions. [2021-10-21 20:11:49,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 796 transitions. [2021-10-21 20:11:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:49,523 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:49,523 INFO L512 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] [2021-10-21 20:11:49,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 20:11:49,523 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:49,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1328417976, now seen corresponding path program 1 times [2021-10-21 20:11:49,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:49,524 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511038174] [2021-10-21 20:11:49,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:49,525 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:49,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:49,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:49,558 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511038174] [2021-10-21 20:11:49,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511038174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:49,570 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:49,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:49,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809457899] [2021-10-21 20:11:49,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:49,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:49,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:49,572 INFO L87 Difference]: Start difference. First operand 499 states and 796 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:49,721 INFO L93 Difference]: Finished difference Result 1206 states and 1920 transitions. [2021-10-21 20:11:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 20:11:49,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:49,730 INFO L225 Difference]: With dead ends: 1206 [2021-10-21 20:11:49,730 INFO L226 Difference]: Without dead ends: 724 [2021-10-21 20:11:49,731 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:49,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2021-10-21 20:11:49,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 547. [2021-10-21 20:11:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 546 states have (on average 1.5622710622710623) internal successors, (853), 546 states have internal predecessors, (853), 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-10-21 20:11:49,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 853 transitions. [2021-10-21 20:11:49,784 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 853 transitions. Word has length 36 [2021-10-21 20:11:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:49,784 INFO L470 AbstractCegarLoop]: Abstraction has 547 states and 853 transitions. [2021-10-21 20:11:49,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 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-10-21 20:11:49,785 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 853 transitions. [2021-10-21 20:11:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-10-21 20:11:49,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:49,785 INFO L512 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] [2021-10-21 20:11:49,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 20:11:49,786 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:49,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:49,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1915223990, now seen corresponding path program 1 times [2021-10-21 20:11:49,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:49,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97275401] [2021-10-21 20:11:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:49,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:49,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:49,851 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97275401] [2021-10-21 20:11:49,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97275401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:49,858 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:49,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:49,858 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939635587] [2021-10-21 20:11:49,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:49,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:49,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:49,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:49,861 INFO L87 Difference]: Start difference. First operand 547 states and 853 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:49,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:49,982 INFO L93 Difference]: Finished difference Result 1300 states and 2032 transitions. [2021-10-21 20:11:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:49,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2021-10-21 20:11:49,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:49,992 INFO L225 Difference]: With dead ends: 1300 [2021-10-21 20:11:49,992 INFO L226 Difference]: Without dead ends: 767 [2021-10-21 20:11:49,993 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2021-10-21 20:11:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 764. [2021-10-21 20:11:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 764 states, 763 states have (on average 1.54259501965924) internal successors, (1177), 763 states have internal predecessors, (1177), 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-10-21 20:11:50,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1177 transitions. [2021-10-21 20:11:50,065 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1177 transitions. Word has length 36 [2021-10-21 20:11:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:50,067 INFO L470 AbstractCegarLoop]: Abstraction has 764 states and 1177 transitions. [2021-10-21 20:11:50,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-10-21 20:11:50,067 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1177 transitions. [2021-10-21 20:11:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 20:11:50,068 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:50,068 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 20:11:50,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 20:11:50,069 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:50,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:50,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1648654786, now seen corresponding path program 1 times [2021-10-21 20:11:50,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:50,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810188984] [2021-10-21 20:11:50,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:50,070 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:50,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:50,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810188984] [2021-10-21 20:11:50,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810188984] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:50,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:50,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:50,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463731757] [2021-10-21 20:11:50,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:50,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,129 INFO L87 Difference]: Start difference. First operand 764 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-10-21 20:11:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:50,236 INFO L93 Difference]: Finished difference Result 1882 states and 2939 transitions. [2021-10-21 20:11:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:50,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 46 [2021-10-21 20:11:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:50,245 INFO L225 Difference]: With dead ends: 1882 [2021-10-21 20:11:50,245 INFO L226 Difference]: Without dead ends: 1145 [2021-10-21 20:11:50,247 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2021-10-21 20:11:50,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1143. [2021-10-21 20:11:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1142 states have (on average 1.5551663747810858) internal successors, (1776), 1142 states have internal predecessors, (1776), 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-10-21 20:11:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1776 transitions. [2021-10-21 20:11:50,362 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1776 transitions. Word has length 46 [2021-10-21 20:11:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:50,362 INFO L470 AbstractCegarLoop]: Abstraction has 1143 states and 1776 transitions. [2021-10-21 20:11:50,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-10-21 20:11:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1776 transitions. [2021-10-21 20:11:50,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-10-21 20:11:50,364 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:50,364 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 20:11:50,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 20:11:50,364 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:50,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:50,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1400508292, now seen corresponding path program 1 times [2021-10-21 20:11:50,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:50,365 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774664307] [2021-10-21 20:11:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:50,366 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:50,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 20:11:50,391 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:50,391 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774664307] [2021-10-21 20:11:50,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774664307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:50,392 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:50,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:50,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942271652] [2021-10-21 20:11:50,392 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:50,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:50,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:50,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,394 INFO L87 Difference]: Start difference. First operand 1143 states and 1776 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-21 20:11:50,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:50,489 INFO L93 Difference]: Finished difference Result 2237 states and 3493 transitions. [2021-10-21 20:11:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:50,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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 46 [2021-10-21 20:11:50,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:50,497 INFO L225 Difference]: With dead ends: 2237 [2021-10-21 20:11:50,498 INFO L226 Difference]: Without dead ends: 1121 [2021-10-21 20:11:50,500 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2021-10-21 20:11:50,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2021-10-21 20:11:50,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1120 states have (on average 1.5616071428571427) internal successors, (1749), 1120 states have internal predecessors, (1749), 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-10-21 20:11:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1749 transitions. [2021-10-21 20:11:50,601 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1749 transitions. Word has length 46 [2021-10-21 20:11:50,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:50,601 INFO L470 AbstractCegarLoop]: Abstraction has 1121 states and 1749 transitions. [2021-10-21 20:11:50,601 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-10-21 20:11:50,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1749 transitions. [2021-10-21 20:11:50,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-21 20:11:50,603 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:50,603 INFO L512 BasicCegarLoop]: trace histogram [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-10-21 20:11:50,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 20:11:50,603 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:50,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:50,604 INFO L82 PathProgramCache]: Analyzing trace with hash 666181047, now seen corresponding path program 1 times [2021-10-21 20:11:50,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:50,604 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012578228] [2021-10-21 20:11:50,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:50,604 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:50,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:50,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012578228] [2021-10-21 20:11:50,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012578228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:50,633 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:50,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:50,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348032981] [2021-10-21 20:11:50,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:50,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,635 INFO L87 Difference]: Start difference. First operand 1121 states and 1749 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-21 20:11:50,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:50,802 INFO L93 Difference]: Finished difference Result 2849 states and 4504 transitions. [2021-10-21 20:11:50,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:50,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 47 [2021-10-21 20:11:50,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:50,815 INFO L225 Difference]: With dead ends: 2849 [2021-10-21 20:11:50,815 INFO L226 Difference]: Without dead ends: 1755 [2021-10-21 20:11:50,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:50,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2021-10-21 20:11:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2021-10-21 20:11:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1753 states, 1752 states have (on average 1.5747716894977168) internal successors, (2759), 1752 states have internal predecessors, (2759), 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-10-21 20:11:50,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2759 transitions. [2021-10-21 20:11:50,989 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2759 transitions. Word has length 47 [2021-10-21 20:11:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:50,989 INFO L470 AbstractCegarLoop]: Abstraction has 1753 states and 2759 transitions. [2021-10-21 20:11:50,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-10-21 20:11:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2759 transitions. [2021-10-21 20:11:50,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-21 20:11:50,991 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:50,991 INFO L512 BasicCegarLoop]: trace histogram [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-10-21 20:11:50,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 20:11:50,992 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:50,992 INFO L82 PathProgramCache]: Analyzing trace with hash -656218967, now seen corresponding path program 1 times [2021-10-21 20:11:50,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:50,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467528520] [2021-10-21 20:11:50,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:50,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:51,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:51,021 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467528520] [2021-10-21 20:11:51,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467528520] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:51,021 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:51,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:51,022 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765592902] [2021-10-21 20:11:51,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:51,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:51,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:51,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:51,023 INFO L87 Difference]: Start difference. First operand 1753 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-10-21 20:11:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:51,315 INFO L93 Difference]: Finished difference Result 4716 states and 7517 transitions. [2021-10-21 20:11:51,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:51,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2021-10-21 20:11:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:51,340 INFO L225 Difference]: With dead ends: 4716 [2021-10-21 20:11:51,340 INFO L226 Difference]: Without dead ends: 2992 [2021-10-21 20:11:51,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:51,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2992 states. [2021-10-21 20:11:51,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2992 to 2990. [2021-10-21 20:11:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2990 states, 2989 states have (on average 1.5878220140515222) internal successors, (4746), 2989 states have internal predecessors, (4746), 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-10-21 20:11:51,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2990 states to 2990 states and 4746 transitions. [2021-10-21 20:11:51,645 INFO L78 Accepts]: Start accepts. Automaton has 2990 states and 4746 transitions. Word has length 48 [2021-10-21 20:11:51,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:51,645 INFO L470 AbstractCegarLoop]: Abstraction has 2990 states and 4746 transitions. [2021-10-21 20:11:51,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-10-21 20:11:51,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2990 states and 4746 transitions. [2021-10-21 20:11:51,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-21 20:11:51,648 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:51,648 INFO L512 BasicCegarLoop]: trace histogram [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-10-21 20:11:51,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 20:11:51,649 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:51,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:51,649 INFO L82 PathProgramCache]: Analyzing trace with hash -408072473, now seen corresponding path program 1 times [2021-10-21 20:11:51,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:51,650 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151971835] [2021-10-21 20:11:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:51,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 20:11:51,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:51,677 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151971835] [2021-10-21 20:11:51,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151971835] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:51,678 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:51,678 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:51,678 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943871029] [2021-10-21 20:11:51,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:51,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:51,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:51,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:51,680 INFO L87 Difference]: Start difference. First operand 2990 states and 4746 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-21 20:11:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:51,921 INFO L93 Difference]: Finished difference Result 5929 states and 9433 transitions. [2021-10-21 20:11:51,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:51,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 48 [2021-10-21 20:11:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:51,942 INFO L225 Difference]: With dead ends: 5929 [2021-10-21 20:11:51,942 INFO L226 Difference]: Without dead ends: 2968 [2021-10-21 20:11:51,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2968 states. [2021-10-21 20:11:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2968 to 2968. [2021-10-21 20:11:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2968 states, 2967 states have (on average 1.5908324907313784) internal successors, (4720), 2967 states have internal predecessors, (4720), 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-10-21 20:11:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4720 transitions. [2021-10-21 20:11:52,260 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 4720 transitions. Word has length 48 [2021-10-21 20:11:52,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:52,260 INFO L470 AbstractCegarLoop]: Abstraction has 2968 states and 4720 transitions. [2021-10-21 20:11:52,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-21 20:11:52,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 4720 transitions. [2021-10-21 20:11:52,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-10-21 20:11:52,262 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:52,263 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 20:11:52,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 20:11:52,263 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:52,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:52,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2128148300, now seen corresponding path program 1 times [2021-10-21 20:11:52,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:52,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169061864] [2021-10-21 20:11:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:52,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:52,303 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:52,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169061864] [2021-10-21 20:11:52,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169061864] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:52,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:52,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:52,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632303361] [2021-10-21 20:11:52,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:52,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:52,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:52,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:52,305 INFO L87 Difference]: Start difference. First operand 2968 states and 4720 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-21 20:11:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:52,755 INFO L93 Difference]: Finished difference Result 7517 states and 12005 transitions. [2021-10-21 20:11:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2021-10-21 20:11:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:52,785 INFO L225 Difference]: With dead ends: 7517 [2021-10-21 20:11:52,785 INFO L226 Difference]: Without dead ends: 3845 [2021-10-21 20:11:52,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:52,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-10-21 20:11:53,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-10-21 20:11:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5832466181061395) internal successors, (6086), 3844 states have internal predecessors, (6086), 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-10-21 20:11:53,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6086 transitions. [2021-10-21 20:11:53,117 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6086 transitions. Word has length 49 [2021-10-21 20:11:53,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:53,118 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6086 transitions. [2021-10-21 20:11:53,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-10-21 20:11:53,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6086 transitions. [2021-10-21 20:11:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-21 20:11:53,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:53,120 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-21 20:11:53,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 20:11:53,121 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1609174737, now seen corresponding path program 1 times [2021-10-21 20:11:53,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:53,122 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206348442] [2021-10-21 20:11:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:53,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:53,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:53,161 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:53,162 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206348442] [2021-10-21 20:11:53,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206348442] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:53,162 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:53,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 20:11:53,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702196370] [2021-10-21 20:11:53,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 20:11:53,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:53,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 20:11:53,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:53,163 INFO L87 Difference]: Start difference. First operand 3845 states and 6086 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10-21 20:11:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:53,717 INFO L93 Difference]: Finished difference Result 9812 states and 15418 transitions. [2021-10-21 20:11:53,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 20:11:53,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10-21 20:11:53,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:53,768 INFO L225 Difference]: With dead ends: 9812 [2021-10-21 20:11:53,768 INFO L226 Difference]: Without dead ends: 5990 [2021-10-21 20:11:53,774 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.3ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 20:11:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2021-10-21 20:11:54,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 4496. [2021-10-21 20:11:54,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 4495 states have (on average 1.5481646273637375) internal successors, (6959), 4495 states have internal predecessors, (6959), 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-10-21 20:11:54,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 6959 transitions. [2021-10-21 20:11:54,224 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 6959 transitions. Word has length 54 [2021-10-21 20:11:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:54,224 INFO L470 AbstractCegarLoop]: Abstraction has 4496 states and 6959 transitions. [2021-10-21 20:11:54,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 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-10-21 20:11:54,225 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 6959 transitions. [2021-10-21 20:11:54,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-10-21 20:11:54,229 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:54,229 INFO L512 BasicCegarLoop]: trace histogram [3, 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-10-21 20:11:54,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 20:11:54,229 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:54,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:54,230 INFO L82 PathProgramCache]: Analyzing trace with hash -605096400, now seen corresponding path program 1 times [2021-10-21 20:11:54,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:54,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942588324] [2021-10-21 20:11:54,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:54,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:54,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:54,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:54,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942588324] [2021-10-21 20:11:54,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942588324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:54,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:54,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:54,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74634404] [2021-10-21 20:11:54,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:54,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:54,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:54,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:54,268 INFO L87 Difference]: Start difference. First operand 4496 states and 6959 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10-21 20:11:54,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:54,692 INFO L93 Difference]: Finished difference Result 9315 states and 14384 transitions. [2021-10-21 20:11:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2021-10-21 20:11:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:54,706 INFO L225 Difference]: With dead ends: 9315 [2021-10-21 20:11:54,706 INFO L226 Difference]: Without dead ends: 4848 [2021-10-21 20:11:54,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4848 states. [2021-10-21 20:11:55,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4848 to 4816. [2021-10-21 20:11:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4816 states, 4815 states have (on average 1.4969885773624092) internal successors, (7208), 4815 states have internal predecessors, (7208), 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-10-21 20:11:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4816 states to 4816 states and 7208 transitions. [2021-10-21 20:11:55,124 INFO L78 Accepts]: Start accepts. Automaton has 4816 states and 7208 transitions. Word has length 86 [2021-10-21 20:11:55,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:55,125 INFO L470 AbstractCegarLoop]: Abstraction has 4816 states and 7208 transitions. [2021-10-21 20:11:55,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-10-21 20:11:55,125 INFO L276 IsEmpty]: Start isEmpty. Operand 4816 states and 7208 transitions. [2021-10-21 20:11:55,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-10-21 20:11:55,130 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:55,130 INFO L512 BasicCegarLoop]: trace histogram [3, 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-10-21 20:11:55,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 20:11:55,131 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:55,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:55,131 INFO L82 PathProgramCache]: Analyzing trace with hash 129921275, now seen corresponding path program 1 times [2021-10-21 20:11:55,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:55,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813798829] [2021-10-21 20:11:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:55,132 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:55,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:55,165 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813798829] [2021-10-21 20:11:55,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813798829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:55,165 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:55,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:55,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325613674] [2021-10-21 20:11:55,166 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:55,166 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:55,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:55,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:55,167 INFO L87 Difference]: Start difference. First operand 4816 states and 7208 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-10-21 20:11:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:55,610 INFO L93 Difference]: Finished difference Result 10113 states and 15094 transitions. [2021-10-21 20:11:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:55,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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 87 [2021-10-21 20:11:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:55,621 INFO L225 Difference]: With dead ends: 10113 [2021-10-21 20:11:55,621 INFO L226 Difference]: Without dead ends: 5338 [2021-10-21 20:11:55,628 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:55,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-10-21 20:11:56,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 5290. [2021-10-21 20:11:56,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 5289 states have (on average 1.4465872565702402) internal successors, (7651), 5289 states have internal predecessors, (7651), 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-10-21 20:11:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 7651 transitions. [2021-10-21 20:11:56,018 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 7651 transitions. Word has length 87 [2021-10-21 20:11:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:56,019 INFO L470 AbstractCegarLoop]: Abstraction has 5290 states and 7651 transitions. [2021-10-21 20:11:56,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 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-10-21 20:11:56,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 7651 transitions. [2021-10-21 20:11:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-10-21 20:11:56,025 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:56,026 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-21 20:11:56,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 20:11:56,026 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:56,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:56,027 INFO L82 PathProgramCache]: Analyzing trace with hash 793269102, now seen corresponding path program 1 times [2021-10-21 20:11:56,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:56,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773630653] [2021-10-21 20:11:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:56,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 20:11:56,060 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:56,060 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773630653] [2021-10-21 20:11:56,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773630653] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:56,061 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:56,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:56,061 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728085604] [2021-10-21 20:11:56,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:56,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:56,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:56,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:56,063 INFO L87 Difference]: Start difference. First operand 5290 states and 7651 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-10-21 20:11:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:56,579 INFO L93 Difference]: Finished difference Result 10887 states and 15753 transitions. [2021-10-21 20:11:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:56,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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 88 [2021-10-21 20:11:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:56,593 INFO L225 Difference]: With dead ends: 10887 [2021-10-21 20:11:56,593 INFO L226 Difference]: Without dead ends: 5658 [2021-10-21 20:11:56,603 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2021-10-21 20:11:57,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5076. [2021-10-21 20:11:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5076 states, 5075 states have (on average 1.383448275862069) internal successors, (7021), 5075 states have internal predecessors, (7021), 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-10-21 20:11:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5076 states to 5076 states and 7021 transitions. [2021-10-21 20:11:57,115 INFO L78 Accepts]: Start accepts. Automaton has 5076 states and 7021 transitions. Word has length 88 [2021-10-21 20:11:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:57,115 INFO L470 AbstractCegarLoop]: Abstraction has 5076 states and 7021 transitions. [2021-10-21 20:11:57,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 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-10-21 20:11:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5076 states and 7021 transitions. [2021-10-21 20:11:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-10-21 20:11:57,123 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:57,124 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-21 20:11:57,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 20:11:57,124 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:57,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -831404099, now seen corresponding path program 1 times [2021-10-21 20:11:57,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:57,125 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403679713] [2021-10-21 20:11:57,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:57,125 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:57,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-21 20:11:57,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:57,178 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403679713] [2021-10-21 20:11:57,178 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403679713] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:57,178 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:57,178 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:57,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788887082] [2021-10-21 20:11:57,179 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:57,179 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:57,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:57,180 INFO L87 Difference]: Start difference. First operand 5076 states and 7021 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-10-21 20:11:57,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:57,997 INFO L93 Difference]: Finished difference Result 9480 states and 13045 transitions. [2021-10-21 20:11:57,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:11:57,997 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 89 [2021-10-21 20:11:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:58,010 INFO L225 Difference]: With dead ends: 9480 [2021-10-21 20:11:58,010 INFO L226 Difference]: Without dead ends: 4855 [2021-10-21 20:11:58,018 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:11:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2021-10-21 20:11:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4741. [2021-10-21 20:11:58,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4741 states, 4740 states have (on average 1.3356540084388187) internal successors, (6331), 4740 states have internal predecessors, (6331), 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-10-21 20:11:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4741 states to 4741 states and 6331 transitions. [2021-10-21 20:11:58,591 INFO L78 Accepts]: Start accepts. Automaton has 4741 states and 6331 transitions. Word has length 89 [2021-10-21 20:11:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:58,591 INFO L470 AbstractCegarLoop]: Abstraction has 4741 states and 6331 transitions. [2021-10-21 20:11:58,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-10-21 20:11:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 4741 states and 6331 transitions. [2021-10-21 20:11:58,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-10-21 20:11:58,605 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:58,606 INFO L512 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:58,606 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 20:11:58,606 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1827636855, now seen corresponding path program 1 times [2021-10-21 20:11:58,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:58,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803797650] [2021-10-21 20:11:58,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:58,607 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:58,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-21 20:11:58,641 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:58,641 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803797650] [2021-10-21 20:11:58,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803797650] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:58,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:58,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:11:58,642 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62269452] [2021-10-21 20:11:58,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:11:58,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:58,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:11:58,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:58,643 INFO L87 Difference]: Start difference. First operand 4741 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-21 20:11:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:11:59,128 INFO L93 Difference]: Finished difference Result 9037 states and 12059 transitions. [2021-10-21 20:11:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:11:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 116 [2021-10-21 20:11:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:11:59,146 INFO L225 Difference]: With dead ends: 9037 [2021-10-21 20:11:59,146 INFO L226 Difference]: Without dead ends: 4687 [2021-10-21 20:11:59,153 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:11:59,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2021-10-21 20:11:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 4687. [2021-10-21 20:11:59,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4687 states, 4686 states have (on average 1.3284250960307298) internal successors, (6225), 4686 states have internal predecessors, (6225), 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-10-21 20:11:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4687 states to 4687 states and 6225 transitions. [2021-10-21 20:11:59,650 INFO L78 Accepts]: Start accepts. Automaton has 4687 states and 6225 transitions. Word has length 116 [2021-10-21 20:11:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:11:59,650 INFO L470 AbstractCegarLoop]: Abstraction has 4687 states and 6225 transitions. [2021-10-21 20:11:59,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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-10-21 20:11:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4687 states and 6225 transitions. [2021-10-21 20:11:59,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-10-21 20:11:59,665 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:11:59,665 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:11:59,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 20:11:59,666 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:11:59,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:11:59,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1827087367, now seen corresponding path program 1 times [2021-10-21 20:11:59,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:11:59,666 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366838420] [2021-10-21 20:11:59,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:11:59,667 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:11:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:11:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-21 20:11:59,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:11:59,726 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366838420] [2021-10-21 20:11:59,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366838420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:11:59,727 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:11:59,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:11:59,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816707068] [2021-10-21 20:11:59,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:11:59,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:11:59,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:11:59,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:11:59,729 INFO L87 Difference]: Start difference. First operand 4687 states and 6225 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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-10-21 20:12:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:00,197 INFO L93 Difference]: Finished difference Result 8325 states and 11081 transitions. [2021-10-21 20:12:00,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:12:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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 128 [2021-10-21 20:12:00,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:00,210 INFO L225 Difference]: With dead ends: 8325 [2021-10-21 20:12:00,211 INFO L226 Difference]: Without dead ends: 4607 [2021-10-21 20:12:00,216 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:12:00,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4607 states. [2021-10-21 20:12:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4607 to 4605. [2021-10-21 20:12:00,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4605 states, 4604 states have (on average 1.3040834057341442) internal successors, (6004), 4604 states have internal predecessors, (6004), 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-10-21 20:12:00,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4605 states to 4605 states and 6004 transitions. [2021-10-21 20:12:00,696 INFO L78 Accepts]: Start accepts. Automaton has 4605 states and 6004 transitions. Word has length 128 [2021-10-21 20:12:00,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:00,697 INFO L470 AbstractCegarLoop]: Abstraction has 4605 states and 6004 transitions. [2021-10-21 20:12:00,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 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-10-21 20:12:00,697 INFO L276 IsEmpty]: Start isEmpty. Operand 4605 states and 6004 transitions. [2021-10-21 20:12:00,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-21 20:12:00,708 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:00,708 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:12:00,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 20:12:00,709 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:00,709 INFO L82 PathProgramCache]: Analyzing trace with hash 210660645, now seen corresponding path program 1 times [2021-10-21 20:12:00,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:00,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475266311] [2021-10-21 20:12:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:00,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:00,746 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 20:12:00,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:00,747 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475266311] [2021-10-21 20:12:00,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475266311] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:00,747 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:00,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:00,748 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30882906] [2021-10-21 20:12:00,748 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:00,748 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:00,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:00,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:00,749 INFO L87 Difference]: Start difference. First operand 4605 states and 6004 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-10-21 20:12:01,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:01,181 INFO L93 Difference]: Finished difference Result 8823 states and 11496 transitions. [2021-10-21 20:12:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:01,182 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 134 [2021-10-21 20:12:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:01,188 INFO L225 Difference]: With dead ends: 8823 [2021-10-21 20:12:01,189 INFO L226 Difference]: Without dead ends: 4604 [2021-10-21 20:12:01,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4604 states. [2021-10-21 20:12:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4604 to 4564. [2021-10-21 20:12:01,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 4563 states have (on average 1.2976112206881438) internal successors, (5921), 4563 states have internal predecessors, (5921), 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-10-21 20:12:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 5921 transitions. [2021-10-21 20:12:01,678 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 5921 transitions. Word has length 134 [2021-10-21 20:12:01,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:01,679 INFO L470 AbstractCegarLoop]: Abstraction has 4564 states and 5921 transitions. [2021-10-21 20:12:01,679 INFO L471 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-10-21 20:12:01,679 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 5921 transitions. [2021-10-21 20:12:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-10-21 20:12:01,690 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:01,690 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:12:01,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 20:12:01,690 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:01,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:01,691 INFO L82 PathProgramCache]: Analyzing trace with hash 80634053, now seen corresponding path program 1 times [2021-10-21 20:12:01,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:01,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067271595] [2021-10-21 20:12:01,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:01,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-10-21 20:12:01,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:01,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067271595] [2021-10-21 20:12:01,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067271595] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:01,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:01,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:01,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036916749] [2021-10-21 20:12:01,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:01,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:01,745 INFO L87 Difference]: Start difference. First operand 4564 states and 5921 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-10-21 20:12:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:02,202 INFO L93 Difference]: Finished difference Result 8762 states and 11357 transitions. [2021-10-21 20:12:02,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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 134 [2021-10-21 20:12:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:02,225 INFO L225 Difference]: With dead ends: 8762 [2021-10-21 20:12:02,226 INFO L226 Difference]: Without dead ends: 4574 [2021-10-21 20:12:02,232 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:02,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2021-10-21 20:12:02,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 4534. [2021-10-21 20:12:02,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4534 states, 4533 states have (on average 1.2905360688285903) internal successors, (5850), 4533 states have internal predecessors, (5850), 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-10-21 20:12:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4534 states to 4534 states and 5850 transitions. [2021-10-21 20:12:02,890 INFO L78 Accepts]: Start accepts. Automaton has 4534 states and 5850 transitions. Word has length 134 [2021-10-21 20:12:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:02,891 INFO L470 AbstractCegarLoop]: Abstraction has 4534 states and 5850 transitions. [2021-10-21 20:12:02,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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-10-21 20:12:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4534 states and 5850 transitions. [2021-10-21 20:12:02,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-21 20:12:02,899 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:02,899 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:12:02,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 20:12:02,900 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:02,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:02,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1507420786, now seen corresponding path program 1 times [2021-10-21 20:12:02,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:02,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117157557] [2021-10-21 20:12:02,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:02,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-10-21 20:12:02,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:02,950 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117157557] [2021-10-21 20:12:02,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117157557] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:02,950 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:02,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:12:02,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436358581] [2021-10-21 20:12:02,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:12:02,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:02,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:12:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:12:02,953 INFO L87 Difference]: Start difference. First operand 4534 states and 5850 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-10-21 20:12:03,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:03,333 INFO L93 Difference]: Finished difference Result 7387 states and 9578 transitions. [2021-10-21 20:12:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:12:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 137 [2021-10-21 20:12:03,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:03,340 INFO L225 Difference]: With dead ends: 7387 [2021-10-21 20:12:03,341 INFO L226 Difference]: Without dead ends: 3225 [2021-10-21 20:12:03,347 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:12:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2021-10-21 20:12:03,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3223. [2021-10-21 20:12:03,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 3222 states have (on average 1.2576039726877715) internal successors, (4052), 3222 states have internal predecessors, (4052), 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-10-21 20:12:03,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4052 transitions. [2021-10-21 20:12:03,738 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4052 transitions. Word has length 137 [2021-10-21 20:12:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:03,738 INFO L470 AbstractCegarLoop]: Abstraction has 3223 states and 4052 transitions. [2021-10-21 20:12:03,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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-10-21 20:12:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4052 transitions. [2021-10-21 20:12:03,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2021-10-21 20:12:03,744 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:03,745 INFO L512 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 20:12:03,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-21 20:12:03,745 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:03,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:03,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1526376893, now seen corresponding path program 1 times [2021-10-21 20:12:03,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:03,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873098686] [2021-10-21 20:12:03,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:03,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:03,788 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-10-21 20:12:03,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:03,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873098686] [2021-10-21 20:12:03,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873098686] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:03,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:03,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 20:12:03,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317345742] [2021-10-21 20:12:03,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 20:12:03,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:03,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 20:12:03,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 20:12:03,791 INFO L87 Difference]: Start difference. First operand 3223 states and 4052 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-10-21 20:12:04,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:04,113 INFO L93 Difference]: Finished difference Result 5208 states and 6552 transitions. [2021-10-21 20:12:04,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 20:12:04,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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 137 [2021-10-21 20:12:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:04,117 INFO L225 Difference]: With dead ends: 5208 [2021-10-21 20:12:04,117 INFO L226 Difference]: Without dead ends: 2057 [2021-10-21 20:12:04,122 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 20:12:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2021-10-21 20:12:04,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 2055. [2021-10-21 20:12:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 2054 states have (on average 1.2239532619279454) internal successors, (2514), 2054 states have internal predecessors, (2514), 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-10-21 20:12:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 2514 transitions. [2021-10-21 20:12:04,300 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 2514 transitions. Word has length 137 [2021-10-21 20:12:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:04,300 INFO L470 AbstractCegarLoop]: Abstraction has 2055 states and 2514 transitions. [2021-10-21 20:12:04,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 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-10-21 20:12:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 2514 transitions. [2021-10-21 20:12:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2021-10-21 20:12:04,303 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:04,303 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-21 20:12:04,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-21 20:12:04,304 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1143751876, now seen corresponding path program 1 times [2021-10-21 20:12:04,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:04,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576148845] [2021-10-21 20:12:04,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:04,305 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:04,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-10-21 20:12:04,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:04,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576148845] [2021-10-21 20:12:04,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576148845] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:04,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:04,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:04,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338884430] [2021-10-21 20:12:04,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:04,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:04,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:04,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:04,351 INFO L87 Difference]: Start difference. First operand 2055 states and 2514 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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-10-21 20:12:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:04,536 INFO L93 Difference]: Finished difference Result 3727 states and 4591 transitions. [2021-10-21 20:12:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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 176 [2021-10-21 20:12:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:04,539 INFO L225 Difference]: With dead ends: 3727 [2021-10-21 20:12:04,539 INFO L226 Difference]: Without dead ends: 2013 [2021-10-21 20:12:04,541 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2021-10-21 20:12:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1935. [2021-10-21 20:12:04,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1934 states have (on average 1.2078593588417788) internal successors, (2336), 1934 states have internal predecessors, (2336), 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-10-21 20:12:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2336 transitions. [2021-10-21 20:12:04,694 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2336 transitions. Word has length 176 [2021-10-21 20:12:04,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:04,695 INFO L470 AbstractCegarLoop]: Abstraction has 1935 states and 2336 transitions. [2021-10-21 20:12:04,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 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-10-21 20:12:04,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2336 transitions. [2021-10-21 20:12:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2021-10-21 20:12:04,697 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:04,698 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:04,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-21 20:12:04,698 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash 709277431, now seen corresponding path program 1 times [2021-10-21 20:12:04,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:04,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062700963] [2021-10-21 20:12:04,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:04,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2021-10-21 20:12:04,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:04,739 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062700963] [2021-10-21 20:12:04,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062700963] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:04,740 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:04,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:04,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204745162] [2021-10-21 20:12:04,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:04,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:04,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:04,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:04,742 INFO L87 Difference]: Start difference. First operand 1935 states and 2336 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-21 20:12:04,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:04,952 INFO L93 Difference]: Finished difference Result 4164 states and 5063 transitions. [2021-10-21 20:12:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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 182 [2021-10-21 20:12:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:04,956 INFO L225 Difference]: With dead ends: 4164 [2021-10-21 20:12:04,956 INFO L226 Difference]: Without dead ends: 2566 [2021-10-21 20:12:04,958 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2021-10-21 20:12:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2213. [2021-10-21 20:12:05,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 2212 states have (on average 1.1916817359855334) internal successors, (2636), 2212 states have internal predecessors, (2636), 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-10-21 20:12:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 2636 transitions. [2021-10-21 20:12:05,118 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 2636 transitions. Word has length 182 [2021-10-21 20:12:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:05,118 INFO L470 AbstractCegarLoop]: Abstraction has 2213 states and 2636 transitions. [2021-10-21 20:12:05,118 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 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-10-21 20:12:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 2636 transitions. [2021-10-21 20:12:05,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2021-10-21 20:12:05,120 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:05,120 INFO L512 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-21 20:12:05,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-21 20:12:05,121 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash 391755360, now seen corresponding path program 1 times [2021-10-21 20:12:05,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:05,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205239038] [2021-10-21 20:12:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:05,122 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:05,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-21 20:12:05,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:05,404 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205239038] [2021-10-21 20:12:05,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205239038] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:05,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679589625] [2021-10-21 20:12:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:05,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:12:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:12:05,408 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:12:05,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 20:12:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:05,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-21 20:12:05,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:12:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 81 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-10-21 20:12:06,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679589625] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:06,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:12:06,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2021-10-21 20:12:06,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659421135] [2021-10-21 20:12:06,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-21 20:12:06,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:06,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-21 20:12:06,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2021-10-21 20:12:06,481 INFO L87 Difference]: Start difference. First operand 2213 states and 2636 transitions. Second operand has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 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-10-21 20:12:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:08,200 INFO L93 Difference]: Finished difference Result 7188 states and 8534 transitions. [2021-10-21 20:12:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-21 20:12:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 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 185 [2021-10-21 20:12:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:08,210 INFO L225 Difference]: With dead ends: 7188 [2021-10-21 20:12:08,210 INFO L226 Difference]: Without dead ends: 5299 [2021-10-21 20:12:08,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 732.6ms TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2021-10-21 20:12:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2021-10-21 20:12:08,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 2902. [2021-10-21 20:12:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2902 states, 2901 states have (on average 1.1889003791795933) internal successors, (3449), 2901 states have internal predecessors, (3449), 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-10-21 20:12:08,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2902 states to 2902 states and 3449 transitions. [2021-10-21 20:12:08,515 INFO L78 Accepts]: Start accepts. Automaton has 2902 states and 3449 transitions. Word has length 185 [2021-10-21 20:12:08,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:08,516 INFO L470 AbstractCegarLoop]: Abstraction has 2902 states and 3449 transitions. [2021-10-21 20:12:08,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 18.63157894736842) internal successors, (354), 19 states have internal predecessors, (354), 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-10-21 20:12:08,517 INFO L276 IsEmpty]: Start isEmpty. Operand 2902 states and 3449 transitions. [2021-10-21 20:12:08,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2021-10-21 20:12:08,519 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:08,519 INFO L512 BasicCegarLoop]: trace histogram [7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:08,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-10-21 20:12:08,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:12:08,734 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1085364486, now seen corresponding path program 1 times [2021-10-21 20:12:08,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:08,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232589273] [2021-10-21 20:12:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:08,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:08,958 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-21 20:12:08,958 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:08,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232589273] [2021-10-21 20:12:08,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232589273] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:08,959 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365193727] [2021-10-21 20:12:08,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:08,960 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:12:08,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:12:08,961 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:12:08,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 20:12:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:09,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 19 conjunts are in the unsatisfiable core [2021-10-21 20:12:09,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:12:10,689 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-10-21 20:12:10,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365193727] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:10,690 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:12:10,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2021-10-21 20:12:10,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821720810] [2021-10-21 20:12:10,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-21 20:12:10,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:10,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-21 20:12:10,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-10-21 20:12:10,692 INFO L87 Difference]: Start difference. First operand 2902 states and 3449 transitions. Second operand has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-10-21 20:12:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:11,656 INFO L93 Difference]: Finished difference Result 6480 states and 7693 transitions. [2021-10-21 20:12:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 20:12:11,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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 191 [2021-10-21 20:12:11,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:11,663 INFO L225 Difference]: With dead ends: 6480 [2021-10-21 20:12:11,663 INFO L226 Difference]: Without dead ends: 3902 [2021-10-21 20:12:11,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 266.6ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-10-21 20:12:11,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2021-10-21 20:12:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3099. [2021-10-21 20:12:11,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3099 states, 3098 states have (on average 1.185280826339574) internal successors, (3672), 3098 states have internal predecessors, (3672), 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-10-21 20:12:11,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 3672 transitions. [2021-10-21 20:12:11,973 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 3672 transitions. Word has length 191 [2021-10-21 20:12:11,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:11,974 INFO L470 AbstractCegarLoop]: Abstraction has 3099 states and 3672 transitions. [2021-10-21 20:12:11,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.1) internal successors, (181), 10 states have internal predecessors, (181), 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-10-21 20:12:11,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 3672 transitions. [2021-10-21 20:12:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-10-21 20:12:11,977 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:11,977 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:12,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 20:12:12,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2021-10-21 20:12:12,181 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1258410680, now seen corresponding path program 1 times [2021-10-21 20:12:12,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:12,182 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878980526] [2021-10-21 20:12:12,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:12,182 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-10-21 20:12:12,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:12,239 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878980526] [2021-10-21 20:12:12,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878980526] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:12,239 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:12,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:12,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949910129] [2021-10-21 20:12:12,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:12,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:12,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:12,242 INFO L87 Difference]: Start difference. First operand 3099 states and 3672 transitions. Second operand has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10-21 20:12:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:12,518 INFO L93 Difference]: Finished difference Result 4753 states and 5608 transitions. [2021-10-21 20:12:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:12,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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 251 [2021-10-21 20:12:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:12,522 INFO L225 Difference]: With dead ends: 4753 [2021-10-21 20:12:12,523 INFO L226 Difference]: Without dead ends: 2114 [2021-10-21 20:12:12,525 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2021-10-21 20:12:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 2081. [2021-10-21 20:12:12,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2081 states, 2080 states have (on average 1.1576923076923078) internal successors, (2408), 2080 states have internal predecessors, (2408), 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-10-21 20:12:12,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2081 states to 2081 states and 2408 transitions. [2021-10-21 20:12:12,709 INFO L78 Accepts]: Start accepts. Automaton has 2081 states and 2408 transitions. Word has length 251 [2021-10-21 20:12:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:12,710 INFO L470 AbstractCegarLoop]: Abstraction has 2081 states and 2408 transitions. [2021-10-21 20:12:12,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 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-10-21 20:12:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2081 states and 2408 transitions. [2021-10-21 20:12:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2021-10-21 20:12:12,712 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:12,712 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:12,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-10-21 20:12:12,713 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:12,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2068647826, now seen corresponding path program 1 times [2021-10-21 20:12:12,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:12,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449409626] [2021-10-21 20:12:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:12,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-10-21 20:12:12,781 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:12,781 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449409626] [2021-10-21 20:12:12,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449409626] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:12,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:12,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:12,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020827513] [2021-10-21 20:12:12,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:12,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:12,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:12,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:12,784 INFO L87 Difference]: Start difference. First operand 2081 states and 2408 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-10-21 20:12:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:12,923 INFO L93 Difference]: Finished difference Result 2385 states and 2747 transitions. [2021-10-21 20:12:12,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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 275 [2021-10-21 20:12:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:12,925 INFO L225 Difference]: With dead ends: 2385 [2021-10-21 20:12:12,926 INFO L226 Difference]: Without dead ends: 815 [2021-10-21 20:12:12,927 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2021-10-21 20:12:13,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 815. [2021-10-21 20:12:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 814 states have (on average 1.106879606879607) internal successors, (901), 814 states have internal predecessors, (901), 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-10-21 20:12:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 901 transitions. [2021-10-21 20:12:13,011 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 901 transitions. Word has length 275 [2021-10-21 20:12:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:13,012 INFO L470 AbstractCegarLoop]: Abstraction has 815 states and 901 transitions. [2021-10-21 20:12:13,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 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-10-21 20:12:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 901 transitions. [2021-10-21 20:12:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2021-10-21 20:12:13,014 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:13,014 INFO L512 BasicCegarLoop]: trace histogram [9, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:13,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-21 20:12:13,015 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:13,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:13,015 INFO L82 PathProgramCache]: Analyzing trace with hash 625161699, now seen corresponding path program 1 times [2021-10-21 20:12:13,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:13,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872204931] [2021-10-21 20:12:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:13,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-10-21 20:12:13,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:13,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872204931] [2021-10-21 20:12:13,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872204931] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 20:12:13,078 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 20:12:13,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 20:12:13,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279747504] [2021-10-21 20:12:13,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 20:12:13,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 20:12:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:13,080 INFO L87 Difference]: Start difference. First operand 815 states and 901 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-10-21 20:12:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:13,191 INFO L93 Difference]: Finished difference Result 1159 states and 1277 transitions. [2021-10-21 20:12:13,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 20:12:13,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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 277 [2021-10-21 20:12:13,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:13,194 INFO L225 Difference]: With dead ends: 1159 [2021-10-21 20:12:13,194 INFO L226 Difference]: Without dead ends: 745 [2021-10-21 20:12:13,194 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 20:12:13,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2021-10-21 20:12:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 737. [2021-10-21 20:12:13,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 736 states have (on average 1.0991847826086956) internal successors, (809), 736 states have internal predecessors, (809), 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-10-21 20:12:13,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 809 transitions. [2021-10-21 20:12:13,268 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 809 transitions. Word has length 277 [2021-10-21 20:12:13,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:13,268 INFO L470 AbstractCegarLoop]: Abstraction has 737 states and 809 transitions. [2021-10-21 20:12:13,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 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-10-21 20:12:13,269 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 809 transitions. [2021-10-21 20:12:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2021-10-21 20:12:13,271 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 20:12:13,272 INFO L512 BasicCegarLoop]: trace histogram [10, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2021-10-21 20:12:13,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-10-21 20:12:13,272 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 20:12:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 20:12:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash -469819346, now seen corresponding path program 1 times [2021-10-21 20:12:13,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 20:12:13,273 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573968412] [2021-10-21 20:12:13,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:13,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 20:12:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-21 20:12:13,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 20:12:13,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573968412] [2021-10-21 20:12:13,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573968412] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:13,469 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439243906] [2021-10-21 20:12:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 20:12:13,469 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 20:12:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 20:12:13,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 20:12:13,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 20:12:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 20:12:13,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 762 conjuncts, 17 conjunts are in the unsatisfiable core [2021-10-21 20:12:13,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 20:12:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 237 proven. 30 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2021-10-21 20:12:15,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439243906] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 20:12:15,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 20:12:15,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2021-10-21 20:12:15,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338367040] [2021-10-21 20:12:15,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 20:12:15,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 20:12:15,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 20:12:15,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-21 20:12:15,248 INFO L87 Difference]: Start difference. First operand 737 states and 809 transitions. Second operand has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 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-10-21 20:12:15,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 20:12:15,627 INFO L93 Difference]: Finished difference Result 1053 states and 1149 transitions. [2021-10-21 20:12:15,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-21 20:12:15,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 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 289 [2021-10-21 20:12:15,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 20:12:15,629 INFO L225 Difference]: With dead ends: 1053 [2021-10-21 20:12:15,629 INFO L226 Difference]: Without dead ends: 0 [2021-10-21 20:12:15,631 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 196.2ms TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-10-21 20:12:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-21 20:12:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-21 20:12:15,631 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-10-21 20:12:15,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-21 20:12:15,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 289 [2021-10-21 20:12:15,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 20:12:15,632 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-21 20:12:15,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 25.88888888888889) internal successors, (233), 9 states have internal predecessors, (233), 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-10-21 20:12:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-21 20:12:15,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-21 20:12:15,636 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 20:12:15,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 20:12:15,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2021-10-21 20:12:15,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-21 20:12:15,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:15,881 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:16,576 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:16,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:16,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:17,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:17,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:18,997 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:20,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:20,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:20,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:20,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:20,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:21,792 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:21,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:21,936 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:22,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:22,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:23,487 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:23,638 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-21 20:12:39,041 WARN L207 SmtUtils]: Spent 6.42 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-10-21 20:12:47,629 WARN L207 SmtUtils]: Spent 6.54 s on a formula simplification. DAG size of input: 303 DAG size of output: 150 [2021-10-21 20:12:57,167 WARN L207 SmtUtils]: Spent 6.52 s on a formula simplification. DAG size of input: 297 DAG size of output: 149 [2021-10-21 20:13:03,647 WARN L207 SmtUtils]: Spent 5.99 s on a formula simplification. DAG size of input: 308 DAG size of output: 152 [2021-10-21 20:13:03,651 INFO L857 garLoopResultBuilder]: For program point L498(lines 498 502) no Hoare annotation was computed. [2021-10-21 20:13:03,651 INFO L853 garLoopResultBuilder]: At program point L234-1(lines 222 249) the Hoare annotation is: (let ((.cse27 (= ~c2_st~0 0)) (.cse39 (+ ~t_b~0 1)) (.cse35 (= ~c1_st~0 0))) (let ((.cse2 (not .cse35)) (.cse37 (not (= ~e_c~0 0))) (.cse33 (= ~c2_pc~0 0)) (.cse25 (<= ~c_t~0 .cse39)) (.cse26 (= ~wb_pc~0 1)) (.cse28 (<= .cse39 ~c_t~0)) (.cse18 (= ~c1_pc~0 1)) (.cse29 (<= .cse39 ~data~0)) (.cse30 (not (= ~r_st~0 0))) (.cse32 (<= ~data~0 .cse39)) (.cse0 (not (= 0 ~wl_st~0))) (.cse9 (not (= 2 ~wl_pc~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse27)) (.cse34 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (= ~wb_pc~0 0)) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse19 (not (= ~wb_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse36 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse25 .cse2 .cse26 .cse27 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse32 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse5 .cse7 .cse37 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse36 .cse23) (let ((.cse38 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 .cse4 .cse26 (= .cse38 ~data~0) .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 (= .cse38 ~c_t~0) .cse31 .cse23)) (and .cse1 .cse2 .cse3 .cse27 .cse33 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse31 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse26 .cse5 .cse7 .cse37 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse18 .cse20 .cse31 .cse23) (and .cse1 .cse3 .cse27 .cse33 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse25 .cse4 .cse26 .cse5 .cse7 .cse10 .cse11 .cse28 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse29 .cse30 .cse20 .cse31 .cse35 .cse32 .cse23) (and .cse0 .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse35 .cse22 .cse23 .cse24) (and .cse1 .cse3 .cse4 .cse34 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse35 .cse36 .cse22 .cse23 .cse24)))) [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L631-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L400(lines 400 410) no Hoare annotation was computed. [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L400-2(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L301(lines 301 309) no Hoare annotation was computed. [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L235(line 235) no Hoare annotation was computed. [2021-10-21 20:13:03,652 INFO L857 garLoopResultBuilder]: For program point L136(lines 136 140) no Hoare annotation was computed. [2021-10-21 20:13:03,653 INFO L857 garLoopResultBuilder]: For program point L665(lines 665 673) no Hoare annotation was computed. [2021-10-21 20:13:03,653 INFO L857 garLoopResultBuilder]: For program point L599(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,653 INFO L857 garLoopResultBuilder]: For program point L566-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,653 INFO L857 garLoopResultBuilder]: For program point L401(lines 401 406) no Hoare annotation was computed. [2021-10-21 20:13:03,653 INFO L857 garLoopResultBuilder]: For program point L401-2(lines 401 406) no Hoare annotation was computed. [2021-10-21 20:13:03,654 INFO L853 garLoopResultBuilder]: At program point L137(lines 132 172) the Hoare annotation is: (let ((.cse22 (= ~wb_st~0 0)) (.cse24 (= ~c2_st~0 0))) (let ((.cse4 (not .cse24)) (.cse2 (+ ~t_b~0 1)) (.cse3 (not (= ~c1_st~0 0))) (.cse12 (= ~e_c~0 2)) (.cse16 (not .cse22)) (.cse17 (not (= ~r_st~0 0))) (.cse21 (= ~processed~0 0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse23 (not (= ~e_c~0 0))) (.cse8 (not (= ~r_i~0 1))) (.cse9 (not (= ~e_e~0 1))) (.cse10 (not (= ~e_wl~0 1))) (.cse11 (= ~c1_i~0 1)) (.cse13 (= ~c2_i~0 1)) (.cse14 (= ~e_f~0 2)) (.cse15 (= ~c1_pc~0 1)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (<= ~c_t~0 .cse2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= .cse2 ~c_t~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= .cse2 ~data~0) .cse17 .cse18 .cse19 (<= ~data~0 .cse2) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18 .cse21 .cse19 (= ~data~0 .cse2) .cse22 .cse20) (and .cse0 .cse1 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse19 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~data~0 ~t_b~0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 .cse5 .cse6 .cse7 .cse23 (not (= 2 ~wl_pc~0)) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse18 .cse19 .cse20)))) [2021-10-21 20:13:03,654 INFO L853 garLoopResultBuilder]: At program point L71(lines 57 127) the Hoare annotation is: (let ((.cse26 (= ~c2_st~0 0)) (.cse29 (= ~c1_st~0 0)) (.cse31 (= ~wb_st~0 0))) (let ((.cse5 (= ~wb_pc~0 1)) (.cse20 (not .cse31)) (.cse27 (= ~c2_pc~0 0)) (.cse2 (not .cse29)) (.cse19 (= ~c1_pc~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~d~0 0)) (.cse4 (not .cse26)) (.cse28 (= ~c1_pc~0 0)) (.cse6 (not (= ~e_g~0 1))) (.cse7 (= ~t_b~0 0)) (.cse8 (not (= ~e_e~0 0))) (.cse9 (= ~data~0 0)) (.cse10 (not (= ~e_c~0 0))) (.cse11 (not (= 2 ~wl_pc~0))) (.cse12 (not (= ~r_i~0 1))) (.cse13 (not (= ~e_e~0 1))) (.cse30 (= ~wb_pc~0 0)) (.cse14 (not (= ~e_wl~0 1))) (.cse15 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse17 (= ~c2_i~0 1)) (.cse18 (= ~e_f~0 2)) (.cse21 (= ~c2_pc~0 1)) (.cse22 (= ~processed~0 0)) (.cse23 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~wb_i~0 1)) (.cse25 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse5 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse29 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse26 .cse27 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse26 .cse27 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 .cse31 .cse23 .cse24 .cse25) (and .cse0 .cse1 .cse3 .cse4 .cse28 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse30 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse22 .cse29 .cse31 .cse23 .cse24 .cse25)))) [2021-10-21 20:13:03,654 INFO L857 garLoopResultBuilder]: For program point L600(lines 600 604) no Hoare annotation was computed. [2021-10-21 20:13:03,654 INFO L853 garLoopResultBuilder]: At program point L468(lines 461 478) the Hoare annotation is: (let ((.cse0 (= ~c2_st~0 0)) (.cse1 (not (= ~r_i~0 1))) (.cse2 (= ~e_g~0 ~e_f~0)) (.cse3 (= ~c1_i~0 1)) (.cse4 (= ~e_c~0 2)) (.cse5 (= ~c2_i~0 1)) (.cse6 (= ~e_wl~0 ~e_c~0)) (.cse7 (= ~e_f~0 2)) (.cse8 (= ~e_e~0 ~e_f~0)) (.cse9 (= ~c1_st~0 0)) (.cse10 (= 0 ~wl_pc~0)) (.cse11 (= ~wb_st~0 0)) (.cse12 (= ~c_req_up~0 ~r_i~0)) (.cse13 (= ~wb_i~0 1))) (or (and (not (= 0 ~wl_st~0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (= ~d~0 0) .cse0 (= ~c2_pc~0 0) (= ~c1_pc~0 0) (= ~t_b~0 0) (= ~data~0 0) .cse1 (= ~wb_pc~0 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ~processed~0 0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= ~r_st~0 ~e_f~0)))) [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L469(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L436-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L304(lines 304 308) no Hoare annotation was computed. [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L304-1(lines 290 388) no Hoare annotation was computed. [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L668(lines 668 672) no Hoare annotation was computed. [2021-10-21 20:13:03,655 INFO L857 garLoopResultBuilder]: For program point L668-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,657 INFO L857 garLoopResultBuilder]: For program point L470(lines 470 474) no Hoare annotation was computed. [2021-10-21 20:13:03,657 INFO L857 garLoopResultBuilder]: For program point L636-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,658 INFO L857 garLoopResultBuilder]: For program point L538(line 538) no Hoare annotation was computed. [2021-10-21 20:13:03,658 INFO L857 garLoopResultBuilder]: For program point L571-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,658 INFO L853 garLoopResultBuilder]: At program point L373(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse20 (= ~c1_st~0 0)) (.cse40 (+ ~t_b~0 1)) (.cse47 (+ ~t_b~0 2))) (let ((.cse43 (= 2 ~wl_pc~0)) (.cse45 (= .cse47 ~data~0)) (.cse33 (= ~data~0 .cse40)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse27 (not .cse20)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse5 (not (= ~e_g~0 1))) (.cse7 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse38 (= ~data~0 ~t_b~0)) (.cse17 (= ~e_f~0 2)) (.cse29 (= ~c1_pc~0 1)) (.cse30 (not .cse21)) (.cse32 (not (= ~r_st~0 0))) (.cse18 (= ~c2_pc~0 1)) (.cse31 (not (= ~e_wl~0 0))) (.cse23 (= ~wb_i~0 1)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0))) (let ((.cse46 (= .cse47 ~c~0)) (.cse48 (= .cse47 ~c_t~0)) (.cse41 (<= .cse40 ~c~0)) (.cse42 (<= ~c~0 .cse40)) (.cse54 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse40)) (.cse35 (<= .cse40 ~c_t~0)) (.cse36 (<= .cse40 ~data~0)) (.cse37 (<= ~data~0 .cse40)) (.cse49 (<= 1 ~c~0)) (.cse50 (<= 1 ~c_t~0)) (.cse51 (<= ~c_t~0 1)) (.cse52 (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse33 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39))) (.cse53 (<= ~c~0 1)) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse43)) (.cse2 (= ~d~0 0)) (.cse4 (= ~c1_pc~0 0)) (.cse6 (= ~t_b~0 0)) (.cse8 (= ~data~0 0)) (.cse19 (= ~processed~0 0)) (.cse44 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse33 .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse40) .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse42 (<= .cse40 ~d~0) .cse43 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse32 .cse18 (= .cse47 ~d~0) .cse48 .cse31 .cse43 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse46 .cse30 .cse18 .cse48 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse54 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse44 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse48 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse44 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse41 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse42 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse45 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse44 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse54 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse2 .cse6 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse44 .cse22 .cse23 .cse24))))) [2021-10-21 20:13:03,659 INFO L857 garLoopResultBuilder]: For program point L506-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,659 INFO L857 garLoopResultBuilder]: For program point L441-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,659 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 121) no Hoare annotation was computed. [2021-10-21 20:13:03,659 INFO L853 garLoopResultBuilder]: At program point L343(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-21 20:13:03,659 INFO L857 garLoopResultBuilder]: For program point L178(lines 178 186) no Hoare annotation was computed. [2021-10-21 20:13:03,659 INFO L857 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L608(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L377(lines 377 384) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L609(lines 609 613) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L576-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,660 INFO L857 garLoopResultBuilder]: For program point L411-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,661 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 120) no Hoare annotation was computed. [2021-10-21 20:13:03,661 INFO L857 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2021-10-21 20:13:03,661 INFO L853 garLoopResultBuilder]: At program point L709(lines 684 711) the Hoare annotation is: (= ~c2_i~0 1) [2021-10-21 20:13:03,661 INFO L857 garLoopResultBuilder]: For program point L544(lines 544 554) no Hoare annotation was computed. [2021-10-21 20:13:03,661 INFO L857 garLoopResultBuilder]: For program point L511-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,661 INFO L857 garLoopResultBuilder]: For program point L544-2(lines 544 554) no Hoare annotation was computed. [2021-10-21 20:13:03,662 INFO L853 garLoopResultBuilder]: At program point L313(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse41 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse37 (<= .cse33 ~c~0)) (.cse40 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse34 (= ~data~0 ~t_b~0)) (.cse35 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse36 (<= ~c_t~0 .cse33)) (.cse38 (<= .cse33 ~c_t~0)) (.cse39 (<= .cse33 ~data~0)) (.cse42 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse41)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse35) (and .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse40 (<= .cse33 ~d~0) .cse41 .cse42 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse42 .cse23) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse41 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse39 .cse32 .cse18 .cse19 .cse31 .cse42 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse37 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse18 .cse31 .cse40 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse34 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse35)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse36 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse38 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse39 .cse32 .cse18 .cse31 .cse20 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-21 20:13:03,662 INFO L857 garLoopResultBuilder]: For program point L181(lines 181 185) no Hoare annotation was computed. [2021-10-21 20:13:03,662 INFO L853 garLoopResultBuilder]: At program point L16(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~e_c~0 2)) (.cse10 (= ~c2_i~0 1)) (.cse11 (= ~e_f~0 2)) (.cse12 (= ~c1_pc~0 1)) (.cse13 (not (= ~wb_st~0 0))) (.cse14 (= ~c2_pc~0 1)) (.cse15 (not (= ~e_wl~0 0))) (.cse16 (= ~wb_i~0 1))) (or (and .cse0 .cse1 (not (= ~c1_st~0 0)) (= ~d~0 0) (not (= ~c2_st~0 0)) .cse2 .cse3 (= ~t_b~0 0) .cse4 (= ~data~0 0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (= ~processed~0 0) .cse15 (= ~c_req_up~0 ~r_i~0) .cse16 (= ~r_st~0 ~e_f~0)) (and (let ((.cse17 (not (= ~r_st~0 0)))) (or (and .cse0 .cse1 .cse2 (= (+ ~t_b~0 2) ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= ~data~0 ~t_b~0) .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse17 .cse14 .cse15 (= ~data~0 (+ ~t_b~0 1)) .cse16))) (= 2 ~wl_pc~0)))) [2021-10-21 20:13:03,662 INFO L857 garLoopResultBuilder]: For program point L545(lines 545 550) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L479(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L446-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L347(lines 347 354) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L853 garLoopResultBuilder]: At program point L182(lines 177 217) the Hoare annotation is: (let ((.cse19 (= ~c1_st~0 0)) (.cse23 (= ~wb_st~0 0))) (let ((.cse14 (not .cse23)) (.cse22 (not .cse19)) (.cse2 (not (= ~c2_st~0 0))) (.cse10 (= ~e_c~0 2)) (.cse15 (not (= ~r_st~0 0))) (.cse17 (= ~processed~0 0)) (.cse21 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse24 (not (= ~e_c~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse16 (= ~c2_pc~0 1)) (.cse18 (not (= ~e_wl~0 0))) (.cse20 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= ~data~0 ~t_b~0) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse21 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse21 ~data~0) .cse15 .cse16 .cse18 (<= ~data~0 .cse21) .cse20) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 (= ~data~0 .cse21) .cse23 .cse20) (and .cse0 .cse1 .cse4 .cse5 .cse24 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse18 (= 0 ~wl_pc~0) .cse20) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse24 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse16 .cse18 .cse20)))) [2021-10-21 20:13:03,663 INFO L853 garLoopResultBuilder]: At program point L678(lines 395 683) the Hoare annotation is: (= ~c2_i~0 1) [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L480(lines 480 484) no Hoare annotation was computed. [2021-10-21 20:13:03,663 INFO L857 garLoopResultBuilder]: For program point L646-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,664 INFO L853 garLoopResultBuilder]: At program point L151-1(lines 132 172) the Hoare annotation is: (let ((.cse34 (= ~wb_st~0 0)) (.cse31 (= ~c2_st~0 0)) (.cse26 (+ ~t_b~0 1))) (let ((.cse28 (<= .cse26 ~data~0)) (.cse30 (<= ~data~0 .cse26)) (.cse35 (not (= ~e_c~0 0))) (.cse10 (not (= 2 ~wl_pc~0))) (.cse3 (= ~d~0 0)) (.cse32 (= ~c2_pc~0 0)) (.cse7 (= ~t_b~0 0)) (.cse9 (= ~data~0 0)) (.cse33 (= ~wb_pc~0 0)) (.cse20 (= ~processed~0 0)) (.cse25 (= 0 ~wl_pc~0)) (.cse23 (= ~r_st~0 ~e_f~0)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not .cse31)) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse11 (not (= ~r_i~0 1))) (.cse12 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse27 (= ~c1_pc~0 1)) (.cse18 (not .cse34)) (.cse29 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse24 (not (= ~e_wl~0 0))) (.cse21 (= ~c_req_up~0 ~r_i~0)) (.cse22 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 (<= ~c_t~0 .cse26) .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 (<= .cse26 ~c_t~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse28 .cse29 .cse19 .cse24 .cse30 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse6 .cse8 .cse35 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse24 .cse25 .cse22) (and .cse0 .cse1 .cse2 .cse5 .cse31 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse28 .cse29 .cse19 .cse20 .cse24 .cse30 .cse34 .cse22) (and .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse24 .cse25 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 (= (+ ~t_b~0 2) ~data~0) .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse29 .cse19 .cse20 .cse24 .cse34 .cse22) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23) (and .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse35 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse27 .cse19 .cse24 .cse22) (and .cse1 .cse2 .cse3 .cse31 .cse32 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse24 .cse25 .cse34 .cse21 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse29 .cse19 .cse24 .cse21 .cse22)))) [2021-10-21 20:13:03,664 INFO L857 garLoopResultBuilder]: For program point L85(lines 85 93) no Hoare annotation was computed. [2021-10-21 20:13:03,664 INFO L857 garLoopResultBuilder]: For program point L85-1(lines 79 122) no Hoare annotation was computed. [2021-10-21 20:13:03,664 INFO L857 garLoopResultBuilder]: For program point L416-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,664 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L317(lines 317 324) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L86(lines 86 90) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 586) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L516-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L451-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L154(lines 154 162) no Hoare annotation was computed. [2021-10-21 20:13:03,665 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 162) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L617(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L155(lines 155 159) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L618(lines 618 622) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L651-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L421-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-21 20:13:03,666 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 231) no Hoare annotation was computed. [2021-10-21 20:13:03,667 INFO L857 garLoopResultBuilder]: For program point L190(line 190) no Hoare annotation was computed. [2021-10-21 20:13:03,667 INFO L857 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2021-10-21 20:13:03,667 INFO L857 garLoopResultBuilder]: For program point L488(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,667 INFO L857 garLoopResultBuilder]: For program point L521-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,669 INFO L853 garLoopResultBuilder]: At program point L389(lines 281 394) the Hoare annotation is: (let ((.cse32 (+ ~t_b~0 2))) (let ((.cse31 (= .cse32 ~data~0)) (.cse22 (+ ~t_b~0 1)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (not (= ~c1_st~0 0))) (.cse4 (not (= ~c2_st~0 0))) (.cse5 (= ~wb_pc~0 1)) (.cse6 (not (= ~e_g~0 1))) (.cse8 (not (= ~e_e~0 0))) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse12 (not (= ~e_wl~0 1))) (.cse13 (= ~c1_i~0 1)) (.cse14 (= ~e_c~0 2)) (.cse15 (= ~c2_i~0 1)) (.cse16 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse25 (not (= ~r_st~0 0))) (.cse19 (= ~c2_pc~0 1)) (.cse26 (not (= ~e_wl~0 0))) (.cse21 (= ~wb_i~0 1))) (let ((.cse9 (not (= 2 ~wl_pc~0))) (.cse24 (not (= ~e_c~0 0))) (.cse3 (= ~d~0 0)) (.cse7 (= ~t_b~0 0)) (.cse27 (<= 1 ~c~0)) (.cse28 (<= 1 ~c_t~0)) (.cse29 (<= ~c_t~0 1)) (.cse23 (or (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 (= ~data~0 .cse22) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (= ~data~0 ~t_b~0) .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse21 (= ULTIMATE.start_write_loop_~t~0 ~data~0)))) (.cse30 (<= ~c~0 1)) (.cse20 (= ~c_req_up~0 ~r_i~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= ~data~0 0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= ~processed~0 0) .cse20 .cse21 (= ~r_st~0 ~e_f~0)) (and (<= ~c_t~0 .cse22) (<= .cse22 ~c_t~0) .cse23 (<= .cse22 ~data~0) (<= ~data~0 .cse22)) (and .cse0 .cse1 .cse5 .cse6 .cse8 .cse24 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse25 .cse19 .cse26 .cse21) (and (<= 1 ~d~0) .cse7 (<= ~d~0 1) .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse6 .cse8 .cse24 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse26 (= 0 ~wl_pc~0) .cse21) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse31 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 (= .cse32 ~c_t~0) .cse26 .cse21) (and .cse3 .cse7 .cse27 .cse28 .cse29 .cse23 .cse30) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse25 .cse19 .cse26 .cse20 .cse21))))) [2021-10-21 20:13:03,670 INFO L857 garLoopResultBuilder]: For program point L257(lines 257 274) no Hoare annotation was computed. [2021-10-21 20:13:03,670 INFO L853 garLoopResultBuilder]: At program point L588(lines 581 598) the Hoare annotation is: (let ((.cse5 (not (= ~e_c~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse17 (not (= ~c1_st~0 0))) (.cse18 (not (= ~c2_st~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse3 (not (= ~e_g~0 1))) (.cse4 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse16 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse11 (= ~c1_pc~0 1)) (.cse20 (not (= ~wb_st~0 0))) (.cse12 (not (= ~r_st~0 0))) (.cse13 (= ~c2_pc~0 1)) (.cse14 (not (= ~e_wl~0 0))) (.cse15 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= 2 ~wl_pc~0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse14 (= 0 ~wl_pc~0) .cse15) (let ((.cse19 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse17 .cse18 .cse2 (= .cse19 ~data~0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse10 .cse11 (= .cse19 ~c~0) .cse20 .cse12 .cse13 (= .cse19 ~c_t~0) .cse14 .cse15)) (let ((.cse21 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse21) .cse17 .cse18 .cse2 .cse3 .cse4 .cse5 .cse6 (<= .cse21 ~c~0) .cse7 (<= .cse21 ~c_t~0) .cse16 .cse8 .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 (= ~data~0 .cse21) (<= ~c~0 .cse21) .cse15)) (and .cse0 .cse1 .cse17 .cse18 .cse2 .cse3 .cse4 .cse6 .cse7 .cse16 .cse8 (= ~e_c~0 2) .cse9 .cse10 .cse11 .cse20 .cse12 .cse13 .cse14 .cse15))) [2021-10-21 20:13:03,670 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 493) no Hoare annotation was computed. [2021-10-21 20:13:03,670 INFO L857 garLoopResultBuilder]: For program point L456-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,670 INFO L857 garLoopResultBuilder]: For program point L291(lines 290 388) no Hoare annotation was computed. [2021-10-21 20:13:03,671 INFO L857 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2021-10-21 20:13:03,671 INFO L857 garLoopResultBuilder]: For program point L589(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,671 INFO L857 garLoopResultBuilder]: For program point L556(lines 556 560) no Hoare annotation was computed. [2021-10-21 20:13:03,671 INFO L857 garLoopResultBuilder]: For program point L556-2(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L853 garLoopResultBuilder]: At program point L358(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse47 .cse31 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point L226(lines 226 230) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point L94(lines 94 102) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point L61(lines 61 69) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point L590(lines 590 594) no Hoare annotation was computed. [2021-10-21 20:13:03,672 INFO L853 garLoopResultBuilder]: At program point L227(lines 222 249) the Hoare annotation is: (let ((.cse22 (= ~c2_st~0 0)) (.cse24 (= ~c1_st~0 0))) (let ((.cse13 (not .cse24)) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse14 (not .cse22)) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_e~0 1))) (.cse7 (not (= ~e_wl~0 1))) (.cse8 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse9 (= ~c2_i~0 1)) (.cse10 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse21 (= ~processed~0 0)) (.cse11 (not (= ~e_wl~0 0))) (.cse23 (+ ~t_b~0 1)) (.cse12 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (= 0 ~wl_pc~0) .cse12) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= (+ ~t_b~0 2) ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 .cse12) (and .cse0 .cse1 .cse13 .cse15 .cse22 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 (<= .cse23 ~data~0) .cse19 .cse20 .cse21 .cse11 (<= ~data~0 .cse23) .cse12) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse20 .cse11 .cse12) (and .cse0 .cse1 .cse14 .cse15 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse16 .cse9 .cse10 .cse17 .cse18 .cse19 .cse20 .cse21 .cse11 (= ~data~0 .cse23) .cse24 .cse12)))) [2021-10-21 20:13:03,672 INFO L857 garLoopResultBuilder]: For program point L95(lines 95 99) no Hoare annotation was computed. [2021-10-21 20:13:03,673 INFO L853 garLoopResultBuilder]: At program point L62(lines 57 127) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~wb_pc~0 1)) (.cse4 (not (= ~e_g~0 1))) (.cse5 (not (= ~e_e~0 0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~wb_st~0 0))) (.cse15 (not (= ~r_st~0 0))) (.cse16 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse18 (= 2 ~wl_pc~0)) (.cse19 (= ~wb_i~0 1))) (or (let ((.cse3 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse2 (= .cse3 ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= .cse3 ~c~0) .cse14 .cse15 .cse16 (= .cse3 ~d~0) (= .cse3 ~c_t~0) .cse17 .cse18 .cse19)) (let ((.cse20 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse20) .cse2 .cse4 .cse5 (<= ~d~0 .cse20) .cse6 (<= .cse20 ~c~0) .cse7 (<= .cse20 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= .cse20 ~data~0) .cse15 .cse16 .cse17 (<= ~c~0 .cse20) (<= .cse20 ~d~0) .cse18 (<= ~data~0 .cse20) .cse19)))) [2021-10-21 20:13:03,673 INFO L857 garLoopResultBuilder]: For program point L426-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,673 INFO L857 garLoopResultBuilder]: For program point L526-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,673 INFO L853 garLoopResultBuilder]: At program point L328(lines 290 388) the Hoare annotation is: (let ((.cse21 (= ~wb_st~0 0)) (.cse25 (= ~c2_st~0 0)) (.cse42 (= 2 ~wl_pc~0)) (.cse20 (= ~c1_st~0 0)) (.cse33 (+ ~t_b~0 1)) (.cse46 (+ ~t_b~0 2))) (let ((.cse45 (= .cse46 ~c~0)) (.cse47 (= .cse46 ~c_t~0)) (.cse40 (<= .cse33 ~c~0)) (.cse41 (<= ~c~0 .cse33)) (.cse44 (= .cse46 ~data~0)) (.cse38 (= ~data~0 ~t_b~0)) (.cse39 (= ULTIMATE.start_write_loop_~t~0 ~data~0)) (.cse48 (not (= ~e_c~0 0))) (.cse12 (= ~wb_pc~0 0)) (.cse34 (<= ~c_t~0 .cse33)) (.cse35 (<= .cse33 ~c_t~0)) (.cse36 (<= .cse33 ~data~0)) (.cse37 (<= ~data~0 .cse33)) (.cse27 (not .cse20)) (.cse29 (= ~c1_pc~0 1)) (.cse32 (not (= ~r_st~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse26 (= ~c2_pc~0 0)) (.cse9 (not .cse42)) (.cse1 (not (= ~e_g~0 0))) (.cse2 (= ~d~0 0)) (.cse3 (not .cse25)) (.cse28 (= ~wb_pc~0 1)) (.cse4 (= ~c1_pc~0 0)) (.cse5 (not (= ~e_g~0 1))) (.cse6 (= ~t_b~0 0)) (.cse7 (not (= ~e_e~0 0))) (.cse8 (= ~data~0 0)) (.cse10 (not (= ~r_i~0 1))) (.cse11 (not (= ~e_e~0 1))) (.cse13 (not (= ~e_wl~0 1))) (.cse14 (= ~c1_i~0 1)) (.cse15 (= ~e_c~0 2)) (.cse16 (= ~c2_i~0 1)) (.cse17 (= ~e_f~0 2)) (.cse30 (not .cse21)) (.cse18 (= ~c2_pc~0 1)) (.cse19 (= ~processed~0 0)) (.cse31 (not (= ~e_wl~0 0))) (.cse43 (= 0 ~wl_pc~0)) (.cse22 (= ~c_req_up~0 ~r_i~0)) (.cse23 (= ~wb_i~0 1)) (.cse24 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse31 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 (= ~data~0 .cse33) .cse20 .cse21 .cse23) (and .cse0 .cse1 .cse34 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse19 .cse31 .cse20 .cse23 .cse39) (and .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 (<= ~d~0 .cse33) .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse41 (<= .cse33 ~d~0) .cse42 .cse37 .cse23) (and .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse18 .cse19 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse32 .cse18 (= .cse46 ~d~0) .cse47 .cse31 .cse42 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse45 .cse30 .cse18 .cse47 .cse31 .cse23) (and .cse0 .cse1 .cse5 .cse7 .cse48 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse31 .cse43 .cse23) (and .cse0 .cse1 .cse27 .cse28 .cse25 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse36 .cse32 .cse18 .cse19 .cse31 .cse37 .cse21 .cse23) (and .cse1 .cse27 .cse2 .cse28 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse19 .cse31 .cse43 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse31 .cse20 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse40 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse18 .cse31 .cse41 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse32 .cse18 .cse19 .cse31 .cse21 .cse23) (and (<= 1 ~d~0) .cse6 (<= ~d~0 1) (<= 1 ~c~0) (<= 1 ~c_t~0) (<= ~c_t~0 1) (or (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse44 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse38 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse23 .cse39)) (<= ~c~0 1)) (and .cse0 .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse25 .cse26 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse31 .cse43 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse28 .cse5 .cse7 .cse48 .cse9 .cse10 .cse11 .cse13 .cse14 .cse16 .cse17 .cse29 .cse18 .cse31 .cse23) (and .cse0 .cse1 .cse27 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse21 .cse22 .cse23 .cse24) (and .cse0 .cse1 .cse34 .cse27 .cse28 .cse5 .cse7 .cse10 .cse11 .cse35 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse36 .cse32 .cse18 .cse31 .cse37 .cse23) (and .cse0 .cse1 .cse27 .cse3 .cse28 .cse5 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse30 .cse32 .cse18 .cse31 .cse22 .cse23) (and .cse0 .cse1 .cse2 .cse28 .cse25 .cse26 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse19 .cse20 .cse22 .cse23 .cse24) (and .cse1 .cse2 .cse3 .cse28 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse30 .cse18 .cse19 .cse31 .cse20 .cse43 .cse22 .cse23 .cse24)))) [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L295(lines 295 311) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L853 garLoopResultBuilder]: At program point L196-1(lines 177 217) the Hoare annotation is: (let ((.cse20 (= ~wb_st~0 0)) (.cse19 (= ~c1_st~0 0))) (let ((.cse18 (+ ~t_b~0 1)) (.cse32 (= ~wb_pc~0 0)) (.cse27 (= 0 ~wl_pc~0)) (.cse33 (not (= ~e_c~0 0))) (.cse30 (not .cse19)) (.cse13 (= ~c1_pc~0 1)) (.cse14 (not (= ~r_st~0 0))) (.cse15 (= ~c2_pc~0 1)) (.cse17 (not (= ~e_wl~0 0))) (.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse22 (= ~d~0 0)) (.cse2 (not (= ~c2_st~0 0))) (.cse3 (= ~wb_pc~0 1)) (.cse23 (= ~c1_pc~0 0)) (.cse4 (not (= ~e_g~0 1))) (.cse24 (= ~t_b~0 0)) (.cse5 (not (= ~e_e~0 0))) (.cse25 (= ~data~0 0)) (.cse31 (not (= 2 ~wl_pc~0))) (.cse6 (not (= ~r_i~0 1))) (.cse7 (not (= ~e_e~0 1))) (.cse8 (not (= ~e_wl~0 1))) (.cse9 (= ~c1_i~0 1)) (.cse10 (= ~e_c~0 2)) (.cse11 (= ~c2_i~0 1)) (.cse12 (= ~e_f~0 2)) (.cse26 (not .cse20)) (.cse16 (= ~processed~0 0)) (.cse28 (= ~c_req_up~0 ~r_i~0)) (.cse21 (= ~wb_i~0 1)) (.cse29 (= ~r_st~0 ~e_f~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= ~data~0 .cse18) .cse19 .cse20 .cse21) (and .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse17 .cse19 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 (<= ~c_t~0 .cse18) .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= .cse18 ~c_t~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 (<= .cse18 ~data~0) .cse14 .cse15 .cse17 (<= ~data~0 .cse18) .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse19 .cse20 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse4 .cse5 .cse33 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse17 .cse27 .cse21) (and .cse1 .cse22 .cse2 .cse23 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse32 .cse8 .cse9 .cse10 .cse11 .cse12 .cse16 .cse17 .cse19 .cse27 .cse20 .cse28 .cse21 .cse29) (and .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse17 .cse27 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse30 .cse2 .cse3 (= (+ ~t_b~0 2) ~data~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse21) (and .cse0 .cse1 .cse30 .cse22 .cse2 .cse3 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse16 .cse28 .cse21 .cse29) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse33 .cse31 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse15 .cse17 .cse21) (and .cse0 .cse1 .cse30 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse26 .cse14 .cse15 .cse17 .cse28 .cse21) (and .cse0 .cse1 .cse22 .cse2 .cse3 .cse23 .cse4 .cse24 .cse5 .cse25 .cse31 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse26 .cse16 .cse19 .cse28 .cse21 .cse29)))) [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 68) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L659(lines 659 675) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L626-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L362(lines 362 369) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-21 20:13:03,674 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L561-1(lines 537 677) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L462(lines 462 466) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L853 garLoopResultBuilder]: At program point L264(lines 257 274) the Hoare annotation is: (let ((.cse0 (not (= 0 ~wl_st~0))) (.cse1 (not (= ~e_g~0 0))) (.cse13 (not (= ~c1_st~0 0))) (.cse14 (not (= ~c2_st~0 0))) (.cse15 (= ~wb_pc~0 1)) (.cse2 (not (= ~e_g~0 1))) (.cse3 (not (= ~e_e~0 0))) (.cse4 (not (= ~e_c~0 0))) (.cse5 (not (= ~r_i~0 1))) (.cse6 (not (= ~e_wl~0 1))) (.cse7 (= ~c1_i~0 1)) (.cse16 (= ~e_c~0 2)) (.cse8 (= ~c2_i~0 1)) (.cse9 (= ~e_f~0 2)) (.cse17 (= ~c1_pc~0 1)) (.cse18 (not (= ~wb_st~0 0))) (.cse19 (not (= ~r_st~0 0))) (.cse20 (= ~c2_pc~0 1)) (.cse10 (not (= ~e_wl~0 0))) (.cse11 (= ~wb_i~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= 0 ~wl_pc~0) .cse11) (let ((.cse12 (+ ~t_b~0 1))) (and .cse0 .cse1 (<= ~c_t~0 .cse12) .cse13 .cse14 .cse15 .cse2 .cse3 .cse4 (<= ~d~0 .cse12) .cse5 (<= .cse12 ~c~0) (<= .cse12 ~c_t~0) .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 .cse18 (<= .cse12 ~data~0) .cse19 .cse20 .cse10 (<= ~c~0 .cse12) (<= .cse12 ~d~0) (<= ~data~0 .cse12) .cse11)) (and .cse0 .cse1 .cse15 .cse2 .cse3 .cse4 (not (= 2 ~wl_pc~0)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse19 .cse20 .cse10 .cse11) (let ((.cse21 (+ ~t_b~0 2))) (and .cse0 .cse1 .cse13 .cse14 .cse15 (= .cse21 ~data~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse16 .cse8 .cse9 .cse17 (= .cse21 ~c~0) .cse18 .cse19 .cse20 (= .cse21 ~d~0) (= .cse21 ~c_t~0) .cse10 .cse11)))) [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L298(lines 298 310) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L265(lines 257 274) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 207) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L199-1(lines 199 207) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L133(lines 133 141) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L662(lines 662 674) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L497(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L431-1(lines 398 682) no Hoare annotation was computed. [2021-10-21 20:13:03,675 INFO L857 garLoopResultBuilder]: For program point L332(lines 332 339) no Hoare annotation was computed. [2021-10-21 20:13:03,676 INFO L857 garLoopResultBuilder]: For program point L266(lines 266 270) no Hoare annotation was computed. [2021-10-21 20:13:03,676 INFO L857 garLoopResultBuilder]: For program point L200(lines 200 204) no Hoare annotation was computed. [2021-10-21 20:13:03,680 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 20:13:03,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 08:13:03 BoogieIcfgContainer [2021-10-21 20:13:03,859 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 20:13:03,860 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 20:13:03,860 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 20:13:03,860 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 20:13:03,861 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 08:11:46" (3/4) ... [2021-10-21 20:13:03,865 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-21 20:13:03,884 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-21 20:13:03,885 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-21 20:13:03,886 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:13:03,887 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-21 20:13:04,035 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 20:13:04,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 20:13:04,036 INFO L168 Benchmark]: Toolchain (without parser) took 78490.17 ms. Allocated memory was 123.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 93.3 MB in the beginning and 831.7 MB in the end (delta: -738.4 MB). Peak memory consumption was 979.7 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,037 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 90.2 MB. Free memory is still 50.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 20:13:04,037 INFO L168 Benchmark]: CACSL2BoogieTranslator took 450.00 ms. Allocated memory is still 123.7 MB. Free memory was 93.3 MB in the beginning and 96.0 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,038 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 123.7 MB. Free memory was 96.0 MB in the beginning and 93.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,038 INFO L168 Benchmark]: Boogie Preprocessor took 78.91 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 91.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,038 INFO L168 Benchmark]: RCFGBuilder took 710.20 ms. Allocated memory is still 123.7 MB. Free memory was 91.8 MB in the beginning and 71.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,039 INFO L168 Benchmark]: TraceAbstraction took 76985.59 ms. Allocated memory was 123.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 70.4 MB in the beginning and 856.0 MB in the end (delta: -785.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,039 INFO L168 Benchmark]: Witness Printer took 175.49 ms. Allocated memory is still 1.8 GB. Free memory was 855.0 MB in the beginning and 831.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-21 20:13:04,041 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.27 ms. Allocated memory is still 90.2 MB. Free memory is still 50.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 450.00 ms. Allocated memory is still 123.7 MB. Free memory was 93.3 MB in the beginning and 96.0 MB in the end (delta: -2.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 81.93 ms. Allocated memory is still 123.7 MB. Free memory was 96.0 MB in the beginning and 93.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.91 ms. Allocated memory is still 123.7 MB. Free memory was 93.9 MB in the beginning and 91.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 710.20 ms. Allocated memory is still 123.7 MB. Free memory was 91.8 MB in the beginning and 71.2 MB in the end (delta: 20.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 76985.59 ms. Allocated memory was 123.7 MB in the beginning and 1.8 GB in the end (delta: 1.7 GB). Free memory was 70.4 MB in the beginning and 856.0 MB in the end (delta: -785.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 175.49 ms. Allocated memory is still 1.8 GB. Free memory was 855.0 MB in the beginning and 831.7 MB in the end (delta: 23.3 MB). Peak memory consumption was 25.2 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 - PositiveResult [Line: 15]: 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 CFG has 1 procedures, 126 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76736.4ms, OverallIterations: 37, TraceHistogramMax: 10, EmptinessCheckTime: 147.0ms, AutomataDifference: 12544.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 47797.3ms, InitialAbstractionConstructionTime: 14.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 7966 SDtfs, 10702 SDslu, 14350 SDs, 0 SdLazy, 1550 SolverSat, 298 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1321.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 765 SyntacticMatches, 4 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1402.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5290occurred in iteration=21, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 8104.7ms AutomataMinimizationTime, 37 MinimizatonAttempts, 7464 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 20 LocationsWithAnnotation, 20 PreInvPairs, 867 NumberOfFragments, 21159 HoareAnnotationTreeSize, 20 FomulaSimplifications, 28919915 FormulaSimplificationTreeSizeReduction, 8745.3ms HoareSimplificationTime, 20 FomulaSimplificationsInter, 1256104 FormulaSimplificationTreeSizeReductionInter, 39014.4ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 211.2ms SsaConstructionTime, 645.1ms SatisfiabilityAnalysisTime, 5656.8ms InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4357 ConstructedInterpolants, 0 QuantifiedInterpolants, 11459 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1821 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 2353/2774 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 1 specifications checked. All of them hold - InvariantResult [Line: 395]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) && 2 == wl_pc) - InvariantResult [Line: 461]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && c2_st == 0) && !(r_i == 1)) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) || (((((((((((((((((((((d == 0 && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && t_b == 0) && data == 0) && !(r_i == 1)) && wb_pc == 0) && e_g == e_f) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_wl == e_c) && e_f == 2) && processed == 0) && e_e == e_f) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && c <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c1_st == 0) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1) && t == data)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 222]: Loop Invariant Derived loop invariant: ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_i == 1) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: ((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1) || (((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 684]: Loop Invariant Derived loop invariant: c2_i == 1 - InvariantResult [Line: 281]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((c_t <= t_b + 1 && t_b + 1 <= c_t) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && t_b + 1 <= data) && data <= t_b + 1)) || (((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data) || (((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && c1_st == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data == t_b + 1) && c1_st == 0) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && wb_i == 1) && t == data)) || (((((((((((((((((((((((((((!(e_g == 0) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && d <= t_b + 1) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && t_b + 1 <= d) && 2 == wl_pc) && data <= t_b + 1) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || (((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == d) && t_b + 2 == c_t) && !(e_wl == 0)) && 2 == wl_pc) && wb_i == 1)) || (((((((1 <= d && t_b == 0) && d <= 1) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 2 == c) && !(wb_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || (((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && !(e_wl == 0)) && 0 == wl_pc) && wb_i == 1)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && wb_pc == 1) && c2_st == 0) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && data <= t_b + 1) && wb_st == 0) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && t_b + 2 == c_t) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && t_b + 1 <= c) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && c2_pc == 1) && !(e_wl == 0)) && c <= t_b + 1) && data <= t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(r_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && wb_st == 0) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && c2_st == 0) && c2_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && 0 == wl_pc) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(e_c == 0)) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && d == 0) && !(c2_st == 0)) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && wb_pc == 0) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && c2_pc == 1) && processed == 0) && wb_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && c_t <= t_b + 1) && !(c1_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && t_b + 1 <= c_t) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && t_b + 1 <= data) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data <= t_b + 1) && wb_i == 1)) || ((((((d == 0 && t_b == 0) && 1 <= c) && 1 <= c_t) && c_t <= 1) && ((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && t_b + 2 == data) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && data == t_b + 1) && wb_i == 1)) || (((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && data == t_b) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && wb_i == 1) && t == data))) && c <= 1)) || ((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && !(c1_st == 0)) && !(c2_st == 0)) && wb_pc == 1) && !(e_g == 1)) && !(e_e == 0)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && c1_pc == 1) && !(wb_st == 0)) && !(r_st == 0)) && c2_pc == 1) && !(e_wl == 0)) && c_req_up == r_i) && wb_i == 1)) || ((((((((((((((((((((((((!(0 == wl_st) && !(e_g == 0)) && d == 0) && wb_pc == 1) && c2_st == 0) && c2_pc == 0) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(2 == wl_pc)) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && processed == 0) && c1_st == 0) && c_req_up == r_i) && wb_i == 1) && r_st == e_f)) || ((((((((((((((((((((((((!(e_g == 0) && d == 0) && !(c2_st == 0)) && wb_pc == 1) && c1_pc == 0) && !(e_g == 1)) && t_b == 0) && !(e_e == 0)) && data == 0) && !(r_i == 1)) && !(e_e == 1)) && !(e_wl == 1)) && c1_i == 1) && e_c == 2) && c2_i == 1) && e_f == 2) && !(wb_st == 0)) && c2_pc == 1) && processed == 0) && !(e_wl == 0)) && c1_st == 0) && 0 == wl_pc) && c_req_up == r_i) && wb_i == 1) && r_st == e_f) RESULT: Ultimate proved your program to be correct! [2021-10-21 20:13:04,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4cdd5ede-22be-4d24-b8c7-07ed25eb55fa/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...