./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb52621d262b2a79ebd79f9601fb8103d2f4f11e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 14:36:52,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:36:52,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:36:52,357 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:36:52,357 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:36:52,358 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:36:52,358 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:36:52,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:36:52,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:36:52,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:36:52,361 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:36:52,361 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:36:52,362 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:36:52,362 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:36:52,363 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:36:52,363 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:36:52,364 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:36:52,365 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:36:52,366 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:36:52,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:36:52,368 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:36:52,369 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:36:52,370 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:36:52,370 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:36:52,370 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:36:52,371 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:36:52,372 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:36:52,372 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:36:52,373 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:36:52,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:36:52,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:36:52,374 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:36:52,374 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:36:52,374 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:36:52,375 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:36:52,375 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:36:52,375 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 14:36:52,383 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:36:52,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:36:52,383 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 14:36:52,384 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 14:36:52,384 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:36:52,384 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:36:52,384 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:36:52,384 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 14:36:52,385 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 14:36:52,386 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 14:36:52,386 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:36:52,386 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:36:52,386 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 14:36:52,386 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:36:52,386 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 14:36:52,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 14:36:52,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:36:52,388 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 14:36:52,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 14:36:52,388 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer 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(__VERIFIER_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 -> bb52621d262b2a79ebd79f9601fb8103d2f4f11e [2018-12-01 14:36:52,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:36:52,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:36:52,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:36:52,420 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:36:52,420 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:36:52,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-01 14:36:52,462 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/data/bd35dbb29/24060a887f2b406ba706c01f56b8ccea/FLAG6606c449b [2018-12-01 14:36:52,881 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:36:52,881 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-12-01 14:36:52,886 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/data/bd35dbb29/24060a887f2b406ba706c01f56b8ccea/FLAG6606c449b [2018-12-01 14:36:52,894 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/data/bd35dbb29/24060a887f2b406ba706c01f56b8ccea [2018-12-01 14:36:52,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:36:52,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:36:52,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:36:52,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:36:52,899 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:36:52,899 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:36:52" (1/1) ... [2018-12-01 14:36:52,901 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a86b9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:52, skipping insertion in model container [2018-12-01 14:36:52,901 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:36:52" (1/1) ... [2018-12-01 14:36:52,906 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:36:52,921 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:36:53,029 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:36:53,032 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:36:53,055 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:36:53,064 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:36:53,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53 WrapperNode [2018-12-01 14:36:53,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:36:53,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:36:53,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:36:53,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:36:53,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,109 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:36:53,109 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:36:53,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:36:53,109 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:36:53,117 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,131 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,132 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... [2018-12-01 14:36:53,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:36:53,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:36:53,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:36:53,134 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:36:53,135 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 14:36:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 14:36:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-12-01 14:36:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-12-01 14:36:53,168 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-12-01 14:36:53,168 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-12-01 14:36:53,169 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-12-01 14:36:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-12-01 14:36:53,169 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-12-01 14:36:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-12-01 14:36:53,169 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-12-01 14:36:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-12-01 14:36:53,169 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-12-01 14:36:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-12-01 14:36:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-12-01 14:36:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-12-01 14:36:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-12-01 14:36:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:36:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:36:53,170 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-12-01 14:36:53,170 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-12-01 14:36:53,427 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:36:53,427 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-01 14:36:53,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:36:53 BoogieIcfgContainer [2018-12-01 14:36:53,427 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:36:53,428 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 14:36:53,428 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 14:36:53,430 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 14:36:53,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 02:36:52" (1/3) ... [2018-12-01 14:36:53,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651ea488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:36:53, skipping insertion in model container [2018-12-01 14:36:53,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:36:53" (2/3) ... [2018-12-01 14:36:53,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@651ea488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 02:36:53, skipping insertion in model container [2018-12-01 14:36:53,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:36:53" (3/3) ... [2018-12-01 14:36:53,432 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-12-01 14:36:53,438 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 14:36:53,442 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 14:36:53,451 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 14:36:53,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:36:53,472 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 14:36:53,472 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 14:36:53,472 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 14:36:53,472 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:36:53,472 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:36:53,473 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 14:36:53,473 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:36:53,473 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 14:36:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2018-12-01 14:36:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-01 14:36:53,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:53,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:36:53,494 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:53,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1449059025, now seen corresponding path program 1 times [2018-12-01 14:36:53,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:53,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:53,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:36:53,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:36:53,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 14:36:53,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:36:53,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:36:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:36:53,695 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 4 states. [2018-12-01 14:36:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:53,791 INFO L93 Difference]: Finished difference Result 265 states and 367 transitions. [2018-12-01 14:36:53,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:36:53,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-01 14:36:53,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:53,799 INFO L225 Difference]: With dead ends: 265 [2018-12-01 14:36:53,799 INFO L226 Difference]: Without dead ends: 134 [2018-12-01 14:36:53,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:36:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-01 14:36:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-01 14:36:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-01 14:36:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2018-12-01 14:36:53,834 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 58 [2018-12-01 14:36:53,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:53,836 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2018-12-01 14:36:53,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:36:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2018-12-01 14:36:53,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-01 14:36:53,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:53,839 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:53,839 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:53,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:53,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1447129993, now seen corresponding path program 1 times [2018-12-01 14:36:53,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:53,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:53,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:53,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 14:36:53,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:53,922 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:53,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:54,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:54,090 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-01 14:36:54,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:36:54,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-01 14:36:54,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:36:54,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:36:54,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:36:54,116 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand 8 states. [2018-12-01 14:36:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:54,578 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2018-12-01 14:36:54,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:36:54,578 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-01 14:36:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:54,581 INFO L225 Difference]: With dead ends: 429 [2018-12-01 14:36:54,581 INFO L226 Difference]: Without dead ends: 313 [2018-12-01 14:36:54,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:36:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-12-01 14:36:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 293. [2018-12-01 14:36:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-12-01 14:36:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 402 transitions. [2018-12-01 14:36:54,604 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 402 transitions. Word has length 125 [2018-12-01 14:36:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:54,604 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 402 transitions. [2018-12-01 14:36:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:36:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 402 transitions. [2018-12-01 14:36:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 14:36:54,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:54,607 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:54,607 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:54,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash -375876485, now seen corresponding path program 1 times [2018-12-01 14:36:54,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:54,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:54,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:54,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 14:36:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:54,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:54,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:54,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 14:36:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:36:54,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-01 14:36:54,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:36:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:36:54,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:36:54,794 INFO L87 Difference]: Start difference. First operand 293 states and 402 transitions. Second operand 8 states. [2018-12-01 14:36:55,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:55,520 INFO L93 Difference]: Finished difference Result 1253 states and 1967 transitions. [2018-12-01 14:36:55,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-01 14:36:55,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-01 14:36:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:55,525 INFO L225 Difference]: With dead ends: 1253 [2018-12-01 14:36:55,525 INFO L226 Difference]: Without dead ends: 983 [2018-12-01 14:36:55,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-12-01 14:36:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-12-01 14:36:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 809. [2018-12-01 14:36:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-12-01 14:36:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1125 transitions. [2018-12-01 14:36:55,579 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1125 transitions. Word has length 127 [2018-12-01 14:36:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:55,580 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1125 transitions. [2018-12-01 14:36:55,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:36:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1125 transitions. [2018-12-01 14:36:55,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-01 14:36:55,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:55,583 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:55,583 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:55,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:55,584 INFO L82 PathProgramCache]: Analyzing trace with hash 819663487, now seen corresponding path program 1 times [2018-12-01 14:36:55,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:55,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:55,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:55,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:55,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 14:36:55,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:55,654 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:55,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:55,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:55,782 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-01 14:36:55,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:36:55,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-01 14:36:55,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 14:36:55,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 14:36:55,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:36:55,798 INFO L87 Difference]: Start difference. First operand 809 states and 1125 transitions. Second operand 9 states. [2018-12-01 14:36:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:56,775 INFO L93 Difference]: Finished difference Result 3001 states and 4899 transitions. [2018-12-01 14:36:56,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 14:36:56,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2018-12-01 14:36:56,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:56,783 INFO L225 Difference]: With dead ends: 3001 [2018-12-01 14:36:56,783 INFO L226 Difference]: Without dead ends: 2245 [2018-12-01 14:36:56,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-12-01 14:36:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2018-12-01 14:36:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1929. [2018-12-01 14:36:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2018-12-01 14:36:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2749 transitions. [2018-12-01 14:36:56,863 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2749 transitions. Word has length 127 [2018-12-01 14:36:56,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:56,863 INFO L480 AbstractCegarLoop]: Abstraction has 1929 states and 2749 transitions. [2018-12-01 14:36:56,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 14:36:56,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2749 transitions. [2018-12-01 14:36:56,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-01 14:36:56,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:56,868 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:56,868 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:56,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:56,868 INFO L82 PathProgramCache]: Analyzing trace with hash -928735401, now seen corresponding path program 1 times [2018-12-01 14:36:56,868 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:56,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:56,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:56,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 14:36:56,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:56,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:56,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:56,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 14:36:57,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:36:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-01 14:36:57,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 14:36:57,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 14:36:57,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:36:57,047 INFO L87 Difference]: Start difference. First operand 1929 states and 2749 transitions. Second operand 10 states. [2018-12-01 14:36:57,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:57,827 INFO L93 Difference]: Finished difference Result 6909 states and 11054 transitions. [2018-12-01 14:36:57,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 14:36:57,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2018-12-01 14:36:57,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:57,842 INFO L225 Difference]: With dead ends: 6909 [2018-12-01 14:36:57,842 INFO L226 Difference]: Without dead ends: 5073 [2018-12-01 14:36:57,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-01 14:36:57,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5073 states. [2018-12-01 14:36:58,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5073 to 4571. [2018-12-01 14:36:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4571 states. [2018-12-01 14:36:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4571 states to 4571 states and 6649 transitions. [2018-12-01 14:36:58,018 INFO L78 Accepts]: Start accepts. Automaton has 4571 states and 6649 transitions. Word has length 129 [2018-12-01 14:36:58,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:58,018 INFO L480 AbstractCegarLoop]: Abstraction has 4571 states and 6649 transitions. [2018-12-01 14:36:58,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 14:36:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 4571 states and 6649 transitions. [2018-12-01 14:36:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 14:36:58,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:58,028 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:58,028 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:58,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -536671115, now seen corresponding path program 1 times [2018-12-01 14:36:58,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:58,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:58,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 14:36:58,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:58,074 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:58,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:58,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-01 14:36:58,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:36:58,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-12-01 14:36:58,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 14:36:58,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 14:36:58,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:36:58,194 INFO L87 Difference]: Start difference. First operand 4571 states and 6649 transitions. Second operand 10 states. [2018-12-01 14:36:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:36:59,122 INFO L93 Difference]: Finished difference Result 13745 states and 20964 transitions. [2018-12-01 14:36:59,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 14:36:59,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-12-01 14:36:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:36:59,157 INFO L225 Difference]: With dead ends: 13745 [2018-12-01 14:36:59,157 INFO L226 Difference]: Without dead ends: 9379 [2018-12-01 14:36:59,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-12-01 14:36:59,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9379 states. [2018-12-01 14:36:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9379 to 9123. [2018-12-01 14:36:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9123 states. [2018-12-01 14:36:59,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9123 states to 9123 states and 12940 transitions. [2018-12-01 14:36:59,539 INFO L78 Accepts]: Start accepts. Automaton has 9123 states and 12940 transitions. Word has length 131 [2018-12-01 14:36:59,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:36:59,539 INFO L480 AbstractCegarLoop]: Abstraction has 9123 states and 12940 transitions. [2018-12-01 14:36:59,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 14:36:59,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9123 states and 12940 transitions. [2018-12-01 14:36:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 14:36:59,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:36:59,559 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:36:59,559 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:36:59,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:36:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash 2058913133, now seen corresponding path program 1 times [2018-12-01 14:36:59,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:36:59,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:36:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:36:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:59,591 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:36:59,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:36:59,591 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:36:59,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:36:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:36:59,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:36:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:36:59,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:36:59,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-12-01 14:36:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 14:36:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 14:36:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:36:59,724 INFO L87 Difference]: Start difference. First operand 9123 states and 12940 transitions. Second operand 10 states. [2018-12-01 14:37:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:00,084 INFO L93 Difference]: Finished difference Result 18593 states and 26234 transitions. [2018-12-01 14:37:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 14:37:00,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-12-01 14:37:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:00,121 INFO L225 Difference]: With dead ends: 18593 [2018-12-01 14:37:00,122 INFO L226 Difference]: Without dead ends: 9755 [2018-12-01 14:37:00,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-01 14:37:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9755 states. [2018-12-01 14:37:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9755 to 9403. [2018-12-01 14:37:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9403 states. [2018-12-01 14:37:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9403 states to 9403 states and 13244 transitions. [2018-12-01 14:37:00,467 INFO L78 Accepts]: Start accepts. Automaton has 9403 states and 13244 transitions. Word has length 131 [2018-12-01 14:37:00,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:00,467 INFO L480 AbstractCegarLoop]: Abstraction has 9403 states and 13244 transitions. [2018-12-01 14:37:00,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 14:37:00,467 INFO L276 IsEmpty]: Start isEmpty. Operand 9403 states and 13244 transitions. [2018-12-01 14:37:00,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 14:37:00,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:00,482 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:00,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:00,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:00,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1681610611, now seen corresponding path program 1 times [2018-12-01 14:37:00,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:00,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:00,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:00,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:00,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-01 14:37:00,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:00,523 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:00,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:00,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-01 14:37:00,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:00,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-12-01 14:37:00,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:37:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:37:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:37:00,619 INFO L87 Difference]: Start difference. First operand 9403 states and 13244 transitions. Second operand 7 states. [2018-12-01 14:37:01,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:01,269 INFO L93 Difference]: Finished difference Result 21478 states and 31422 transitions. [2018-12-01 14:37:01,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 14:37:01,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-12-01 14:37:01,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:01,299 INFO L225 Difference]: With dead ends: 21478 [2018-12-01 14:37:01,300 INFO L226 Difference]: Without dead ends: 12392 [2018-12-01 14:37:01,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:37:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2018-12-01 14:37:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 11768. [2018-12-01 14:37:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2018-12-01 14:37:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 16242 transitions. [2018-12-01 14:37:01,803 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 16242 transitions. Word has length 131 [2018-12-01 14:37:01,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:01,803 INFO L480 AbstractCegarLoop]: Abstraction has 11768 states and 16242 transitions. [2018-12-01 14:37:01,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:37:01,803 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 16242 transitions. [2018-12-01 14:37:01,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 14:37:01,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:01,820 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:01,820 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:01,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:01,820 INFO L82 PathProgramCache]: Analyzing trace with hash 660542257, now seen corresponding path program 1 times [2018-12-01 14:37:01,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:01,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-01 14:37:01,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:37:01,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 14:37:01,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 14:37:01,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 14:37:01,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 14:37:01,864 INFO L87 Difference]: Start difference. First operand 11768 states and 16242 transitions. Second operand 6 states. [2018-12-01 14:37:02,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:02,163 INFO L93 Difference]: Finished difference Result 22908 states and 31054 transitions. [2018-12-01 14:37:02,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:37:02,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 131 [2018-12-01 14:37:02,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:02,187 INFO L225 Difference]: With dead ends: 22908 [2018-12-01 14:37:02,187 INFO L226 Difference]: Without dead ends: 11864 [2018-12-01 14:37:02,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:37:02,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2018-12-01 14:37:02,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 11768. [2018-12-01 14:37:02,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2018-12-01 14:37:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 16210 transitions. [2018-12-01 14:37:02,649 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 16210 transitions. Word has length 131 [2018-12-01 14:37:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:02,649 INFO L480 AbstractCegarLoop]: Abstraction has 11768 states and 16210 transitions. [2018-12-01 14:37:02,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 14:37:02,650 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 16210 transitions. [2018-12-01 14:37:02,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-01 14:37:02,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:02,663 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:02,663 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:02,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1361606835, now seen corresponding path program 1 times [2018-12-01 14:37:02,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:02,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:02,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:02,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:02,704 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:02,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:02,705 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:02,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:02,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:02,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:02,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-12-01 14:37:02,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-01 14:37:02,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 14:37:02,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:37:02,827 INFO L87 Difference]: Start difference. First operand 11768 states and 16210 transitions. Second operand 9 states. [2018-12-01 14:37:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:03,594 INFO L93 Difference]: Finished difference Result 27480 states and 37877 transitions. [2018-12-01 14:37:03,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 14:37:03,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-12-01 14:37:03,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:03,623 INFO L225 Difference]: With dead ends: 27480 [2018-12-01 14:37:03,624 INFO L226 Difference]: Without dead ends: 16010 [2018-12-01 14:37:03,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-12-01 14:37:03,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16010 states. [2018-12-01 14:37:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16010 to 12605. [2018-12-01 14:37:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12605 states. [2018-12-01 14:37:04,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12605 states to 12605 states and 17404 transitions. [2018-12-01 14:37:04,210 INFO L78 Accepts]: Start accepts. Automaton has 12605 states and 17404 transitions. Word has length 131 [2018-12-01 14:37:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:04,211 INFO L480 AbstractCegarLoop]: Abstraction has 12605 states and 17404 transitions. [2018-12-01 14:37:04,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-01 14:37:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 12605 states and 17404 transitions. [2018-12-01 14:37:04,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-01 14:37:04,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:04,228 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-12-01 14:37:04,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:04,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:04,228 INFO L82 PathProgramCache]: Analyzing trace with hash 602442252, now seen corresponding path program 1 times [2018-12-01 14:37:04,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:04,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:04,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:04,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-01 14:37:04,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:04,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:04,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:04,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-01 14:37:04,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:04,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-12-01 14:37:04,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-01 14:37:04,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 14:37:04,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-01 14:37:04,437 INFO L87 Difference]: Start difference. First operand 12605 states and 17404 transitions. Second operand 10 states. [2018-12-01 14:37:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:05,695 INFO L93 Difference]: Finished difference Result 34512 states and 47809 transitions. [2018-12-01 14:37:05,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:37:05,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2018-12-01 14:37:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:05,731 INFO L225 Difference]: With dead ends: 34512 [2018-12-01 14:37:05,731 INFO L226 Difference]: Without dead ends: 22355 [2018-12-01 14:37:05,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-01 14:37:05,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22355 states. [2018-12-01 14:37:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22355 to 20939. [2018-12-01 14:37:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20939 states. [2018-12-01 14:37:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20939 states to 20939 states and 28608 transitions. [2018-12-01 14:37:06,487 INFO L78 Accepts]: Start accepts. Automaton has 20939 states and 28608 transitions. Word has length 140 [2018-12-01 14:37:06,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:06,487 INFO L480 AbstractCegarLoop]: Abstraction has 20939 states and 28608 transitions. [2018-12-01 14:37:06,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-01 14:37:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20939 states and 28608 transitions. [2018-12-01 14:37:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-01 14:37:06,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:06,514 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-12-01 14:37:06,514 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:06,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1970522358, now seen corresponding path program 1 times [2018-12-01 14:37:06,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:06,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:06,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:06,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-01 14:37:06,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:06,631 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:06,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:06,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-01 14:37:06,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:06,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-12-01 14:37:06,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-01 14:37:06,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-01 14:37:06,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-12-01 14:37:06,809 INFO L87 Difference]: Start difference. First operand 20939 states and 28608 transitions. Second operand 18 states. [2018-12-01 14:37:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:08,749 INFO L93 Difference]: Finished difference Result 43716 states and 62996 transitions. [2018-12-01 14:37:08,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-01 14:37:08,749 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 140 [2018-12-01 14:37:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:08,801 INFO L225 Difference]: With dead ends: 43716 [2018-12-01 14:37:08,801 INFO L226 Difference]: Without dead ends: 23181 [2018-12-01 14:37:08,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-12-01 14:37:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23181 states. [2018-12-01 14:37:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23181 to 19969. [2018-12-01 14:37:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19969 states. [2018-12-01 14:37:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19969 states to 19969 states and 27198 transitions. [2018-12-01 14:37:09,683 INFO L78 Accepts]: Start accepts. Automaton has 19969 states and 27198 transitions. Word has length 140 [2018-12-01 14:37:09,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:09,683 INFO L480 AbstractCegarLoop]: Abstraction has 19969 states and 27198 transitions. [2018-12-01 14:37:09,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-01 14:37:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 19969 states and 27198 transitions. [2018-12-01 14:37:09,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-01 14:37:09,702 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:09,702 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:09,703 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:09,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2053428502, now seen corresponding path program 1 times [2018-12-01 14:37:09,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:09,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:09,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:09,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:09,763 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:09,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:09,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:09,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:09,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:09,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:09,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-01 14:37:09,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 14:37:09,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 14:37:09,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:37:09,883 INFO L87 Difference]: Start difference. First operand 19969 states and 27198 transitions. Second operand 11 states. [2018-12-01 14:37:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:10,921 INFO L93 Difference]: Finished difference Result 35999 states and 49733 transitions. [2018-12-01 14:37:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 14:37:10,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 141 [2018-12-01 14:37:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:10,953 INFO L225 Difference]: With dead ends: 35999 [2018-12-01 14:37:10,953 INFO L226 Difference]: Without dead ends: 16260 [2018-12-01 14:37:10,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-01 14:37:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16260 states. [2018-12-01 14:37:11,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16260 to 15806. [2018-12-01 14:37:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15806 states. [2018-12-01 14:37:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15806 states to 15806 states and 20555 transitions. [2018-12-01 14:37:11,689 INFO L78 Accepts]: Start accepts. Automaton has 15806 states and 20555 transitions. Word has length 141 [2018-12-01 14:37:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:11,690 INFO L480 AbstractCegarLoop]: Abstraction has 15806 states and 20555 transitions. [2018-12-01 14:37:11,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 14:37:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 15806 states and 20555 transitions. [2018-12-01 14:37:11,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 14:37:11,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:11,701 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:11,701 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:11,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:11,701 INFO L82 PathProgramCache]: Analyzing trace with hash 684967753, now seen corresponding path program 1 times [2018-12-01 14:37:11,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:11,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:11,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:11,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:11,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-01 14:37:11,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:11,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:11,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:11,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-01 14:37:11,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:11,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-01 14:37:11,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:37:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:37:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:37:11,827 INFO L87 Difference]: Start difference. First operand 15806 states and 20555 transitions. Second operand 4 states. [2018-12-01 14:37:12,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:12,531 INFO L93 Difference]: Finished difference Result 30758 states and 40353 transitions. [2018-12-01 14:37:12,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:37:12,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-01 14:37:12,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:12,557 INFO L225 Difference]: With dead ends: 30758 [2018-12-01 14:37:12,557 INFO L226 Difference]: Without dead ends: 15448 [2018-12-01 14:37:12,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:37:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15448 states. [2018-12-01 14:37:13,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15448 to 15448. [2018-12-01 14:37:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15448 states. [2018-12-01 14:37:13,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15448 states to 15448 states and 19823 transitions. [2018-12-01 14:37:13,233 INFO L78 Accepts]: Start accepts. Automaton has 15448 states and 19823 transitions. Word has length 146 [2018-12-01 14:37:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:13,233 INFO L480 AbstractCegarLoop]: Abstraction has 15448 states and 19823 transitions. [2018-12-01 14:37:13,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:37:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 15448 states and 19823 transitions. [2018-12-01 14:37:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-01 14:37:13,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:13,245 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:13,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:13,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:13,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1924800119, now seen corresponding path program 1 times [2018-12-01 14:37:13,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:13,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:13,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:13,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:13,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:13,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:13,298 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:13,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:13,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:13,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-12-01 14:37:13,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-01 14:37:13,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-01 14:37:13,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:37:13,439 INFO L87 Difference]: Start difference. First operand 15448 states and 19823 transitions. Second operand 11 states. [2018-12-01 14:37:14,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:14,370 INFO L93 Difference]: Finished difference Result 28479 states and 36942 transitions. [2018-12-01 14:37:14,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 14:37:14,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 146 [2018-12-01 14:37:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:14,393 INFO L225 Difference]: With dead ends: 28479 [2018-12-01 14:37:14,393 INFO L226 Difference]: Without dead ends: 13634 [2018-12-01 14:37:14,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-12-01 14:37:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13634 states. [2018-12-01 14:37:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13634 to 13362. [2018-12-01 14:37:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13362 states. [2018-12-01 14:37:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13362 states to 13362 states and 16664 transitions. [2018-12-01 14:37:14,973 INFO L78 Accepts]: Start accepts. Automaton has 13362 states and 16664 transitions. Word has length 146 [2018-12-01 14:37:14,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:14,973 INFO L480 AbstractCegarLoop]: Abstraction has 13362 states and 16664 transitions. [2018-12-01 14:37:14,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-01 14:37:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 13362 states and 16664 transitions. [2018-12-01 14:37:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-01 14:37:14,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:14,982 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2018-12-01 14:37:14,982 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1441746548, now seen corresponding path program 1 times [2018-12-01 14:37:14,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:14,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:14,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-01 14:37:15,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:15,021 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:15,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:15,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:15,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-01 14:37:15,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:15,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-12-01 14:37:15,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 14:37:15,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:37:15,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:37:15,135 INFO L87 Difference]: Start difference. First operand 13362 states and 16664 transitions. Second operand 4 states. [2018-12-01 14:37:15,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:15,845 INFO L93 Difference]: Finished difference Result 24820 states and 31263 transitions. [2018-12-01 14:37:15,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 14:37:15,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-01 14:37:15,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:15,867 INFO L225 Difference]: With dead ends: 24820 [2018-12-01 14:37:15,867 INFO L226 Difference]: Without dead ends: 12362 [2018-12-01 14:37:15,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:37:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12362 states. [2018-12-01 14:37:16,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12362 to 12362. [2018-12-01 14:37:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12362 states. [2018-12-01 14:37:16,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12362 states to 12362 states and 15136 transitions. [2018-12-01 14:37:16,404 INFO L78 Accepts]: Start accepts. Automaton has 12362 states and 15136 transitions. Word has length 151 [2018-12-01 14:37:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:16,404 INFO L480 AbstractCegarLoop]: Abstraction has 12362 states and 15136 transitions. [2018-12-01 14:37:16,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 14:37:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 12362 states and 15136 transitions. [2018-12-01 14:37:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-01 14:37:16,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:16,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2018-12-01 14:37:16,412 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:16,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:16,413 INFO L82 PathProgramCache]: Analyzing trace with hash 2143321140, now seen corresponding path program 1 times [2018-12-01 14:37:16,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:16,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:16,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:16,477 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-01 14:37:16,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:37:16,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 14:37:16,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 14:37:16,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 14:37:16,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 14:37:16,478 INFO L87 Difference]: Start difference. First operand 12362 states and 15136 transitions. Second operand 5 states. [2018-12-01 14:37:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:18,252 INFO L93 Difference]: Finished difference Result 42715 states and 52598 transitions. [2018-12-01 14:37:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 14:37:18,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2018-12-01 14:37:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:18,295 INFO L225 Difference]: With dead ends: 42715 [2018-12-01 14:37:18,295 INFO L226 Difference]: Without dead ends: 32489 [2018-12-01 14:37:18,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:37:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32489 states. [2018-12-01 14:37:19,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32489 to 32483. [2018-12-01 14:37:19,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32483 states. [2018-12-01 14:37:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32483 states to 32483 states and 39667 transitions. [2018-12-01 14:37:19,784 INFO L78 Accepts]: Start accepts. Automaton has 32483 states and 39667 transitions. Word has length 151 [2018-12-01 14:37:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:19,785 INFO L480 AbstractCegarLoop]: Abstraction has 32483 states and 39667 transitions. [2018-12-01 14:37:19,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 14:37:19,785 INFO L276 IsEmpty]: Start isEmpty. Operand 32483 states and 39667 transitions. [2018-12-01 14:37:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-01 14:37:19,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:19,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:19,805 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:19,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:19,806 INFO L82 PathProgramCache]: Analyzing trace with hash -91788150, now seen corresponding path program 1 times [2018-12-01 14:37:19,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:19,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:19,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-01 14:37:19,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:19,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:19,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:19,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-01 14:37:19,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:19,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-01 14:37:19,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:37:19,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:37:19,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:37:19,945 INFO L87 Difference]: Start difference. First operand 32483 states and 39667 transitions. Second operand 8 states. [2018-12-01 14:37:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:23,154 INFO L93 Difference]: Finished difference Result 94322 states and 117314 transitions. [2018-12-01 14:37:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 14:37:23,154 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 156 [2018-12-01 14:37:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:23,263 INFO L225 Difference]: With dead ends: 94322 [2018-12-01 14:37:23,263 INFO L226 Difference]: Without dead ends: 61971 [2018-12-01 14:37:23,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:37:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61971 states. [2018-12-01 14:37:25,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61971 to 53451. [2018-12-01 14:37:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53451 states. [2018-12-01 14:37:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53451 states to 53451 states and 63425 transitions. [2018-12-01 14:37:25,948 INFO L78 Accepts]: Start accepts. Automaton has 53451 states and 63425 transitions. Word has length 156 [2018-12-01 14:37:25,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:25,949 INFO L480 AbstractCegarLoop]: Abstraction has 53451 states and 63425 transitions. [2018-12-01 14:37:25,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:37:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 53451 states and 63425 transitions. [2018-12-01 14:37:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-01 14:37:25,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:25,966 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:25,967 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:25,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1891751974, now seen corresponding path program 1 times [2018-12-01 14:37:25,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:25,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:25,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-01 14:37:26,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:26,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:26,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:26,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 14:37:26,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:26,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-12-01 14:37:26,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 14:37:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 14:37:26,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-01 14:37:26,233 INFO L87 Difference]: Start difference. First operand 53451 states and 63425 transitions. Second operand 7 states. [2018-12-01 14:37:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:27,780 INFO L93 Difference]: Finished difference Result 80589 states and 96331 transitions. [2018-12-01 14:37:27,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:37:27,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2018-12-01 14:37:27,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:27,828 INFO L225 Difference]: With dead ends: 80589 [2018-12-01 14:37:27,828 INFO L226 Difference]: Without dead ends: 27927 [2018-12-01 14:37:27,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-01 14:37:27,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27927 states. [2018-12-01 14:37:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27927 to 20780. [2018-12-01 14:37:29,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-01 14:37:29,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 24642 transitions. [2018-12-01 14:37:29,045 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 24642 transitions. Word has length 173 [2018-12-01 14:37:29,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:29,046 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 24642 transitions. [2018-12-01 14:37:29,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 14:37:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 24642 transitions. [2018-12-01 14:37:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 14:37:29,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:29,056 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:29,057 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:29,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:29,057 INFO L82 PathProgramCache]: Analyzing trace with hash -461567596, now seen corresponding path program 1 times [2018-12-01 14:37:29,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:29,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:29,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:29,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:29,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-12-01 14:37:29,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:37:29,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:37:29,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 14:37:29,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 14:37:29,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:37:29,086 INFO L87 Difference]: Start difference. First operand 20780 states and 24642 transitions. Second operand 3 states. [2018-12-01 14:37:30,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:30,226 INFO L93 Difference]: Finished difference Result 41078 states and 48881 transitions. [2018-12-01 14:37:30,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 14:37:30,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-12-01 14:37:30,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:30,256 INFO L225 Difference]: With dead ends: 41078 [2018-12-01 14:37:30,256 INFO L226 Difference]: Without dead ends: 20954 [2018-12-01 14:37:30,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 14:37:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20954 states. [2018-12-01 14:37:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20954 to 20780. [2018-12-01 14:37:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20780 states. [2018-12-01 14:37:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20780 states to 20780 states and 24468 transitions. [2018-12-01 14:37:31,395 INFO L78 Accepts]: Start accepts. Automaton has 20780 states and 24468 transitions. Word has length 175 [2018-12-01 14:37:31,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:31,395 INFO L480 AbstractCegarLoop]: Abstraction has 20780 states and 24468 transitions. [2018-12-01 14:37:31,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 14:37:31,395 INFO L276 IsEmpty]: Start isEmpty. Operand 20780 states and 24468 transitions. [2018-12-01 14:37:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-01 14:37:31,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:31,402 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:31,402 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:31,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:31,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1491892827, now seen corresponding path program 1 times [2018-12-01 14:37:31,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:31,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:31,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:31,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-12-01 14:37:31,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:31,485 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:31,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:31,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 14:37:31,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:31,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-12-01 14:37:31,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-01 14:37:31,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-01 14:37:31,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:37:31,581 INFO L87 Difference]: Start difference. First operand 20780 states and 24468 transitions. Second operand 12 states. [2018-12-01 14:37:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:33,310 INFO L93 Difference]: Finished difference Result 38969 states and 46566 transitions. [2018-12-01 14:37:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 14:37:33,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2018-12-01 14:37:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:33,336 INFO L225 Difference]: With dead ends: 38969 [2018-12-01 14:37:33,336 INFO L226 Difference]: Without dead ends: 18638 [2018-12-01 14:37:33,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-12-01 14:37:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18638 states. [2018-12-01 14:37:34,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18638 to 11137. [2018-12-01 14:37:34,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11137 states. [2018-12-01 14:37:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11137 states to 11137 states and 12634 transitions. [2018-12-01 14:37:34,216 INFO L78 Accepts]: Start accepts. Automaton has 11137 states and 12634 transitions. Word has length 175 [2018-12-01 14:37:34,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:34,216 INFO L480 AbstractCegarLoop]: Abstraction has 11137 states and 12634 transitions. [2018-12-01 14:37:34,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-01 14:37:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11137 states and 12634 transitions. [2018-12-01 14:37:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-01 14:37:34,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:34,220 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:34,220 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:34,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:34,220 INFO L82 PathProgramCache]: Analyzing trace with hash -599778512, now seen corresponding path program 1 times [2018-12-01 14:37:34,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:34,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:34,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:34,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:34,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-01 14:37:34,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:34,260 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:34,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:34,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 14:37:34,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:34,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-12-01 14:37:34,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:37:34,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:37:34,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:37:34,386 INFO L87 Difference]: Start difference. First operand 11137 states and 12634 transitions. Second operand 8 states. [2018-12-01 14:37:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:35,043 INFO L93 Difference]: Finished difference Result 17599 states and 19975 transitions. [2018-12-01 14:37:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 14:37:35,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2018-12-01 14:37:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:35,053 INFO L225 Difference]: With dead ends: 17599 [2018-12-01 14:37:35,053 INFO L226 Difference]: Without dead ends: 6901 [2018-12-01 14:37:35,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 177 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-01 14:37:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states. [2018-12-01 14:37:35,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6258. [2018-12-01 14:37:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6258 states. [2018-12-01 14:37:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6258 states to 6258 states and 6989 transitions. [2018-12-01 14:37:35,539 INFO L78 Accepts]: Start accepts. Automaton has 6258 states and 6989 transitions. Word has length 176 [2018-12-01 14:37:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:35,539 INFO L480 AbstractCegarLoop]: Abstraction has 6258 states and 6989 transitions. [2018-12-01 14:37:35,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:37:35,539 INFO L276 IsEmpty]: Start isEmpty. Operand 6258 states and 6989 transitions. [2018-12-01 14:37:35,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-01 14:37:35,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:35,541 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:35,542 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:35,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1061132729, now seen corresponding path program 1 times [2018-12-01 14:37:35,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:35,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:35,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:35,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:35,577 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-12-01 14:37:35,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:35,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:35,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:35,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 14:37:35,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 14:37:35,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-01 14:37:35,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:37:35,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:37:35,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:37:35,688 INFO L87 Difference]: Start difference. First operand 6258 states and 6989 transitions. Second operand 8 states. [2018-12-01 14:37:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:37,243 INFO L93 Difference]: Finished difference Result 18802 states and 21448 transitions. [2018-12-01 14:37:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-01 14:37:37,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 177 [2018-12-01 14:37:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:37,264 INFO L225 Difference]: With dead ends: 18802 [2018-12-01 14:37:37,264 INFO L226 Difference]: Without dead ends: 14494 [2018-12-01 14:37:37,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-12-01 14:37:37,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14494 states. [2018-12-01 14:37:38,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14494 to 8604. [2018-12-01 14:37:38,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8604 states. [2018-12-01 14:37:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8604 states to 8604 states and 9633 transitions. [2018-12-01 14:37:38,127 INFO L78 Accepts]: Start accepts. Automaton has 8604 states and 9633 transitions. Word has length 177 [2018-12-01 14:37:38,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:38,127 INFO L480 AbstractCegarLoop]: Abstraction has 8604 states and 9633 transitions. [2018-12-01 14:37:38,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:37:38,127 INFO L276 IsEmpty]: Start isEmpty. Operand 8604 states and 9633 transitions. [2018-12-01 14:37:38,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-01 14:37:38,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 14:37:38,129 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:38,129 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 14:37:38,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:38,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1306155177, now seen corresponding path program 1 times [2018-12-01 14:37:38,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:38,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:38,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:38,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-12-01 14:37:38,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 14:37:38,167 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-01 14:37:38,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:38,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-01 14:37:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 14:37:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-12-01 14:37:38,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 14:37:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 14:37:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-01 14:37:38,274 INFO L87 Difference]: Start difference. First operand 8604 states and 9633 transitions. Second operand 8 states. [2018-12-01 14:37:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:38,482 INFO L93 Difference]: Finished difference Result 10041 states and 11178 transitions. [2018-12-01 14:37:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 14:37:38,482 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2018-12-01 14:37:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 14:37:38,483 INFO L225 Difference]: With dead ends: 10041 [2018-12-01 14:37:38,483 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 14:37:38,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-01 14:37:38,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 14:37:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 14:37:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 14:37:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 14:37:38,491 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2018-12-01 14:37:38,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 14:37:38,491 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:37:38,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 14:37:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 14:37:38,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 14:37:38,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 14:37:38,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,623 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,670 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,675 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,682 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:38,847 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 394 DAG size of output: 288 [2018-12-01 14:37:39,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,235 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 382 DAG size of output: 318 [2018-12-01 14:37:39,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,514 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,588 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 244 [2018-12-01 14:37:39,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,931 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,932 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,957 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:39,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:40,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:40,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:40,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:40,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:40,166 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 337 [2018-12-01 14:37:41,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:41,263 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 405 DAG size of output: 337 [2018-12-01 14:37:42,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:42,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:43,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:43,121 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 300 [2018-12-01 14:37:43,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,229 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 317 DAG size of output: 291 [2018-12-01 14:37:44,360 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 292 [2018-12-01 14:37:44,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:44,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-01 14:37:45,042 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 359 DAG size of output: 300 [2018-12-01 14:37:47,741 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 114 [2018-12-01 14:37:48,932 WARN L180 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 314 DAG size of output: 137 [2018-12-01 14:37:49,839 WARN L180 SmtUtils]: Spent 897.00 ms on a formula simplification. DAG size of input: 266 DAG size of output: 148 [2018-12-01 14:37:51,695 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 348 DAG size of output: 143 [2018-12-01 14:37:56,397 WARN L180 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 335 DAG size of output: 130 [2018-12-01 14:37:58,002 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 280 DAG size of output: 142 [2018-12-01 14:37:58,110 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2018-12-01 14:38:01,527 WARN L180 SmtUtils]: Spent 3.38 s on a formula simplification. DAG size of input: 388 DAG size of output: 101 [2018-12-01 14:38:01,681 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2018-12-01 14:38:07,500 WARN L180 SmtUtils]: Spent 5.82 s on a formula simplification. DAG size of input: 371 DAG size of output: 171 [2018-12-01 14:38:07,786 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 115 [2018-12-01 14:38:10,484 WARN L180 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 458 DAG size of output: 125 [2018-12-01 14:38:14,041 WARN L180 SmtUtils]: Spent 3.52 s on a formula simplification. DAG size of input: 389 DAG size of output: 112 [2018-12-01 14:38:19,805 WARN L180 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 371 DAG size of output: 171 [2018-12-01 14:38:20,226 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 1 [2018-12-01 14:38:22,087 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 339 DAG size of output: 92 [2018-12-01 14:38:22,200 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 75 [2018-12-01 14:38:27,463 WARN L180 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 388 DAG size of output: 101 [2018-12-01 14:38:27,744 WARN L180 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-12-01 14:38:30,315 WARN L180 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 480 DAG size of output: 91 [2018-12-01 14:38:32,358 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 330 DAG size of output: 105 [2018-12-01 14:38:33,915 WARN L180 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 193 DAG size of output: 143 [2018-12-01 14:38:37,443 WARN L180 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 431 DAG size of output: 136 [2018-12-01 14:38:40,340 WARN L180 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 336 DAG size of output: 156 [2018-12-01 14:38:41,705 WARN L180 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 275 DAG size of output: 112 [2018-12-01 14:38:42,135 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 1 [2018-12-01 14:38:46,694 WARN L180 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 361 DAG size of output: 135 [2018-12-01 14:38:46,997 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2018-12-01 14:38:47,268 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 84 [2018-12-01 14:38:48,829 WARN L180 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 418 DAG size of output: 114 [2018-12-01 14:38:48,966 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2018-12-01 14:39:02,564 WARN L180 SmtUtils]: Spent 13.59 s on a formula simplification. DAG size of input: 718 DAG size of output: 324 [2018-12-01 14:39:02,734 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2018-12-01 14:39:03,567 WARN L180 SmtUtils]: Spent 831.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 133 [2018-12-01 14:39:03,707 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2018-12-01 14:39:07,510 WARN L180 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 407 DAG size of output: 127 [2018-12-01 14:39:10,041 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 334 DAG size of output: 153 [2018-12-01 14:39:10,695 WARN L180 SmtUtils]: Spent 642.00 ms on a formula simplification. DAG size of input: 337 DAG size of output: 1 [2018-12-01 14:39:11,115 WARN L180 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 455 DAG size of output: 1 [2018-12-01 14:39:18,472 WARN L180 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 523 DAG size of output: 194 [2018-12-01 14:39:22,384 WARN L180 SmtUtils]: Spent 3.90 s on a formula simplification. DAG size of input: 402 DAG size of output: 133 [2018-12-01 14:39:24,361 WARN L180 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 380 DAG size of output: 166 [2018-12-01 14:39:24,501 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 109 [2018-12-01 14:39:25,932 WARN L180 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 328 DAG size of output: 117 [2018-12-01 14:39:26,868 WARN L180 SmtUtils]: Spent 927.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 145 [2018-12-01 14:39:28,702 WARN L180 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 385 DAG size of output: 164 [2018-12-01 14:39:28,970 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 115 [2018-12-01 14:39:33,315 WARN L180 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 431 DAG size of output: 136 [2018-12-01 14:39:33,320 INFO L444 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (let ((.cse21 (= 1 ~b0_ev~0))) (let ((.cse28 (not (= 1 ~d0_ev~0))) (.cse25 (< 0 ~z_req_up~0)) (.cse29 (not .cse21)) (.cse30 (not (= 0 ~z_val_t~0))) (.cse24 (not (= ~z_val~0 ~z_val_t~0))) (.cse26 (< 1 ~d1_ev~0)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse31 (< 0 ~b0_ev~0)) (.cse27 (= 0 ~d1_ev~0)) (.cse0 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse10 (< ~b1_val~0 ~b1_val_t~0)) (.cse9 (= ~b1_req_up~0 1)) (.cse11 (= 0 ~b0_ev~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse1 (= ~z_req_up~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse2 (= ~b1_ev~0 0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse32 (< ~d0_ev~0 2)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse8 (not (= 1 ~d1_ev~0))) (.cse5 (< ~b1_val_t~0 1))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or .cse20 .cse10 .cse22 .cse5 .cse12 .cse0 .cse24 (or .cse9 .cse25 .cse13 .cse26 .cse2 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse3 .cse4 .cse28 .cse23 .cse29)) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse0 .cse11 .cse12 .cse25 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 (not .cse18) .cse20 .cse22 .cse23) (or .cse0 .cse24 (or .cse26 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse22 .cse23)) (or (or .cse20 .cse10 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse27 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse32 .cse3 .cse4 .cse21 .cse22 .cse23) .cse5 .cse24) .cse0) (or (or .cse9 .cse25 .cse13 .cse26 .cse2 .cse27 .cse14 .cse15 .cse16 .cse17 .cse3 .cse4 .cse29 .cse6) .cse30 .cse20 .cse10 .cse22 .cse5 .cse12 .cse7 .cse24 .cse0) (or (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) .cse0) (or .cse0 (or .cse20 .cse10 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse32 .cse3 .cse4 .cse21 .cse22 .cse23 .cse8) .cse5))))) [2018-12-01 14:39:33,320 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-12-01 14:39:33,320 INFO L448 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-12-01 14:39:33,320 INFO L444 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (let ((.cse21 (= 1 ~b0_ev~0))) (let ((.cse28 (not (= 1 ~d0_ev~0))) (.cse25 (< 0 ~z_req_up~0)) (.cse29 (not .cse21)) (.cse30 (not (= 0 ~z_val_t~0))) (.cse24 (not (= ~z_val~0 ~z_val_t~0))) (.cse26 (< 1 ~d1_ev~0)) (.cse6 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse31 (< 0 ~b0_ev~0)) (.cse27 (= 0 ~d1_ev~0)) (.cse0 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse10 (< ~b1_val~0 ~b1_val_t~0)) (.cse9 (= ~b1_req_up~0 1)) (.cse11 (= 0 ~b0_ev~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse1 (= ~z_req_up~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse2 (= ~b1_ev~0 0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse32 (< ~d0_ev~0 2)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse8 (not (= 1 ~d1_ev~0))) (.cse5 (< ~b1_val_t~0 1))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or .cse20 .cse10 .cse22 .cse5 .cse12 .cse0 .cse24 (or .cse9 .cse25 .cse13 .cse26 .cse2 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse3 .cse4 .cse28 .cse23 .cse29)) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse30 .cse20 .cse21 .cse22 .cse23) (or .cse26 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse0 .cse11 .cse12 .cse25 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse30 (not .cse18) .cse20 .cse22 .cse23) (or .cse0 .cse24 (or .cse26 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11 .cse12 .cse25 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse28 .cse22 .cse23)) (or (or .cse20 .cse10 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse27 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse32 .cse3 .cse4 .cse21 .cse22 .cse23) .cse5 .cse24) .cse0) (or (or .cse9 .cse25 .cse13 .cse26 .cse2 .cse27 .cse14 .cse15 .cse16 .cse17 .cse3 .cse4 .cse29 .cse6) .cse30 .cse20 .cse10 .cse22 .cse5 .cse12 .cse7 .cse24 .cse0) (or (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse31 .cse27 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) .cse0) (or .cse0 (or .cse20 .cse10 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse2 .cse14 .cse15 .cse16 .cse18 .cse17 .cse19 .cse32 .cse3 .cse4 .cse21 .cse22 .cse23 .cse8) .cse5))))) [2018-12-01 14:39:33,321 INFO L448 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-12-01 14:39:33,321 INFO L448 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-12-01 14:39:33,321 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-12-01 14:39:33,322 INFO L444 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse32 (< ~b1_ev~0 2)) (.cse24 (= 0 exists_runnable_thread_~__retres1~1)) (.cse28 (< ~comp_m1_st~0 2)) (.cse34 (not (= 0 ~z_val_t~0))) (.cse31 (= 1 ~b0_ev~0)) (.cse33 (< 0 ~z_req_up~0)) (.cse27 (= 0 ~d1_ev~0)) (.cse29 (= 1 ~d1_ev~0)) (.cse25 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse21 (< 0 ~d0_ev~0)) (.cse7 (= 0 ~d0_ev~0)) (.cse1 (< ~d1_val~0 ~d1_val_t~0)) (.cse2 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse9 (= 0 ~b0_ev~0)) (.cse22 (< 0 ~b0_ev~0)) (.cse3 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse5 (< ~d0_val_t~0 1)) (.cse8 (= ~b1_req_up~0 1)) (.cse26 (< ~b0_ev~0 2)) (.cse10 (= ~z_req_up~0 1)) (.cse11 (= ~b1_ev~0 0)) (.cse12 (< ~d1_val_t~0 1)) (.cse13 (= ~b1_ev~0 1)) (.cse14 (< ~z_ev~0 2)) (.cse15 (< 0 ~z_val~0)) (.cse30 (< ~d0_ev~0 2)) (.cse16 (= ~b0_req_up~0 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse18 (< ~z_val~0 0)) (.cse19 (not (= 0 ~comp_m1_st~0))) (.cse20 (< ~d1_ev~0 2)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< ~b0_val_t~0 1))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23)) (or .cse24 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25 (or .cse8 .cse26 .cse6 .cse11 .cse27 .cse28 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse21 .cse29)) (or .cse25 (or .cse11 .cse30 .cse16 .cse17 .cse4 .cse8 .cse2 .cse9 .cse5 .cse6 .cse27 .cse28 .cse23 .cse12 .cse14 .cse13 .cse15 .cse1 .cse31 .cse3 .cse18 .cse29)))) (or .cse16 .cse17 .cse19 .cse4 .cse21 .cse7 .cse32 .cse8 .cse0 .cse2 .cse9 .cse5 .cse33 .cse6 .cse27 .cse23 .cse12 .cse14 .cse15 .cse34 .cse1 .cse31 .cse3 .cse18 .cse29) (or .cse16 .cse17 .cse4 .cse21 .cse7 .cse32 .cse8 .cse2 .cse9 .cse5 .cse6 .cse22 .cse27 .cse28 .cse23 .cse24 .cse12 .cse14 .cse15 .cse34 .cse1 .cse3 .cse18 .cse29) (or (or .cse10 (< 1 ~d1_ev~0) .cse11 .cse16 .cse17 .cse4 .cse21 .cse7 (< 1 ~b1_ev~0) .cse8 .cse2 .cse9 .cse5 .cse6 .cse22 .cse27 .cse28 .cse23 .cse12 .cse14 .cse13 .cse15 .cse1 .cse3 .cse18 .cse29) .cse24) (or .cse11 .cse16 .cse17 .cse4 .cse20 .cse21 .cse7 .cse8 .cse2 .cse9 .cse5 .cse24 .cse6 .cse28 .cse23 .cse12 .cse14 .cse13 .cse15 .cse34 .cse1 .cse31 .cse3 .cse18) (or (and (or (or .cse8 .cse26 .cse33 .cse6 .cse11 .cse27 .cse23 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse29) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse25) (or (and (or .cse1 .cse2 (or .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse29) .cse3 .cse4 .cse5 .cse6 .cse22 .cse23) (or (or (or (or .cse8 .cse26 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse29) .cse6 .cse23) .cse3 .cse5) .cse1 .cse2 .cse4)) .cse25)) .cse0) (or .cse0 (and (or (or .cse6 (or .cse8 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse23) .cse1 .cse2 .cse3 .cse4 .cse5 .cse7) (or .cse1 .cse2 .cse4 (and (or (or .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20) .cse3 .cse5 .cse6 .cse22 .cse23) (or .cse3 .cse5 (or (or .cse8 .cse26 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20) .cse6 .cse23)))))))) [2018-12-01 14:39:33,322 INFO L451 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-12-01 14:39:33,322 INFO L448 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-12-01 14:39:33,322 INFO L448 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-12-01 14:39:33,322 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-12-01 14:39:33,322 INFO L448 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-12-01 14:39:33,322 INFO L448 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-12-01 14:39:33,323 INFO L448 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-12-01 14:39:33,323 INFO L444 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (let ((.cse32 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse33 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse22 (< 0 ~b0_ev~0)) (.cse25 (< 1 ~d1_ev~0)) (.cse24 (= ~z_val~0 ~z_val_t~0)) (.cse31 (< 0 |old(~z_req_up~0)|)) (.cse26 (= 0 ~d1_ev~0)) (.cse28 (= 1 ~d1_ev~0)) (.cse5 (= 0 ~b0_ev~0)) (.cse27 (< ~d0_ev~0 2)) (.cse34 (= 1 ~b0_ev~0)) (.cse1 (< ~d1_val~0 ~d1_val_t~0)) (.cse2 (< ~b1_val~0 ~b1_val_t~0)) (.cse17 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse18 (< ~b1_val_t~0 1)) (.cse19 (< ~d0_val_t~0 1)) (.cse21 (= 0 ~d0_ev~0)) (.cse3 (= 0 |old(~comp_m1_st~0)|)) (.cse4 (= ~b1_req_up~0 1)) (.cse29 (< ~b0_ev~0 2)) (.cse6 (= |old(~z_req_up~0)| 1)) (.cse7 (= ~b1_ev~0 0)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (= ~b1_ev~0 1)) (.cse10 (< ~z_ev~0 2)) (.cse11 (< 0 ~z_val~0)) (.cse12 (= ~b0_req_up~0 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse14 (< ~z_val~0 0)) (.cse15 (< ~d1_ev~0 2)) (.cse16 (< 0 ~d0_ev~0)) (.cse20 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< ~b0_val_t~0 1)) (.cse0 (and .cse32 .cse33))) (and (or .cse0 (or .cse1 .cse2 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (and .cse0 .cse24) (let ((.cse30 (not (= ~z_val~0 |old(~z_val_t~0)|)))) (and (or (and (or (or .cse3 .cse4 .cse5 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse28) .cse1 .cse2 .cse17 .cse18 .cse19 .cse20 .cse22 .cse23) (or .cse1 .cse2 .cse18 (or (or (or .cse3 .cse4 .cse29 .cse6 .cse25 .cse7 .cse26 .cse8 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse14 .cse28) .cse20 .cse23) .cse17 .cse19))) .cse30) (or .cse1 .cse2 .cse17 .cse18 .cse19 (or .cse3 .cse4 .cse29 .cse31 .cse20 .cse25 .cse7 .cse26 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse28) .cse21 .cse30)))) (or .cse3 .cse25 .cse12 (and .cse24 .cse32 .cse33) .cse13 .cse18 .cse16 .cse21 (< ~b1_ev~0 2) .cse4 .cse2 .cse5 .cse19 .cse31 .cse20 .cse26 .cse23 .cse8 .cse10 .cse11 (not (= 0 |old(~z_val_t~0)|)) .cse1 .cse34 .cse17 .cse14 .cse28) (or (and (or (or .cse17 .cse19 .cse20 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse27 .cse12 .cse13 .cse34 .cse14 .cse15) .cse23) .cse8 .cse1 .cse2 .cse18) (or .cse1 .cse2 .cse17 .cse18 .cse19 .cse21 (or (or .cse3 .cse4 .cse29 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse20 .cse23))) .cse0)))) [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-12-01 14:39:33,324 INFO L448 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-12-01 14:39:33,325 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-12-01 14:39:33,325 INFO L448 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L444 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse31 (= 1 |old(~d1_ev~0)|)) (.cse33 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse34 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse35 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse36 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse28 (= 1 |old(~b0_ev~0)|))) (let ((.cse38 (not .cse28)) (.cse20 (not (= 0 ~z_val_t~0))) (.cse30 (< ~comp_m1_st~0 2)) (.cse27 (< |old(~d0_ev~0)| 2)) (.cse39 (and (and .cse33 .cse34 .cse35 .cse36) (= ~d0_ev~0 |old(~d0_ev~0)|))) (.cse32 (not (= ~z_val~0 ~z_val_t~0))) (.cse1 (< 1 |old(~d1_ev~0)|)) (.cse12 (< 0 ~z_req_up~0)) (.cse14 (< 0 |old(~b0_ev~0)|)) (.cse15 (= 0 |old(~d1_ev~0)|)) (.cse37 (not (= 1 |old(~d0_ev~0)|))) (.cse0 (and .cse33 .cse34 (= |old(~d0_ev~0)| ~d0_ev~0) .cse35 .cse36)) (.cse25 (= ~z_req_up~0 1)) (.cse26 (= |old(~b1_ev~0)| 0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse4 (not (= 0 ~comp_m1_st~0))) (.cse5 (< ~b1_val_t~0 1)) (.cse6 (< 0 |old(~d0_ev~0)|)) (.cse7 (= 0 |old(~d0_ev~0)|)) (.cse29 (not .cse31)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 |old(~b0_ev~0)|)) (.cse11 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse18 (< |old(~z_ev~0)| 2)) (.cse21 (= |old(~b1_ev~0)| 1)) (.cse19 (< 0 ~z_val~0)) (.cse22 (< ~d1_val~0 ~d1_val_t~0)) (.cse23 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse24 (< ~z_val~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (not .cse21) .cse22 .cse23 .cse24) (or .cse0 (or .cse22 .cse9 .cse5 (or .cse8 .cse10 .cse11 .cse25 .cse13 .cse26 .cse16 .cse17 .cse21 .cse18 .cse19 .cse27 .cse2 .cse3 .cse28 .cse23 .cse24 .cse4 .cse29))) (or (or .cse25 .cse1 .cse26 .cse2 .cse3 .cse5 .cse6 .cse7 (< 1 |old(~b1_ev~0)|) .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse30 .cse16 .cse17 .cse18 .cse21 .cse19 .cse22 .cse23 .cse24 .cse31) .cse0) (or .cse0 .cse25 .cse2 .cse3 .cse5 .cse6 .cse7 (< |old(~b1_ev~0)| 2) .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse30 .cse16 .cse17 .cse18 .cse19 .cse20 .cse22 .cse28 .cse23 .cse24 .cse31) (or .cse22 .cse9 .cse23 .cse5 .cse11 .cse32 (and .cse33 .cse34 (= 1 ~d0_ev~0) .cse35 .cse36) (or .cse8 .cse12 .cse13 .cse1 .cse26 .cse15 .cse16 .cse17 .cse18 .cse19 .cse2 .cse3 .cse37 .cse24 .cse4 .cse38)) (or .cse25 .cse26 .cse2 .cse3 .cse0 .cse5 (< |old(~d1_ev~0)| 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse16 .cse17 .cse18 .cse21 .cse19 .cse20 .cse22 .cse28 .cse23 .cse24) (or (or .cse8 .cse12 .cse13 .cse1 .cse26 .cse15 .cse16 .cse18 .cse2 .cse3 .cse4 .cse38 .cse6) .cse17 .cse20 .cse22 .cse9 .cse23 .cse5 .cse11 .cse7 .cse32 .cse39) (or (and (or (or .cse8 (< |old(~b0_ev~0)| 2) .cse25 .cse13 .cse26 .cse15 .cse30 .cse16 .cse17 .cse21 .cse18 .cse2 .cse3 .cse6 .cse31) .cse20 .cse22 .cse9 .cse23 .cse5 .cse11 .cse7 .cse32) (or .cse22 .cse9 (or .cse8 .cse10 .cse11 .cse25 .cse13 .cse26 .cse15 .cse30 .cse16 .cse17 .cse21 .cse18 .cse19 .cse27 .cse2 .cse3 .cse28 .cse23 .cse24 .cse31) .cse5 .cse32)) .cse39) (or .cse39 .cse32 (or .cse1 .cse26 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse22 .cse37 .cse23 .cse24)) (or .cse0 (or .cse25 .cse26 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse16 .cse17 .cse18 .cse21 .cse19 .cse22 .cse28 .cse23 .cse24))))) [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-12-01 14:39:33,326 INFO L448 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-12-01 14:39:33,327 INFO L444 ceAbstractionStarter]: At program point init_threadsENTRY(lines 241 253) the Hoare annotation is: (or (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (< 1 ~d1_ev~0) (= ~b0_req_up~0 1) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 ~d0_ev~0) (= ~b1_req_up~0 1) (< ~b1_val~0 ~b1_val_t~0) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< ~b0_val~0 ~b0_val_t~0) (< 0 ~b0_ev~0) (< ~b0_val_t~0 1) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (= ~b1_ev~0 1) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (< ~d1_val~0 ~d1_val_t~0) (not (= ~d0_val_t~0 ~d0_val~0)) (< ~z_val~0 0) (= 1 ~d1_ev~0)) [2018-12-01 14:39:33,327 INFO L448 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-12-01 14:39:33,327 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 483 501) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (= 1 |old(~d1_ev~0)|)) [2018-12-01 14:39:33,327 INFO L444 ceAbstractionStarter]: At program point L493(line 493) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-01 14:39:33,327 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-12-01 14:39:33,328 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-12-01 14:39:33,328 INFO L448 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-12-01 14:39:33,328 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-12-01 14:39:33,328 INFO L444 ceAbstractionStarter]: At program point L488(line 488) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (= 1 |old(~d1_ev~0)|)) [2018-12-01 14:39:33,329 INFO L444 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (and (<= 2 ~d0_ev~0) (<= 2 ~b0_ev~0) (<= 1 ~d1_val_t~0) (<= 1 ~b1_val_t~0) (= 0 ~z_val_t~0) (= ~z_val~0 ~z_val_t~0) (= 1 ~b1_req_up~0) (= 0 ~d0_val~0) (<= 1 ~b0_val_t~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (<= 2 ~d1_ev~0) (<= 0 ~b0_val~0) (<= ~d1_val~0 0) (<= ~b0_val~0 0) (<= ~z_req_up~0 0) (<= 2 ~b1_ev~0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 1) (<= 1 ~d0_val_t~0) (<= ~d1_req_up~0 ~b0_req_up~0) (<= 2 ~z_ev~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~d0_req_up~0 1)) (< 0 |old(~comp_m1_i~0)|) (not (= 0 |old(~comp_m1_st~0)|)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (= 1 |old(~d1_ev~0)|)) [2018-12-01 14:39:33,329 INFO L448 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-12-01 14:39:33,329 INFO L448 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-12-01 14:39:33,329 INFO L451 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-12-01 14:39:33,329 INFO L448 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-12-01 14:39:33,329 INFO L448 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-12-01 14:39:33,329 INFO L448 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-12-01 14:39:33,330 INFO L444 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse1 (= 0 ~b0_ev~0)) (.cse0 (= ~b1_req_up~0 1)) (.cse3 (< ~b0_val~0 ~b0_val_t~0)) (.cse4 (= ~b1_ev~0 0)) (.cse5 (< ~comp_m1_st~0 2)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (= ~b1_ev~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (= ~b0_req_up~0 1)) (.cse11 (< 0 ~comp_m1_i~0)) (.cse13 (< 0 ~d0_ev~0)) (.cse14 (not (= 1 |old(~z_req_up~0)|))) (.cse15 (= 1 ~d1_ev~0)) (.cse12 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse2 (< ~d0_val_t~0 1)) (.cse16 (< ~d1_val~0 ~d1_val_t~0)) (.cse17 (< ~b1_val~0 ~b1_val_t~0)) (.cse18 (< ~b1_val_t~0 1)) (.cse21 (= 0 ~d0_ev~0)) (.cse22 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse19 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse20 (<= |old(~z_ev~0)| ~z_ev~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 (< 0 ~b0_ev~0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 0 ~z_val_t~0)) .cse16 .cse17 .cse18 (and (= ~z_val~0 ~z_val_t~0) .cse19 .cse20) .cse21 .cse22) (or (let ((.cse23 (< 0 |old(~z_val~0)|)) (.cse24 (< |old(~z_val~0)| 0))) (and (or .cse16 .cse17 (or .cse0 .cse2 .cse3 .cse6 (or .cse9 (< ~d0_ev~0 2) .cse11 .cse1 .cse4 .cse5 .cse15) .cse7 .cse8 .cse23 .cse10 (= 1 ~b0_ev~0) .cse12 .cse24 .cse14) .cse18 .cse22) (or (or (or .cse0 (< ~b0_ev~0 2) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse23 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15) .cse12 .cse2) .cse16 .cse17 .cse18 .cse21 .cse22))) (and (= ~z_val~0 |old(~z_val~0)|) .cse19 .cse20)))) [2018-12-01 14:39:33,330 INFO L448 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-12-01 14:39:33,330 INFO L444 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (let ((.cse1 (= ~b0_req_up~0 1)) (.cse9 (< 0 ~b0_ev~0)) (.cse21 (= 0 |old(~d1_ev~0)|)) (.cse23 (= 1 |old(~d1_ev~0)|)) (.cse0 (and (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|))) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse6 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse27 (= 0 ~d0_ev~0)) (.cse26 (not (= ~z_val~0 ~z_val_t~0))) (.cse20 (= ~b1_ev~0 0)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse4 (< |old(~d1_ev~0)| 2)) (.cse5 (< 0 ~d0_ev~0)) (.cse19 (= 0 ~b0_ev~0)) (.cse7 (< ~d0_val_t~0 1)) (.cse24 (= ~b1_req_up~0 |old(~d1_req_up~0)|)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse22 (< ~comp_m1_st~0 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< ~d1_val_t~0 1)) (.cse12 (< ~z_ev~0 2)) (.cse13 (= ~b1_ev~0 1)) (.cse28 (= ~b0_req_up~0 |old(~d1_req_up~0)|)) (.cse14 (< 0 ~z_val~0)) (.cse25 (= 1 ~b0_ev~0)) (.cse15 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse16 (< ~z_val~0 0)) (.cse17 (not (= 1 |old(~d1_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 .cse4 .cse5 (< 0 |old(~d1_val~0)|) (= ~b1_req_up~0 1) .cse6 .cse7 (< 0 ~z_req_up~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= 0 ~z_val_t~0)) .cse15 .cse16 .cse17) (or .cse0 (and (or .cse18 .cse6 .cse3 (or (or .cse12 (< ~d0_ev~0 2) .cse2 .cse19 .cse17 .cse20 .cse21 .cse22 .cse23) .cse7 .cse24 .cse8 .cse10 .cse11 .cse13 .cse14 .cse1 .cse25 .cse15 .cse16) .cse26) (or .cse18 .cse6 .cse3 .cse27 .cse26 (or (or (< ~b0_ev~0 2) .cse24 .cse8 .cse20 .cse21 .cse22 .cse10 .cse11 .cse13 .cse12 .cse14 .cse1 .cse2 .cse16 .cse5 .cse17 .cse23) .cse15 .cse7)))) (or (or .cse18 .cse6 (or (= ~z_req_up~0 1) (< 1 |old(~d1_ev~0)|) .cse20 .cse2 .cse5 (< 1 ~b1_ev~0) .cse19 .cse7 .cse24 .cse8 .cse9 .cse21 .cse22 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse15 .cse16 .cse17 .cse23) .cse3 .cse27) .cse0) (or .cse0 .cse18 .cse6 .cse3 .cse27 (or .cse2 .cse5 (< ~b1_ev~0 2) .cse19 .cse7 .cse24 .cse8 .cse21 .cse22 .cse10 .cse11 .cse12 .cse28 .cse14 .cse25 .cse15 .cse16 .cse17 .cse23) .cse26) (or .cse0 .cse18 .cse6 .cse3 .cse27 .cse26 (or .cse20 .cse2 .cse4 .cse5 .cse19 .cse7 .cse24 .cse8 .cse22 .cse10 .cse11 .cse12 .cse13 .cse28 .cse14 .cse25 .cse15 .cse16 .cse17)))) [2018-12-01 14:39:33,330 INFO L448 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-12-01 14:39:33,330 INFO L448 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-12-01 14:39:33,330 INFO L448 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-12-01 14:39:33,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-01 14:39:33,331 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~d0_req_up~0)| ~d0_req_up~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= ~z_val~0 |old(~z_val~0)|) (= |old(~b0_req_up~0)| ~b0_req_up~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) [2018-12-01 14:39:33,331 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 14:39:33,331 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-12-01 14:39:33,331 INFO L451 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-12-01 14:39:33,331 INFO L448 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-12-01 14:39:33,331 INFO L448 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-12-01 14:39:33,331 INFO L444 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (let ((.cse1 (= ~b1_ev~0 0)) (.cse17 (= ~b1_ev~0 1)) (.cse21 (= 1 ~b0_ev~0)) (.cse0 (= ~z_req_up~0 1)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse5 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse24 (< 0 ~b0_ev~0)) (.cse25 (= 0 ~d1_ev~0)) (.cse13 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse7 (= 0 stop_simulation_~tmp~2)) (.cse16 (< ~z_ev~0 2)) (.cse18 (< 0 ~z_val~0)) (.cse19 (not (= 0 ~z_val_t~0))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse26 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (< ~d1_ev~0 2) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (or .cse0 (< 1 ~d1_ev~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse26) .cse7) (or (let ((.cse27 (not (= ~z_val~0 ~z_val_t~0)))) (and (or (or .cse8 (< ~b0_ev~0 2) .cse0 .cse12 .cse1 .cse25 .cse13 .cse14 .cse15 .cse17 .cse16 .cse2 .cse3 .cse5 .cse26) .cse19 .cse20 .cse9 .cse22 .cse4 .cse11 .cse6 .cse27) (or .cse20 .cse9 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse1 .cse25 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 (< ~d0_ev~0 2) .cse2 .cse3 .cse21 .cse22 .cse23 .cse26) .cse4 .cse27))) .cse7) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~b1_ev~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse24 .cse25 .cse13 .cse14 .cse15 .cse7 .cse16 .cse18 .cse19 .cse20 .cse22 .cse23 .cse26))) [2018-12-01 14:39:33,331 INFO L451 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-12-01 14:39:33,331 INFO L448 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-12-01 14:39:33,332 INFO L444 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse33 (= ~z_val~0 ~z_val_t~0)) (.cse37 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse38 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse26 (< ~b0_ev~0 2)) (.cse31 (< ~d0_ev~0 2)) (.cse35 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse0 (and .cse33 .cse37 .cse38)) (.cse7 (< ~b1_ev~0 2)) (.cse34 (< 0 |old(~z_req_up~0)|)) (.cse19 (not (= 0 |old(~z_val_t~0)|))) (.cse21 (= 1 ~b0_ev~0)) (.cse36 (< 1 ~d1_ev~0)) (.cse13 (= 0 ~d1_ev~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse24 (= 1 ~d1_ev~0)) (.cse25 (and .cse37 .cse38)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse4 (< ~b1_val_t~0 1)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse10 (= 0 ~b0_ev~0)) (.cse1 (= |old(~z_req_up~0)| 1)) (.cse27 (= ~b1_ev~0 0)) (.cse16 (< ~d1_val_t~0 1)) (.cse28 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse18 (< 0 ~z_val~0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse23 (< ~z_val~0 0)) (.cse29 (not (= 0 |old(~comp_m1_st~0)|))) (.cse30 (< ~d1_ev~0 2)) (.cse5 (< 0 ~d0_ev~0)) (.cse32 (< 0 ~b0_ev~0)) (.cse15 (< ~b0_val_t~0 1))) (and (or .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) (or .cse25 (and (or (or .cse12 (or .cse8 .cse26 .cse1 .cse27 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse30 .cse5) .cse15) .cse20 .cse9 .cse22 .cse4 .cse11 .cse6) (or .cse20 .cse9 .cse4 (and (or (or .cse8 .cse10 .cse1 .cse27 .cse16 .cse28 .cse17 .cse18 .cse31 .cse2 .cse3 .cse23 .cse29 .cse30) .cse22 .cse11 .cse12 .cse32 .cse15) (or .cse22 .cse11 (or (or .cse8 .cse26 .cse1 .cse27 .cse16 .cse28 .cse17 .cse18 .cse31 .cse2 .cse3 .cse23 .cse29 .cse30) .cse12 .cse15)))))) (or .cse1 .cse27 .cse2 .cse3 .cse0 .cse4 .cse30 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse33 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or (and (or (or .cse8 .cse26 .cse1 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse2 .cse3 .cse5 .cse24) .cse19 .cse20 .cse9 .cse22 .cse4 .cse11 .cse6 .cse35) (or .cse20 .cse9 (or .cse8 .cse10 .cse11 .cse1 .cse12 .cse27 .cse13 .cse14 .cse15 .cse16 .cse28 .cse17 .cse18 .cse31 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24) .cse4 .cse35)) (and .cse25 .cse33)) (or (and (or (or .cse8 .cse26 .cse34 .cse12 .cse36 .cse27 .cse13 .cse15 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse5 .cse24) .cse20 .cse9 .cse22 .cse4 .cse11 .cse6 .cse35) (or (and (or .cse20 .cse9 (or .cse8 .cse10 .cse1 .cse36 .cse27 .cse13 .cse16 .cse28 .cse17 .cse18 .cse31 .cse2 .cse3 .cse23 .cse29 .cse24) .cse22 .cse4 .cse11 .cse12 .cse32 .cse15) (or (or (or (or .cse8 .cse26 .cse1 .cse36 .cse27 .cse13 .cse16 .cse28 .cse17 .cse18 .cse31 .cse2 .cse3 .cse23 .cse29 .cse24) .cse12 .cse15) .cse22 .cse11) .cse20 .cse9 .cse4)) .cse35)) (and .cse33 .cse25)) (or .cse0 .cse36 .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse34 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or (or .cse1 .cse36 .cse27 .cse2 .cse3 .cse4 .cse5 .cse6 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse32 .cse13 .cse14 .cse15 .cse16 .cse17 .cse28 .cse18 .cse20 .cse22 .cse23 .cse24) .cse25) (or .cse25 (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse12 .cse6 (or .cse8 .cse10 .cse1 .cse27 .cse16 .cse28 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse30 .cse5) .cse32 .cse15))))) [2018-12-01 14:39:33,332 INFO L448 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-12-01 14:39:33,333 INFO L444 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse38 (<= 2 ~comp_m1_st~0)) (.cse35 (= ~z_val~0 ~z_val_t~0)) (.cse39 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse31 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse25 (< ~b0_ev~0 2)) (.cse32 (< ~d0_ev~0 2)) (.cse34 (and .cse39 .cse40)) (.cse33 (< 0 ~b0_ev~0)) (.cse27 (< 1 ~d1_ev~0)) (.cse36 (and .cse38 .cse35)) (.cse30 (not (= 0 |old(~comp_m1_st~0)|))) (.cse7 (< ~b1_ev~0 2)) (.cse26 (< 0 |old(~z_req_up~0)|)) (.cse13 (= 0 ~d1_ev~0)) (.cse24 (= 1 ~d1_ev~0)) (.cse0 (= |old(~z_req_up~0)| 1)) (.cse28 (= ~b1_ev~0 0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse37 (< ~d1_ev~0 2)) (.cse4 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse5 (and .cse35 .cse39 .cse40)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse29 (= ~b1_ev~0 1)) (.cse18 (< 0 ~z_val~0)) (.cse19 (not (= 0 |old(~z_val_t~0)|))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse21 (= 1 ~b0_ev~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0))) (and (or .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) (or (and (or (or .cse8 .cse25 .cse26 .cse12 .cse27 .cse28 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse4 .cse24) .cse20 .cse9 .cse22 .cse3 .cse11 .cse6 .cse31) (or (and (or .cse20 .cse9 (or .cse8 .cse10 .cse0 .cse27 .cse28 .cse13 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse24) .cse22 .cse3 .cse11 .cse12 .cse33 .cse15) (or (or (or (or .cse8 .cse25 .cse0 .cse27 .cse28 .cse13 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse24) .cse12 .cse15) .cse22 .cse11) .cse20 .cse9 .cse3)) .cse31)) (and .cse34 .cse35) .cse36) (or (and .cse35 .cse34) (and (or (or .cse8 .cse25 .cse0 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse1 .cse2 .cse4 .cse24) .cse19 .cse20 .cse9 .cse22 .cse3 .cse11 .cse6 .cse31) (or .cse20 .cse9 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse21 .cse22 .cse23 .cse24) .cse3 .cse31))) (or (or .cse20 .cse9 .cse22 .cse3 .cse11 .cse12 .cse6 (or .cse8 .cse10 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse37 .cse4) .cse33 .cse15) .cse34 .cse36) (or (and (or (or .cse12 (or .cse8 .cse25 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse37 .cse4) .cse15) .cse20 .cse9 .cse22 .cse3 .cse11 .cse6) (or .cse20 .cse9 .cse3 (and (or (or .cse8 .cse10 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse37) .cse22 .cse11 .cse12 .cse33 .cse15) (or .cse22 .cse11 (or (or .cse8 .cse25 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse37) .cse12 .cse15))))) .cse34 (and .cse35 .cse38)) (or .cse34 (or .cse0 .cse27 .cse28 .cse1 .cse2 .cse3 .cse4 .cse6 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse22 .cse23 .cse24)) (or .cse5 .cse27 .cse36 .cse1 .cse2 .cse30 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse28 .cse1 .cse35 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse37 .cse4 .cse6 .cse8 .cse9 .cse10 .cse5 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2018-12-01 14:39:33,334 INFO L444 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse34 (not (= 0 ~comp_m1_st~0))) (.cse36 (<= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse37 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse33 (< ~b1_ev~0 2)) (.cse18 (= 1 ~b0_ev~0)) (.cse27 (not (= 0 |old(~z_val_t~0)|))) (.cse38 (< 0 |old(~z_req_up~0)|)) (.cse28 (< ~b0_ev~0 2)) (.cse15 (< ~d0_ev~0 2)) (.cse23 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse35 (= ~z_val~0 ~z_val_t~0)) (.cse29 (not (= 0 |old(~comp_m1_st~0)|))) (.cse24 (< ~d1_ev~0 2)) (.cse31 (and .cse34 .cse36 .cse37)) (.cse5 (= |old(~z_req_up~0)| 1)) (.cse32 (< 1 ~d1_ev~0)) (.cse7 (= ~b1_ev~0 0)) (.cse16 (= ~b0_req_up~0 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse22 (< ~b1_val_t~0 1)) (.cse25 (< 0 ~d0_ev~0)) (.cse26 (= 0 ~d0_ev~0)) (.cse2 (= ~b1_req_up~0 1)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (= 0 ~b0_ev~0)) (.cse4 (< ~d0_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse30 (< 0 ~b0_ev~0)) (.cse8 (= 0 ~d1_ev~0)) (.cse9 (< |old(~comp_m1_st~0)| 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< ~d1_val_t~0 1)) (.cse13 (< ~z_ev~0 2)) (.cse12 (= ~b1_ev~0 1)) (.cse14 (< 0 ~z_val~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse19 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (< ~z_val~0 0)) (.cse21 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22 .cse23) (or .cse5 .cse7 .cse16 .cse17 .cse22 .cse24 .cse25 .cse26 .cse2 .cse1 .cse3 .cse4 .cse6 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 .cse27 .cse0 .cse18 .cse19 .cse20) (or (and (or (or .cse6 (or .cse2 .cse28 .cse5 .cse7 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse29 .cse24 .cse25) .cse10) .cse0 .cse1 .cse19 .cse22 .cse4 .cse26) (or .cse0 .cse1 .cse22 (and (or (or .cse2 .cse3 .cse5 .cse7 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse29 .cse24) .cse19 .cse4 .cse6 .cse30 .cse10) (or .cse19 .cse4 (or (or .cse2 .cse28 .cse5 .cse7 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse29 .cse24) .cse6 .cse10))))) .cse31) (or .cse32 .cse16 .cse17 .cse29 .cse22 .cse25 .cse26 .cse33 .cse2 .cse1 (and .cse34 .cse35 .cse36 .cse37) .cse3 .cse4 .cse38 .cse6 .cse8 .cse10 .cse11 .cse13 .cse14 .cse27 .cse0 .cse18 .cse19 .cse20 .cse21) (or .cse5 .cse16 .cse17 .cse22 .cse25 .cse26 .cse33 .cse2 .cse1 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse27 .cse0 .cse18 .cse19 .cse20 .cse21) (or (or .cse2 .cse28 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse16 .cse17 .cse25 .cse21) .cse27 .cse0 .cse1 .cse19 .cse22 .cse4 .cse26 .cse23) (or (and (or (or .cse2 .cse28 .cse38 .cse6 .cse32 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse29 .cse25 .cse21) .cse0 .cse1 .cse19 .cse22 .cse4 .cse26 .cse23) (or (and (or .cse0 .cse1 (or .cse2 .cse3 .cse5 .cse32 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse29 .cse21) .cse19 .cse22 .cse4 .cse6 .cse30 .cse10) (or (or (or (or .cse2 .cse28 .cse5 .cse32 .cse7 .cse8 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse29 .cse21) .cse6 .cse10) .cse19 .cse4) .cse0 .cse1 .cse22)) .cse23)) (and .cse35 .cse31)) (or (or .cse0 .cse1 .cse19 .cse22 .cse4 .cse6 .cse26 (or .cse2 .cse3 .cse5 .cse7 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse20 .cse29 .cse24 .cse25) .cse30 .cse10) .cse31) (or .cse5 .cse32 .cse7 .cse16 .cse17 .cse22 .cse25 .cse26 (< 1 ~b1_ev~0) .cse2 .cse1 .cse3 .cse4 .cse6 .cse30 .cse8 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 .cse0 .cse19 .cse20 .cse21)))) [2018-12-01 14:39:33,334 INFO L448 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-12-01 14:39:33,334 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-12-01 14:39:33,334 INFO L448 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-12-01 14:39:33,334 INFO L448 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-12-01 14:39:33,335 INFO L444 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse38 (<= 2 ~comp_m1_st~0)) (.cse35 (= ~z_val~0 ~z_val_t~0)) (.cse39 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse31 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse25 (< ~b0_ev~0 2)) (.cse32 (< ~d0_ev~0 2)) (.cse34 (and .cse39 .cse40)) (.cse33 (< 0 ~b0_ev~0)) (.cse27 (< 1 ~d1_ev~0)) (.cse36 (and .cse38 .cse35)) (.cse30 (not (= 0 |old(~comp_m1_st~0)|))) (.cse7 (< ~b1_ev~0 2)) (.cse26 (< 0 |old(~z_req_up~0)|)) (.cse13 (= 0 ~d1_ev~0)) (.cse24 (= 1 ~d1_ev~0)) (.cse0 (= |old(~z_req_up~0)| 1)) (.cse28 (= ~b1_ev~0 0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse37 (< ~d1_ev~0 2)) (.cse4 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse5 (and .cse35 .cse39 .cse40)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse29 (= ~b1_ev~0 1)) (.cse18 (< 0 ~z_val~0)) (.cse19 (not (= 0 |old(~z_val_t~0)|))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse21 (= 1 ~b0_ev~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0))) (and (or .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) (or (and (or (or .cse8 .cse25 .cse26 .cse12 .cse27 .cse28 .cse13 .cse15 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse4 .cse24) .cse20 .cse9 .cse22 .cse3 .cse11 .cse6 .cse31) (or (and (or .cse20 .cse9 (or .cse8 .cse10 .cse0 .cse27 .cse28 .cse13 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse24) .cse22 .cse3 .cse11 .cse12 .cse33 .cse15) (or (or (or (or .cse8 .cse25 .cse0 .cse27 .cse28 .cse13 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse24) .cse12 .cse15) .cse22 .cse11) .cse20 .cse9 .cse3)) .cse31)) (and .cse34 .cse35) .cse36) (or (and .cse35 .cse34) (and (or (or .cse8 .cse25 .cse0 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse1 .cse2 .cse4 .cse24) .cse19 .cse20 .cse9 .cse22 .cse3 .cse11 .cse6 .cse31) (or .cse20 .cse9 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse28 .cse13 .cse14 .cse15 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse21 .cse22 .cse23 .cse24) .cse3 .cse31))) (or (or .cse20 .cse9 .cse22 .cse3 .cse11 .cse12 .cse6 (or .cse8 .cse10 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse37 .cse4) .cse33 .cse15) .cse34 .cse36) (or (and (or (or .cse12 (or .cse8 .cse25 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse1 .cse2 .cse23 .cse30 .cse37 .cse4) .cse15) .cse20 .cse9 .cse22 .cse3 .cse11 .cse6) (or .cse20 .cse9 .cse3 (and (or (or .cse8 .cse10 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse37) .cse22 .cse11 .cse12 .cse33 .cse15) (or .cse22 .cse11 (or (or .cse8 .cse25 .cse0 .cse28 .cse16 .cse29 .cse17 .cse18 .cse32 .cse1 .cse2 .cse23 .cse30 .cse37) .cse12 .cse15))))) .cse34 (and .cse35 .cse38)) (or .cse34 (or .cse0 .cse27 .cse28 .cse1 .cse2 .cse3 .cse4 .cse6 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse33 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse20 .cse22 .cse23 .cse24)) (or .cse5 .cse27 .cse36 .cse1 .cse2 .cse30 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse28 .cse1 .cse35 .cse2 .cse3 .cse4 .cse6 .cse8 .cse9 .cse10 .cse11 .cse26 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse0 .cse28 .cse1 .cse2 .cse3 .cse37 .cse4 .cse6 .cse8 .cse9 .cse10 .cse5 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse29 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)))) [2018-12-01 14:39:33,335 INFO L444 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse37 (<= 2 ~comp_m1_st~0)) (.cse31 (= ~z_val~0 ~z_val_t~0)) (.cse38 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse39 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse0 (and .cse31 .cse38 .cse39)) (.cse26 (< ~d1_ev~0 2)) (.cse21 (= 1 ~b0_ev~0)) (.cse33 (< ~b0_ev~0 2)) (.cse34 (< ~d0_ev~0 2)) (.cse35 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse29 (not (= 0 |old(~comp_m1_st~0)|))) (.cse7 (< ~b1_ev~0 2)) (.cse32 (< 0 |old(~z_req_up~0)|)) (.cse28 (and .cse37 .cse31)) (.cse19 (not (= 0 |old(~z_val_t~0)|))) (.cse1 (= |old(~z_req_up~0)| 1)) (.cse25 (= ~b1_ev~0 0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse5 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse30 (< 0 ~b0_ev~0)) (.cse13 (= 0 ~d1_ev~0)) (.cse14 (< |old(~comp_m1_st~0)| 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse27 (= ~b1_ev~0 1)) (.cse18 (< 0 ~z_val~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse24 (= 1 ~d1_ev~0)) (.cse36 (and .cse38 .cse39))) (and (or .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) (or .cse1 .cse25 .cse2 .cse3 .cse0 .cse4 .cse26 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse28 (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse12 .cse6 (or .cse8 .cse10 .cse1 .cse25 .cse16 .cse27 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse26 .cse5) .cse30 .cse15)) (or .cse31 .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse32 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse28 (and (or (or .cse12 (or .cse8 .cse33 .cse1 .cse25 .cse16 .cse27 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse26 .cse5) .cse15) .cse20 .cse9 .cse22 .cse4 .cse11 .cse6) (or .cse20 .cse9 .cse4 (and (or (or .cse8 .cse10 .cse1 .cse25 .cse16 .cse27 .cse17 .cse18 .cse34 .cse2 .cse3 .cse23 .cse29 .cse26) .cse22 .cse11 .cse12 .cse30 .cse15) (or .cse22 .cse11 (or (or .cse8 .cse33 .cse1 .cse25 .cse16 .cse27 .cse17 .cse18 .cse34 .cse2 .cse3 .cse23 .cse29 .cse26) .cse12 .cse15)))))) (or (and (or (or .cse8 .cse33 .cse1 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse2 .cse3 .cse5 .cse24) .cse19 .cse20 .cse9 .cse22 .cse4 .cse11 .cse6 .cse35) (or .cse20 .cse9 (or .cse8 .cse10 .cse11 .cse1 .cse12 .cse25 .cse13 .cse14 .cse15 .cse16 .cse27 .cse17 .cse18 .cse34 .cse2 .cse3 .cse21 .cse22 .cse23 .cse24) .cse4 .cse35)) (and .cse36 .cse31)) (or (and (or (or .cse8 .cse33 .cse32 .cse12 .cse25 .cse13 .cse15 .cse16 .cse27 .cse17 .cse18 .cse2 .cse3 .cse23 .cse29 .cse5 .cse24) .cse20 .cse9 .cse22 .cse4 .cse11 .cse6 .cse35) (or (and (or .cse20 .cse9 (or .cse8 .cse10 .cse1 .cse25 .cse13 .cse16 .cse27 .cse17 .cse18 .cse34 .cse2 .cse3 .cse23 .cse29 .cse24) .cse22 .cse4 .cse11 .cse12 .cse30 .cse15) (or (or (or (or .cse8 .cse33 .cse1 .cse25 .cse13 .cse16 .cse27 .cse17 .cse18 .cse34 .cse2 .cse3 .cse23 .cse29 .cse24) .cse12 .cse15) .cse22 .cse11) .cse20 .cse9 .cse4)) .cse35)) (and .cse31 .cse37)) (or .cse2 .cse3 .cse29 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse32 .cse12 .cse30 .cse13 .cse15 .cse16 .cse17 .cse28 .cse18 .cse19 .cse20 .cse22 .cse23 .cse24) (or (or .cse1 (< 1 ~d1_ev~0) .cse25 .cse2 .cse3 .cse4 .cse5 .cse6 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse30 .cse13 .cse14 .cse15 .cse16 .cse17 .cse27 .cse18 .cse20 .cse22 .cse23 .cse24) .cse36)))) [2018-12-01 14:39:33,336 INFO L444 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (let ((.cse1 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse2 (= ~d0_req_up~0 1))) (let ((.cse3 (< |old(~d0_ev~0)| 2)) (.cse12 (< 0 ~b0_ev~0)) (.cse22 (= ~b1_ev~0 0)) (.cse7 (< ~d1_ev~0 2)) (.cse16 (= ~b1_ev~0 1)) (.cse0 (not (= |old(~d0_req_up~0)| 1))) (.cse4 (= ~b0_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse29 (< 0 |old(~d0_ev~0)|)) (.cse30 (= 0 |old(~d0_ev~0)|)) (.cse31 (and (= ~d0_val~0 ~d0_val_t~0) .cse1 .cse2)) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse21 (= 0 ~b0_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (= 0 ~d1_ev~0)) (.cse24 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse15 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse18 (not (= 0 ~z_val_t~0))) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse25 (= 1 ~b0_ev~0)) (.cse26 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse19 (< ~z_val~0 0)) (.cse27 (= 1 ~d1_ev~0))) (and (or .cse0 (and (= 0 ~d0_val~0) .cse1 .cse2) .cse3 .cse4 .cse5 (not (= 0 ~comp_m1_st~0)) .cse6 .cse7 (< 0 ~d1_val~0) .cse8 .cse9 .cse10 (< 0 ~z_req_up~0) .cse11 .cse12 .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (not (= 1 ~d1_req_up~0))) (or (and .cse2 (= ~d0_val_t~0 ~d0_val~0) (= ~d0_ev~0 |old(~d0_ev~0)|)) (let ((.cse28 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse20 .cse9 .cse6 (or .cse0 .cse8 .cse21 .cse10 .cse11 .cse22 .cse23 .cse24 .cse13 .cse14 .cse16 .cse15 .cse17 .cse3 .cse4 .cse5 .cse25 .cse26 .cse19 .cse27) .cse28) (or (or .cse0 .cse8 (< ~b0_ev~0 2) .cse11 .cse22 .cse23 .cse24 .cse13 .cse14 .cse16 .cse15 .cse4 .cse5 .cse29 .cse27) .cse18 .cse20 .cse9 .cse26 .cse6 .cse10 .cse30 .cse28)))) (or (or .cse0 (= ~z_req_up~0 1) (< 1 ~d1_ev~0) .cse22 .cse4 .cse5 .cse6 .cse29 .cse30 (< 1 ~b1_ev~0) .cse8 .cse9 .cse21 .cse10 .cse11 .cse12 .cse23 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse20 .cse26 .cse19 .cse27) .cse31) (or .cse0 .cse31 .cse22 .cse4 .cse5 .cse6 .cse7 .cse29 .cse30 .cse8 .cse9 .cse21 .cse10 .cse11 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse25 .cse26 .cse19) (or .cse0 .cse4 .cse5 .cse6 .cse29 .cse30 (< ~b1_ev~0 2) .cse31 .cse8 .cse9 .cse21 .cse10 .cse11 .cse23 .cse24 .cse13 .cse14 .cse15 .cse17 .cse18 .cse20 .cse25 .cse26 .cse19 .cse27)))) [2018-12-01 14:39:33,336 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-12-01 14:39:33,336 INFO L448 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-12-01 14:39:33,336 INFO L448 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-12-01 14:39:33,336 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-12-01 14:39:33,336 INFO L448 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-12-01 14:39:33,337 INFO L444 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (< ~d0_ev~0 2) (= ~b0_req_up~0 1) (< 0 ~comp_m1_i~0) (not (= 0 ~comp_m1_st~0)) (< ~b1_val_t~0 1) (< ~d1_ev~0 2) (< ~d1_req_up~0 |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 ~d1_val~0) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< ~b0_val~0 ~b0_val_t~0) (< 0 ~b0_ev~0) (and (= 1 ~b1_req_up~0) (= |old(~b1_ev~0)| ~b1_ev~0)) (< ~b0_val_t~0 1) (not (= ~d0_val~0 0)) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (< |old(~b1_req_up~0)| ~d1_req_up~0) (< ~z_val~0 0) (not (= 1 ~d1_req_up~0))) [2018-12-01 14:39:33,337 INFO L448 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-12-01 14:39:33,337 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-12-01 14:39:33,337 INFO L448 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-12-01 14:39:33,337 INFO L444 ceAbstractionStarter]: At program point update_b0ENTRY(lines 123 137) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (< ~d0_ev~0 2) (< 0 ~comp_m1_i~0) (not (= 0 ~comp_m1_st~0)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< ~d1_ev~0 2) (< ~d1_req_up~0 ~b1_req_up~0) (< ~b1_ev~0 2) (and (<= ~b0_val~0 0) (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (<= 0 ~b0_val~0)) (< 0 ~d1_val~0) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 ~z_req_up~0) (< |old(~b0_req_up~0)| ~d1_req_up~0) (< ~b0_val_t~0 1) (not (= ~d0_val~0 0)) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (< 0 ~z_val~0) (not (= 0 ~z_val_t~0)) (<= (+ ~d1_req_up~0 1) |old(~b0_req_up~0)|) (< ~b1_req_up~0 ~d1_req_up~0) (< ~z_val~0 0) (not (= 1 ~d1_req_up~0))) [2018-12-01 14:39:33,337 INFO L448 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-12-01 14:39:33,338 INFO L444 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse20 (not (= ~b0_ev~0 0))) (.cse21 (not (= ~d1_ev~0 0))) (.cse22 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse1 (= ~d0_val_t~0 ~d0_val~0)) (.cse6 (= ~b0_ev~0 1)) (.cse16 (= ~z_val~0 |old(~z_val~0)|)) (.cse17 (= 1 ~d0_ev~0)) (.cse13 (and (not (= ~b1_ev~0 0)) .cse20 (<= ~b1_ev~0 1) .cse21 .cse22)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse15 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse20 .cse21 (<= 2 ~b1_ev~0) .cse22)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (= 0 ~z_val_t~0)) (.cse8 (= ~z_val~0 ~z_val_t~0)) (.cse9 (<= ~d1_val_t~0 ~d1_val~0)) (.cse18 (= ~d0_val~0 ~d0_val_t~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse19 (<= ~b0_ev~0 0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse14 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse11 (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse6 .cse16 (<= ~d0_ev~0 1) .cse14) .cse1 .cse8 .cse12 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse12 .cse13 .cse14) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse8 (or (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse16 .cse9 .cse18 .cse17 .cse19 .cse12 .cse13 .cse14) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse16 .cse9 .cse18 .cse17 .cse19 .cse12 .cse14))) (< ~b0_val_t~0 1) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse19 .cse12 .cse13 .cse14) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse2 .cse3 .cse4 .cse15 .cse5 .cse7 .cse8 .cse9 .cse18 .cse10 .cse11 .cse19 .cse12 .cse14) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|)))) [2018-12-01 14:39:33,338 INFO L444 ceAbstractionStarter]: At program point L415(line 415) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= 0 ~comp_m1_st~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-01 14:39:33,338 INFO L444 ceAbstractionStarter]: At program point L415-1(line 415) the Hoare annotation is: (let ((.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~d1_ev~0 1)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= 0 ~z_val_t~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (<= ~b0_ev~0 0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |old(~b1_ev~0)| ~b1_ev~0) .cse13 .cse14) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= ~b1_ev~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse13 .cse14) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|)))) [2018-12-01 14:39:33,338 INFO L448 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-12-01 14:39:33,339 INFO L444 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse10 (<= ~d0_ev~0 1)) (.cse14 (not (= ~d0_ev~0 1))) (.cse22 (<= 2 ~d1_ev~0)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0)) (.cse17 (not (= ~d1_ev~0 0)))) (let ((.cse26 (and .cse12 (<= 2 ~d0_ev~0) .cse13 .cse15 .cse16 .cse17)) (.cse28 (<= 2 ~b1_ev~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse7 (<= ~b0_ev~0 0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse29 (= 0 ~z_val_t~0)) (.cse25 (not (= ~b0_ev~0 1))) (.cse24 (and .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)) (.cse6 (not (= ~d0_ev~0 0))) (.cse20 (= ~d0_val_t~0 ~d0_val~0)) (.cse27 (= ~z_val~0 ~z_val_t~0)) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0)) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse21 (<= 2 ~b0_ev~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (and .cse6 .cse20 (and (and .cse0 .cse2 .cse3 .cse21 .cse22 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16) .cse4) .cse8 .cse19) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse24 .cse0 .cse2 .cse3 .cse23 .cse5 .cse25 .cse18)) (and (and .cse1 .cse4 (and .cse0 .cse2 (and (and .cse22 .cse26) .cse23) .cse3 .cse25 .cse18 .cse5)) .cse8 .cse19) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse18 (and .cse9 .cse11 .cse26)) .cse27 .cse8 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) .cse6 .cse29 .cse27 .cse25 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse22 .cse16 .cse28) .cse0 .cse2 .cse3 .cse23 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse29 .cse27 .cse25 .cse8 (and .cse9 .cse24) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse6 .cse20 .cse27 .cse8 .cse19 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse4 .cse21 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17))))) [2018-12-01 14:39:33,339 INFO L444 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (let ((.cse18 (= 0 ~z_val_t~0)) (.cse13 (= ~z_val~0 ~z_val_t~0)) (.cse10 (not (= ~b0_ev~0 1))) (.cse16 (not (= ~d0_ev~0 1))) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse4 (not (= ~b0_req_up~0 1))) (.cse5 (not (= ~z_req_up~0 1))) (.cse6 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (= ~z_val~0 |old(~z_val~0)|)) (.cse9 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse15 (<= ~d1_val_t~0 ~d1_val~0)) (.cse3 (= ~d0_val~0 ~d0_val_t~0)) (.cse17 (not (= ~d0_ev~0 0))) (.cse8 (not (= ~b1_ev~0 0))) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= 2 ~z_ev~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~d0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse1 (and .cse0 .cse2 .cse9 .cse16 .cse12 (<= 2 ~b1_ev~0)) .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse13 .cse10 .cse14 .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (and .cse17 (= ~d0_val_t~0 ~d0_val~0) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 (<= 2 ~b0_ev~0) .cse7 .cse8 .cse16 .cse11 .cse12) .cse13 .cse14 .cse15) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse17 .cse18 .cse13 .cse10 .cse14 (and .cse0 (and .cse8 .cse9 .cse16 (<= 2 ~d1_ev~0) .cse12)) .cse11 .cse15) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse0 .cse1 .cse2 .cse4 (<= ~d1_ev~0 1) .cse5 .cse6 .cse7 .cse9 .cse11 .cse15 .cse3 (<= ~d0_ev~0 0) .cse17 .cse8 (<= ~b0_ev~0 0) .cse14 (<= ~b1_ev~0 1) .cse12))) [2018-12-01 14:39:33,339 INFO L444 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (let ((.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse13 (not (= ~d1_ev~0 0))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse18 (= 0 ~z_val_t~0)) (.cse16 (= ~z_val~0 ~z_val_t~0)) (.cse17 (not (= ~b0_ev~0 1))) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse8 (<= 2 ~comp_m1_st~0)) (.cse9 (not (= ~b1_ev~0 0))) (.cse10 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~d0_ev~0 1))) (.cse12 (<= 2 ~z_ev~0)) (.cse14 (not (= ~b1_ev~0 1))) (.cse15 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 (and .cse8 (<= ~d0_ev~0 1) .cse9 (<= ~d1_ev~0 1) .cse10 .cse11 (<= ~b1_ev~0 1) .cse12 .cse13) .cse14 .cse15) (and .cse6 (= ~d0_val_t~0 ~d0_val~0) .cse16 .cse7 .cse15 (and .cse8 .cse0 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse9 .cse11 .cse14 .cse12 .cse13)) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 (= 1 ~d1_ev~0) .cse9 .cse10 .cse11 .cse12) .cse5 .cse6 .cse17 .cse7 .cse14 .cse15) (and .cse16 .cse7 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse8 (and .cse9 (<= 2 ~d0_ev~0) .cse10 .cse12 .cse13)) .cse17 .cse14) .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 .cse10 .cse11 .cse12 .cse13 (<= 2 ~b1_ev~0)) .cse6 .cse18 .cse16 .cse17 .cse7 .cse15) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse18 .cse16 .cse17 .cse7 (and .cse8 (and .cse9 .cse10 .cse11 (<= 2 ~d1_ev~0) .cse12)) .cse14 .cse15) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|))) [2018-12-01 14:39:33,340 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse4 (= ~z_val~0 |old(~z_val~0)|)) (.cse9 (not (= ~b1_ev~0 0))) (.cse14 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse7 (<= 2 ~comp_m1_st~0)) (.cse8 (not (= ~d1_ev~0 1))) (.cse10 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~d0_ev~0 1))) (.cse12 (<= 2 ~z_ev~0)) (.cse13 (not (= ~d1_ev~0 0))) (.cse5 (not (= ~d0_ev~0 0))) (.cse16 (= 0 ~z_val_t~0)) (.cse17 (= ~z_val~0 ~z_val_t~0)) (.cse18 (not (= ~b0_ev~0 1))) (.cse6 (<= ~b1_val_t~0 ~b1_val~0)) (.cse15 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 (not (= ~z_req_up~0 1)) .cse3 .cse4 .cse5 (<= ~b0_ev~0 0) .cse6 (and .cse7 (<= ~d0_ev~0 1) .cse8 .cse9 (<= ~d1_ev~0 1) .cse10 .cse11 (<= ~b1_ev~0 1) .cse12 .cse13) .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse16 .cse17 .cse18 .cse6 (and .cse7 (and .cse9 .cse10 .cse11 (<= 2 ~d1_ev~0) .cse12)) .cse14 .cse15) (and .cse17 .cse6 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse18 .cse14 (and .cse7 .cse8 (and .cse9 (<= 2 ~d0_ev~0) .cse10 .cse12 .cse13))) .cse15) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and .cse5 (= ~d0_val_t~0 ~d0_val~0) .cse17 .cse6 (and .cse7 .cse0 .cse8 .cse2 .cse3 (<= 2 ~b0_ev~0) .cse4 .cse9 .cse11 .cse14 .cse12 .cse13) .cse15) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 (and .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 (<= 2 ~b1_ev~0)) .cse5 .cse16 .cse17 .cse18 .cse6 .cse15))) [2018-12-01 14:39:33,343 INFO L448 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-12-01 14:39:33,344 INFO L444 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse32 (<= 2 ~d0_ev~0)) (.cse17 (not (= ~d1_ev~0 0))) (.cse10 (<= ~d0_ev~0 1)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse14 (not (= ~d0_ev~0 1))) (.cse22 (<= 2 ~d1_ev~0)) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0))) (let ((.cse7 (<= ~b0_ev~0 0)) (.cse24 (and .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)) (.cse26 (and .cse12 .cse32 .cse13 .cse15 .cse16 .cse17 (<= ~comp_m1_i~0 0))) (.cse20 (= ~d0_val_t~0 ~d0_val~0)) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse21 (<= 2 ~b0_ev~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse29 (= 0 ~z_val_t~0)) (.cse27 (= ~z_val~0 ~z_val_t~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse28 (<= 2 ~b1_ev~0)) (.cse30 (<= ~d0_ev~0 0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse25 (not (= ~b0_ev~0 1))) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (< |old(~d1_ev~0)| 2) (and .cse6 .cse20 .cse8 (and .cse4 (and .cse0 .cse2 .cse3 .cse21 .cse22 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16)) .cse19) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse24 .cse0 .cse2 .cse3 .cse23 .cse5 .cse25 .cse18)) (and (and .cse1 .cse4 (and .cse0 .cse2 (and (and .cse22 .cse26) .cse23) .cse3 .cse25 .cse18 .cse5)) .cse8 .cse19) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse18 (and .cse9 .cse11 .cse26)) .cse27 .cse8 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) .cse6 .cse29 .cse27 .cse25 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse22 .cse16 .cse28) .cse0 .cse2 .cse3 .cse23 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse29 .cse27 .cse25 .cse8 (and .cse9 .cse24) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (and .cse6 (and .cse0 .cse11 .cse2 .cse4 .cse21 .cse23 .cse5 .cse18 .cse17 .cse30 .cse12 .cse16 .cse31) .cse20 .cse27 .cse8 .cse19) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse27 (or (and (and .cse1 (and .cse0 .cse2 .cse3 (and .cse11 .cse23 (and .cse32 .cse13 .cse16 .cse17 .cse28)) .cse25 .cse5) .cse4) .cse8 .cse19) (and .cse1 .cse4 .cse8 (and (and .cse11 .cse23 .cse26) .cse0 .cse2 .cse3 .cse25 .cse18 .cse5) .cse19))) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse6 .cse20 .cse27 .cse8 .cse19 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse4 .cse21 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17)) (and .cse0 .cse11 .cse2 .cse4 .cse23 .cse29 .cse27 .cse13 .cse17 .cse19 .cse1 .cse28 .cse30 .cse6 .cse25 .cse8 .cse16 .cse31)))) [2018-12-01 14:39:33,348 INFO L448 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-12-01 14:39:33,348 INFO L444 ceAbstractionStarter]: At program point L422-1(lines 419 444) the Hoare annotation is: (let ((.cse32 (<= 2 ~d0_ev~0)) (.cse17 (not (= ~d1_ev~0 0))) (.cse10 (<= ~d0_ev~0 1)) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 0))) (.cse14 (not (= ~d0_ev~0 1))) (.cse22 (<= 2 ~d1_ev~0)) (.cse15 (<= ~b1_ev~0 1)) (.cse16 (<= 2 ~z_ev~0))) (let ((.cse7 (<= ~b0_ev~0 0)) (.cse24 (and .cse10 .cse12 .cse13 .cse14 .cse22 .cse15 .cse16)) (.cse26 (and .cse12 .cse32 .cse13 .cse15 .cse16 .cse17 (<= ~comp_m1_i~0 0))) (.cse20 (= ~d0_val_t~0 ~d0_val~0)) (.cse9 (<= 2 ~comp_m1_st~0)) (.cse3 (not (= ~z_req_up~0 1))) (.cse21 (<= 2 ~b0_ev~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse18 (not (= ~b1_ev~0 1))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse11 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse29 (= 0 ~z_val_t~0)) (.cse27 (= ~z_val~0 ~z_val_t~0)) (.cse19 (<= ~d1_val_t~0 ~d1_val~0)) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse28 (<= 2 ~b1_ev~0)) (.cse30 (<= ~d0_ev~0 0)) (.cse6 (not (= ~d0_ev~0 0))) (.cse25 (not (= ~b0_ev~0 1))) (.cse8 (<= ~b1_val_t~0 ~b1_val~0)) (.cse31 (= ~z_req_up~0 |old(~z_req_up~0)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10 .cse11 .cse12 (<= ~d1_ev~0 1) .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19) (< |old(~d1_ev~0)| 2) (and .cse6 .cse20 .cse8 (and .cse4 (and .cse0 .cse2 .cse3 .cse21 .cse22 .cse23 .cse5 .cse12 .cse14 .cse18 .cse16)) .cse19) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse6 .cse1 .cse4 .cse8 .cse19 (and .cse24 .cse0 .cse2 .cse3 .cse23 .cse5 .cse25 .cse18)) (and (and .cse1 .cse4 (and .cse0 .cse2 (and (and .cse22 .cse26) .cse23) .cse3 .cse25 .cse18 .cse5)) .cse8 .cse19) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse25 .cse18 (and .cse9 .cse11 .cse26)) .cse27 .cse8 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse9 .cse11 .cse13 .cse14 .cse16 .cse17 .cse28) .cse6 .cse29 .cse27 .cse25 .cse8 .cse19) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (and (and (and .cse13 .cse14 .cse22 .cse16 .cse28) .cse0 .cse2 .cse3 .cse23 .cse5) .cse6 .cse1 .cse7 .cse4 .cse8 .cse19) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse29 .cse27 .cse25 .cse8 (and .cse9 .cse24) .cse18 .cse19) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (and .cse6 (and .cse0 .cse11 .cse2 .cse4 .cse21 .cse23 .cse5 .cse18 .cse17 .cse30 .cse12 .cse16 .cse31) .cse20 .cse27 .cse8 .cse19) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse27 (or (and (and .cse1 (and .cse0 .cse2 .cse3 (and .cse11 .cse23 (and .cse32 .cse13 .cse16 .cse17 .cse28)) .cse25 .cse5) .cse4) .cse8 .cse19) (and .cse1 .cse4 .cse8 (and (and .cse11 .cse23 .cse26) .cse0 .cse2 .cse3 .cse25 .cse18 .cse5) .cse19))) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse6 .cse20 .cse27 .cse8 .cse19 (and .cse9 .cse0 .cse11 .cse2 .cse3 .cse4 .cse21 .cse5 .cse12 .cse14 .cse18 .cse16 .cse17)) (and .cse0 .cse11 .cse2 .cse4 .cse23 .cse29 .cse27 .cse13 .cse17 .cse19 .cse1 .cse28 .cse30 .cse6 .cse25 .cse8 .cse16 .cse31)))) [2018-12-01 14:39:33,351 INFO L444 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (let ((.cse24 (not (= ~b0_ev~0 0))) (.cse25 (not (= ~d1_ev~0 0))) (.cse26 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse7 (= 1 ~d0_ev~0)) (.cse20 (<= 2 ~comp_m1_st~0)) (.cse21 (not (= ~d1_ev~0 1))) (.cse23 (= 1 ~d1_ev~0)) (.cse22 (= ~b1_ev~0 1)) (.cse17 (= 0 ~z_val_t~0)) (.cse2 (= ~d0_val~0 ~d0_val_t~0)) (.cse18 (<= ~d0_ev~0 0)) (.cse9 (<= ~b0_ev~0 0)) (.cse11 (and (not (= ~b1_ev~0 0)) .cse24 (<= ~b1_ev~0 1) .cse25 .cse26)) (.cse19 (not (= ~d0_ev~0 0))) (.cse15 (= ~d0_val_t~0 ~d0_val~0)) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse10 (<= ~b1_val_t~0 ~b1_val~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse14 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse24 .cse25 (<= 2 ~z_ev~0) (<= 2 ~b1_ev~0) (<= ~comp_m1_i~0 0) .cse26)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse16 (= ~b0_ev~0 1)) (.cse6 (= 0 ~comp_m1_st~0)) (.cse8 (= ~z_val~0 |old(~z_val~0)|)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse12 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13))) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse0 .cse12 .cse7 .cse10 .cse11 .cse13) (and .cse15 .cse1 .cse3 .cse4 .cse5 .cse16 .cse6 .cse17 .cse0 .cse12 .cse18 .cse19 .cse10 .cse11 .cse13) (and .cse20 .cse1 .cse21 .cse3 .cse4 .cse5 .cse17 .cse0 (not .cse22) .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse20 .cse1 .cse21 .cse3 .cse4 .cse14 .cse5 .cse17 .cse0 .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse13) (not (= 1 |old(~d1_req_up~0)|)) (and .cse1 .cse3 .cse5 .cse6 .cse17 .cse0 .cse12 .cse23 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (not (= |old(~d0_req_up~0)| 1)) (and .cse1 .cse3 .cse14 .cse5 .cse6 .cse17 .cse0 .cse12 .cse23 .cse2 .cse18 .cse19 .cse9 .cse10 .cse13) (< |old(~d0_ev~0)| 2) (and .cse1 .cse3 .cse4 .cse22 .cse5 .cse6 .cse17 .cse0 .cse12 .cse2 .cse18 .cse19 .cse9 .cse10 .cse11 .cse13) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse19 .cse15 .cse0 .cse10 (and .cse1 .cse3 .cse4 .cse14 .cse5 .cse16 .cse6 .cse8 (<= ~d0_ev~0 1) .cse13) .cse12)))) [2018-12-01 14:39:33,354 INFO L444 ceAbstractionStarter]: At program point start_simulationENTRY(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= 0 ~comp_m1_st~0) (= ~b0_req_up~0 1) (= 0 ~z_val_t~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-01 14:39:33,359 INFO L444 ceAbstractionStarter]: At program point L416(line 416) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse4 (<= ~d1_ev~0 1)) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= 0 ~z_val_t~0)) (.cse7 (= ~z_val~0 ~z_val_t~0)) (.cse8 (<= ~d1_val_t~0 ~d1_val~0)) (.cse9 (= ~d0_val~0 ~d0_val_t~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (<= ~b0_ev~0 0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse14 (<= |old(~z_ev~0)| ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (= ~b1_ev~0 1)) .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse13 .cse14) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= |old(~b1_ev~0)| ~b1_ev~0) .cse13 .cse14) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|)))) [2018-12-01 14:39:33,359 INFO L444 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (and (let ((.cse0 (and (not (= ~d1_ev~0 1)) (and (not (= ~d0_ev~0 1)) (and (and (and (not (= ~b0_ev~0 0)) (<= ~comp_m1_i~0 0)) (not (= ~b1_ev~0 0))) (not (= ~d1_ev~0 0))))))) (or (and .cse0 (= 0 ~comp_m1_st~0)) (and (<= 2 ~comp_m1_st~0) .cse0))) (not (= 1 ~b1_req_up~0)) (not (= ~b0_req_up~0 1)) (not (= ~b0_ev~0 1)) (not (= ~b1_ev~0 1)) (= ~z_val~0 |old(~z_val~0)|)) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~0)|) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (not (= 1 |old(~d1_req_up~0)|))) [2018-12-01 14:39:33,359 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-12-01 14:39:33,361 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-01 14:39:33,361 INFO L444 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse10 (not (= ~b1_ev~0 0))) (.cse25 (<= 2 ~d0_ev~0)) (.cse11 (not (= ~b0_ev~0 0))) (.cse13 (<= ~b1_ev~0 1)) (.cse14 (<= 2 ~z_ev~0)) (.cse15 (not (= ~d1_ev~0 0)))) (let ((.cse22 (= 0 ~z_val_t~0)) (.cse19 (and .cse10 .cse25 .cse11 .cse13 .cse14 .cse15 (<= ~comp_m1_i~0 0))) (.cse1 (= ~d0_val~0 ~d0_val_t~0)) (.cse24 (= 1 ~d1_ev~0)) (.cse23 (= 0 ~comp_m1_st~0)) (.cse21 (<= 2 ~b1_ev~0)) (.cse18 (not (= ~b0_ev~0 1))) (.cse6 (not (= ~d0_ev~0 0))) (.cse20 (= ~z_val~0 ~z_val_t~0)) (.cse7 (<= ~b1_val_t~0 ~b1_val~0)) (.cse17 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse9 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (not (= ~z_req_up~0 1))) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= ~z_val~0 |old(~z_val~0)|)) (.cse12 (not (= ~d0_ev~0 1))) (.cse16 (not (= ~b1_ev~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ~b0_ev~0 0) .cse7 (and .cse8 (<= ~d0_ev~0 1) .cse9 .cse10 (<= ~d1_ev~0 1) .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse18 .cse16 (and .cse8 .cse9 .cse19)) .cse20 .cse7 .cse17) (and .cse0 .cse1 .cse2 .cse3 .cse4 (and .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse21) .cse6 .cse22 .cse20 .cse18 .cse7 .cse17) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse22 .cse20 .cse18 .cse7 (and .cse8 (and .cse10 .cse11 .cse12 (<= 2 ~d1_ev~0) .cse14)) .cse16 .cse17) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (and .cse0 .cse2 .cse3 .cse4 .cse23 .cse5 .cse11 .cse16 .cse17 .cse24 .cse1 (<= ~d0_ev~0 0) .cse6 .cse10 .cse18 .cse7 .cse14) (not (= |old(~d0_val~0)| 0)) (and .cse7 (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse24 .cse23 .cse19) .cse18 .cse16) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (and .cse24 .cse23 (and .cse25 .cse11 .cse14 .cse21)) .cse18)) .cse17) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (not (= 0 |old(~z_val_t~0)|)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (and .cse6 (= ~d0_val_t~0 ~d0_val~0) .cse20 .cse7 .cse17 (and .cse8 .cse0 .cse9 .cse2 .cse3 .cse4 (<= 2 ~b0_ev~0) .cse5 .cse10 .cse12 .cse16 .cse14 .cse15))))) [2018-12-01 14:39:33,361 INFO L448 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-12-01 14:39:33,361 INFO L444 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse28 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse29 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse30 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse31 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse32 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse8 (= 0 |old(~d0_ev~0)|)) (.cse11 (= 0 |old(~b0_ev~0)|)) (.cse1 (= ~z_req_up~0 1)) (.cse3 (= |old(~b1_ev~0)| 0)) (.cse26 (= 1 |old(~b0_ev~0)|)) (.cse2 (< 1 |old(~d1_ev~0)|)) (.cse4 (= ~b0_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse7 (< 0 |old(~d0_ev~0)|)) (.cse9 (= ~b1_req_up~0 1)) (.cse10 (< ~b1_val~0 ~b1_val_t~0)) (.cse12 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (< 0 |old(~b0_ev~0)|)) (.cse15 (< ~comp_m1_st~0 2)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse18 (< |old(~z_ev~0)| 2)) (.cse19 (= |old(~b1_ev~0)| 1)) (.cse20 (< 0 ~z_val~0)) (.cse25 (not (= 0 ~z_val_t~0))) (.cse0 (and .cse28 .cse29 .cse30 .cse31 .cse32)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse24 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< 1 |old(~b1_ev~0)|) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24)) (or .cse1 .cse4 .cse5 .cse6 .cse7 .cse8 (< |old(~b1_ev~0)| 2) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse25 .cse21 .cse22 .cse23 .cse0 .cse24) (or .cse1 .cse3 .cse4 .cse5 .cse0 .cse6 (< |old(~d1_ev~0)| 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse21 .cse26 .cse22 .cse23) (or (let ((.cse27 (not (= ~z_val~0 ~z_val_t~0)))) (and (or .cse21 .cse10 .cse22 .cse6 .cse12 .cse8 .cse27 (or .cse9 (< |old(~b0_ev~0)| 2) .cse1 .cse13 .cse3 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 .cse4 .cse5 .cse23 .cse7 .cse24)) (or .cse21 .cse10 .cse6 (or .cse9 .cse11 .cse12 .cse1 .cse13 .cse3 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 (< |old(~d0_ev~0)| 2) .cse4 .cse5 .cse26 .cse22 .cse23 .cse24) .cse27))) (and .cse28 (and .cse29 .cse30 .cse31 .cse32))) (or .cse2 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 (< 0 ~z_req_up~0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse25 .cse0 .cse21 .cse22 .cse23 .cse24)))) [2018-12-01 14:39:33,362 INFO L448 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L448 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L448 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L448 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L448 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L448 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-12-01 14:39:33,363 INFO L444 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse52 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse54 (<= ~d0_ev~0 1)) (.cse55 (not (= ~b0_ev~0 0))) (.cse56 (not (= ~d0_ev~0 1))) (.cse45 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse48 (<= ~b1_ev~0 1)) (.cse57 (not (= ~d1_ev~0 0))) (.cse46 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse4 (< |old(~d1_ev~0)| 2)) (.cse21 (= ~z_val~0 ~z_val_t~0)) (.cse7 (< 1 |old(~b1_ev~0)|)) (.cse15 (and (<= ~comp_m1_i~0 0) .cse52 .cse54 (not (= ~b1_ev~0 0)) .cse55 .cse56 .cse45 .cse48 (<= 2 ~z_ev~0) .cse57 .cse46)) (.cse20 (= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse40 (< |old(~b1_ev~0)| 2)) (.cse34 (not (= 0 ~z_val_t~0))) (.cse6 (= 0 |old(~d0_ev~0)|)) (.cse47 (< |old(~b0_ev~0)| 2)) (.cse5 (< 0 |old(~d0_ev~0)|)) (.cse35 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse24 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse23 (= |old(~b1_req_up~0)| 1)) (.cse25 (= 0 |old(~b0_ev~0)|)) (.cse26 (< ~d0_val_t~0 1)) (.cse27 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse49 (= 0 |old(~d1_ev~0)|)) (.cse28 (< ~comp_m1_st~0 2)) (.cse29 (< ~b0_val_t~0 1)) (.cse30 (< ~d1_val_t~0 1)) (.cse32 (= |old(~b1_ev~0)| 1)) (.cse31 (< |old(~z_ev~0)| 2)) (.cse33 (< 0 |old(~z_val~0)|)) (.cse39 (< |old(~d0_ev~0)| 2)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse36 (= 1 |old(~b0_ev~0)|)) (.cse37 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse38 (< |old(~z_val~0)| 0)) (.cse50 (= 1 |old(~d1_ev~0)|)) (.cse22 (<= ~b1_val_t~0 ~b1_val~0)) (.cse19 (= |old(~d0_req_up~0)| 1)) (.cse11 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse12 (= |old(~d1_val~0)| ~d1_val~0)) (.cse14 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse16 (= ~d1_req_up~0 1)) (.cse13 (= ~d0_val~0 ~d0_val_t~0)) (.cse8 (<= ~b0_val_t~0 ~b0_val~0)) (.cse51 (= ~z_val~0 |old(~z_val~0)|)) (.cse9 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse10 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse17 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse18 (= ~z_req_up~0 |old(~z_req_up~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse19 .cse16 .cse17 .cse18)) .cse20 .cse21 .cse22) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38) (let ((.cse41 (not (= 1 ~b1_req_up~0))) (.cse42 (not (= ~b0_req_up~0 1))) (.cse43 (<= ~d0_ev~0 0)) (.cse44 (<= ~b0_ev~0 0))) (or (not .cse19) .cse39 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) .cse4 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse40 (< 0 |old(~d1_val~0)|) (and .cse41 .cse42 .cse8 .cse21 .cse12 .cse13 .cse14 .cse43 .cse44 .cse17 .cse22 .cse45 .cse18 .cse46) (< |old(~b0_val~0)| 0) .cse47 .cse26 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse29 (not (= |old(~d0_val~0)| 0)) .cse30 .cse31 .cse33 .cse34 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse38 (and .cse41 .cse42 .cse8 .cse21 (not (= ~b1_ev~0 1)) .cse12 .cse13 .cse14 .cse43 .cse44 .cse17 .cse22 .cse48 .cse18 .cse46) (not (= 1 |old(~d1_req_up~0)|)))) (or (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse23 .cse24 .cse25 .cse26 .cse27 (< 0 |old(~b0_ev~0)|) .cse49 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse37 .cse38 .cse50) (and (or (and .cse13 .cse8 (and .cse12 .cse14 .cse15 .cse19 .cse16 .cse17) .cse51 .cse9 .cse10 .cse18) (and .cse8 .cse51 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18)) .cse20 .cse22)) (or .cse1 (and .cse20 .cse22 (let ((.cse53 (and .cse54 (<= |old(~d0_ev~0)| ~d0_ev~0) .cse55 .cse56 .cse45 .cse57 .cse46))) (or (and .cse13 .cse8 .cse51 .cse9 .cse52 .cse10 .cse17 (and .cse12 .cse53 .cse14 .cse19 .cse16) .cse18) (and .cse8 .cse51 .cse9 .cse52 .cse10 .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse53 .cse18)))) .cse2 .cse3 .cse5 .cse6 .cse40 .cse23 .cse24 .cse25 .cse26 .cse27 .cse49 .cse28 .cse29 .cse30 .cse31 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse50) (or (let ((.cse58 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse35 .cse24 .cse37 .cse3 .cse26 .cse6 .cse58 (or .cse23 .cse47 .cse27 .cse0 .cse49 .cse28 .cse29 .cse30 .cse32 .cse31 .cse33 .cse1 .cse2 .cse38 .cse5 .cse50)) (or .cse35 .cse24 .cse3 (or .cse23 .cse25 .cse26 .cse27 .cse0 .cse49 .cse28 .cse29 .cse30 .cse32 .cse31 .cse33 .cse39 .cse1 .cse2 .cse36 .cse37 .cse38 .cse50) .cse58))) (and .cse22 (and (let ((.cse59 (= |old(~d0_ev~0)| ~d0_ev~0))) (or (and .cse12 .cse14 .cse59 .cse19 .cse16 .cse52 .cse45 .cse46) (and .cse11 .cse12 .cse14 .cse59 .cse16 .cse52 .cse45 .cse46))) .cse13 .cse8 .cse51 .cse9 .cse10 .cse17 .cse18)))))) [2018-12-01 14:39:33,365 INFO L448 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-12-01 14:39:33,367 INFO L444 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse24 (< |old(~d1_ev~0)| 2)) (.cse5 (< |old(~b1_ev~0)| 2)) (.cse17 (not (= 0 ~z_val_t~0))) (.cse4 (= 0 |old(~d0_ev~0)|)) (.cse27 (< |old(~b0_ev~0)| 2)) (.cse3 (< 0 |old(~d0_ev~0)|)) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse6 (= |old(~b1_req_up~0)| 1)) (.cse8 (= 0 |old(~b0_ev~0)|)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse23 (= |old(~b1_ev~0)| 0)) (.cse11 (= 0 |old(~d1_ev~0)|)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse25 (= |old(~b1_ev~0)| 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse16 (< 0 |old(~z_val~0)|)) (.cse26 (< |old(~d0_ev~0)| 2)) (.cse0 (= |old(~b0_req_up~0)| 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse21 (< |old(~z_val~0)| 0)) (.cse22 (= 1 |old(~d1_ev~0)|)) (.cse28 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 (< 1 |old(~b1_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 0 |old(~b0_ev~0)|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse18 .cse20 .cse21 .cse22) (or (not (= |old(~d0_req_up~0)| 1)) .cse26 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (< 0 |old(~b0_val~0)|) .cse24 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse5 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (and (not (= ~b0_req_up~0 1)) (<= ~b0_val_t~0 ~b0_val~0) (= ~z_val~0 ~z_val_t~0) (= 1 ~b1_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_ev~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (= ~d0_req_up~0 1) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) .cse27 .cse9 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse21 (not (= 1 |old(~d1_req_up~0)|))) (or .cse18 .cse7 .cse20 .cse2 .cse9 .cse4 .cse28 (or .cse6 .cse27 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse0 .cse1 .cse21 .cse3 .cse22)) (or .cse18 .cse7 .cse2 (or .cse6 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse26 .cse0 .cse1 .cse19 .cse20 .cse21 .cse22) .cse28))) [2018-12-01 14:39:33,367 INFO L448 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-12-01 14:39:33,368 INFO L444 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse56 (<= ~b1_ev~0 1)) (.cse47 (<= 2 ~comp_m1_st~0)) (.cse32 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse25 (= ~d0_val_t~0 ~d0_val~0)) (.cse49 (<= 2 ~d0_ev~0)) (.cse75 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse62 (<= 2 ~b1_ev~0)) (.cse53 (<= ~comp_m1_i~0 0)) (.cse55 (not (= ~b0_ev~0 0))) (.cse57 (<= 2 ~z_ev~0)) (.cse81 (not (= ~d1_ev~0 0))) (.cse23 (<= ~d1_val_t~0 ~d1_val~0)) (.cse30 (not (= ~d1_ev~0 1))) (.cse31 (<= ~d1_ev~0 1)) (.cse22 (<= ~b1_val_t~0 ~b1_val~0)) (.cse58 (= ~d0_val~0 ~d0_val_t~0)) (.cse42 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse26 (= ~b0_req_up~0 |old(~b0_req_up~0)|)) (.cse28 (not (= |old(~b0_req_up~0)| |old(~d1_req_up~0)|))) (.cse41 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse37 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse67 (= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse38 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))) (.cse48 (= |old(~d1_val~0)| ~d1_val~0)) (.cse36 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse52 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse27 (<= ~b0_val_t~0 ~b0_val~0)) (.cse29 (= ~z_val~0 |old(~z_val~0)|)) (.cse24 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse39 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse66 (<= ~d0_ev~0 1)) (.cse54 (not (= ~b1_ev~0 0))) (.cse88 (<= |old(~d0_ev~0)| ~d0_ev~0)) (.cse79 (not (= ~d0_ev~0 1))) (.cse34 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse35 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse33 (= |old(~d0_req_up~0)| 1)) (.cse17 (< |old(~d1_ev~0)| 2)) (.cse86 (< |old(~b1_ev~0)| 2)) (.cse70 (< |old(~b0_ev~0)| 2)) (.cse85 (not (= 0 ~z_val_t~0))) (.cse71 (< 1 |old(~d1_ev~0)|)) (.cse73 (< 0 |old(~d0_ev~0)|)) (.cse69 (= 0 |old(~d0_ev~0)|)) (.cse89 (< 0 |old(~b0_ev~0)|)) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse19 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse0 (= |old(~b1_req_up~0)| 1)) (.cse1 (= 0 |old(~b0_ev~0)|)) (.cse2 (< ~d0_val_t~0 1)) (.cse84 (= |old(~z_req_up~0)| 1)) (.cse3 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse4 (= |old(~b1_ev~0)| 0)) (.cse72 (= 0 |old(~d1_ev~0)|)) (.cse5 (< ~comp_m1_st~0 2)) (.cse6 (< ~b0_val_t~0 1)) (.cse7 (< ~d1_val_t~0 1)) (.cse8 (= |old(~b1_ev~0)| 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse10 (< 0 |old(~z_val~0)|)) (.cse11 (< |old(~d0_ev~0)| 2)) (.cse12 (= |old(~b0_req_up~0)| 1)) (.cse13 (< 0 ~comp_m1_i~0)) (.cse14 (= 1 |old(~b0_ev~0)|)) (.cse15 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse16 (< |old(~z_val~0)| 0)) (.cse74 (= 1 |old(~d1_ev~0)|)) (.cse20 (< ~b1_val_t~0 1)) (.cse21 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21) (and .cse22 .cse23 (and .cse24 .cse25 (and .cse26 .cse27 .cse28 .cse29 (or (and .cse30 .cse31 .cse32 .cse33 .cse34 .cse35) (and .cse36 .cse30 .cse31 .cse32 .cse34 .cse35)) .cse37 .cse38 .cse39))) (and .cse22 (let ((.cse45 (not .cse0)) (.cse43 (not (= 1 ~b1_req_up~0))) (.cse50 (<= 2 ~d1_ev~0)) (.cse51 (<= 1 ~d1_val_t~0))) (or (and (let ((.cse40 (let ((.cse44 (let ((.cse46 (and .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse32 .cse53 .cse24 .cse54 .cse55 .cse34 .cse56 .cse57 .cse35))) (or (and .cse36 .cse46) (and .cse46 .cse33))))) (or (and .cse43 .cse37 .cse44 .cse38) (and .cse37 .cse41 .cse44 .cse45))))) (or (and .cse40 .cse26 .cse28) (and .cse40 .cse41 .cse42))) .cse58 .cse27 .cse29 .cse39) (and .cse58 .cse27 (let ((.cse59 (let ((.cse60 (let ((.cse61 (and .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse32 .cse62 .cse53 .cse24 .cse55 .cse34 .cse57 .cse35))) (or (and .cse36 .cse61) (and .cse61 .cse33))))) (or (and .cse60 .cse37 .cse41 .cse45) (and .cse43 .cse60 .cse37 .cse38))))) (or (and .cse59 .cse41 .cse42) (and .cse59 .cse26 .cse28))) .cse29 .cse39))))) (let ((.cse64 (= 1 |old(~z_req_up~0)|)) (.cse68 (= ~z_val~0 ~z_val_t~0))) (or (and (let ((.cse65 (and .cse24 .cse66 .cse34 .cse56 .cse35)) (.cse63 (and .cse48 (and .cse52 .cse62 .cse24 .cse66 .cse34 .cse35)))) (or (and .cse25 (or (and (and .cse41 (and .cse63 .cse36 .cse37) .cse42) .cse27 .cse39) (and .cse27 .cse64 (and (and .cse37 (and .cse48 (and .cse36 .cse65 .cse52))) .cse41 .cse42) .cse39))) (and .cse25 (or (and .cse27 .cse64 (and (and (and (and .cse48 (and .cse65 .cse52)) .cse33) .cse37 .cse41) .cse42) .cse39) (and .cse27 (and (and (and .cse63 .cse33) .cse37) .cse41 .cse42) .cse39))))) .cse67 .cse68 .cse22) (and (or .cse18 .cse19 .cse15 .cse20 .cse2 .cse69 .cse21 (or .cse0 .cse70 .cse3 .cse71 .cse4 .cse72 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse16 .cse73 .cse74)) (or .cse18 .cse19 .cse20 (or .cse0 .cse1 .cse2 .cse3 .cse71 .cse4 .cse72 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse74) .cse21)) (and (let ((.cse78 (<= 2 ~b0_ev~0))) (let ((.cse77 (and .cse24 .cse66 .cse54 .cse78 .cse79 .cse34 .cse56 .cse57 .cse53 .cse35)) (.cse76 (and .cse24 .cse66 .cse78 .cse79 .cse34 .cse57 .cse62 .cse53 .cse35))) (or (and .cse25 (or (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse75 .cse37 .cse36 .cse76 .cse38 .cse39) (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse75 .cse37 .cse64 .cse77 .cse36 .cse38 .cse39))) (and .cse25 (or (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse33 .cse75 .cse37 .cse38 .cse64 .cse77 .cse39) (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse33 .cse75 .cse76 .cse37 .cse38 .cse39)))))) .cse67 .cse68 .cse22 .cse23) (and .cse22 (let ((.cse82 (<= |old(~d1_ev~0)| 1))) (or (and .cse58 .cse27 .cse29 .cse24 (and (and .cse37 (let ((.cse80 (and .cse47 .cse48 .cse30 .cse49 .cse52 .cse32 .cse53 .cse54 .cse55 .cse34 .cse56 .cse57 .cse81 .cse82 .cse35))) (or (and .cse80 .cse33) (and .cse80 .cse36)))) .cse41 .cse42) .cse39) (and .cse58 .cse27 (and (and .cse37 (let ((.cse83 (and .cse47 .cse48 .cse30 .cse49 .cse52 .cse32 .cse62 .cse53 .cse55 .cse34 .cse57 .cse81 .cse82 .cse35))) (or (and .cse83 .cse33) (and .cse83 .cse36)))) .cse41 .cse42) .cse29 .cse24 .cse39)))) (and (and .cse25 (and .cse26 .cse27 .cse28 .cse37 .cse38 (or (and .cse36 .cse30 .cse31 .cse49 .cse75 .cse24 .cse34 .cse35) (and .cse30 .cse31 .cse49 .cse33 .cse75 .cse24 .cse34 .cse35)) .cse39)) .cse67 .cse68 .cse22 .cse23))) (or .cse84 .cse4 .cse12 .cse13 .cse20 .cse17 .cse73 .cse69 .cse0 .cse19 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse85 .cse18 .cse14 .cse15 .cse16) (or .cse71 .cse12 .cse13 .cse20 .cse73 .cse69 .cse86 (and .cse67 .cse22 .cse23 (let ((.cse87 (and .cse24 .cse88 .cse34 .cse62 .cse53 .cse35))) (or (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse75 .cse29 .cse37 .cse87 .cse58 .cse33 .cse38 .cse39) (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse75 .cse29 .cse37 .cse87 .cse36 .cse58 .cse38 .cse39)))) .cse0 .cse19 .cse1 .cse2 .cse3 .cse89 .cse72 .cse5 .cse6 .cse7 .cse9 .cse10 .cse85 .cse18 .cse15 .cse16 (and .cse67 .cse22 (let ((.cse90 (and .cse48 (and (and .cse62 .cse53 .cse24 .cse66 .cse88 .cse55 .cse79 .cse34 .cse57 .cse81 .cse35) .cse52)))) (or (and .cse58 .cse27 (and .cse41 (and .cse36 .cse37 .cse90) .cse42) .cse29 .cse39) (and .cse58 .cse27 (and (and .cse37 (and .cse90 .cse33)) .cse41 .cse42) .cse29 .cse39)))) .cse74) (or (and .cse67 .cse22 .cse23 (let ((.cse91 (and .cse24 .cse88 .cse34 .cse35))) (or (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse91 .cse29 .cse37 .cse58 .cse33 .cse38 .cse39) (and .cse30 .cse31 .cse26 .cse27 .cse28 .cse91 .cse29 .cse37 .cse36 .cse58 .cse38 .cse39)))) .cse4 (and .cse67 .cse22 (let ((.cse94 (and .cse66 .cse54 .cse88 .cse79 .cse34 .cse35))) (or (and .cse58 .cse27 .cse29 (let ((.cse92 (let ((.cse93 (and (and .cse48 (and .cse94 .cse52)) .cse33))) (or (and .cse37 .cse38 .cse93) (and .cse37 .cse41 .cse93))))) (or (and .cse92 .cse41 .cse42) (and .cse26 .cse92 .cse28))) .cse24 .cse39) (and .cse58 (let ((.cse95 (let ((.cse96 (and .cse48 (and .cse36 .cse94 (not (= ~d0_req_up~0 1)) .cse52)))) (or (and .cse96 .cse37 .cse67 .cse41) (and .cse96 .cse37 .cse67 .cse38))))) (or (and .cse41 .cse95 .cse42) (and .cse26 .cse28 .cse95))) .cse27 .cse29 .cse24 .cse39)))) .cse12 .cse13 .cse20 .cse17 .cse73 .cse69 .cse0 .cse19 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse85 .cse18 .cse14 .cse15 .cse16) (or .cse84 .cse12 .cse13 .cse20 .cse73 .cse69 .cse86 .cse0 .cse19 .cse1 .cse2 .cse3 .cse72 .cse5 .cse6 .cse7 .cse9 .cse10 .cse85 .cse18 .cse14 .cse15 .cse16 .cse74) (or (not .cse33) .cse11 .cse13 (not (= 0 ~comp_m1_st~0)) .cse20 (< 0 |old(~b0_val~0)|) .cse17 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse86 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse70 .cse2 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse6 (not (= |old(~d0_val~0)| 0)) .cse7 .cse9 .cse10 .cse85 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse16 (not (= 1 |old(~d1_req_up~0)|))) (or .cse84 .cse71 .cse4 .cse12 .cse13 .cse20 .cse73 .cse69 (< 1 |old(~b1_ev~0)|) .cse0 .cse19 .cse1 .cse2 .cse3 .cse89 .cse72 .cse5 .cse6 .cse7 .cse9 .cse8 .cse10 .cse18 .cse15 .cse16 .cse74) (or .cse18 .cse19 (or .cse0 .cse1 .cse2 .cse84 .cse3 .cse4 .cse72 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse74) .cse20 .cse21))) [2018-12-01 14:39:33,375 INFO L448 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-12-01 14:39:33,375 INFO L444 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse29 (<= ~b0_val_t~0 ~b0_val~0)) (.cse45 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse46 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse47 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse30 (= ~z_val~0 ~z_val_t~0)) (.cse32 (= |old(~d1_val~0)| ~d1_val~0)) (.cse48 (= ~d0_val~0 ~d0_val_t~0)) (.cse33 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse34 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse24 (= |old(~d0_req_up~0)| 1)) (.cse36 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse37 (<= ~b1_val_t~0 ~b1_val~0)) (.cse38 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse39 (= ~d0_req_up~0 1)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse41 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse5 (< |old(~d1_ev~0)| 2)) (.cse26 (< |old(~b1_ev~0)| 2)) (.cse0 (and .cse29 .cse45 .cse46 .cse47 .cse30 .cse32 .cse48 .cse33 .cse34 .cse24 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (.cse19 (not (= 0 ~z_val_t~0))) (.cse7 (= 0 |old(~d0_ev~0)|)) (.cse42 (< |old(~b0_ev~0)| 2)) (.cse6 (< 0 |old(~d0_ev~0)|)) (.cse20 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse9 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse8 (= |old(~b1_req_up~0)| 1)) (.cse10 (= 0 |old(~b0_ev~0)|)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse1 (= |old(~b1_ev~0)| 0)) (.cse43 (= 0 |old(~d1_ev~0)|)) (.cse13 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse17 (= |old(~b1_ev~0)| 1)) (.cse16 (< |old(~z_ev~0)| 2)) (.cse18 (< 0 |old(~z_val~0)|)) (.cse25 (< |old(~d0_ev~0)| 2)) (.cse2 (= |old(~b0_req_up~0)| 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse21 (= 1 |old(~b0_ev~0)|)) (.cse22 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse23 (< |old(~z_val~0)| 0)) (.cse44 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (let ((.cse27 (not (= 1 ~b1_req_up~0))) (.cse28 (not (= ~b0_req_up~0 1))) (.cse31 (= 0 ~d0_val~0)) (.cse35 (<= ~b0_ev~0 0))) (or (not .cse24) .cse25 .cse3 (not (= 0 ~comp_m1_st~0)) .cse4 (< 0 |old(~b0_val~0)|) .cse5 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse26 (< 0 |old(~d1_val~0)|) (and .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41) (< |old(~b0_val~0)| 0) .cse42 .cse11 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse14 (not (= |old(~d0_val~0)| 0)) .cse15 .cse16 .cse18 .cse19 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse23 (and .cse27 .cse28 .cse29 .cse30 (not (= ~b1_ev~0 1)) .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= ~b1_ev~0 1) .cse39 .cse40 .cse41) (not (= 1 |old(~d1_req_up~0)|)))) (or (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (< 1 |old(~b1_ev~0)|) .cse8 .cse9 .cse10 .cse11 .cse12 (< 0 |old(~b0_ev~0)|) .cse43 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse22 .cse23 .cse44) (and .cse29 (= ~z_val~0 |old(~z_val~0)|) .cse45 .cse46 .cse47 .cse32 .cse48 .cse33 .cse34 .cse24 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41)) (or .cse2 .cse3 .cse4 .cse6 .cse7 .cse26 .cse0 .cse8 .cse9 .cse10 .cse11 .cse12 .cse43 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse44) (or (and (and .cse29 .cse45 .cse46 .cse47 .cse32 .cse33 .cse24 .cse36 .cse38 .cse39 .cse40 .cse41) (= ~d0_val_t~0 ~d0_val~0) (= ~d0_ev~0 |old(~d0_ev~0)|) .cse30 .cse37) (let ((.cse49 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse20 .cse9 .cse22 .cse4 .cse11 .cse7 .cse49 (or .cse8 .cse42 .cse12 .cse1 .cse43 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse2 .cse3 .cse23 .cse6 .cse44)) (or .cse20 .cse9 .cse4 (or .cse8 .cse10 .cse11 .cse12 .cse1 .cse43 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse25 .cse2 .cse3 .cse21 .cse22 .cse23 .cse44) .cse49))))))) [2018-12-01 14:39:33,377 INFO L448 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-12-01 14:39:33,377 INFO L444 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse35 (<= ~b0_val_t~0 ~b0_val~0)) (.cse37 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse9 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse38 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse5 (= ~z_val~0 ~z_val_t~0)) (.cse39 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse10 (= |old(~d1_val~0)| ~d1_val~0)) (.cse40 (= ~d0_val~0 ~d0_val_t~0)) (.cse11 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse6 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse41 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse42 (<= ~b1_val_t~0 ~b1_val~0)) (.cse7 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse8 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse12 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse4 (< |old(~b1_ev~0)| 2)) (.cse43 (and .cse35 .cse37 .cse9 .cse38 .cse5 .cse39 .cse10 .cse40 .cse11 .cse6 .cse41 .cse42 .cse7 .cse8 .cse12)) (.cse3 (< |old(~d1_ev~0)| 2)) (.cse19 (not (= 0 ~z_val_t~0))) (.cse36 (= ~z_val~0 |old(~z_val~0)|)) (.cse24 (= 0 |old(~d0_ev~0)|)) (.cse13 (< |old(~b0_ev~0)| 2)) (.cse23 (< 0 |old(~d0_ev~0)|)) (.cse32 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse26 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse25 (= |old(~b1_req_up~0)| 1)) (.cse27 (= 0 |old(~b0_ev~0)|)) (.cse14 (< ~d0_val_t~0 1)) (.cse28 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse21 (= |old(~b1_ev~0)| 0)) (.cse29 (= 0 |old(~d1_ev~0)|)) (.cse30 (< ~comp_m1_st~0 2)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse31 (= |old(~b1_ev~0)| 1)) (.cse17 (< |old(~z_ev~0)| 2)) (.cse18 (< 0 |old(~z_val~0)|)) (.cse0 (< |old(~d0_ev~0)| 2)) (.cse22 (= |old(~b0_req_up~0)| 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse44 (= 1 |old(~b0_ev~0)|)) (.cse33 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (< |old(~z_val~0)| 0)) (.cse34 (= 1 |old(~d1_ev~0)|))) (and (or (not (= |old(~d0_req_up~0)| 1)) .cse0 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (< 0 |old(~b0_val~0)|) .cse3 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse4 (and .cse5 .cse6 (<= ~b0_val~0 0) .cse7 (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) .cse8 (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) .cse9 (= 0 ~d0_val~0) .cse10 (<= 0 ~b0_val~0) .cse11 (= ~d0_req_up~0 1) .cse12) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse13 .cse14 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse15 (not (= |old(~d0_val~0)| 0)) .cse16 .cse17 .cse18 .cse19 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse20 (not (= 1 |old(~d1_req_up~0)|))) (or (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse21 .cse22 .cse1 .cse2 .cse23 .cse24 (< 1 |old(~b1_ev~0)|) .cse25 .cse26 .cse27 .cse14 .cse28 (< 0 |old(~b0_ev~0)|) .cse29 .cse30 .cse15 .cse16 .cse17 .cse31 .cse18 .cse32 .cse33 .cse20 .cse34) (and .cse35 .cse36 .cse37 .cse9 .cse38 .cse39 .cse10 .cse40 .cse11 .cse6 .cse41 .cse42 .cse7 .cse8 .cse12)) (or .cse22 .cse1 .cse2 .cse23 .cse24 .cse4 .cse43 .cse25 .cse26 .cse27 .cse14 .cse28 .cse29 .cse30 .cse15 .cse16 .cse17 .cse18 .cse19 .cse32 .cse44 .cse33 .cse20 .cse34) (or .cse43 .cse21 .cse22 .cse1 .cse2 .cse3 .cse23 .cse24 .cse25 .cse26 .cse27 .cse14 .cse28 .cse30 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19 .cse32 .cse44 .cse33 .cse20) (or (and .cse42 (and .cse35 .cse36 .cse37 .cse9 .cse38 .cse39 .cse10 .cse40 .cse11 .cse6 .cse41 .cse7 .cse8 .cse12)) (let ((.cse45 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse32 .cse26 .cse33 .cse2 .cse14 .cse24 .cse45 (or .cse25 .cse13 .cse28 .cse21 .cse29 .cse30 .cse15 .cse16 .cse31 .cse17 .cse18 .cse22 .cse1 .cse20 .cse23 .cse34)) (or .cse32 .cse26 .cse2 (or .cse25 .cse27 .cse14 .cse28 .cse21 .cse29 .cse30 .cse15 .cse16 .cse31 .cse17 .cse18 .cse0 .cse22 .cse1 .cse44 .cse33 .cse20 .cse34) .cse45))))))) [2018-12-01 14:39:33,378 INFO L444 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse24 (< |old(~d1_ev~0)| 2)) (.cse5 (< |old(~b1_ev~0)| 2)) (.cse17 (not (= 0 ~z_val_t~0))) (.cse4 (= 0 |old(~d0_ev~0)|)) (.cse27 (< |old(~b0_ev~0)| 2)) (.cse3 (< 0 |old(~d0_ev~0)|)) (.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse7 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse6 (= |old(~b1_req_up~0)| 1)) (.cse8 (= 0 |old(~b0_ev~0)|)) (.cse9 (< ~d0_val_t~0 1)) (.cse10 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse23 (= |old(~b1_ev~0)| 0)) (.cse11 (= 0 |old(~d1_ev~0)|)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse25 (= |old(~b1_ev~0)| 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse16 (< 0 |old(~z_val~0)|)) (.cse26 (< |old(~d0_ev~0)| 2)) (.cse0 (= |old(~b0_req_up~0)| 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse19 (= 1 |old(~b0_ev~0)|)) (.cse20 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse21 (< |old(~z_val~0)| 0)) (.cse22 (= 1 |old(~d1_ev~0)|)) (.cse28 (not (= |old(~z_val~0)| ~z_val_t~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse23 .cse0 .cse1 .cse2 .cse24 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) (or (not (= |old(~d0_req_up~0)| 1)) .cse26 .cse1 (not (= 0 ~comp_m1_st~0)) .cse2 (< 0 |old(~b0_val~0)|) .cse24 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse5 (and (= ~z_val~0 ~z_val_t~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse27 .cse9 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse21 (not (= 1 |old(~d1_req_up~0)|))) (or (= |old(~z_req_up~0)| 1) (< 1 |old(~d1_ev~0)|) .cse23 .cse0 .cse1 .cse2 .cse3 .cse4 (< 1 |old(~b1_ev~0)|) .cse6 .cse7 .cse8 .cse9 .cse10 (< 0 |old(~b0_ev~0)|) .cse11 .cse12 .cse13 .cse14 .cse15 .cse25 .cse16 .cse18 .cse20 .cse21 .cse22) (or .cse18 .cse7 .cse20 .cse2 .cse9 .cse4 .cse28 (or .cse6 .cse27 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse0 .cse1 .cse21 .cse3 .cse22)) (or .cse18 .cse7 .cse2 (or .cse6 .cse8 .cse9 .cse10 .cse23 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse16 .cse26 .cse0 .cse1 .cse19 .cse20 .cse21 .cse22) .cse28))) [2018-12-01 14:39:33,379 INFO L448 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-12-01 14:39:33,379 INFO L448 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-12-01 14:39:33,379 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-12-01 14:39:33,379 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-12-01 14:39:33,379 INFO L444 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse32 (= 1 ~b0_ev~0)) (.cse24 (= 1 ~d1_ev~0))) (let ((.cse13 (< 0 ~b0_ev~0)) (.cse31 (not .cse24)) (.cse26 (= 1 is_method1_triggered_~__retres1~0)) (.cse28 (< 0 ~z_req_up~0)) (.cse1 (< 1 ~d1_ev~0)) (.cse29 (not (= 1 ~d0_ev~0))) (.cse33 (not .cse32)) (.cse6 (< 0 ~d0_ev~0)) (.cse30 (not (= 0 ~z_val_t~0))) (.cse7 (= 0 ~d0_ev~0)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse0 (= ~z_req_up~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse2 (= ~b1_ev~0 0)) (.cse14 (= 0 ~d1_ev~0)) (.cse15 (< ~comp_m1_st~0 2)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse19 (= ~b1_ev~0 1)) (.cse18 (< ~z_ev~0 2)) (.cse20 (< 0 ~z_val~0)) (.cse34 (< ~d0_ev~0 2)) (.cse3 (= ~b0_req_up~0 1)) (.cse4 (< 0 ~comp_m1_i~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse5 (< ~b1_val_t~0 1)) (.cse27 (not (= ~z_val~0 ~z_val_t~0))) (.cse25 (= 0 is_method1_triggered_~__retres1~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (< 1 ~b1_ev~0) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) .cse25) (or .cse26 .cse27 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse29 .cse22 .cse23)) (or .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 (< ~b1_ev~0 2) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 .cse21 .cse22 .cse23 .cse25 .cse24) (or .cse26 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse31 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse32 .cse22 .cse23)) (or .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse28 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse30 (not .cse19) .cse21 .cse22 .cse23 .cse26) (or (or .cse8 .cse28 .cse12 .cse1 .cse2 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse4 .cse33 .cse6) .cse30 .cse21 .cse9 .cse22 .cse26 .cse5 .cse11 .cse7 .cse27) (or .cse26 (or .cse21 .cse9 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse2 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 .cse34 .cse3 .cse4 .cse32 .cse22 .cse23 .cse31) .cse5)) (or .cse25 .cse0 .cse2 .cse3 .cse4 .cse5 (< ~d1_ev~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse30 .cse21 .cse32 .cse22 .cse23) (or .cse21 .cse9 .cse22 .cse5 .cse11 .cse27 .cse26 (or .cse8 .cse28 .cse12 .cse1 .cse2 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse3 .cse4 .cse29 .cse23 .cse33)) (or (and (or (or .cse8 (< ~b0_ev~0 2) .cse0 .cse12 .cse2 .cse14 .cse15 .cse16 .cse17 .cse19 .cse18 .cse3 .cse4 .cse6 .cse24) .cse30 .cse21 .cse9 .cse22 .cse5 .cse11 .cse7 .cse27) (or .cse21 .cse9 (or .cse8 .cse10 .cse11 .cse0 .cse12 .cse2 .cse14 .cse15 .cse16 .cse17 .cse19 .cse18 .cse20 .cse34 .cse3 .cse4 .cse32 .cse22 .cse23 .cse24) .cse5 .cse27)) .cse25)))) [2018-12-01 14:39:33,380 INFO L448 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-12-01 14:39:33,380 INFO L448 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-12-01 14:39:33,380 INFO L451 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-12-01 14:39:33,380 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-12-01 14:39:33,380 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-12-01 14:39:33,380 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 14:39:33,380 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~d0_val~0) (= ~d0_val_t~0 ~d0_val~0) (not (= ~d1_ev~0 1)) (<= ~b1_req_up~0 ~d1_req_up~0) (not (= ~b0_req_up~0 1)) (<= ~d1_ev~0 1) (<= ~b0_val_t~0 ~b0_val~0) (<= 0 ~b0_val~0) (= 0 ~comp_m1_st~0) (<= ~d1_val~0 0) (<= ~b0_val~0 0) (<= ~z_req_up~0 0) (<= ~comp_m1_i~0 0) (<= ~d0_ev~0 0) (= 0 ~z_val_t~0) (<= ~b0_ev~0 0) (= ~z_val~0 ~z_val_t~0) (<= ~b1_ev~0 1) (not (= ~b1_ev~0 1)) (<= ~d1_req_up~0 ~b1_req_up~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (<= ~d1_val_t~0 ~d1_val~0)) [2018-12-01 14:39:33,381 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 14:39:33,381 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 14:39:33,381 INFO L448 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-12-01 14:39:33,381 INFO L448 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-12-01 14:39:33,382 INFO L444 ceAbstractionStarter]: At program point init_modelENTRY(lines 451 482) the Hoare annotation is: (or (< 1 |old(~d1_ev~0)|) (< 0 |old(~comp_m1_i~0)|) (not (= 0 ~comp_m1_st~0)) (< 0 |old(~b0_val~0)|) (< 0 |old(~d0_ev~0)|) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< 1 |old(~b1_ev~0)|) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (= |old(~b1_req_up~0)| 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_val~0)| |old(~b0_val_t~0)|) (< 0 |old(~b0_ev~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val~0)| 0)) (= |old(~b1_ev~0)| 1) (< 0 |old(~z_val~0)|) (not (= 0 ~z_val_t~0)) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~d1_val~0)| |old(~d1_val_t~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (not (= |old(~d0_val_t~0)| |old(~d0_val~0)|)) (< |old(~z_val~0)| 0) (and (= ~d0_val_t~0 ~d0_val~0) (<= ~b0_val_t~0 ~b0_val~0) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b1_req_up~0)| ~b1_req_up~0) (= ~z_val~0 ~z_val_t~0) (<= ~d1_val_t~0 ~d1_val~0) (= |old(~d0_req_up~0)| ~d0_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (<= 0 ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (<= ~b0_val~0 0) (<= ~comp_m1_i~0 0) (= ~d1_req_up~0 |old(~d1_req_up~0)|) (= |old(~b1_ev~0)| ~b1_ev~0) (<= ~d1_req_up~0 ~b0_req_up~0) (< ~b0_req_up~0 (+ ~d1_req_up~0 1)) (= ~z_req_up~0 |old(~z_req_up~0)|) (<= |old(~z_ev~0)| ~z_ev~0)) (= 1 |old(~d1_ev~0)|)) [2018-12-01 14:39:33,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 02:39:33 BoogieIcfgContainer [2018-12-01 14:39:33,423 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 14:39:33,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:39:33,424 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:39:33,424 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:39:33,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:36:53" (3/4) ... [2018-12-01 14:39:33,426 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-12-01 14:39:33,431 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-12-01 14:39:33,432 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-12-01 14:39:33,438 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-01 14:39:33,438 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-01 14:39:33,460 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(d0_ev == 0)) && b0_ev <= 0) && b1_val_t <= b1_val) && ((((((((2 <= comp_m1_st && d0_ev <= 1) && !(d1_ev == 1)) && !(b1_ev == 0)) && d1_ev <= 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) || \old(d1_ev) < 2) || ((((!(d0_ev == 0) && d0_val_t == d0_val) && b1_val_t <= b1_val) && b0_val_t <= b0_val && (((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || b0_val_t < 1) || \old(b1_req_up) < \old(d1_req_up)) || (((((!(d0_ev == 0) && d0_val == d0_val_t) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && ((((((((((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1))) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && (((((!(1 == b1_req_up) && !(b0_req_up == 1)) && (2 <= d1_ev && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && 0 == comp_m1_st) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1)) && (2 <= comp_m1_st && !(d1_ev == 1)) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && (((((2 <= comp_m1_st && !(d1_ev == 1)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || (((((((((((((((!(b0_ev == 0) && !(d0_ev == 1)) && 2 <= d1_ev) && 2 <= z_ev) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(d0_ev == 0)) && d0_val == d0_val_t) && b0_ev <= 0) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || \old(d0_ev) < 2) || ((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= comp_m1_st && (((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || (((((!(d0_ev == 0) && (((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 1)) && !(d1_ev == 0)) && d0_ev <= 0) && !(b1_ev == 0)) && 2 <= z_ev) && z_req_up == \old(z_req_up)) && d0_val_t == d0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(\old(z_val) == \old(z_val_t))) || 0 < \old(d1_val)) || (z_val == z_val_t && (((((d0_val == d0_val_t && ((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && (!(d1_ev == 1) && 0 == comp_m1_st) && (((2 <= d0_ev && !(b0_ev == 0)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(b0_ev == 1)) && z_val == \old(z_val)) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && d1_val_t <= d1_val)))) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((!(d0_ev == 0) && d0_val_t == d0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && (((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0))) || (((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 0)) && !(d1_ev == 0)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 2 <= b1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) && z_req_up == \old(z_req_up)) [2018-12-01 14:39:33,460 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(d0_req_up) == 1) || \old(d0_ev) < 2) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || b0_val_t < 1) || !(\old(d0_val) == 0)) || d1_val_t < 1) || ((((((((!(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0)) && 0 == comp_m1_st) || (2 <= comp_m1_st && !(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0))) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || \old(z_ev) < 2) || 0 < \old(z_val)) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || \old(b1_req_up) < \old(d1_req_up)) || \old(z_val) < 0) || !(1 == \old(d1_req_up)) [2018-12-01 14:39:33,461 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((\old(z_req_up) == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && (((((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) || !(z_val == \old(z_val_t)))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || (2 <= comp_m1_st && z_val == z_val_t))) && ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == \old(z_val_t)))))) && (((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (2 <= comp_m1_st && z_val == z_val_t))) && (((((((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || b0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val < b0_val_t) || b0_val_t < 1)))) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (z_val == z_val_t && 2 <= comp_m1_st))) && ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || ((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || 1 < d1_ev) || (2 <= comp_m1_st && z_val == z_val_t)) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || z_val == z_val_t) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) [2018-12-01 14:39:33,461 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || \old(z_req_up) == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && ((2 <= comp_m1_st && z_val == z_val_t) || ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1)) && (((((((((((((((((((((((((z_val == z_val_t || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((2 <= comp_m1_st && z_val == z_val_t) || (((((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || b0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val < b0_val_t) || b0_val_t < 1)))))) && ((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == \old(z_val_t)))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t))) && (((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) || !(z_val == \old(z_val_t)))) || (z_val == z_val_t && 2 <= comp_m1_st))) && ((((((((((((((((((((((((b0_req_up == 1 || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || (2 <= comp_m1_st && z_val == z_val_t)) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) [2018-12-01 14:39:33,492 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b7e6a0fc-919f-4332-b40c-627d718ee51c/bin-2019/uautomizer/witness.graphml [2018-12-01 14:39:33,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:39:33,493 INFO L168 Benchmark]: Toolchain (without parser) took 160596.88 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 960.3 MB in the beginning and 2.0 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,493 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:39:33,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,494 INFO L168 Benchmark]: Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,494 INFO L168 Benchmark]: RCFGBuilder took 293.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,494 INFO L168 Benchmark]: TraceAbstraction took 159995.12 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -913.8 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-01 14:39:33,494 INFO L168 Benchmark]: Witness Printer took 68.59 ms. Allocated memory is still 3.9 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:39:33,495 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 944.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 293.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.8 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 159995.12 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: -913.8 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 68.59 ms. Allocated memory is still 3.9 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(\old(d0_req_up) == 1) || \old(d0_ev) < 2) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || \old(d1_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || 0 < \old(d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || b0_val_t < 1) || !(\old(d0_val) == 0)) || d1_val_t < 1) || ((((((((!(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0)) && 0 == comp_m1_st) || (2 <= comp_m1_st && !(d1_ev == 1) && !(d0_ev == 1) && ((!(b0_ev == 0) && comp_m1_i <= 0) && !(b1_ev == 0)) && !(d1_ev == 0))) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || \old(z_ev) < 2) || 0 < \old(z_val)) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || \old(b1_req_up) < \old(d1_req_up)) || \old(z_val) < 0) || !(1 == \old(d1_req_up)) - InvariantResult [Line: 257]: Loop Invariant Derived loop invariant: (((((((1 <= __retres1 || ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) && (0 == __retres1 || ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == z_val_t)) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || 0 < d0_ev) || 1 == d1_ev) && (!(z_val == z_val_t) || ((((((((((((((((((((b1_ev == 0 || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)))) && ((((((((((((((((((((((((b0_req_up == 1 || 0 < comp_m1_i) || !(0 == comp_m1_st)) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || 1 <= __retres1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((b0_req_up == 1 || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || 0 == __retres1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || 0 == __retres1)) && (((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 == __retres1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && (((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < z_req_up) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 0 < d0_ev) || 1 == d1_ev) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == z_val_t)) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 1 == d1_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) || !(z_val == z_val_t))) || 1 <= __retres1)) && (1 <= __retres1 || (((((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || 0 < d0_ev) || b0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || d1_ev < 2) || b0_val < b0_val_t) || b0_val_t < 1))))) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || \old(z_req_up) == 1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && ((2 <= comp_m1_st && z_val == z_val_t) || ((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1)) && (((((((((((((((((((((((((z_val == z_val_t || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((2 <= comp_m1_st && z_val == z_val_t) || (((((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || b0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val < b0_val_t) || b0_val_t < 1)))))) && ((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == \old(z_val_t)))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t))) && (((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) || !(z_val == \old(z_val_t)))) || (z_val == z_val_t && 2 <= comp_m1_st))) && ((((((((((((((((((((((((b0_req_up == 1 || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || (2 <= comp_m1_st && z_val == z_val_t)) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((\old(z_req_up) == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && (((((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 0 < d0_ev) || 1 == d1_ev) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || 1 == d1_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) || !(z_val == \old(z_val_t)))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || (2 <= comp_m1_st && z_val == z_val_t))) && ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == \old(z_val_t))) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || \old(z_req_up) == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == \old(z_val_t)))))) && (((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || 0 == d0_ev) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 < b0_ev) || b0_val_t < 1) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (2 <= comp_m1_st && z_val == z_val_t))) && (((((((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || b0_val_t < 1) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) && (((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || \old(z_req_up) == 1) || b1_ev == 0) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || b0_val < b0_val_t) || b0_val_t < 1)))) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (z_val == z_val_t && 2 <= comp_m1_st))) && ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || ((((((((((((((((((((((((\old(z_req_up) == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((((((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up)) || 1 < d1_ev) || (2 <= comp_m1_st && z_val == z_val_t)) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || z_val == z_val_t) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 0 == d1_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && ((((((((((((((((((((((((\old(z_req_up) == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || d0_val_t < 1) || b0_val < b0_val_t) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == \old(z_val_t))) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || 0 == __retres1) && ((1 == __retres1 || !(z_val == z_val_t)) || ((((((((((((((((((((1 < d1_ev || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || d1_val < d1_val_t) || !(1 == d0_ev)) || !(d0_val_t == d0_val)) || z_val < 0)) && ((((((((((((((((((((((((z_req_up == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 0 == __retres1) || 1 == d1_ev)) && (1 == __retres1 || (((((((((((((((((((((z_req_up == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(1 == d1_ev)) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && ((((((((((((((((((((((((1 < d1_ev || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || !(b1_ev == 1)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == __retres1)) && ((((((((((((((((((((((b1_req_up == 1 || 0 < z_req_up) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(1 == b0_ev)) || 0 < d0_ev) || !(0 == z_val_t)) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || 1 == __retres1) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == z_val_t))) && (1 == __retres1 || ((d1_val < d1_val_t || b1_val < b1_val_t) || (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || !(1 == d1_ev)) || b1_val_t < 1)) && ((((((((((((((((((((((((0 == __retres1 || z_req_up == 1) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0)) && (((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || !(z_val == z_val_t)) || 1 == __retres1) || ((((((((((((((b1_req_up == 1 || 0 < z_req_up) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || b0_req_up == 1) || 0 < comp_m1_i) || !(1 == d0_ev)) || z_val < 0) || !(1 == b0_ev))) && ((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == z_val_t)) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == z_val_t)) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == z_val_t))) || 0 == __retres1) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(d0_ev == 0)) && b0_ev <= 0) && b1_val_t <= b1_val) && ((((((((2 <= comp_m1_st && d0_ev <= 1) && !(d1_ev == 1)) && !(b1_ev == 0)) && d1_ev <= 1) && !(b0_ev == 0)) && !(d0_ev == 1)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) || \old(d1_ev) < 2) || ((((!(d0_ev == 0) && d0_val_t == d0_val) && b1_val_t <= b1_val) && b0_val_t <= b0_val && (((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 2 <= b0_ev) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || b0_val_t < 1) || \old(b1_req_up) < \old(d1_req_up)) || (((((!(d0_ev == 0) && d0_val == d0_val_t) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && ((((((((((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1))) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && (((((!(1 == b1_req_up) && !(b0_req_up == 1)) && (2 <= d1_ev && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && 0 == comp_m1_st) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(b0_ev == 1)) && !(b1_ev == 1)) && (2 <= comp_m1_st && !(d1_ev == 1)) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && (((((2 <= comp_m1_st && !(d1_ev == 1)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || (((((((((((((((!(b0_ev == 0) && !(d0_ev == 1)) && 2 <= d1_ev) && 2 <= z_ev) && 2 <= b1_ev) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(d0_ev == 0)) && d0_val == d0_val_t) && b0_ev <= 0) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || \old(d0_ev) < 2) || ((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && !(d0_ev == 0)) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= comp_m1_st && (((((d0_ev <= 1 && !(b1_ev == 0)) && !(b0_ev == 0)) && !(d0_ev == 1)) && 2 <= d1_ev) && b1_ev <= 1) && 2 <= z_ev) && !(b1_ev == 1)) && d1_val_t <= d1_val)) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || (((((!(d0_ev == 0) && (((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 1)) && !(d1_ev == 0)) && d0_ev <= 0) && !(b1_ev == 0)) && 2 <= z_ev) && z_req_up == \old(z_req_up)) && d0_val_t == d0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || !(\old(z_val) == \old(z_val_t))) || 0 < \old(d1_val)) || (z_val == z_val_t && (((((d0_val == d0_val_t && ((((!(1 == b1_req_up) && !(b0_req_up == 1)) && !(z_req_up == 1)) && (!(d1_ev == 1) && 0 == comp_m1_st) && (((2 <= d0_ev && !(b0_ev == 0)) && 2 <= z_ev) && !(d1_ev == 0)) && 2 <= b1_ev) && !(b0_ev == 1)) && z_val == \old(z_val)) && b0_val_t <= b0_val) && b1_val_t <= b1_val) && d1_val_t <= d1_val) || ((((d0_val == d0_val_t && b0_val_t <= b0_val) && b1_val_t <= b1_val) && (((((((!(d1_ev == 1) && 0 == comp_m1_st) && (((((!(b1_ev == 0) && 2 <= d0_ev) && !(b0_ev == 0)) && b1_ev <= 1) && 2 <= z_ev) && !(d1_ev == 0)) && comp_m1_i <= 0) && !(1 == b1_req_up)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val)) && d1_val_t <= d1_val)))) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || 0 < \old(z_req_up)) || \old(b0_req_up) < \old(d1_req_up)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || !(0 == \old(z_val_t))) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((!(d0_ev == 0) && d0_val_t == d0_val) && z_val == z_val_t) && b1_val_t <= b1_val) && d1_val_t <= d1_val) && (((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && !(z_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && !(d1_ev == 0))) || (((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && 0 == z_val_t) && z_val == z_val_t) && !(b0_ev == 0)) && !(d1_ev == 0)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 2 <= b1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) && z_req_up == \old(z_req_up)) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((z_req_up == 1 || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || 0 == tmp) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) && ((((((((((((((((((((((((((z_req_up == 1 || 1 < d1_ev) || b1_ev == 0) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || 1 < b1_ev) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || 0 == tmp)) && ((((((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 0 < d0_ev) || 1 == d1_ev) || !(0 == z_val_t)) || d1_val < d1_val_t) || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 0 == d0_ev) || !(z_val == z_val_t)) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || z_req_up == 1) || b0_val < b0_val_t) || b1_ev == 0) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || b1_ev == 1) || z_ev < 2) || 0 < z_val) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) || b1_val_t < 1) || !(z_val == z_val_t))) || 0 == tmp)) && ((((((((((((((((((((((((z_req_up == 1 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || 0 == d1_ev) || comp_m1_st < 2) || b0_val_t < 1) || d1_val_t < 1) || 0 == tmp) || z_ev < 2) || 0 < z_val) || !(0 == z_val_t)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 141 locations, 1 error locations. SAFE Result, 159.9s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 25.5s AutomataDifference, 0.0s DeadEndRemovalTime, 114.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 5185 SDtfs, 11687 SDslu, 8930 SDs, 0 SdLazy, 13662 SolverSat, 4212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3350 GetRequests, 3043 SyntacticMatches, 6 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53451occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.1s AutomataMinimizationTime, 24 MinimizatonAttempts, 40980 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 76775 PreInvPairs, 77135 NumberOfFragments, 30331 HoareAnnotationTreeSize, 76775 FomulaSimplifications, 2042322 FormulaSimplificationTreeSizeReduction, 8.7s HoareSimplificationTime, 52 FomulaSimplificationsInter, 3402001 FormulaSimplificationTreeSizeReductionInter, 105.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 6377 NumberOfCodeBlocks, 6377 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 6333 ConstructedInterpolants, 0 QuantifiedInterpolants, 1527802 SizeOfPredicates, 15 NumberOfNonLiveVariables, 18097 ConjunctsInSsa, 131 ConjunctsInUnsatCore, 44 InterpolantComputations, 13 PerfectInterpolantSequences, 1482/1821 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...