./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-1dbac8b [2018-11-10 03:47:12,782 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 03:47:12,784 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 03:47:12,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 03:47:12,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 03:47:12,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 03:47:12,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 03:47:12,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 03:47:12,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 03:47:12,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 03:47:12,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 03:47:12,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 03:47:12,798 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 03:47:12,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 03:47:12,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 03:47:12,800 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 03:47:12,801 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 03:47:12,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 03:47:12,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 03:47:12,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 03:47:12,805 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 03:47:12,806 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 03:47:12,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 03:47:12,809 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 03:47:12,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 03:47:12,810 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 03:47:12,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 03:47:12,811 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 03:47:12,811 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 03:47:12,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 03:47:12,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 03:47:12,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 03:47:12,813 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 03:47:12,813 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 03:47:12,813 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 03:47:12,814 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 03:47:12,814 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-10 03:47:12,822 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 03:47:12,823 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 03:47:12,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 03:47:12,824 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-10 03:47:12,824 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 03:47:12,824 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 03:47:12,824 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 03:47:12,825 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 03:47:12,825 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 03:47:12,825 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 03:47:12,825 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 03:47:12,825 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 03:47:12,825 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 03:47:12,826 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 03:47:12,826 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 03:47:12,826 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 03:47:12,826 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 03:47:12,826 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 03:47:12,827 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 03:47:12,827 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 03:47:12,827 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 03:47:12,827 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 03:47:12,827 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 03:47:12,827 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 03:47:12,828 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 03:47:12,828 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 03:47:12,828 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 03:47:12,828 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 03:47:12,828 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 03:47:12,828 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_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:12,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 03:47:12,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 03:47:12,874 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 03:47:12,875 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 03:47:12,876 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 03:47:12,876 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:12,931 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/data/14f75fb98/d57b7645b2a2436488535a53025535fe/FLAGf7d873cae [2018-11-10 03:47:13,284 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 03:47:13,285 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:13,291 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/data/14f75fb98/d57b7645b2a2436488535a53025535fe/FLAGf7d873cae [2018-11-10 03:47:13,303 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/data/14f75fb98/d57b7645b2a2436488535a53025535fe [2018-11-10 03:47:13,307 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 03:47:13,309 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-10 03:47:13,310 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:13,310 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 03:47:13,314 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 03:47:13,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,317 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1394c33e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13, skipping insertion in model container [2018-11-10 03:47:13,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 03:47:13,360 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 03:47:13,520 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:13,524 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 03:47:13,552 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 03:47:13,566 INFO L193 MainTranslator]: Completed translation [2018-11-10 03:47:13,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13 WrapperNode [2018-11-10 03:47:13,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 03:47:13,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 03:47:13,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 03:47:13,567 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 03:47:13,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,582 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... [2018-11-10 03:47:13,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 03:47:13,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 03:47:13,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 03:47:13,603 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 03:47:13,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:13,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-11-10 03:47:13,694 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-11-10 03:47:13,695 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-11-10 03:47:13,696 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-11-10 03:47:13,697 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-11-10 03:47:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 03:47:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 03:47:13,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 03:47:14,079 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 03:47:14,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:14 BoogieIcfgContainer [2018-11-10 03:47:14,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 03:47:14,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 03:47:14,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 03:47:14,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 03:47:14,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:47:13" (1/3) ... [2018-11-10 03:47:14,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5a8dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:47:14, skipping insertion in model container [2018-11-10 03:47:14,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:47:13" (2/3) ... [2018-11-10 03:47:14,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f5a8dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:47:14, skipping insertion in model container [2018-11-10 03:47:14,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:14" (3/3) ... [2018-11-10 03:47:14,087 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-11-10 03:47:14,094 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 03:47:14,102 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 03:47:14,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 03:47:14,146 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 03:47:14,147 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 03:47:14,147 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 03:47:14,147 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 03:47:14,148 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 03:47:14,148 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 03:47:14,148 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 03:47:14,148 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 03:47:14,148 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 03:47:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-11-10 03:47:14,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 03:47:14,177 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:14,178 INFO L375 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-11-10 03:47:14,180 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:14,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:14,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1766200525, now seen corresponding path program 1 times [2018-11-10 03:47:14,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:14,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:14,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:14,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 03:47:14,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:47:14,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:14,438 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-11-10 03:47:14,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:14,585 INFO L93 Difference]: Finished difference Result 269 states and 371 transitions. [2018-11-10 03:47:14,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:47:14,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-10 03:47:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:14,601 INFO L225 Difference]: With dead ends: 269 [2018-11-10 03:47:14,601 INFO L226 Difference]: Without dead ends: 136 [2018-11-10 03:47:14,605 INFO L605 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-11-10 03:47:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-10 03:47:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-10 03:47:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 03:47:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2018-11-10 03:47:14,649 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 58 [2018-11-10 03:47:14,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:14,651 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2018-11-10 03:47:14,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:47:14,651 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2018-11-10 03:47:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 03:47:14,655 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:14,655 INFO L375 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] [2018-11-10 03:47:14,655 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:14,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:14,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1105971296, now seen corresponding path program 1 times [2018-11-10 03:47:14,656 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:14,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:14,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:14,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:14,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:14,804 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:14,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:14,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:15,027 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-10 03:47:15,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:15,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:47:15,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:47:15,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:47:15,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:47:15,050 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand 8 states. [2018-11-10 03:47:15,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:15,753 INFO L93 Difference]: Finished difference Result 436 states and 610 transitions. [2018-11-10 03:47:15,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 03:47:15,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-11-10 03:47:15,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:15,758 INFO L225 Difference]: With dead ends: 436 [2018-11-10 03:47:15,758 INFO L226 Difference]: Without dead ends: 318 [2018-11-10 03:47:15,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 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-11-10 03:47:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-10 03:47:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 297. [2018-11-10 03:47:15,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-10 03:47:15,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 406 transitions. [2018-11-10 03:47:15,800 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 406 transitions. Word has length 127 [2018-11-10 03:47:15,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:15,801 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 406 transitions. [2018-11-10 03:47:15,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:47:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 406 transitions. [2018-11-10 03:47:15,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 03:47:15,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:15,806 INFO L375 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] [2018-11-10 03:47:15,808 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:15,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:15,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1903501912, now seen corresponding path program 1 times [2018-11-10 03:47:15,808 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:15,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:15,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:15,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:15,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:15,929 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 03:47:15,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:15,929 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:15,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:16,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 03:47:16,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:16,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-10 03:47:16,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:47:16,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:47:16,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:47:16,115 INFO L87 Difference]: Start difference. First operand 297 states and 406 transitions. Second operand 8 states. [2018-11-10 03:47:17,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:17,026 INFO L93 Difference]: Finished difference Result 1273 states and 1987 transitions. [2018-11-10 03:47:17,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 03:47:17,027 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-11-10 03:47:17,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:17,036 INFO L225 Difference]: With dead ends: 1273 [2018-11-10 03:47:17,036 INFO L226 Difference]: Without dead ends: 999 [2018-11-10 03:47:17,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 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-11-10 03:47:17,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-11-10 03:47:17,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 817. [2018-11-10 03:47:17,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-11-10 03:47:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1133 transitions. [2018-11-10 03:47:17,125 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1133 transitions. Word has length 129 [2018-11-10 03:47:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:17,126 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1133 transitions. [2018-11-10 03:47:17,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:47:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1133 transitions. [2018-11-10 03:47:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 03:47:17,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:17,132 INFO L375 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] [2018-11-10 03:47:17,132 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:17,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:17,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1712106708, now seen corresponding path program 1 times [2018-11-10 03:47:17,133 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:17,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:17,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:17,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:17,214 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 03:47:17,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:17,214 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:17,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:17,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-10 03:47:17,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:17,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-10 03:47:17,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:47:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:47:17,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:47:17,376 INFO L87 Difference]: Start difference. First operand 817 states and 1133 transitions. Second operand 9 states. [2018-11-10 03:47:18,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:18,701 INFO L93 Difference]: Finished difference Result 3179 states and 5143 transitions. [2018-11-10 03:47:18,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 03:47:18,702 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-11-10 03:47:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:18,712 INFO L225 Difference]: With dead ends: 3179 [2018-11-10 03:47:18,713 INFO L226 Difference]: Without dead ends: 2415 [2018-11-10 03:47:18,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-11-10 03:47:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-11-10 03:47:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2065. [2018-11-10 03:47:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2018-11-10 03:47:18,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2933 transitions. [2018-11-10 03:47:18,822 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2933 transitions. Word has length 129 [2018-11-10 03:47:18,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:18,823 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 2933 transitions. [2018-11-10 03:47:18,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:47:18,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2933 transitions. [2018-11-10 03:47:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 03:47:18,828 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:18,829 INFO L375 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-11-10 03:47:18,829 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:18,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:18,829 INFO L82 PathProgramCache]: Analyzing trace with hash -739180416, now seen corresponding path program 1 times [2018-11-10 03:47:18,829 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:18,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:18,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:18,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:18,912 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:47:18,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:18,912 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:18,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:18,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:47:19,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:19,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 03:47:19,089 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:47:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:47:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:47:19,090 INFO L87 Difference]: Start difference. First operand 2065 states and 2933 transitions. Second operand 10 states. [2018-11-10 03:47:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:19,977 INFO L93 Difference]: Finished difference Result 6040 states and 9013 transitions. [2018-11-10 03:47:19,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:47:19,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-11-10 03:47:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:19,995 INFO L225 Difference]: With dead ends: 6040 [2018-11-10 03:47:19,995 INFO L226 Difference]: Without dead ends: 4076 [2018-11-10 03:47:20,002 INFO L605 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-11-10 03:47:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-11-10 03:47:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3944. [2018-11-10 03:47:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2018-11-10 03:47:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5562 transitions. [2018-11-10 03:47:20,198 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5562 transitions. Word has length 131 [2018-11-10 03:47:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:20,198 INFO L481 AbstractCegarLoop]: Abstraction has 3944 states and 5562 transitions. [2018-11-10 03:47:20,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:47:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5562 transitions. [2018-11-10 03:47:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 03:47:20,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:20,210 INFO L375 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, 1, 1] [2018-11-10 03:47:20,210 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:20,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash 198751002, now seen corresponding path program 1 times [2018-11-10 03:47:20,211 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:20,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:20,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,313 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 03:47:20,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:20,314 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:20,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:20,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-10 03:47:20,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:20,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-10 03:47:20,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:47:20,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:47:20,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:47:20,484 INFO L87 Difference]: Start difference. First operand 3944 states and 5562 transitions. Second operand 10 states. [2018-11-10 03:47:21,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:21,637 INFO L93 Difference]: Finished difference Result 14228 states and 22188 transitions. [2018-11-10 03:47:21,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 03:47:21,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-11-10 03:47:21,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:21,677 INFO L225 Difference]: With dead ends: 14228 [2018-11-10 03:47:21,677 INFO L226 Difference]: Without dead ends: 10377 [2018-11-10 03:47:21,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 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-11-10 03:47:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2018-11-10 03:47:22,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 9427. [2018-11-10 03:47:22,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9427 states. [2018-11-10 03:47:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 13304 transitions. [2018-11-10 03:47:22,147 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 13304 transitions. Word has length 133 [2018-11-10 03:47:22,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:22,148 INFO L481 AbstractCegarLoop]: Abstraction has 9427 states and 13304 transitions. [2018-11-10 03:47:22,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:47:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 13304 transitions. [2018-11-10 03:47:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 03:47:22,172 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:22,172 INFO L375 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, 1, 1] [2018-11-10 03:47:22,172 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:22,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:22,173 INFO L82 PathProgramCache]: Analyzing trace with hash -381846254, now seen corresponding path program 1 times [2018-11-10 03:47:22,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:22,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:22,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:22,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:22,238 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:22,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:22,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 03:47:22,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:22,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-11-10 03:47:22,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:47:22,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:47:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:47:22,501 INFO L87 Difference]: Start difference. First operand 9427 states and 13304 transitions. Second operand 10 states. [2018-11-10 03:47:22,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:22,929 INFO L93 Difference]: Finished difference Result 19233 states and 26994 transitions. [2018-11-10 03:47:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:47:22,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-11-10 03:47:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:22,972 INFO L225 Difference]: With dead ends: 19233 [2018-11-10 03:47:22,972 INFO L226 Difference]: Without dead ends: 10091 [2018-11-10 03:47:22,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-11-10 03:47:22,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10091 states. [2018-11-10 03:47:23,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10091 to 9707. [2018-11-10 03:47:23,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2018-11-10 03:47:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 13608 transitions. [2018-11-10 03:47:23,495 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 13608 transitions. Word has length 133 [2018-11-10 03:47:23,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:23,495 INFO L481 AbstractCegarLoop]: Abstraction has 9707 states and 13608 transitions. [2018-11-10 03:47:23,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:47:23,496 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 13608 transitions. [2018-11-10 03:47:23,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 03:47:23,520 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:23,520 INFO L375 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, 1, 1] [2018-11-10 03:47:23,520 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:23,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:23,521 INFO L82 PathProgramCache]: Analyzing trace with hash -943606120, now seen corresponding path program 1 times [2018-11-10 03:47:23,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:23,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:23,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:23,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:23,571 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-10 03:47:23,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:23,572 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:23,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:23,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 03:47:23,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:23,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-10 03:47:23,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:47:23,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:47:23,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:47:23,704 INFO L87 Difference]: Start difference. First operand 9707 states and 13608 transitions. Second operand 7 states. [2018-11-10 03:47:24,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:24,585 INFO L93 Difference]: Finished difference Result 22214 states and 32278 transitions. [2018-11-10 03:47:24,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 03:47:24,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-10 03:47:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:24,722 INFO L225 Difference]: With dead ends: 22214 [2018-11-10 03:47:24,722 INFO L226 Difference]: Without dead ends: 12824 [2018-11-10 03:47:24,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 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-11-10 03:47:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12824 states. [2018-11-10 03:47:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12824 to 12168. [2018-11-10 03:47:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-10 03:47:25,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 16702 transitions. [2018-11-10 03:47:25,212 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 16702 transitions. Word has length 133 [2018-11-10 03:47:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:25,213 INFO L481 AbstractCegarLoop]: Abstraction has 12168 states and 16702 transitions. [2018-11-10 03:47:25,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:47:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 16702 transitions. [2018-11-10 03:47:25,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 03:47:25,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:25,240 INFO L375 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, 1, 1] [2018-11-10 03:47:25,240 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:25,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:25,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1964674474, now seen corresponding path program 1 times [2018-11-10 03:47:25,240 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:25,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:25,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-11-10 03:47:25,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:25,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 03:47:25,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 03:47:25,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 03:47:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:47:25,296 INFO L87 Difference]: Start difference. First operand 12168 states and 16702 transitions. Second operand 6 states. [2018-11-10 03:47:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:25,857 INFO L93 Difference]: Finished difference Result 23708 states and 31974 transitions. [2018-11-10 03:47:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:47:25,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-11-10 03:47:25,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:25,893 INFO L225 Difference]: With dead ends: 23708 [2018-11-10 03:47:25,894 INFO L226 Difference]: Without dead ends: 12264 [2018-11-10 03:47:25,914 INFO L605 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-11-10 03:47:25,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2018-11-10 03:47:26,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 12168. [2018-11-10 03:47:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-10 03:47:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 16670 transitions. [2018-11-10 03:47:26,638 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 16670 transitions. Word has length 133 [2018-11-10 03:47:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:26,639 INFO L481 AbstractCegarLoop]: Abstraction has 12168 states and 16670 transitions. [2018-11-10 03:47:26,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 03:47:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 16670 transitions. [2018-11-10 03:47:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 03:47:26,676 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:26,676 INFO L375 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, 1, 1] [2018-11-10 03:47:26,676 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1263609896, now seen corresponding path program 1 times [2018-11-10 03:47:26,677 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:26,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:26,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:26,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:26,753 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:26,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:26,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:26,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-11-10 03:47:26,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:47:26,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:47:26,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:47:26,894 INFO L87 Difference]: Start difference. First operand 12168 states and 16670 transitions. Second operand 9 states. [2018-11-10 03:47:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:27,985 INFO L93 Difference]: Finished difference Result 28172 states and 38677 transitions. [2018-11-10 03:47:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 03:47:27,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-11-10 03:47:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:28,021 INFO L225 Difference]: With dead ends: 28172 [2018-11-10 03:47:28,021 INFO L226 Difference]: Without dead ends: 16302 [2018-11-10 03:47:28,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-11-10 03:47:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16302 states. [2018-11-10 03:47:28,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16302 to 12657. [2018-11-10 03:47:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12657 states. [2018-11-10 03:47:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12657 states to 12657 states and 17408 transitions. [2018-11-10 03:47:28,641 INFO L78 Accepts]: Start accepts. Automaton has 12657 states and 17408 transitions. Word has length 133 [2018-11-10 03:47:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:28,641 INFO L481 AbstractCegarLoop]: Abstraction has 12657 states and 17408 transitions. [2018-11-10 03:47:28,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:47:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12657 states and 17408 transitions. [2018-11-10 03:47:28,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 03:47:28,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:28,667 INFO L375 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] [2018-11-10 03:47:28,667 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:28,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:28,667 INFO L82 PathProgramCache]: Analyzing trace with hash -2119885873, now seen corresponding path program 1 times [2018-11-10 03:47:28,667 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:28,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:28,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:28,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:28,730 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 03:47:28,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:28,730 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:28,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:28,878 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 03:47:28,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:28,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-11-10 03:47:28,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 03:47:28,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 03:47:28,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-11-10 03:47:28,896 INFO L87 Difference]: Start difference. First operand 12657 states and 17408 transitions. Second operand 10 states. [2018-11-10 03:47:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:30,465 INFO L93 Difference]: Finished difference Result 37072 states and 51266 transitions. [2018-11-10 03:47:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:47:30,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-11-10 03:47:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:30,536 INFO L225 Difference]: With dead ends: 37072 [2018-11-10 03:47:30,536 INFO L226 Difference]: Without dead ends: 24863 [2018-11-10 03:47:30,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 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-11-10 03:47:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24863 states. [2018-11-10 03:47:31,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24863 to 23303. [2018-11-10 03:47:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23303 states. [2018-11-10 03:47:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23303 states to 23303 states and 31733 transitions. [2018-11-10 03:47:31,565 INFO L78 Accepts]: Start accepts. Automaton has 23303 states and 31733 transitions. Word has length 142 [2018-11-10 03:47:31,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:31,565 INFO L481 AbstractCegarLoop]: Abstraction has 23303 states and 31733 transitions. [2018-11-10 03:47:31,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 03:47:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23303 states and 31733 transitions. [2018-11-10 03:47:31,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-11-10 03:47:31,599 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:31,599 INFO L375 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] [2018-11-10 03:47:31,600 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:31,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:31,600 INFO L82 PathProgramCache]: Analyzing trace with hash -837713587, now seen corresponding path program 1 times [2018-11-10 03:47:31,600 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:31,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,772 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 03:47:31,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:31,772 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:31,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:31,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:31,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-10 03:47:31,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:31,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-11-10 03:47:31,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 03:47:31,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 03:47:31,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-11-10 03:47:31,954 INFO L87 Difference]: Start difference. First operand 23303 states and 31733 transitions. Second operand 18 states. [2018-11-10 03:47:34,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:34,334 INFO L93 Difference]: Finished difference Result 47438 states and 67903 transitions. [2018-11-10 03:47:34,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 03:47:34,334 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-11-10 03:47:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:34,390 INFO L225 Difference]: With dead ends: 47438 [2018-11-10 03:47:34,390 INFO L226 Difference]: Without dead ends: 24539 [2018-11-10 03:47:34,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2018-11-10 03:47:34,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24539 states. [2018-11-10 03:47:35,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24539 to 21931. [2018-11-10 03:47:35,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21931 states. [2018-11-10 03:47:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21931 states to 21931 states and 29813 transitions. [2018-11-10 03:47:35,477 INFO L78 Accepts]: Start accepts. Automaton has 21931 states and 29813 transitions. Word has length 142 [2018-11-10 03:47:35,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:35,477 INFO L481 AbstractCegarLoop]: Abstraction has 21931 states and 29813 transitions. [2018-11-10 03:47:35,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 03:47:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 21931 states and 29813 transitions. [2018-11-10 03:47:35,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-10 03:47:35,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:35,497 INFO L375 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, 1, 1] [2018-11-10 03:47:35,498 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:35,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:35,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1745548876, now seen corresponding path program 1 times [2018-11-10 03:47:35,498 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:35,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:35,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:35,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:35,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:35,634 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:35,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:35,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:35,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:35,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:35,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-10 03:47:35,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 03:47:35,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:47:35,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:47:35,787 INFO L87 Difference]: Start difference. First operand 21931 states and 29813 transitions. Second operand 11 states. [2018-11-10 03:47:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:36,863 INFO L93 Difference]: Finished difference Result 39611 states and 54904 transitions. [2018-11-10 03:47:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:47:36,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-11-10 03:47:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:36,897 INFO L225 Difference]: With dead ends: 39611 [2018-11-10 03:47:36,897 INFO L226 Difference]: Without dead ends: 17910 [2018-11-10 03:47:36,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 144 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-11-10 03:47:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-11-10 03:47:37,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17384. [2018-11-10 03:47:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17384 states. [2018-11-10 03:47:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17384 states to 17384 states and 22499 transitions. [2018-11-10 03:47:37,701 INFO L78 Accepts]: Start accepts. Automaton has 17384 states and 22499 transitions. Word has length 143 [2018-11-10 03:47:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:37,702 INFO L481 AbstractCegarLoop]: Abstraction has 17384 states and 22499 transitions. [2018-11-10 03:47:37,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 03:47:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 17384 states and 22499 transitions. [2018-11-10 03:47:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 03:47:37,719 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:37,720 INFO L375 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, 1, 1] [2018-11-10 03:47:37,720 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:37,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:37,720 INFO L82 PathProgramCache]: Analyzing trace with hash -371199058, now seen corresponding path program 1 times [2018-11-10 03:47:37,720 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:37,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:37,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:37,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-10 03:47:37,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:37,781 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:37,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:37,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 03:47:37,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:37,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-10 03:47:37,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:47:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:37,896 INFO L87 Difference]: Start difference. First operand 17384 states and 22499 transitions. Second operand 4 states. [2018-11-10 03:47:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:38,716 INFO L93 Difference]: Finished difference Result 33824 states and 44184 transitions. [2018-11-10 03:47:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:47:38,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-11-10 03:47:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:38,753 INFO L225 Difference]: With dead ends: 33824 [2018-11-10 03:47:38,753 INFO L226 Difference]: Without dead ends: 16936 [2018-11-10 03:47:38,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 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-11-10 03:47:38,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16936 states. [2018-11-10 03:47:39,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16936 to 16936. [2018-11-10 03:47:39,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16936 states. [2018-11-10 03:47:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16936 states to 16936 states and 21629 transitions. [2018-11-10 03:47:39,685 INFO L78 Accepts]: Start accepts. Automaton has 16936 states and 21629 transitions. Word has length 148 [2018-11-10 03:47:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:39,685 INFO L481 AbstractCegarLoop]: Abstraction has 16936 states and 21629 transitions. [2018-11-10 03:47:39,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:47:39,685 INFO L276 IsEmpty]: Start isEmpty. Operand 16936 states and 21629 transitions. [2018-11-10 03:47:39,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-11-10 03:47:39,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:39,702 INFO L375 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, 1, 1] [2018-11-10 03:47:39,702 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:39,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:39,703 INFO L82 PathProgramCache]: Analyzing trace with hash -97223186, now seen corresponding path program 1 times [2018-11-10 03:47:39,703 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:39,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:39,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:39,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:39,788 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:39,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:39,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:39,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:39,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-11-10 03:47:39,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 03:47:39,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 03:47:39,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-11-10 03:47:39,940 INFO L87 Difference]: Start difference. First operand 16936 states and 21629 transitions. Second operand 11 states. [2018-11-10 03:47:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:41,039 INFO L93 Difference]: Finished difference Result 31319 states and 40532 transitions. [2018-11-10 03:47:41,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 03:47:41,039 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-11-10 03:47:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:41,070 INFO L225 Difference]: With dead ends: 31319 [2018-11-10 03:47:41,070 INFO L226 Difference]: Without dead ends: 14986 [2018-11-10 03:47:41,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 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-11-10 03:47:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14986 states. [2018-11-10 03:47:41,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14986 to 14666. [2018-11-10 03:47:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14666 states. [2018-11-10 03:47:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14666 states to 14666 states and 18136 transitions. [2018-11-10 03:47:41,928 INFO L78 Accepts]: Start accepts. Automaton has 14666 states and 18136 transitions. Word has length 148 [2018-11-10 03:47:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:41,929 INFO L481 AbstractCegarLoop]: Abstraction has 14666 states and 18136 transitions. [2018-11-10 03:47:41,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 03:47:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 14666 states and 18136 transitions. [2018-11-10 03:47:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 03:47:41,941 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:41,941 INFO L375 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, 1, 1] [2018-11-10 03:47:41,941 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:41,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 724172170, now seen corresponding path program 1 times [2018-11-10 03:47:41,942 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:41,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:41,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:41,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 03:47:42,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:42,002 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:42,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:42,108 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-10 03:47:42,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:42,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-10 03:47:42,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 03:47:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 03:47:42,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 03:47:42,139 INFO L87 Difference]: Start difference. First operand 14666 states and 18136 transitions. Second operand 4 states. [2018-11-10 03:47:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:42,919 INFO L93 Difference]: Finished difference Result 27564 states and 34437 transitions. [2018-11-10 03:47:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 03:47:42,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-11-10 03:47:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:42,948 INFO L225 Difference]: With dead ends: 27564 [2018-11-10 03:47:42,948 INFO L226 Difference]: Without dead ends: 13802 [2018-11-10 03:47:42,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 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-11-10 03:47:42,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13802 states. [2018-11-10 03:47:43,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13802 to 13802. [2018-11-10 03:47:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2018-11-10 03:47:43,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 16772 transitions. [2018-11-10 03:47:43,678 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 16772 transitions. Word has length 153 [2018-11-10 03:47:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:43,678 INFO L481 AbstractCegarLoop]: Abstraction has 13802 states and 16772 transitions. [2018-11-10 03:47:43,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 03:47:43,678 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 16772 transitions. [2018-11-10 03:47:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-10 03:47:43,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:43,690 INFO L375 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, 1, 1] [2018-11-10 03:47:43,690 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:43,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:43,690 INFO L82 PathProgramCache]: Analyzing trace with hash 627489610, now seen corresponding path program 1 times [2018-11-10 03:47:43,691 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:43,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:43,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:43,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:43,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-10 03:47:43,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:47:43,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:47:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:47:43,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:47:43,798 INFO L87 Difference]: Start difference. First operand 13802 states and 16772 transitions. Second operand 5 states. [2018-11-10 03:47:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:46,122 INFO L93 Difference]: Finished difference Result 48590 states and 59377 transitions. [2018-11-10 03:47:46,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 03:47:46,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-11-10 03:47:46,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:46,193 INFO L225 Difference]: With dead ends: 48590 [2018-11-10 03:47:46,194 INFO L226 Difference]: Without dead ends: 36944 [2018-11-10 03:47:46,215 INFO L605 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-11-10 03:47:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36944 states. [2018-11-10 03:47:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36944 to 36938. [2018-11-10 03:47:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36938 states. [2018-11-10 03:47:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36938 states to 36938 states and 44786 transitions. [2018-11-10 03:47:48,250 INFO L78 Accepts]: Start accepts. Automaton has 36938 states and 44786 transitions. Word has length 153 [2018-11-10 03:47:48,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:48,251 INFO L481 AbstractCegarLoop]: Abstraction has 36938 states and 44786 transitions. [2018-11-10 03:47:48,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:47:48,251 INFO L276 IsEmpty]: Start isEmpty. Operand 36938 states and 44786 transitions. [2018-11-10 03:47:48,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-11-10 03:47:48,276 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:48,276 INFO L375 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 03:47:48,276 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:48,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -398865530, now seen corresponding path program 1 times [2018-11-10 03:47:48,276 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:48,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:48,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:48,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:48,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:48,359 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:48,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:48,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 03:47:48,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 03:47:48,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-11-10 03:47:48,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 03:47:48,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 03:47:48,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:47:48,526 INFO L87 Difference]: Start difference. First operand 36938 states and 44786 transitions. Second operand 9 states. [2018-11-10 03:47:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:52,668 INFO L93 Difference]: Finished difference Result 103701 states and 126581 transitions. [2018-11-10 03:47:52,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 03:47:52,668 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2018-11-10 03:47:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:52,771 INFO L225 Difference]: With dead ends: 103701 [2018-11-10 03:47:52,772 INFO L226 Difference]: Without dead ends: 66895 [2018-11-10 03:47:52,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-11-10 03:47:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66895 states. [2018-11-10 03:47:55,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66895 to 55933. [2018-11-10 03:47:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55933 states. [2018-11-10 03:47:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55933 states to 55933 states and 66127 transitions. [2018-11-10 03:47:55,777 INFO L78 Accepts]: Start accepts. Automaton has 55933 states and 66127 transitions. Word has length 158 [2018-11-10 03:47:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:55,778 INFO L481 AbstractCegarLoop]: Abstraction has 55933 states and 66127 transitions. [2018-11-10 03:47:55,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 03:47:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 55933 states and 66127 transitions. [2018-11-10 03:47:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 03:47:55,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:55,797 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:47:55,798 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:55,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash 103916808, now seen corresponding path program 1 times [2018-11-10 03:47:55,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:55,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:55,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:55,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 03:47:55,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:47:55,903 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:47:55,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:55,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:47:55,995 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:47:56,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:47:56,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-11-10 03:47:56,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 03:47:56,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 03:47:56,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 03:47:56,014 INFO L87 Difference]: Start difference. First operand 55933 states and 66127 transitions. Second operand 7 states. [2018-11-10 03:47:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:47:58,037 INFO L93 Difference]: Finished difference Result 83965 states and 99936 transitions. [2018-11-10 03:47:58,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:47:58,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 177 [2018-11-10 03:47:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:47:58,108 INFO L225 Difference]: With dead ends: 83965 [2018-11-10 03:47:58,109 INFO L226 Difference]: Without dead ends: 28827 [2018-11-10 03:47:58,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 178 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-11-10 03:47:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28827 states. [2018-11-10 03:47:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28827 to 21475. [2018-11-10 03:47:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21475 states. [2018-11-10 03:47:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21475 states to 21475 states and 25298 transitions. [2018-11-10 03:47:59,747 INFO L78 Accepts]: Start accepts. Automaton has 21475 states and 25298 transitions. Word has length 177 [2018-11-10 03:47:59,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:47:59,748 INFO L481 AbstractCegarLoop]: Abstraction has 21475 states and 25298 transitions. [2018-11-10 03:47:59,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 03:47:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 21475 states and 25298 transitions. [2018-11-10 03:47:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 03:47:59,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:47:59,762 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:47:59,762 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:47:59,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:47:59,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1971562178, now seen corresponding path program 1 times [2018-11-10 03:47:59,763 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:47:59,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:47:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:59,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:47:59,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:47:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:47:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 03:47:59,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:47:59,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 03:47:59,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 03:47:59,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 03:47:59,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 03:47:59,826 INFO L87 Difference]: Start difference. First operand 21475 states and 25298 transitions. Second operand 3 states. [2018-11-10 03:48:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:01,029 INFO L93 Difference]: Finished difference Result 42464 states and 50216 transitions. [2018-11-10 03:48:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 03:48:01,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2018-11-10 03:48:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:01,075 INFO L225 Difference]: With dead ends: 42464 [2018-11-10 03:48:01,075 INFO L226 Difference]: Without dead ends: 21649 [2018-11-10 03:48:01,100 INFO L605 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-11-10 03:48:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21649 states. [2018-11-10 03:48:02,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21649 to 21475. [2018-11-10 03:48:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21475 states. [2018-11-10 03:48:02,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21475 states to 21475 states and 25124 transitions. [2018-11-10 03:48:02,558 INFO L78 Accepts]: Start accepts. Automaton has 21475 states and 25124 transitions. Word has length 179 [2018-11-10 03:48:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:02,558 INFO L481 AbstractCegarLoop]: Abstraction has 21475 states and 25124 transitions. [2018-11-10 03:48:02,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 03:48:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 21475 states and 25124 transitions. [2018-11-10 03:48:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 03:48:02,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:48:02,567 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:48:02,567 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:48:02,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:48:02,568 INFO L82 PathProgramCache]: Analyzing trace with hash -328506733, now seen corresponding path program 1 times [2018-11-10 03:48:02,568 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:48:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:48:02,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:02,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:02,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:02,677 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-10 03:48:02,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:48:02,677 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:48:02,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:02,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:48:02,778 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:48:02,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:48:02,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-11-10 03:48:02,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 03:48:02,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 03:48:02,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-11-10 03:48:02,798 INFO L87 Difference]: Start difference. First operand 21475 states and 25124 transitions. Second operand 12 states. [2018-11-10 03:48:04,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:04,367 INFO L93 Difference]: Finished difference Result 36029 states and 42486 transitions. [2018-11-10 03:48:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 03:48:04,368 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-11-10 03:48:04,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:04,397 INFO L225 Difference]: With dead ends: 36029 [2018-11-10 03:48:04,397 INFO L226 Difference]: Without dead ends: 15007 [2018-11-10 03:48:04,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 187 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-11-10 03:48:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2018-11-10 03:48:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 7300. [2018-11-10 03:48:05,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2018-11-10 03:48:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 8191 transitions. [2018-11-10 03:48:05,130 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 8191 transitions. Word has length 179 [2018-11-10 03:48:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:05,130 INFO L481 AbstractCegarLoop]: Abstraction has 7300 states and 8191 transitions. [2018-11-10 03:48:05,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 03:48:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 8191 transitions. [2018-11-10 03:48:05,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 03:48:05,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:48:05,133 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:48:05,133 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:48:05,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:48:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash -263820910, now seen corresponding path program 1 times [2018-11-10 03:48:05,134 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:48:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:48:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:05,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:05,202 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-10 03:48:05,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:48:05,202 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:48:05,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:05,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:48:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:48:05,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:48:05,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-10 03:48:05,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:48:05,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:48:05,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:48:05,363 INFO L87 Difference]: Start difference. First operand 7300 states and 8191 transitions. Second operand 8 states. [2018-11-10 03:48:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:05,947 INFO L93 Difference]: Finished difference Result 11359 states and 12760 transitions. [2018-11-10 03:48:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:48:05,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-11-10 03:48:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:05,955 INFO L225 Difference]: With dead ends: 11359 [2018-11-10 03:48:05,955 INFO L226 Difference]: Without dead ends: 4557 [2018-11-10 03:48:05,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 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-11-10 03:48:05,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-11-10 03:48:06,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4509. [2018-11-10 03:48:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2018-11-10 03:48:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 4996 transitions. [2018-11-10 03:48:06,356 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 4996 transitions. Word has length 180 [2018-11-10 03:48:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:06,357 INFO L481 AbstractCegarLoop]: Abstraction has 4509 states and 4996 transitions. [2018-11-10 03:48:06,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:48:06,357 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 4996 transitions. [2018-11-10 03:48:06,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 03:48:06,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:48:06,359 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:48:06,359 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:48:06,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:48:06,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1041738037, now seen corresponding path program 1 times [2018-11-10 03:48:06,359 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:48:06,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:48:06,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:06,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:06,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:06,433 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 03:48:06,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 03:48:06,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 03:48:06,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 03:48:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 03:48:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 03:48:06,435 INFO L87 Difference]: Start difference. First operand 4509 states and 4996 transitions. Second operand 5 states. [2018-11-10 03:48:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:07,745 INFO L93 Difference]: Finished difference Result 13945 states and 15849 transitions. [2018-11-10 03:48:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 03:48:07,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-11-10 03:48:07,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:07,760 INFO L225 Difference]: With dead ends: 13945 [2018-11-10 03:48:07,760 INFO L226 Difference]: Without dead ends: 11296 [2018-11-10 03:48:07,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 03:48:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2018-11-10 03:48:08,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 10003. [2018-11-10 03:48:08,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10003 states. [2018-11-10 03:48:08,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 11256 transitions. [2018-11-10 03:48:08,708 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 11256 transitions. Word has length 181 [2018-11-10 03:48:08,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:08,708 INFO L481 AbstractCegarLoop]: Abstraction has 10003 states and 11256 transitions. [2018-11-10 03:48:08,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 03:48:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 11256 transitions. [2018-11-10 03:48:08,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 03:48:08,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 03:48:08,712 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:48:08,712 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 03:48:08,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 03:48:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1686471309, now seen corresponding path program 1 times [2018-11-10 03:48:08,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 03:48:08,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 03:48:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:08,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:08,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 03:48:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:08,804 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 03:48:08,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 03:48:08,804 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/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-11-10 03:48:08,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 03:48:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 03:48:08,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 03:48:08,968 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 03:48:08,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 03:48:08,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-10 03:48:08,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 03:48:08,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 03:48:08,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-10 03:48:08,999 INFO L87 Difference]: Start difference. First operand 10003 states and 11256 transitions. Second operand 8 states. [2018-11-10 03:48:09,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 03:48:09,333 INFO L93 Difference]: Finished difference Result 11345 states and 12703 transitions. [2018-11-10 03:48:09,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 03:48:09,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-11-10 03:48:09,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 03:48:09,334 INFO L225 Difference]: With dead ends: 11345 [2018-11-10 03:48:09,334 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 03:48:09,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 03:48:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 03:48:09,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 03:48:09,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 03:48:09,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 03:48:09,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2018-11-10 03:48:09,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 03:48:09,345 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 03:48:09,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 03:48:09,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 03:48:09,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 03:48:09,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 03:48:09,522 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 136 [2018-11-10 03:48:09,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,600 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,688 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,705 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,767 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,785 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 196 [2018-11-10 03:48:09,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:09,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,313 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 377 DAG size of output: 243 [2018-11-10 03:48:10,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,604 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,667 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,691 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:10,745 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 196 [2018-11-10 03:48:11,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,267 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,282 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,327 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,371 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 259 [2018-11-10 03:48:11,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:11,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:12,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,114 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,142 WARN L179 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 398 DAG size of output: 259 [2018-11-10 03:48:13,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,530 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,588 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,647 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:13,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:14,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,040 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:15,198 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 353 DAG size of output: 232 [2018-11-10 03:48:15,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,327 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 283 [2018-11-10 03:48:16,472 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 276 DAG size of output: 236 [2018-11-10 03:48:16,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,963 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:16,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,000 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,156 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 354 DAG size of output: 229 [2018-11-10 03:48:17,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,438 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:17,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:18,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 03:48:19,661 WARN L179 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 203 DAG size of output: 113 [2018-11-10 03:48:20,354 WARN L179 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 120 [2018-11-10 03:48:21,132 WARN L179 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 134 [2018-11-10 03:48:21,963 WARN L179 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 122 [2018-11-10 03:48:23,821 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 283 DAG size of output: 118 [2018-11-10 03:48:24,500 WARN L179 SmtUtils]: Spent 677.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 120 [2018-11-10 03:48:27,001 WARN L179 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 352 DAG size of output: 98 [2018-11-10 03:48:27,163 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2018-11-10 03:48:28,435 WARN L179 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 261 DAG size of output: 136 [2018-11-10 03:48:28,690 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2018-11-10 03:48:30,682 WARN L179 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 332 DAG size of output: 108 [2018-11-10 03:48:33,679 WARN L179 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 355 DAG size of output: 99 [2018-11-10 03:48:35,089 WARN L179 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 261 DAG size of output: 136 [2018-11-10 03:48:35,306 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 1 [2018-11-10 03:48:36,313 WARN L179 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 296 DAG size of output: 68 [2018-11-10 03:48:36,428 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 75 [2018-11-10 03:48:38,613 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 352 DAG size of output: 98 [2018-11-10 03:48:38,762 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 66 [2018-11-10 03:48:40,086 WARN L179 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 248 DAG size of output: 90 [2018-11-10 03:48:41,619 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 396 DAG size of output: 89 [2018-11-10 03:48:42,917 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 192 DAG size of output: 142 [2018-11-10 03:48:46,095 WARN L179 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 366 DAG size of output: 123 [2018-11-10 03:48:47,256 WARN L179 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 244 DAG size of output: 125 [2018-11-10 03:48:48,711 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 221 DAG size of output: 105 [2018-11-10 03:48:50,798 WARN L179 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 334 DAG size of output: 119 [2018-11-10 03:48:51,001 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 1 [2018-11-10 03:48:51,195 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 113 [2018-11-10 03:48:51,372 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 84 [2018-11-10 03:48:53,140 WARN L179 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 297 DAG size of output: 97 [2018-11-10 03:48:53,334 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2018-11-10 03:49:00,961 WARN L179 SmtUtils]: Spent 7.62 s on a formula simplification. DAG size of input: 620 DAG size of output: 337 [2018-11-10 03:49:01,153 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 114 [2018-11-10 03:49:02,113 WARN L179 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 191 DAG size of output: 133 [2018-11-10 03:49:02,293 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 113 [2018-11-10 03:49:06,096 WARN L179 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 371 DAG size of output: 116 [2018-11-10 03:49:07,237 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 241 DAG size of output: 125 [2018-11-10 03:49:07,511 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 291 DAG size of output: 1 [2018-11-10 03:49:07,803 WARN L179 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 329 DAG size of output: 1 [2018-11-10 03:49:10,399 WARN L179 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 389 DAG size of output: 155 [2018-11-10 03:49:12,651 WARN L179 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 336 DAG size of output: 120 [2018-11-10 03:49:14,173 WARN L179 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 303 DAG size of output: 150 [2018-11-10 03:49:14,341 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-11-10 03:49:16,106 WARN L179 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 252 DAG size of output: 102 [2018-11-10 03:49:16,898 WARN L179 SmtUtils]: Spent 786.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 131 [2018-11-10 03:49:18,628 WARN L179 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 310 DAG size of output: 150 [2018-11-10 03:49:18,941 WARN L179 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 115 [2018-11-10 03:49:22,103 WARN L179 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 366 DAG size of output: 123 [2018-11-10 03:49:22,106 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (let ((.cse27 (= 1 ~b0_ev~0))) (let ((.cse6 (not (= 1 ~d1_ev~0))) (.cse12 (< 0 ~b0_ev~0)) (.cse26 (< ~d0_ev~0 2)) (.cse9 (= 0 ~b0_ev~0)) (.cse17 (= ~b1_ev~0 1)) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse19 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (< ~b1_val_t~0 1)) (.cse10 (< ~d0_val_t~0 1)) (.cse24 (not (= ~z_val~0 ~z_val_t~0))) (.cse22 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse7 (= ~b1_req_up~0 1)) (.cse25 (< 0 ~z_req_up~0)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< 1 ~d1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse18 (< 0 ~z_val~0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse28 (not (= 1 ~d0_ev~0))) (.cse21 (< ~z_val~0 0)) (.cse29 (not .cse27))) (and (or (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse18 (not .cse17) .cse19 .cse20 .cse21) (or .cse22 (or .cse19 .cse8 .cse3 (and (or (or (or .cse7 (< ~b0_ev~0 2) .cse0 .cse13 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6) .cse11 .cse14) .cse20 .cse10) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse26 .cse1 .cse2 .cse27 .cse20 .cse21 .cse6)))) (or .cse19 .cse8 (or .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse28 .cse20 .cse21) .cse22 .cse3 .cse24) (or .cse22 .cse19 .cse8 .cse3 (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse26 .cse1 .cse2 .cse27 .cse20 .cse21) .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse19 .cse8 .cse20 .cse3 .cse10 (or .cse7 .cse25 .cse11 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse21 .cse29 .cse4 .cse5) .cse24 .cse22) (or .cse19 .cse8 .cse20 .cse3 .cse10 .cse24 .cse22 (or .cse7 .cse25 .cse11 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse28 .cse21 .cse29))))) [2018-11-10 03:49:22,107 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-11-10 03:49:22,107 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-11-10 03:49:22,107 INFO L421 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (let ((.cse27 (= 1 ~b0_ev~0))) (let ((.cse6 (not (= 1 ~d1_ev~0))) (.cse12 (< 0 ~b0_ev~0)) (.cse26 (< ~d0_ev~0 2)) (.cse9 (= 0 ~b0_ev~0)) (.cse17 (= ~b1_ev~0 1)) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse19 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (< ~b1_val_t~0 1)) (.cse10 (< ~d0_val_t~0 1)) (.cse24 (not (= ~z_val~0 ~z_val_t~0))) (.cse22 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse7 (= ~b1_req_up~0 1)) (.cse25 (< 0 ~z_req_up~0)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< 1 ~d1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse18 (< 0 ~z_val~0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse28 (not (= 1 ~d0_ev~0))) (.cse21 (< ~z_val~0 0)) (.cse29 (not .cse27))) (and (or (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 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse25 .cse11 .cse12 .cse13 .cse22 .cse14 .cse15 .cse16 .cse18 (not .cse17) .cse19 .cse20 .cse21) (or .cse22 (or .cse19 .cse8 .cse3 (and (or (or (or .cse7 (< ~b0_ev~0 2) .cse0 .cse13 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse21 .cse4 .cse5 .cse6) .cse11 .cse14) .cse20 .cse10) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse26 .cse1 .cse2 .cse27 .cse20 .cse21 .cse6)))) (or .cse19 .cse8 (or .cse7 .cse9 .cse10 .cse25 .cse11 .cse12 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse28 .cse20 .cse21) .cse22 .cse3 .cse24) (or .cse22 .cse19 .cse8 .cse3 (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse26 .cse1 .cse2 .cse27 .cse20 .cse21) .cse24) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse24 .cse7 .cse8 .cse9 .cse10 .cse11 .cse22 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse27 .cse20 .cse21) (or .cse19 .cse8 .cse20 .cse3 .cse10 (or .cse7 .cse25 .cse11 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse21 .cse29 .cse4 .cse5) .cse24 .cse22) (or .cse19 .cse8 .cse20 .cse3 .cse10 .cse24 .cse22 (or .cse7 .cse25 .cse11 .cse23 .cse0 .cse13 .cse14 .cse15 .cse16 .cse18 .cse1 .cse2 .cse28 .cse21 .cse29))))) [2018-11-10 03:49:22,107 INFO L425 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-11-10 03:49:22,107 INFO L425 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-11-10 03:49:22,107 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L421 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse28 (< ~d1_ev~0 2)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~1)) (.cse27 (< ~d0_ev~0 2)) (.cse29 (< 0 ~b0_ev~0)) (.cse30 (< ~b0_ev~0 2)) (.cse12 (< 0 ~z_req_up~0)) (.cse3 (not (= 0 ~comp_m1_st~0))) (.cse24 (= ~b1_ev~0 0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse5 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse7 (not (= ~z_val~0 ~z_val_t~0))) (.cse23 (= 0 exists_runnable_thread_~__retres1~1)) (.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)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse25 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse26 (= ~b1_ev~0 1)) (.cse17 (< 0 ~z_val~0)) (.cse18 (< ~d1_val~0 ~d1_val_t~0)) (.cse19 (= 1 ~b0_ev~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (< ~z_val~0 0)) (.cse22 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~b1_ev~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse18 .cse9 .cse4 .cse23 .cse7 (or .cse8 .cse10 .cse11 .cse13 .cse24 .cse25 .cse14 .cse15 .cse26 .cse16 .cse17 .cse27 .cse1 .cse2 .cse19 .cse20 .cse21 .cse22)) (or .cse0 (or (or .cse8 .cse10 .cse24 .cse26 .cse16 .cse1 .cse2 .cse3 .cse28 .cse5 .cse6) .cse15 (not (= ~z_val~0 0)) .cse18 .cse9 .cse20 .cse4 .cse11 .cse13 .cse29 .cse14)) (or .cse0 (or (and (or (or (or .cse8 .cse30 .cse24 .cse15 .cse26 .cse16 .cse17 .cse1 .cse2 .cse21 .cse3 .cse28 .cse5 .cse6) .cse13 .cse14) .cse20 .cse11) (or .cse20 .cse11 (or (or .cse8 .cse30 .cse24 .cse15 .cse26 .cse16 .cse17 .cse27 .cse1 .cse2 .cse21 .cse3 .cse28) .cse13 .cse14)) (or (or .cse8 .cse10 .cse24 .cse15 .cse26 .cse16 .cse17 .cse27 .cse1 .cse2 .cse21 .cse3 .cse28) .cse20 .cse11 .cse13 .cse29 .cse14)) .cse18 .cse9 .cse4)) (or .cse18 .cse9 .cse4 .cse0 (and (or (or .cse13 (or .cse8 .cse30 .cse24 .cse15 .cse26 .cse16 .cse17 .cse27 .cse1 .cse2 .cse21 .cse3 .cse22) .cse14) .cse20 .cse11) (or .cse20 (or .cse8 .cse10 .cse24 .cse15 .cse26 .cse16 .cse17 .cse27 .cse1 .cse2 .cse21 .cse3 .cse22) .cse11 .cse13 .cse29 .cse14) (or (or .cse8 .cse30 .cse12 .cse13 .cse24 .cse14 .cse15 .cse26 .cse16 .cse17 .cse1 .cse2 .cse21 .cse3 .cse5 .cse6 .cse22) .cse20 .cse11)) .cse7) (or .cse24 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse23 .cse8 .cse9 .cse10 .cse11 .cse13 .cse25 .cse14 .cse15 .cse16 .cse26 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2018-11-10 03:49:22,108 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-11-10 03:49:22,108 INFO L425 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L421 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (let ((.cse29 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse30 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse12 (< 1 ~d1_ev~0)) (.cse5 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse25 (< 0 |old(~z_req_up~0)|)) (.cse3 (= ~z_val~0 ~z_val_t~0)) (.cse22 (= 1 ~d1_ev~0)) (.cse18 (< ~d0_ev~0 2)) (.cse24 (< ~b0_ev~0 2)) (.cse2 (and .cse29 .cse30)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse6 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse4 (< ~b1_val_t~0 1)) (.cse7 (< ~d0_val_t~0 1)) (.cse9 (= 0 |old(~comp_m1_st~0)|)) (.cse10 (= ~b1_req_up~0 1)) (.cse11 (= 0 ~b0_ev~0)) (.cse13 (= ~b1_ev~0 0)) (.cse14 (< ~d1_val_t~0 1)) (.cse15 (= ~b1_ev~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse19 (= ~b0_req_up~0 1)) (.cse20 (< 0 ~comp_m1_i~0)) (.cse21 (< ~z_val~0 0)) (.cse31 (< ~d1_ev~0 2)) (.cse26 (< 0 ~d0_ev~0)) (.cse27 (= 0 ~d0_ev~0)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse28 (< 0 ~b0_ev~0)) (.cse23 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 (and .cse2 .cse3) .cse4 .cse5 (and (or .cse6 .cse7 .cse8 (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (= 1 ~b0_ev~0) .cse21 .cse22) .cse23) (or .cse6 .cse7 (or .cse9 .cse10 .cse24 .cse25 .cse8 .cse12 .cse13 .cse23 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse26 .cse27 .cse22)))) (or .cse9 .cse12 .cse19 .cse20 .cse4 .cse26 .cse27 (< ~b1_ev~0 2) .cse5 .cse10 .cse1 .cse11 .cse7 .cse25 .cse8 .cse28 .cse23 .cse14 (and .cse3 .cse29 .cse30) .cse16 .cse17 .cse0 .cse6 .cse21 .cse22) (or .cse2 (or (and (or (or .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31) .cse6 .cse7 .cse8 .cse28 .cse23) (or (or (or .cse9 .cse10 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse31) .cse8 .cse23) .cse6 .cse7) (or .cse6 .cse7 (or .cse8 (or .cse9 .cse10 .cse24 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse26 .cse27) .cse23))) .cse0 .cse1 .cse4)) (or .cse2 (or .cse0 .cse1 .cse6 .cse4 .cse7 (or .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse31 .cse26 .cse27) .cse8 .cse28 .cse23))))) [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-11-10 03:49:22,109 INFO L425 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse32 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse37 (= 1 |old(~d1_ev~0)|)) (.cse38 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse31 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse33 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse34 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse16 (= 1 |old(~b0_ev~0)|))) (let ((.cse28 (not .cse16)) (.cse29 (and .cse38 .cse31 (= 1 ~d0_ev~0) .cse33 .cse34)) (.cse27 (not (= 1 |old(~d0_ev~0)|))) (.cse21 (< |old(~b0_ev~0)| 2)) (.cse36 (< ~comp_m1_st~0 2)) (.cse13 (< |old(~d0_ev~0)| 2)) (.cse26 (< 1 |old(~d1_ev~0)|)) (.cse30 (not (= ~z_val~0 ~z_val_t~0))) (.cse25 (< 0 ~z_req_up~0)) (.cse7 (= |old(~b1_ev~0)| 0)) (.cse14 (= ~b0_req_up~0 1)) (.cse15 (< 0 ~comp_m1_i~0)) (.cse19 (not (= 0 ~comp_m1_st~0))) (.cse2 (< ~b1_val_t~0 1)) (.cse22 (< 0 |old(~d0_ev~0)|)) (.cse23 (= 0 |old(~d0_ev~0)|)) (.cse20 (not .cse37)) (.cse3 (= ~b1_req_up~0 1)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (= 0 |old(~b0_ev~0)|)) (.cse5 (< ~d0_val_t~0 1)) (.cse6 (< ~b0_val~0 ~b0_val_t~0)) (.cse35 (< 0 |old(~b0_ev~0)|)) (.cse8 (< ~b0_val_t~0 1)) (.cse9 (< ~d1_val_t~0 1)) (.cse11 (< |old(~z_ev~0)| 2)) (.cse10 (= |old(~b1_ev~0)| 1)) (.cse12 (< 0 ~z_val~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse17 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse18 (< ~z_val~0 0)) (.cse24 (and .cse38 .cse31 .cse32 .cse33 .cse34))) (and (or (or .cse0 .cse1 .cse2 (and (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse17 (or (or .cse3 .cse21 .cse7 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse18 .cse19 .cse22 .cse23 .cse20) .cse6 .cse8) .cse5))) .cse24) (or (or .cse3 .cse25 .cse6 .cse26 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse27 .cse18 .cse19 .cse28) .cse0 .cse1 .cse17 .cse2 .cse5 .cse29 .cse30) (or .cse0 .cse1 .cse17 .cse2 (and (= ~b0_ev~0 1) .cse31 .cse32 .cse33 .cse34) .cse5 .cse30 (or .cse3 .cse25 .cse6 .cse26 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse18 .cse19 .cse28 .cse22 .cse23)) (or .cse29 (or .cse3 .cse4 .cse5 .cse25 .cse6 .cse35 .cse26 .cse7 .cse8 .cse9 .cse11 .cse12 .cse14 .cse15 .cse27 .cse17 .cse18 .cse19) .cse0 .cse1 .cse2 .cse30) (or .cse7 .cse14 .cse15 .cse2 .cse22 .cse23 .cse30 .cse3 .cse1 .cse4 .cse5 .cse6 .cse35 .cse36 .cse8 .cse9 .cse11 .cse10 .cse12 .cse0 .cse17 .cse18 .cse24 .cse37) (or .cse0 .cse1 .cse2 .cse30 (and (or .cse17 .cse5 (or .cse3 .cse21 .cse6 .cse7 .cse36 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse18 .cse22 .cse23 .cse37)) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse36 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse37)) .cse24) (or .cse24 .cse26 .cse14 .cse15 .cse19 .cse2 .cse22 .cse23 .cse30 .cse3 .cse1 .cse4 .cse5 .cse25 .cse6 .cse35 .cse8 .cse9 .cse11 .cse12 (not .cse10) .cse0 .cse17 .cse18) (or (or .cse7 .cse14 .cse15 .cse19 .cse2 .cse22 .cse23 .cse20 .cse3 .cse1 .cse4 .cse5 .cse6 .cse35 .cse8 .cse9 .cse11 .cse10 .cse12 .cse0 .cse17 .cse18) .cse24)))) [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-11-10 03:49:22,110 INFO L421 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) (not (= ~z_val~0 ~z_val_t~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) (< ~d1_val~0 ~d1_val_t~0) (not (= ~d0_val_t~0 ~d0_val~0)) (< ~z_val~0 0) (= 1 ~d1_ev~0)) [2018-11-10 03:49:22,110 INFO L425 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-11-10 03:49:22,111 INFO L421 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)|) (not (= |old(~z_val~0)| |old(~z_val_t~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)|) (<= (+ |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) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (= 0 ~z_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-11-10 03:49:22,111 INFO L421 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)|) (not (= |old(~z_val~0)| |old(~z_val_t~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)|) (<= (+ |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-11-10 03:49:22,111 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-11-10 03:49:22,111 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-11-10 03:49:22,111 INFO L425 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-11-10 03:49:22,111 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-11-10 03:49:22,111 INFO L421 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)|) (not (= |old(~z_val~0)| |old(~z_val_t~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)|) (<= (+ |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) (= |old(~comp_m1_st~0)| ~comp_m1_st~0) (= 0 ~z_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-11-10 03:49:22,111 INFO L421 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) (= ~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) (= 0 ~z_val~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)|) (not (= |old(~z_val~0)| |old(~z_val_t~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)|) (<= (+ |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-11-10 03:49:22,111 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-11-10 03:49:22,112 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L425 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L425 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L421 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse11 (= ~b1_req_up~0 1)) (.cse19 (< ~b1_val~0 ~b1_val_t~0)) (.cse1 (< ~d0_val_t~0 1)) (.cse14 (< ~b0_val~0 ~b0_val_t~0)) (.cse22 (= 0 ~z_val~0)) (.cse20 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse21 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse16 (< ~b0_val_t~0 1)) (.cse8 (< ~d1_val_t~0 1)) (.cse9 (= ~b1_ev~0 1)) (.cse10 (< 0 |old(~z_val~0)|)) (.cse12 (= ~b0_req_up~0 1)) (.cse2 (< |old(~z_ev~0)| 2)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse17 (= 0 ~b0_ev~0)) (.cse4 (= 0 ~d0_ev~0)) (.cse5 (= ~b1_ev~0 0)) (.cse6 (< ~comp_m1_st~0 2)) (.cse7 (= 1 ~d1_ev~0)) (.cse18 (< ~d1_val~0 ~d1_val_t~0)) (.cse0 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse13 (< |old(~z_val~0)| 0)) (.cse23 (< ~b1_val_t~0 1)) (.cse24 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse15 (< |old(~z_req_up~0)| 1))) (and (or (and (or .cse0 .cse1 (or (or (= 1 ~d0_ev~0) .cse2 .cse3 (< ~b0_ev~0 2) .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16)) (or .cse11 .cse1 (or .cse2 (< ~d0_ev~0 2) .cse3 .cse17 .cse5 .cse6 .cse7) .cse14 .cse16 .cse8 .cse9 .cse10 .cse12 (= 1 ~b0_ev~0) .cse0 .cse13 .cse15)) .cse18 .cse19 (and (and .cse20 .cse21) .cse22) .cse23 .cse24) (or .cse11 .cse19 .cse1 .cse14 (< 0 ~b0_ev~0) (and .cse22 .cse20 .cse21) .cse16 .cse8 .cse9 .cse10 .cse12 (or .cse2 .cse3 .cse17 .cse4 .cse5 .cse6 .cse7) .cse18 .cse0 .cse13 .cse23 (< 0 ~d0_ev~0) .cse24 .cse15))) [2018-11-10 03:49:22,112 INFO L425 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-11-10 03:49:22,112 INFO L421 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (let ((.cse19 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse9 (= 0 ~b0_ev~0)) (.cse2 (= ~b1_req_up~0 |old(~d1_req_up~0)|)) (.cse10 (= 0 ~d0_ev~0)) (.cse12 (= ~b1_ev~0 0)) (.cse13 (< ~comp_m1_st~0 2)) (.cse14 (= 1 |old(~d1_ev~0)|)) (.cse6 (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 (= ~b0_req_up~0 1)) (.cse8 (< 0 ~comp_m1_i~0)) (.cse22 (< ~b1_val_t~0 1)) (.cse23 (< 0 ~d0_ev~0)) (.cse24 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (< ~b1_val~0 ~b1_val_t~0)) (.cse1 (< ~d0_val_t~0 1)) (.cse3 (< ~b0_val~0 ~b0_val_t~0)) (.cse4 (< 0 ~b0_ev~0)) (.cse5 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse7 (< ~z_ev~0 2)) (.cse16 (= ~b1_ev~0 1)) (.cse17 (< 0 ~z_val~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (< ~z_val~0 0)) (.cse11 (not (= 1 |old(~d1_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24) (or .cse19 .cse0 .cse6 .cse22 .cse24 (and (or .cse1 .cse2 (or .cse7 (< ~d0_ev~0 2) .cse8 .cse9 .cse11 .cse12 .cse13 .cse14) .cse3 .cse5 .cse15 .cse16 .cse17 .cse18 (= 1 ~b0_ev~0) .cse20 .cse21) (or (or .cse2 .cse3 .cse5 (or .cse7 .cse8 (< ~b0_ev~0 2) .cse10 .cse11 .cse12 .cse13 .cse14) .cse15 .cse16 .cse17 .cse18 .cse21 .cse23) .cse20 .cse1))) (or .cse6 .cse18 .cse8 (not (= 0 ~comp_m1_st~0)) .cse22 (< |old(~d1_ev~0)| 2) .cse23 .cse24 (< 0 |old(~d1_val~0)|) (= ~b1_req_up~0 1) .cse0 .cse1 (< 0 ~z_req_up~0) .cse3 .cse4 .cse5 .cse15 .cse7 .cse16 .cse17 .cse20 .cse21 .cse11))) [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L421 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-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L421 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (let ((.cse26 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse27 (= ~d0_req_up~0 1))) (let ((.cse10 (= 0 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse1 (= ~b1_ev~0 0)) (.cse14 (< ~comp_m1_st~0 2)) (.cse5 (< 0 |old(~d0_ev~0)|)) (.cse6 (= 0 |old(~d0_ev~0)|)) (.cse23 (= 1 ~d1_ev~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse24 (and (= ~d0_val~0 ~d0_val_t~0) .cse26 .cse27)) (.cse0 (not (= |old(~d0_req_up~0)| 1))) (.cse25 (< |old(~d0_ev~0)| 2)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse7 (not (= ~z_val~0 ~z_val_t~0))) (.cse8 (= ~b1_req_up~0 1)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse12 (< ~b0_val~0 ~b0_val_t~0)) (.cse13 (< 0 ~b0_ev~0)) (.cse15 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse18 (= ~b1_ev~0 1)) (.cse19 (< 0 ~z_val~0)) (.cse22 (< ~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 .cse0 .cse8 .cse10 .cse11 .cse12 .cse1 .cse14 .cse15 .cse18 .cse17 .cse25 .cse2 .cse3 (= 1 ~b0_ev~0) .cse21 .cse23) (or .cse21 (or .cse0 .cse8 (< ~b0_ev~0 2) .cse12 .cse1 .cse14 .cse15 .cse18 .cse17 .cse2 .cse3 .cse5 .cse6 .cse23) .cse11)) .cse16 (not (= ~z_val~0 0)) .cse20 .cse9 .cse4 .cse7 .cse24) (or (and (= 0 ~d0_val~0) .cse26 .cse27) .cse0 .cse25 .cse2 .cse3 (not (= 0 ~comp_m1_st~0)) .cse4 (< ~d1_ev~0 2) .cse7 (< 0 ~d1_val~0) .cse8 .cse9 .cse11 (< 0 ~z_req_up~0) .cse12 .cse13 .cse15 (not (= |old(~d0_val~0)| 0)) .cse16 .cse17 .cse18 .cse19 .cse22 (not (= 1 ~d1_req_up~0)))))) [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-11-10 03:49:22,113 INFO L425 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-11-10 03:49:22,114 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse31 (= ~z_val~0 ~z_val_t~0)) (.cse32 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse33 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse8 (< ~d1_ev~0 2)) (.cse28 (and .cse31 .cse32 .cse33)) (.cse30 (< |old(~comp_m1_st~0)| 2)) (.cse20 (and .cse32 .cse33)) (.cse12 (< ~d1_val~0 ~d1_val_t~0)) (.cse13 (< ~b1_val~0 ~b1_val_t~0)) (.cse15 (< ~b1_val_t~0 1)) (.cse1 (= 0 ~b0_ev~0)) (.cse24 (< ~d0_ev~0 2)) (.cse18 (< 0 ~b0_ev~0)) (.cse0 (= ~b1_req_up~0 1)) (.cse21 (< ~b0_ev~0 2)) (.cse27 (< 0 |old(~z_req_up~0)|)) (.cse17 (< ~b0_val~0 ~b0_val_t~0)) (.cse25 (< 1 ~d1_ev~0)) (.cse2 (= ~b1_ev~0 0)) (.cse19 (< ~b0_val_t~0 1)) (.cse11 (< ~d1_val_t~0 1)) (.cse3 (= ~b1_ev~0 1)) (.cse4 (< ~z_ev~0 2)) (.cse22 (< 0 ~z_val~0)) (.cse5 (= ~b0_req_up~0 1)) (.cse6 (< 0 ~comp_m1_i~0)) (.cse23 (< ~z_val~0 0)) (.cse7 (not (= 0 |old(~comp_m1_st~0)|))) (.cse9 (< 0 ~d0_ev~0)) (.cse10 (= 0 ~d0_ev~0)) (.cse29 (= 1 ~d1_ev~0)) (.cse14 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse16 (< ~d0_val_t~0 1)) (.cse26 (not (= ~z_val~0 |old(~z_val_t~0)|)))) (and (or (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 (not (= ~z_val~0 0)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse20) (or .cse20 (or (and (or (or (or .cse0 .cse21 .cse2 .cse11 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse7 .cse8 .cse9 .cse10) .cse17 .cse19) .cse14 .cse16) (or .cse14 .cse16 (or (or .cse0 .cse21 .cse2 .cse11 .cse3 .cse4 .cse22 .cse24 .cse5 .cse6 .cse23 .cse7 .cse8) .cse17 .cse19)) (or (or .cse0 .cse1 .cse2 .cse11 .cse3 .cse4 .cse22 .cse24 .cse5 .cse6 .cse23 .cse7 .cse8) .cse14 .cse16 .cse17 .cse18 .cse19)) .cse12 .cse13 .cse15)) (or .cse25 .cse5 .cse6 .cse7 .cse15 .cse9 .cse10 (< ~b1_ev~0 2) .cse26 .cse0 .cse13 .cse1 .cse16 .cse27 .cse17 .cse18 .cse28 .cse19 .cse11 .cse4 .cse22 .cse12 .cse14 .cse23 .cse29) (or .cse2 .cse5 .cse6 .cse15 .cse9 .cse10 .cse26 .cse0 .cse13 .cse1 .cse16 .cse17 .cse18 .cse30 .cse19 .cse11 .cse4 .cse3 .cse22 .cse12 .cse14 .cse23 .cse28 .cse29) (or .cse12 .cse13 .cse15 .cse26 (and (or .cse14 .cse16 (or .cse0 .cse21 .cse17 .cse2 .cse30 .cse19 .cse11 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse9 .cse10 .cse29)) (or .cse0 .cse1 .cse16 .cse17 .cse2 .cse30 .cse19 .cse11 .cse3 .cse4 .cse22 .cse24 .cse5 .cse6 (= 1 ~b0_ev~0) .cse14 .cse23 .cse29)) (and .cse20 .cse31)) (or (and .cse31 .cse20) .cse12 .cse13 .cse15 (and (or (or .cse17 (or .cse0 .cse21 .cse25 .cse2 .cse11 .cse3 .cse4 .cse22 .cse24 .cse5 .cse6 .cse23 .cse7 .cse29) .cse19) .cse14 .cse16) (or .cse14 (or .cse0 .cse1 .cse25 .cse2 .cse11 .cse3 .cse4 .cse22 .cse24 .cse5 .cse6 .cse23 .cse7 .cse29) .cse16 .cse17 .cse18 .cse19) (or (or .cse0 .cse21 .cse27 .cse17 .cse25 .cse2 .cse19 .cse11 .cse3 .cse4 .cse22 .cse5 .cse6 .cse23 .cse7 .cse9 .cse10 .cse29) .cse14 .cse16)) .cse26)))) [2018-11-10 03:49:22,114 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-11-10 03:49:22,114 INFO L421 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse34 (<= 2 ~comp_m1_st~0)) (.cse24 (= ~z_val~0 ~z_val_t~0)) (.cse35 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse36 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse16 (and .cse24 .cse35 .cse36)) (.cse28 (= 1 ~b0_ev~0)) (.cse31 (and .cse34 .cse24)) (.cse33 (< ~d1_ev~0 2)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse25 (and .cse35 .cse36)) (.cse9 (= 0 ~b0_ev~0)) (.cse27 (< ~d0_ev~0 2)) (.cse12 (< 0 ~b0_ev~0)) (.cse7 (= ~b1_req_up~0 1)) (.cse26 (< ~b0_ev~0 2)) (.cse32 (< 0 |old(~z_req_up~0)|)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse29 (< 1 ~d1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse22 (< ~z_val~0 0)) (.cse30 (not (= 0 |old(~comp_m1_st~0)|))) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse23 (= 1 ~d1_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse10 (< ~d0_val_t~0 1)) (.cse6 (not (= ~z_val~0 |old(~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 .cse23) (or (and .cse24 .cse25) .cse20 .cse8 .cse3 .cse6 (and (or .cse21 .cse10 (or .cse7 .cse26 .cse11 .cse0 .cse13 .cse14 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse4 .cse5 .cse23)) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse28 .cse21 .cse22 .cse23))) (or .cse29 .cse1 .cse2 .cse30 .cse3 .cse16 .cse4 .cse5 (< ~b1_ev~0 2) .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse32 .cse11 .cse14 .cse15 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse31 .cse25 (or (or .cse7 .cse9 .cse0 .cse18 .cse17 .cse1 .cse2 .cse30 .cse33 .cse4 .cse5) .cse15 (not (= ~z_val~0 0)) .cse20 .cse8 .cse21 .cse3 .cse10 .cse11 .cse12 .cse14)) (or .cse25 .cse31 (or (and (or (or (or .cse7 .cse26 .cse0 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse30 .cse33 .cse4 .cse5) .cse11 .cse14) .cse21 .cse10) (or .cse21 .cse10 (or (or .cse7 .cse26 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse33) .cse11 .cse14)) (or (or .cse7 .cse9 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse33) .cse21 .cse10 .cse11 .cse12 .cse14)) .cse20 .cse8 .cse3)) (or .cse20 .cse8 .cse3 (and .cse25 .cse24) (and (or (or .cse11 (or .cse7 .cse26 .cse29 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse23) .cse14) .cse21 .cse10) (or .cse21 (or .cse7 .cse9 .cse29 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse23) .cse10 .cse11 .cse12 .cse14) (or (or .cse7 .cse26 .cse32 .cse11 .cse29 .cse0 .cse14 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse30 .cse4 .cse5 .cse23) .cse21 .cse10)) (and .cse24 .cse34) .cse6)))) [2018-11-10 03:49:22,115 INFO L425 ceAbstractionStarter]: For program point L275-1(lines 275 300) no Hoare annotation was computed. [2018-11-10 03:49:22,115 INFO L421 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse32 (not (= 0 ~comp_m1_st~0))) (.cse33 (<= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse34 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse12 (< |old(~comp_m1_st~0)| 2)) (.cse25 (< ~d1_ev~0 2)) (.cse27 (and .cse32 .cse33 .cse34)) (.cse23 (< ~d0_ev~0 2)) (.cse26 (< 0 ~b0_ev~0)) (.cse28 (< ~b0_ev~0 2)) (.cse0 (= ~b1_ev~0 0)) (.cse16 (= ~b1_ev~0 1)) (.cse29 (= ~z_val~0 ~z_val_t~0)) (.cse30 (< 1 ~d1_ev~0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse24 (not (= 0 |old(~comp_m1_st~0)|))) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse6 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse7 (= ~b1_req_up~0 1)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse9 (= 0 ~b0_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse31 (< 0 |old(~z_req_up~0)|)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse15 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse18 (< ~d1_val~0 ~d1_val_t~0)) (.cse19 (= 1 ~b0_ev~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (< ~z_val~0 0)) (.cse22 (= 1 ~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) (or .cse18 .cse8 .cse3 .cse6 (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse23 .cse1 .cse2 .cse19 .cse20 .cse21 .cse22)) (or (or (or .cse7 .cse9 .cse0 .cse16 .cse15 .cse1 .cse2 .cse24 .cse25 .cse4 .cse5) .cse14 (not (= ~z_val~0 0)) .cse18 .cse8 .cse20 .cse3 .cse10 .cse11 .cse26 .cse13) .cse27) (or .cse27 (or (and (or (or (or .cse7 .cse28 .cse0 .cse14 .cse16 .cse15 .cse17 .cse1 .cse2 .cse21 .cse24 .cse25 .cse4 .cse5) .cse11 .cse13) .cse20 .cse10) (or .cse20 .cse10 (or (or .cse7 .cse28 .cse0 .cse14 .cse16 .cse15 .cse17 .cse23 .cse1 .cse2 .cse21 .cse24 .cse25) .cse11 .cse13)) (or (or .cse7 .cse9 .cse0 .cse14 .cse16 .cse15 .cse17 .cse23 .cse1 .cse2 .cse21 .cse24 .cse25) .cse20 .cse10 .cse11 .cse26 .cse13)) .cse18 .cse8 .cse3)) (or (and .cse29 .cse27) .cse18 .cse8 .cse3 (and (or (or .cse11 (or .cse7 .cse28 .cse30 .cse0 .cse14 .cse16 .cse15 .cse17 .cse23 .cse1 .cse2 .cse21 .cse24 .cse22) .cse13) .cse20 .cse10) (or .cse20 (or .cse7 .cse9 .cse30 .cse0 .cse14 .cse16 .cse15 .cse17 .cse23 .cse1 .cse2 .cse21 .cse24 .cse22) .cse10 .cse11 .cse26 .cse13) (or (or .cse7 .cse28 .cse31 .cse11 .cse30 .cse0 .cse13 .cse14 .cse16 .cse15 .cse17 .cse1 .cse2 .cse21 .cse24 .cse4 .cse5 .cse22) .cse20 .cse10)) .cse6) (or (and .cse32 .cse29 .cse33 .cse34) .cse30 .cse1 .cse2 .cse24 .cse3 .cse4 .cse5 (< ~b1_ev~0 2) .cse6 .cse7 .cse8 .cse9 .cse10 .cse31 .cse11 .cse13 .cse14 .cse15 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22)))) [2018-11-10 03:49:22,115 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-11-10 03:49:22,115 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-11-10 03:49:22,115 INFO L425 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-11-10 03:49:22,115 INFO L425 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-11-10 03:49:22,116 INFO L421 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse34 (<= 2 ~comp_m1_st~0)) (.cse24 (= ~z_val~0 ~z_val_t~0)) (.cse35 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse36 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse16 (and .cse24 .cse35 .cse36)) (.cse28 (= 1 ~b0_ev~0)) (.cse31 (and .cse34 .cse24)) (.cse33 (< ~d1_ev~0 2)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse25 (and .cse35 .cse36)) (.cse9 (= 0 ~b0_ev~0)) (.cse27 (< ~d0_ev~0 2)) (.cse12 (< 0 ~b0_ev~0)) (.cse7 (= ~b1_req_up~0 1)) (.cse26 (< ~b0_ev~0 2)) (.cse32 (< 0 |old(~z_req_up~0)|)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse29 (< 1 ~d1_ev~0)) (.cse0 (= ~b1_ev~0 0)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse22 (< ~z_val~0 0)) (.cse30 (not (= 0 |old(~comp_m1_st~0)|))) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse23 (= 1 ~d1_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse10 (< ~d0_val_t~0 1)) (.cse6 (not (= ~z_val~0 |old(~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 .cse23) (or (and .cse24 .cse25) .cse20 .cse8 .cse3 .cse6 (and (or .cse21 .cse10 (or .cse7 .cse26 .cse11 .cse0 .cse13 .cse14 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse4 .cse5 .cse23)) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse28 .cse21 .cse22 .cse23))) (or .cse29 .cse1 .cse2 .cse30 .cse3 .cse16 .cse4 .cse5 (< ~b1_ev~0 2) .cse6 .cse7 .cse8 .cse31 .cse9 .cse10 .cse32 .cse11 .cse14 .cse15 .cse17 .cse19 .cse20 .cse28 .cse21 .cse22 .cse23) (or .cse31 .cse25 (or (or .cse7 .cse9 .cse0 .cse18 .cse17 .cse1 .cse2 .cse30 .cse33 .cse4 .cse5) .cse15 (not (= ~z_val~0 0)) .cse20 .cse8 .cse21 .cse3 .cse10 .cse11 .cse12 .cse14)) (or .cse25 .cse31 (or (and (or (or (or .cse7 .cse26 .cse0 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse30 .cse33 .cse4 .cse5) .cse11 .cse14) .cse21 .cse10) (or .cse21 .cse10 (or (or .cse7 .cse26 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse33) .cse11 .cse14)) (or (or .cse7 .cse9 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse33) .cse21 .cse10 .cse11 .cse12 .cse14)) .cse20 .cse8 .cse3)) (or .cse20 .cse8 .cse3 (and .cse25 .cse24) (and (or (or .cse11 (or .cse7 .cse26 .cse29 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse23) .cse14) .cse21 .cse10) (or .cse21 (or .cse7 .cse9 .cse29 .cse0 .cse15 .cse18 .cse17 .cse19 .cse27 .cse1 .cse2 .cse22 .cse30 .cse23) .cse10 .cse11 .cse12 .cse14) (or (or .cse7 .cse26 .cse32 .cse11 .cse29 .cse0 .cse14 .cse15 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse30 .cse4 .cse5 .cse23) .cse21 .cse10)) (and .cse24 .cse34) .cse6)))) [2018-11-10 03:49:22,116 INFO L421 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse25 (= ~z_val~0 ~z_val_t~0))) (let ((.cse22 (< |old(~comp_m1_st~0)| 2)) (.cse26 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse27 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse31 (< 0 |old(~z_req_up~0)|)) (.cse28 (= 1 ~d1_ev~0)) (.cse21 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse0 (and (<= 2 ~comp_m1_st~0) .cse25)) (.cse10 (< 0 ~d0_ev~0)) (.cse11 (= 0 ~d0_ev~0)) (.cse29 (< ~b0_ev~0 2)) (.cse1 (= ~b1_req_up~0 1)) (.cse2 (= 0 ~b0_ev~0)) (.cse3 (= ~b1_ev~0 0)) (.cse12 (< ~d1_val_t~0 1)) (.cse4 (= ~b1_ev~0 1)) (.cse5 (< ~z_ev~0 2)) (.cse23 (< 0 ~z_val~0)) (.cse30 (< ~d0_ev~0 2)) (.cse6 (= ~b0_req_up~0 1)) (.cse7 (< 0 ~comp_m1_i~0)) (.cse24 (< ~z_val~0 0)) (.cse8 (not (= 0 |old(~comp_m1_st~0)|))) (.cse9 (< ~d1_ev~0 2)) (.cse15 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse17 (< ~d0_val_t~0 1)) (.cse18 (< ~b0_val~0 ~b0_val_t~0)) (.cse19 (< 0 ~b0_ev~0)) (.cse20 (< ~b0_val_t~0 1)) (.cse13 (< ~d1_val~0 ~d1_val_t~0)) (.cse14 (< ~b1_val~0 ~b1_val_t~0)) (.cse16 (< ~b1_val_t~0 1))) (and (or .cse0 (or (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 (not (= ~z_val~0 0)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse3 .cse6 .cse7 .cse16 .cse10 .cse11 .cse21 .cse1 .cse14 .cse2 .cse17 .cse18 .cse19 .cse22 .cse20 .cse12 .cse5 .cse4 .cse23 .cse13 .cse15 .cse24 (and .cse25 .cse26 .cse27) .cse28) (or .cse13 .cse14 .cse16 .cse21 (and (or .cse15 .cse17 (or .cse1 .cse29 .cse18 .cse3 .cse22 .cse20 .cse12 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse10 .cse11 .cse28)) (or .cse1 .cse2 .cse17 .cse18 .cse3 .cse22 .cse20 .cse12 .cse4 .cse5 .cse23 .cse30 .cse6 .cse7 (= 1 ~b0_ev~0) .cse15 .cse24 .cse28)) (and (and .cse26 .cse27) .cse25)) (or .cse6 .cse7 .cse8 .cse16 .cse10 .cse11 (< ~b1_ev~0 2) .cse21 .cse1 .cse14 .cse2 .cse17 .cse31 .cse18 .cse19 .cse20 .cse12 .cse5 .cse23 .cse13 .cse15 .cse24 .cse0 .cse28) (or .cse13 .cse14 .cse16 (and (or (or .cse18 (or .cse1 .cse29 .cse3 .cse12 .cse4 .cse5 .cse23 .cse30 .cse6 .cse7 .cse24 .cse8 .cse28) .cse20) .cse15 .cse17) (or .cse15 (or .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse23 .cse30 .cse6 .cse7 .cse24 .cse8 .cse28) .cse17 .cse18 .cse19 .cse20) (or (or .cse1 .cse29 .cse31 .cse18 .cse3 .cse20 .cse12 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse10 .cse11 .cse28) .cse15 .cse17)) .cse21 .cse0) (or .cse0 (or (and (or (or (or .cse1 .cse29 .cse3 .cse12 .cse4 .cse5 .cse23 .cse6 .cse7 .cse24 .cse8 .cse9 .cse10 .cse11) .cse18 .cse20) .cse15 .cse17) (or .cse15 .cse17 (or (or .cse1 .cse29 .cse3 .cse12 .cse4 .cse5 .cse23 .cse30 .cse6 .cse7 .cse24 .cse8 .cse9) .cse18 .cse20)) (or (or .cse1 .cse2 .cse3 .cse12 .cse4 .cse5 .cse23 .cse30 .cse6 .cse7 .cse24 .cse8 .cse9) .cse15 .cse17 .cse18 .cse19 .cse20)) .cse13 .cse14 .cse16))))) [2018-11-10 03:49:22,116 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-11-10 03:49:22,116 INFO L428 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L421 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (let ((.cse9 (= ~b1_ev~0 0)) (.cse16 (= ~b0_req_up~0 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (= 0 stop_simulation_~tmp~2)) (.cse5 (= ~b1_req_up~0 1)) (.cse2 (< ~b1_val~0 ~b1_val_t~0)) (.cse6 (= 0 ~b0_ev~0)) (.cse7 (< ~d0_val_t~0 1)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse10 (< ~comp_m1_st~0 2)) (.cse11 (< ~b0_val_t~0 1)) (.cse12 (< ~d1_val_t~0 1)) (.cse14 (< ~z_ev~0 2)) (.cse13 (= ~b1_ev~0 1)) (.cse15 (< 0 ~z_val~0)) (.cse1 (< ~d1_val~0 ~d1_val_t~0)) (.cse18 (= 1 ~b0_ev~0)) (.cse19 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (< ~z_val~0 0)) (.cse21 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (or .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (< ~d0_ev~0 2) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse9 .cse16 .cse17 .cse3 (< 0 ~d0_ev~0) (= 0 ~d0_ev~0) .cse4 .cse0 .cse5 .cse2 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse1 .cse18 .cse19 .cse20 .cse21))) [2018-11-10 03:49:22,117 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L421 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) (not (= ~z_val~0 ~z_val_t~0)) (and (= 1 ~b1_req_up~0) (= |old(~b1_ev~0)| ~b1_ev~0)) (< 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) (< ~b0_val_t~0 1) (not (= ~d0_val~0 0)) (< ~d1_val_t~0 1) (< ~z_ev~0 2) (< 0 ~z_val~0) (< |old(~b1_req_up~0)| ~d1_req_up~0) (< ~z_val~0 0) (not (= 1 ~d1_req_up~0))) [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-11-10 03:49:22,117 INFO L421 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) (and (<= ~b0_val~0 0) (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (<= 0 ~b0_val~0)) (< ~d1_req_up~0 ~b1_req_up~0) (< ~b1_ev~0 2) (not (= ~z_val~0 ~z_val_t~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) (<= (+ ~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-11-10 03:49:22,117 INFO L425 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L421 ceAbstractionStarter]: At program point L119(lines 96 121) the Hoare annotation is: (let ((.cse26 (= 1 ~b0_ev~0)) (.cse27 (= 1 ~d1_ev~0))) (let ((.cse28 (not .cse27)) (.cse31 (not (= 1 ~d0_ev~0))) (.cse19 (not .cse26)) (.cse10 (= ~b1_ev~0 0)) (.cse30 (< ~d0_ev~0 2)) (.cse23 (= 0 is_method1_triggered_~__retres1~0)) (.cse9 (< 1 ~d1_ev~0)) (.cse16 (= ~b0_req_up~0 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse20 (< 0 ~d0_ev~0)) (.cse21 (= 0 ~d0_ev~0)) (.cse22 (not (= ~z_val~0 ~z_val_t~0))) (.cse6 (= ~b1_req_up~0 1)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse24 (= 0 ~b0_ev~0)) (.cse4 (< ~d0_val_t~0 1)) (.cse7 (< 0 ~z_req_up~0)) (.cse8 (< ~b0_val~0 ~b0_val_t~0)) (.cse29 (< 0 ~b0_ev~0)) (.cse11 (< ~comp_m1_st~0 2)) (.cse12 (< ~b0_val_t~0 1)) (.cse5 (= 1 is_method1_triggered_~__retres1~0)) (.cse13 (< ~d1_val_t~0 1)) (.cse14 (< ~z_ev~0 2)) (.cse15 (< 0 ~z_val~0)) (.cse25 (= ~b1_ev~0 1)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse2 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse18 (< ~z_val~0 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse22) (or .cse10 .cse23 .cse16 .cse17 .cse3 .cse20 .cse21 .cse22 .cse6 .cse1 .cse24 .cse4 .cse8 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse0 .cse26 .cse2 .cse18 .cse27) (or (or .cse10 .cse16 .cse17 .cse3 .cse20 .cse21 .cse28 .cse6 .cse1 .cse24 .cse4 .cse8 .cse29 .cse11 .cse12 .cse13 .cse14 .cse25 .cse15 .cse0 .cse2 .cse18) .cse5) (or (or .cse0 .cse1 .cse3 (and (or (or (or .cse6 (< ~b0_ev~0 2) .cse10 .cse11 .cse13 .cse25 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse28) .cse8 .cse12) .cse2 .cse4) (or .cse6 .cse24 .cse4 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse30 .cse16 .cse17 .cse26 .cse2 .cse18 .cse28))) .cse5) (or .cse0 .cse1 (or .cse6 .cse24 .cse4 .cse7 .cse8 .cse29 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse2 .cse18) .cse3 .cse22 .cse5) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse22 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse31 .cse18 .cse19)) (or .cse0 .cse1 .cse3 .cse22 (or .cse6 .cse24 .cse4 .cse8 .cse10 .cse11 .cse12 .cse13 .cse25 .cse14 .cse15 .cse30 .cse16 .cse17 .cse26 .cse2 .cse18 .cse27) .cse23) (or .cse9 .cse16 .cse17 .cse3 .cse20 .cse21 .cse22 .cse6 .cse1 .cse24 .cse4 .cse7 .cse8 .cse29 .cse11 .cse12 .cse5 .cse13 .cse14 .cse15 (not .cse25) .cse0 .cse2 .cse18)))) [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L428 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-11-10 03:49:22,118 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-11-10 03:49:22,119 INFO L421 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse31 (< |old(~d0_ev~0)| 2)) (.cse15 (= 0 ~z_val~0)) (.cse24 (= |old(~b1_ev~0)| 0)) (.cse32 (= |old(~b0_req_up~0)| 1)) (.cse33 (< 0 ~comp_m1_i~0)) (.cse18 (< ~b1_val_t~0 1)) (.cse40 (= ~d0_val~0 ~d0_val_t~0)) (.cse0 (<= ~b0_val_t~0 ~b0_val~0)) (.cse10 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse1 (= |old(~d1_val~0)| ~d1_val~0)) (.cse2 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse3 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse4 (= |old(~d0_req_up~0)| 1)) (.cse5 (= ~d1_req_up~0 1)) (.cse6 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse8 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse9 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse11 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse12 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse7 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse19 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse20 (= |old(~b1_req_up~0)| 1)) (.cse17 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse21 (= 0 |old(~b0_ev~0)|)) (.cse22 (< ~d0_val_t~0 1)) (.cse23 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse25 (< ~comp_m1_st~0 2)) (.cse26 (< ~b0_val_t~0 1)) (.cse27 (< ~d1_val_t~0 1)) (.cse29 (< |old(~z_ev~0)| 2)) (.cse28 (= |old(~b1_ev~0)| 1)) (.cse30 (< 0 |old(~z_val~0)|)) (.cse16 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse34 (= 1 |old(~b0_ev~0)|)) (.cse35 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse36 (< |old(~z_val~0)| 0)) (.cse37 (= 1 |old(~d1_ev~0)|))) (and (or (and (and (= ~d0_val_t~0 ~d0_val~0) (and .cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8 .cse9)) .cse11 .cse12 .cse13)) .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 (or .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)) (let ((.cse38 (not (= 1 ~b1_req_up~0))) (.cse39 (not (= ~b0_req_up~0 1))) (.cse41 (<= ~d0_ev~0 0)) (.cse42 (<= ~b0_ev~0 0))) (or (not .cse4) .cse31 .cse33 (not (= 0 ~comp_m1_st~0)) .cse18 (< 0 |old(~b0_val~0)|) (and .cse38 .cse39 .cse0 .cse1 .cse40 .cse15 .cse2 .cse41 .cse42 .cse7 .cse14 .cse8 .cse13 .cse9) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) .cse19 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) .cse22 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse26 (not (= |old(~d0_val~0)| 0)) .cse27 .cse29 .cse30 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse36 (and .cse38 .cse39 .cse0 (not (= ~b1_ev~0 1)) .cse1 .cse40 .cse15 .cse2 .cse41 .cse42 .cse7 .cse14 (<= ~b1_ev~0 1) .cse13 .cse9) (not (= 1 |old(~d1_req_up~0)|)))) (or .cse24 .cse32 .cse33 .cse18 (< 0 |old(~d0_ev~0)|) (and .cse40 .cse0 (or (and .cse10 .cse1 .cse2 .cse3 .cse5 .cse6 .cse8 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9)) .cse11 .cse12 (= ~z_val~0 ~z_val_t~0) .cse7 .cse14 .cse13) (= 0 |old(~d0_ev~0)|) .cse19 .cse20 .cse17 .cse21 .cse22 .cse23 .cse25 .cse26 .cse27 .cse29 .cse28 .cse30 .cse16 .cse34 .cse35 .cse36 .cse37))) [2018-11-10 03:49:22,119 INFO L425 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-11-10 03:49:22,119 INFO L421 ceAbstractionStarter]: At program point L211(line 211) the Hoare annotation is: (let ((.cse16 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse6 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse5 (= |old(~b1_req_up~0)| 1)) (.cse7 (= 0 |old(~b0_ev~0)|)) (.cse8 (< ~d0_val_t~0 1)) (.cse9 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse10 (< ~comp_m1_st~0 2)) (.cse11 (< ~b0_val_t~0 1)) (.cse12 (< ~d1_val_t~0 1)) (.cse14 (= |old(~b1_ev~0)| 1)) (.cse13 (< |old(~z_ev~0)| 2)) (.cse15 (< 0 |old(~z_val~0)|)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse17 (= 1 |old(~b0_ev~0)|)) (.cse18 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse19 (< |old(~z_val~0)| 0)) (.cse20 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (< 0 |old(~d0_ev~0)|) (= 0 |old(~d0_ev~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or (not (= |old(~d0_req_up~0)| 1)) (and (not (= ~b0_req_up~0 1)) (<= ~b0_val_t~0 ~b0_val~0) (= 1 ~b1_req_up~0) (= 0 ~d0_val~0) (= |old(~d1_val~0)| ~d1_val~0) (= 0 ~z_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)) .cse21 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 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) .cse4 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) .cse8 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse11 (not (= |old(~d0_val~0)| 0)) .cse12 .cse13 .cse15 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse19 (not (= 1 |old(~d1_req_up~0)|))) (or .cse16 .cse6 .cse3 .cse4 (or .cse5 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse21 .cse1 .cse2 .cse17 .cse18 .cse19 .cse20)))) [2018-11-10 03:49:22,119 INFO L425 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-11-10 03:49:22,120 INFO L421 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse32 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse56 (not (= ~d1_ev~0 1))) (.cse57 (<= ~d1_ev~0 1)) (.cse58 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse31 (= |old(~d0_req_up~0)| 1)) (.cse41 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse62 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse63 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse78 (< 1 |old(~b1_ev~0)|)) (.cse83 (not (= ~b1_ev~0 0))) (.cse53 (< |old(~b0_ev~0)| 2)) (.cse64 (<= ~b1_ev~0 1)) (.cse30 (= ~d0_ev~0 |old(~d0_ev~0)|)) (.cse70 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse44 (= ~d0_val_t~0 ~d0_val~0)) (.cse27 (= ~z_val~0 |old(~z_val~0)|)) (.cse72 (or (and .cse32 .cse56 .cse57 .cse58 .cse41 .cse62 .cse63) (and .cse56 .cse57 .cse58 .cse31 .cse41 .cse62 .cse63))) (.cse73 (< |old(~d1_ev~0)| 2)) (.cse54 (< 1 |old(~d1_ev~0)|)) (.cse4 (< 0 |old(~d0_ev~0)|)) (.cse5 (= 0 |old(~d0_ev~0)|)) (.cse74 (< |old(~b1_ev~0)| 2)) (.cse50 (not (= |old(~b0_req_up~0)| |old(~d1_req_up~0)|))) (.cse52 (= 0 ~z_val~0)) (.cse51 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))) (.cse79 (< 0 |old(~b0_ev~0)|)) (.cse25 (= ~d0_val~0 ~d0_val_t~0)) (.cse26 (<= ~b0_val_t~0 ~b0_val~0)) (.cse28 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse33 (= ~d1_val_t~0 |old(~d1_val~0)|)) (.cse35 (<= ~d1_val~0 |old(~d1_val~0)|)) (.cse36 (= |old(~d1_val~0)| ~d1_val~0)) (.cse39 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse37 (not (= 1 |old(~d1_req_up~0)|))) (.cse38 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse71 (= ~z_val~0 ~z_val_t~0)) (.cse24 (<= ~b1_val_t~0 ~b1_val~0)) (.cse49 (<= ~d1_val_t~0 ~d1_val~0)) (.cse40 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse80 (<= 2 ~comp_m1_st~0)) (.cse59 (<= 2 ~b1_ev~0)) (.cse81 (<= ~comp_m1_i~0 0)) (.cse60 (<= |old(~d1_ev~0)| ~d1_ev~0)) (.cse82 (not (= ~d0_ev~0 0))) (.cse61 (<= ~d0_ev~0 1)) (.cse66 (not (= ~b0_ev~0 0))) (.cse84 (not (= ~d0_ev~0 1))) (.cse85 (<= 2 ~z_ev~0)) (.cse19 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse8 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse7 (= |old(~b1_req_up~0)| 1)) (.cse9 (= 0 |old(~b0_ev~0)|)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< 0 |old(~z_req_up~0)|)) (.cse12 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse0 (= |old(~b1_ev~0)| 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)|)) (.cse55 (< |old(~d0_ev~0)| 2)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse20 (= 1 |old(~b0_ev~0)|)) (.cse21 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse22 (< |old(~z_val~0)| 0)) (.cse23 (= 1 |old(~d1_ev~0)|)) (.cse6 (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 .cse23) (let ((.cse65 (<= 2 ~d0_ev~0))) (let ((.cse43 (and .cse56 .cse57 .cse65 .cse60 .cse66 .cse62 .cse64 .cse63)) (.cse34 (and .cse56 .cse57 .cse65 .cse59 .cse60 .cse41 .cse62 .cse63)) (.cse48 (and .cse56 .cse57 .cse58 .cse60 .cse41 .cse61 .cse62 .cse64 .cse63)) (.cse46 (and .cse56 .cse57 .cse58 .cse59 .cse60 .cse41 .cse61 .cse62 .cse63))) (or (and .cse24 (or (and .cse25 .cse26 .cse27 .cse28 (and (and (let ((.cse29 (or (and .cse33 .cse34 .cse35) (and .cse36 (and .cse34 .cse37))))) (or (and .cse29 .cse30 .cse31) (and .cse32 .cse29 .cse30))) .cse38) .cse39) .cse40) (and .cse25 .cse26 .cse27 .cse28 .cse41 (and (and .cse38 (let ((.cse42 (or (and .cse33 .cse43 .cse35) (and .cse36 (and .cse43 .cse37))))) (or (and .cse32 .cse42 .cse30) (and .cse42 .cse30 .cse31)))) .cse39) .cse40) (and .cse44 (or (and (and (and .cse38 (let ((.cse45 (or (and .cse33 .cse35 .cse46) (and .cse36 (and .cse37 .cse46))))) (or (and .cse32 .cse45) (and .cse45 .cse31)))) .cse39) .cse26 .cse40 .cse27 .cse28) (and .cse26 (and (and (let ((.cse47 (or (and (and .cse37 .cse48) .cse36) (and .cse33 .cse48 .cse35)))) (or (and .cse32 .cse47) (and .cse47 .cse31))) .cse38) .cse39) .cse40 .cse27 .cse28)))) .cse49) .cse19 .cse8 (and (or (and .cse25 .cse26 .cse50 .cse28 (or (and .cse43 .cse30 .cse31) (and .cse32 .cse43 .cse30)) .cse41 .cse38 .cse51 .cse40) (and .cse25 .cse26 .cse50 .cse28 (or (and .cse34 .cse30 .cse31) (and .cse32 .cse34 .cse30)) .cse38 .cse51 .cse40) (and .cse44 (or (and .cse26 .cse50 .cse28 .cse38 .cse51 (or (and .cse32 .cse48) (and .cse48 .cse31)) .cse40) (and .cse26 .cse50 (or (and .cse32 .cse46) (and .cse46 .cse31)) .cse28 .cse38 .cse51 .cse40)))) .cse24 .cse52 .cse49) .cse3 .cse6 (and (or .cse21 .cse10 (or .cse7 .cse53 .cse12 .cse54 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse22 .cse4 .cse5 .cse23)) (or .cse7 .cse9 .cse10 .cse12 .cse54 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse55 .cse1 .cse2 .cse20 .cse21 .cse22 .cse23))))) (or (and .cse25 .cse26 (let ((.cse67 (let ((.cse68 (let ((.cse69 (and .cse36 .cse70 .cse58 .cse62 .cse63))) (or (and .cse69 .cse31) (and .cse32 .cse69))))) (or (and .cse68 .cse38 .cse51) (and .cse68 .cse38 .cse39))))) (or (and .cse39 .cse67) (and .cse50 .cse67))) .cse28 .cse41 .cse71 .cse24 .cse40) (and .cse26 .cse50 .cse28 .cse38 .cse49 .cse25 .cse52 .cse24 .cse51 .cse72 .cse40) .cse1 .cse2 .cse3 .cse73 .cse4 .cse5 .cse74 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20 .cse21 .cse22) (let ((.cse76 (and .cse56 .cse57 .cse58 .cse81 .cse60 .cse82 .cse61 .cse83 .cse66 .cse84 .cse62 .cse64 .cse85 .cse63))) (let ((.cse77 (and .cse80 .cse76))) (or .cse54 .cse0 (and .cse25 .cse26 .cse28 .cse41 (and (and .cse38 (let ((.cse75 (or (and .cse36 (and .cse76 .cse37)) (and .cse33 .cse35 .cse77)))) (or (and .cse32 .cse75) (and .cse75 .cse31)))) .cse39) .cse71 .cse24 .cse49 .cse40) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse78 .cse7 .cse8 .cse9 .cse10 .cse12 .cse79 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 (and .cse26 .cse50 .cse28 .cse41 .cse38 .cse49 .cse25 .cse52 (or (and .cse32 .cse77) (and .cse77 .cse31)) .cse24 .cse51 .cse40) .cse23))) (or .cse0 .cse1 .cse2 .cse3 .cse73 .cse4 .cse5 (and .cse26 .cse50 .cse28 .cse41 .cse38 (or (and .cse56 .cse57 .cse58 .cse31 .cse62 .cse63) (and .cse32 .cse56 .cse57 .cse58 .cse62 .cse63)) .cse49 .cse25 .cse52 .cse24 .cse51 .cse40) .cse6 .cse78 .cse7 (and .cse25 .cse26 (let ((.cse86 (let ((.cse87 (let ((.cse88 (and .cse36 (<= 2 ~d1_ev~0) .cse70 .cse58 .cse81 .cse82 .cse61 .cse83 .cse84 .cse62 .cse64 .cse63))) (or (and .cse88 .cse31) (and .cse32 .cse88))))) (or (and .cse87 (not (= 1 ~b1_req_up~0)) .cse38 .cse51) (and .cse87 .cse38 .cse39 (not .cse7)))))) (or (and .cse86 .cse39) (and .cse86 .cse50))) .cse28 .cse41 .cse71 .cse24 .cse40) .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or (not .cse31) .cse55 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) .cse73 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) .cse74 .cse6 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse53 .cse10 .cse11 (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse14 (not (= |old(~d0_val~0)| 0)) .cse15 .cse16 .cse18 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse22 .cse37) (or (and (or (and .cse25 .cse26 (let ((.cse89 (let ((.cse90 (let ((.cse91 (and .cse36 .cse70 .cse58 .cse62 .cse64 .cse63))) (or (and .cse32 .cse91) (and .cse31 .cse91))))) (or (and .cse38 .cse39 .cse90) (and .cse38 .cse51 .cse90))))) (or (and .cse89 .cse39) (and .cse89 .cse50))) .cse28 .cse41 .cse40) (and .cse25 .cse26 .cse28 (let ((.cse92 (let ((.cse93 (let ((.cse94 (and .cse36 .cse70 .cse59 .cse41 .cse62 .cse63))) (or (and .cse94 .cse30 .cse31) (and .cse32 .cse94 .cse30))))) (or (and .cse38 .cse51 .cse93) (and .cse38 .cse39 .cse93))))) (or (and .cse50 .cse92) (and .cse39 .cse92))) .cse40)) .cse24 .cse52) .cse19 .cse8 (and .cse24 (and .cse44 (and .cse26 .cse50 .cse27 .cse28 .cse72 .cse38 .cse51 .cse40)) .cse49) .cse3 (or .cse7 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse55 .cse1 .cse2 .cse20 .cse21 .cse22 .cse73) .cse6) (let ((.cse98 (and .cse56 .cse57 .cse58 .cse59 .cse81 .cse60 .cse82 .cse41 .cse61 .cse66 .cse84 .cse62 .cse85 .cse63))) (let ((.cse95 (and .cse80 .cse98))) (or .cse54 .cse1 .cse2 .cse3 .cse4 .cse5 .cse74 .cse6 (and .cse26 .cse50 .cse28 .cse38 .cse49 (or (and .cse95 .cse31) (and .cse32 .cse95)) .cse25 .cse52 .cse24 .cse51 .cse40) .cse7 .cse8 .cse9 .cse10 .cse12 .cse79 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 .cse22 (and .cse25 .cse26 .cse28 (and .cse39 (and (let ((.cse96 (let ((.cse97 (<= 1 ~d1_val_t~0))) (or (and .cse33 .cse35 .cse97 .cse95) (and .cse36 (and .cse80 .cse39 .cse98 .cse37) .cse97))))) (or (and .cse32 .cse96) (and .cse96 .cse31))) .cse38)) .cse71 .cse24 .cse49 .cse40) .cse23))) (or .cse19 .cse8 .cse3 (or .cse7 .cse9 .cse10 .cse11 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse55 .cse1 .cse2 .cse20 .cse21 .cse22 .cse23) .cse6)))) [2018-11-10 03:49:22,130 INFO L425 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-11-10 03:49:22,130 INFO L421 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse18 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse8 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse22 (<= ~b0_val_t~0 ~b0_val~0)) (.cse23 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse24 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse25 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse26 (= |old(~d1_val~0)| ~d1_val~0)) (.cse27 (= ~d0_val~0 ~d0_val_t~0)) (.cse29 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse30 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse31 (= |old(~d0_req_up~0)| 1)) (.cse32 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse34 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse35 (= ~d0_req_up~0 1)) (.cse36 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse37 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse33 (<= ~b1_val_t~0 ~b1_val~0)) (.cse28 (= 0 ~z_val~0)) (.cse43 (< |old(~b0_ev~0)| 2)) (.cse4 (< 0 |old(~d0_ev~0)|)) (.cse5 (= 0 |old(~d0_ev~0)|)) (.cse7 (= |old(~b1_req_up~0)| 1)) (.cse9 (= 0 |old(~b0_ev~0)|)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse12 (< ~comp_m1_st~0 2)) (.cse13 (< ~b0_val_t~0 1)) (.cse14 (< ~d1_val_t~0 1)) (.cse16 (= |old(~b1_ev~0)| 1)) (.cse15 (< |old(~z_ev~0)| 2)) (.cse17 (< 0 |old(~z_val~0)|)) (.cse42 (< |old(~d0_ev~0)| 2)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse19 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (< |old(~z_val~0)| 0)) (.cse21 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (< 0 |old(~b0_ev~0)|) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37)) (let ((.cse38 (not (= 1 ~b1_req_up~0))) (.cse39 (not (= ~b0_req_up~0 1))) (.cse40 (= 0 ~d0_val~0)) (.cse41 (<= ~b0_ev~0 0))) (or (not .cse31) (and .cse38 .cse39 .cse22 .cse40 .cse26 .cse28 .cse29 .cse30 .cse41 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse42 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 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) .cse6 (< 0 |old(~d1_val~0)|) (and .cse38 .cse39 .cse22 (not (= ~b1_ev~0 1)) .cse40 .cse26 .cse28 .cse29 .cse30 .cse41 .cse32 .cse33 (<= ~b1_ev~0 1) .cse35 .cse36 .cse37) (< |old(~b0_val~0)| 0) .cse43 .cse10 (< 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 .cse17 (<= (+ |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 .cse18 .cse8 .cse3 .cse6 (and (and .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37) .cse33 .cse28) (and (or .cse19 .cse10 (or .cse7 .cse43 .cse11 .cse0 .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse1 .cse2 .cse20 .cse4 .cse5 .cse21)) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse12 .cse13 .cse14 .cse16 .cse15 .cse17 .cse42 .cse1 .cse2 (= 1 |old(~b0_ev~0)|) .cse19 .cse20 .cse21))))) [2018-11-10 03:49:22,131 INFO L425 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-11-10 03:49:22,135 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse23 (< |old(~d0_ev~0)| 2)) (.cse7 (< |old(~b0_ev~0)| 2)) (.cse9 (= |old(~b1_ev~0)| 0)) (.cse16 (= |old(~b0_req_up~0)| 1)) (.cse17 (< 0 ~comp_m1_i~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse19 (< 0 |old(~d0_ev~0)|)) (.cse20 (= 0 |old(~d0_ev~0)|)) (.cse3 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse6 (= |old(~b1_req_up~0)| 1)) (.cse1 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse22 (= 0 |old(~b0_ev~0)|)) (.cse5 (< ~d0_val_t~0 1)) (.cse8 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse10 (< ~comp_m1_st~0 2)) (.cse11 (< ~b0_val_t~0 1)) (.cse12 (< ~d1_val_t~0 1)) (.cse14 (< |old(~z_ev~0)| 2)) (.cse13 (= |old(~b1_ev~0)| 1)) (.cse15 (< 0 |old(~z_val~0)|)) (.cse0 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse4 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse18 (< |old(~z_val~0)| 0)) (.cse24 (<= ~b0_val_t~0 ~b0_val~0)) (.cse25 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse26 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse27 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse28 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse29 (= |old(~d1_val~0)| ~d1_val~0)) (.cse30 (= ~d0_val~0 ~d0_val_t~0)) (.cse38 (= 0 ~z_val~0)) (.cse31 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse32 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse33 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse37 (<= ~b1_val_t~0 ~b1_val~0)) (.cse34 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse35 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse36 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse21 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 (and (or .cse4 .cse5 (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21)) (or .cse6 .cse22 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse23 .cse16 .cse17 (= 1 |old(~b0_ev~0)|) .cse4 .cse18 .cse21)) (and (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36) .cse37 .cse38)) (or (not (= |old(~d0_req_up~0)| 1)) .cse23 .cse17 (not (= 0 ~comp_m1_st~0)) .cse2 (< 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) .cse3 (< 0 |old(~d1_val~0)|) (and .cse38 .cse32 (<= ~b0_val~0 0) .cse34 (<= ~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)) .cse35 (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) .cse26 (= 0 ~d0_val~0) .cse29 (<= 0 ~b0_val~0) .cse31 (= ~d0_req_up~0 1) .cse36) (< |old(~b0_val~0)| 0) .cse7 .cse5 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse11 (not (= |old(~d0_val~0)| 0)) .cse12 .cse14 .cse15 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse18 (not (= 1 |old(~d1_req_up~0)|))) (or .cse9 .cse16 .cse17 .cse2 .cse19 .cse20 .cse3 .cse6 .cse1 .cse22 .cse5 .cse8 (< 0 |old(~b0_ev~0)|) .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse0 .cse4 .cse18 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse38 .cse31 .cse32 .cse33 .cse37 .cse34 .cse35 .cse36) .cse21))) [2018-11-10 03:49:22,135 INFO L421 ceAbstractionStarter]: At program point L204(line 204) the Hoare annotation is: (let ((.cse16 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse6 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse5 (= |old(~b1_req_up~0)| 1)) (.cse7 (= 0 |old(~b0_ev~0)|)) (.cse9 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse10 (< ~comp_m1_st~0 2)) (.cse14 (= |old(~b1_ev~0)| 1)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse17 (= 1 |old(~b0_ev~0)|)) (.cse18 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse20 (= 1 |old(~d1_ev~0)|)) (.cse21 (< |old(~d0_ev~0)| 2)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse8 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val_t~0 1)) (.cse12 (< ~d1_val_t~0 1)) (.cse13 (< |old(~z_ev~0)| 2)) (.cse15 (< 0 |old(~z_val~0)|)) (.cse19 (< |old(~z_val~0)| 0))) (and (or .cse0 .cse1 .cse2 .cse3 (< 0 |old(~d0_ev~0)|) (= 0 |old(~d0_ev~0)|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse16 .cse6 .cse3 .cse4 (or .cse5 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse21 .cse1 .cse2 .cse17 .cse18 .cse19 .cse20)) (or (not (= |old(~d0_req_up~0)| 1)) .cse21 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) (< |old(~d1_ev~0)| 2) (and (= 0 ~z_val~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)) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) .cse4 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) .cse8 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse11 (not (= |old(~d0_val~0)| 0)) .cse12 .cse13 .cse15 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse19 (not (= 1 |old(~d1_req_up~0)|))))) [2018-11-10 03:49:22,139 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-11-10 03:49:22,139 INFO L425 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-11-10 03:49:22,139 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse10 (< 0 |old(~b0_ev~0)|)) (.cse17 (< ~d1_val~0 ~d1_val_t~0)) (.cse6 (< ~b1_val~0 ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse4 (not (= ~z_val~0 ~z_val_t~0))) (.cse3 (< 0 |old(~d0_ev~0)|)) (.cse22 (= 0 |old(~d0_ev~0)|)) (.cse5 (= ~b1_req_up~0 1)) (.cse23 (= 0 |old(~b0_ev~0)|)) (.cse8 (< ~d0_val_t~0 1)) (.cse9 (< ~b0_val~0 ~b0_val_t~0)) (.cse21 (= |old(~b1_ev~0)| 0)) (.cse11 (< ~comp_m1_st~0 2)) (.cse12 (< ~b0_val_t~0 1)) (.cse13 (< ~d1_val_t~0 1)) (.cse15 (= |old(~b1_ev~0)| 1)) (.cse14 (< |old(~z_ev~0)| 2)) (.cse16 (< 0 ~z_val~0)) (.cse0 (= ~b0_req_up~0 1)) (.cse1 (< 0 ~comp_m1_i~0)) (.cse18 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse19 (< ~z_val~0 0)) (.cse20 (= 1 |old(~d1_ev~0)|)) (.cse7 (and (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= |old(~d0_ev~0)| ~d0_ev~0) (= |old(~b1_ev~0)| ~b1_ev~0) (<= |old(~z_ev~0)| ~z_ev~0)))) (and (or (< 1 |old(~d1_ev~0)|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (< 0 ~z_req_up~0) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (or .cse21 .cse0 .cse1 .cse2 .cse3 .cse22 .cse4 .cse5 .cse6 .cse23 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse7 .cse20) (or .cse17 .cse6 .cse2 .cse4 (and (or .cse18 .cse8 (or .cse5 (< |old(~b0_ev~0)| 2) .cse9 .cse21 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 .cse0 .cse1 .cse19 .cse3 .cse22 .cse20)) (or .cse5 .cse23 .cse8 .cse9 .cse21 .cse11 .cse12 .cse13 .cse15 .cse14 .cse16 (< |old(~d0_ev~0)| 2) .cse0 .cse1 (= 1 |old(~b0_ev~0)|) .cse18 .cse19 .cse20)) .cse7))) [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-11-10 03:49:22,143 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse18 (not (= ~d0_ev~0 0))) (.cse19 (not (= ~b0_ev~0 0))) (.cse20 (<= 2 ~z_ev~0)) (.cse21 (<= ~comp_m1_i~0 0)) (.cse22 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse10 (<= ~d0_ev~0 0)) (.cse16 (and .cse18 (not (= ~b1_ev~0 0)) .cse19 (<= ~b1_ev~0 1) .cse20 .cse21 .cse22)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~d1_ev~0 1)) (.cse4 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= ~b0_ev~0 0)) (.cse7 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse18 .cse19 .cse20 (<= 2 ~b1_ev~0) .cse21 .cse22)) (.cse13 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse5 (= ~z_val~0 ~z_val_t~0)) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (= 0 ~z_val~0)) (.cse6 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and (let ((.cse14 (= ~b0_ev~0 1)) (.cse15 (<= ~d0_ev~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse16 .cse13))) (= ~d0_val_t~0 ~d0_val~0) .cse5 .cse12 .cse9 .cse6) (< ~b0_val_t~0 1) (< 0 |old(~z_val~0)|) (< |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 .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse16 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (< |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) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~z_val~0)| 0) (and (let ((.cse17 (= 1 ~d0_ev~0))) (or (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse17 .cse11 .cse16 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse17 .cse11 .cse7 .cse13))) .cse5 .cse12 .cse9 .cse6)))) [2018-11-10 03:49:22,146 INFO L421 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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and (= ~z_val~0 ~z_val_t~0) (= 0 ~z_val~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) (= |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)) (< |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)|) (<= (+ |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-11-10 03:49:22,146 INFO L421 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 (= ~z_val~0 ~z_val_t~0)) (.cse6 (<= ~d1_val_t~0 ~d1_val~0)) (.cse7 (= ~d0_val~0 ~d0_val_t~0)) (.cse8 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse9 (= 0 ~z_val~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)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ~b1_ev~0 1)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ~b1_ev~0 1) .cse13 .cse14) (< |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) (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) (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(~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)|) (<= (+ |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-11-10 03:49:22,148 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-11-10 03:49:22,148 INFO L421 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse4 (<= 2 ~d0_ev~0)) (.cse8 (= ~z_val~0 |old(~z_val~0)|)) (.cse7 (= 0 ~comp_m1_st~0)) (.cse6 (<= 2 ~d1_ev~0)) (.cse16 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse17 (not (= ~d1_ev~0 1))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~z_val~0 ~z_val_t~0)) (.cse10 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse2 (= ~d0_val~0 ~d0_val_t~0)) (.cse18 (= 0 ~z_val~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse20 (not (= ~d0_ev~0 0))) (.cse9 (not (= ~b1_ev~0 0))) (.cse11 (not (= ~b0_ev~0 1))) (.cse0 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (<= 2 ~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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (and .cse15 .cse0 (and .cse16 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (and .cse1 .cse3 .cse5 .cse7 .cse10 .cse12 .cse14 .cse2 .cse18 .cse6 .cse19 .cse20 .cse9 .cse0 .cse11 .cse13) (< 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)|) (<= (+ |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)|)) (and .cse16 .cse1 .cse17 .cse3 .cse5 .cse15 .cse10 .cse12 .cse14 .cse2 .cse18 .cse19 .cse20 .cse9 .cse11 .cse0 .cse13))) [2018-11-10 03:49:22,149 INFO L421 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (let ((.cse2 (<= 2 ~comp_m1_st~0)) (.cse3 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~d1_ev~0 1))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse9 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse5 (= ~d0_val~0 ~d0_val_t~0)) (.cse8 (not (= ~b1_ev~0 0))) (.cse10 (not (= ~b0_ev~0 1))) (.cse1 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= 2 ~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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~d0_ev~0) .cse7 (= ~z_val~0 |old(~z_val~0)|) .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (< |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)|) (<= (+ |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) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse0 .cse9 .cse11 .cse13 .cse5 (= 0 ~z_val~0) (<= ~d0_ev~0 0) (not (= ~d0_ev~0 0)) .cse8 .cse10 .cse1 .cse12) (not (= 1 |old(~d1_req_up~0)|)))) [2018-11-10 03:49:22,150 INFO L421 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (let ((.cse15 (= 1 ~d1_ev~0)) (.cse4 (<= 2 ~d0_ev~0)) (.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse3 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (= ~z_val~0 ~z_val_t~0)) (.cse7 (not (= ~b0_ev~0 0))) (.cse9 (not (= ~b1_ev~0 1))) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse2 (= ~d0_val~0 ~d0_val_t~0)) (.cse13 (= 0 ~z_val~0)) (.cse16 (<= ~d0_ev~0 0)) (.cse17 (not (= ~d0_ev~0 0))) (.cse6 (not (= ~b1_ev~0 0))) (.cse8 (not (= ~b0_ev~0 1))) (.cse12 (<= ~b1_val_t~0 ~b1_val~0)) (.cse10 (<= 2 ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse3 .cse5 .cse7 .cse9 .cse14 .cse15 .cse2 .cse13 .cse16 .cse17 .cse6 .cse8 .cse12 .cse10) (< |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)|) (and .cse12 (and .cse0 .cse15 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~z_val~0 |old(~z_val~0)|) .cse6 .cse7 .cse8 .cse9 .cse10) .cse14) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (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)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (and .cse0 .cse1 .cse3 .cse5 .cse11 .cse7 .cse9 .cse14 .cse2 .cse13 .cse16 .cse17 .cse6 .cse8 .cse12 .cse10) (< ~d1_val_t~0 1) (< |old(~z_ev~0)| 2) (< 0 |old(~z_val~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-11-10 03:49:22,151 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse2 (<= 2 ~comp_m1_st~0)) (.cse3 (not (= 1 ~b1_req_up~0))) (.cse4 (not (= ~d1_ev~0 1))) (.cse6 (not (= ~b0_req_up~0 1))) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse9 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~b1_ev~0 1))) (.cse13 (<= ~d1_val_t~0 ~d1_val~0)) (.cse5 (= ~d0_val~0 ~d0_val_t~0)) (.cse8 (not (= ~b1_ev~0 0))) (.cse10 (not (= ~b0_ev~0 1))) (.cse1 (<= ~b1_val_t~0 ~b1_val~0)) (.cse12 (<= 2 ~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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 (<= 2 ~d0_ev~0) .cse7 (= ~z_val~0 |old(~z_val~0)|) .cse8 .cse9 .cse10 .cse11 .cse12) .cse13) (< |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)|) (<= (+ |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) (and .cse2 .cse3 .cse4 .cse6 .cse7 .cse0 .cse9 .cse11 .cse13 .cse5 (= 0 ~z_val~0) (<= ~d0_ev~0 0) (not (= ~d0_ev~0 0)) .cse8 .cse10 .cse1 .cse12) (not (= 1 |old(~d1_req_up~0)|)))) [2018-11-10 03:49:22,153 INFO L425 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-11-10 03:49:22,154 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse15 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse16 (<= 2 ~d0_ev~0)) (.cse20 (= ~z_val~0 |old(~z_val~0)|)) (.cse4 (= 0 ~comp_m1_st~0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse21 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse5 (not (= ~b0_ev~0 0))) (.cse18 (not (= ~b1_ev~0 1))) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= 0 ~z_val~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse17 (not (= ~b1_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse14 (<= 2 ~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~b1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (and (or (and .cse0 .cse1 .cse8 .cse2 .cse16 .cse3 .cse4 .cse17 .cse5 .cse12 .cse18 .cse14) (and (= ~d0_val_t~0 ~d0_val~0) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b0_ev~0) .cse4 .cse18 .cse10 .cse11 .cse17 .cse14 .cse15))) .cse6 .cse13 .cse9 .cse7) (< 0 |old(~d1_val~0)|) (and (and .cse0 .cse8 .cse2 .cse16 .cse3 .cse19 .cse4 .cse20 .cse17 .cse5 .cse12 .cse18 .cse14) .cse13 .cse7) (and .cse6 .cse13 (and .cse21 .cse0 .cse1 .cse8 .cse2 .cse16 .cse3 .cse20 .cse17 .cse5 .cse12 .cse18 .cse14) .cse7) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse17 .cse13 .cse12 .cse14) (< 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)|) (<= (+ |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)|)) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14))) [2018-11-10 03:49:22,154 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-11-10 03:49:22,155 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 444) no Hoare annotation was computed. [2018-11-10 03:49:22,155 INFO L421 ceAbstractionStarter]: At program point L422-2(lines 419 444) the Hoare annotation is: (let ((.cse15 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse16 (<= 2 ~d0_ev~0)) (.cse20 (= ~z_val~0 |old(~z_val~0)|)) (.cse4 (= 0 ~comp_m1_st~0)) (.cse19 (<= 2 ~d1_ev~0)) (.cse21 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse2 (not (= ~b0_req_up~0 1))) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse5 (not (= ~b0_ev~0 0))) (.cse18 (not (= ~b1_ev~0 1))) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= 0 ~z_val~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse17 (not (= ~b1_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse14 (<= 2 ~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) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~b1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (and (or (and .cse0 .cse1 .cse8 .cse2 .cse16 .cse3 .cse4 .cse17 .cse5 .cse12 .cse18 .cse14) (and (= ~d0_val_t~0 ~d0_val~0) (and .cse0 .cse1 .cse2 .cse3 (<= 2 ~b0_ev~0) .cse4 .cse18 .cse10 .cse11 .cse17 .cse14 .cse15))) .cse6 .cse13 .cse9 .cse7) (< 0 |old(~d1_val~0)|) (and (and .cse0 .cse8 .cse2 .cse16 .cse3 .cse19 .cse4 .cse20 .cse17 .cse5 .cse12 .cse18 .cse14) .cse13 .cse7) (and .cse6 .cse13 (and .cse21 .cse0 .cse1 .cse8 .cse2 .cse16 .cse3 .cse20 .cse17 .cse5 .cse12 .cse18 .cse14) .cse7) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse18 .cse7 .cse8 .cse9 .cse19 .cse10 .cse11 .cse17 .cse13 .cse12 .cse14) (< 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)|) (<= (+ |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)|)) (and .cse21 .cse0 .cse1 .cse2 .cse3 .cse6 .cse5 .cse18 .cse7 .cse8 .cse9 .cse10 .cse11 .cse17 .cse12 .cse13 .cse14))) [2018-11-10 03:49:22,156 INFO L421 ceAbstractionStarter]: At program point L418(line 418) the Hoare annotation is: (let ((.cse22 (not (= ~d0_ev~0 0))) (.cse23 (not (= ~b0_ev~0 0))) (.cse24 (<= ~comp_m1_i~0 0)) (.cse25 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse10 (= 1 ~d0_ev~0)) (.cse18 (= ~d0_val_t~0 ~d0_val~0)) (.cse19 (= ~b0_ev~0 1)) (.cse16 (and (<= |old(~b1_ev~0)| ~b1_ev~0) .cse22 .cse23 (<= 2 ~b1_ev~0) .cse24 .cse25)) (.cse20 (= 1 ~d1_ev~0)) (.cse4 (= 0 ~comp_m1_st~0)) (.cse14 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse15 (not (= ~d1_ev~0 1))) (.cse1 (not (= ~b0_req_up~0 1))) (.cse2 (<= ~d1_ev~0 1)) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse5 (= ~z_val~0 ~z_val_t~0)) (.cse21 (= ~b1_ev~0 1)) (.cse6 (and .cse22 (not (= ~b1_ev~0 0)) .cse23 (<= ~b1_ev~0 1) (<= 2 ~z_ev~0) .cse24 .cse25)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= 0 ~z_val~0)) (.cse17 (<= ~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)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 .cse7 .cse16 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse17 .cse12 .cse13) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (and .cse5 .cse12 (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse10 (= ~z_val~0 |old(~z_val~0)|) .cse11 .cse16 .cse13) .cse7) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse20 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13) (and .cse18 .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 .cse12 .cse13) (< ~b0_val_t~0 1) (< 0 |old(~z_val~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse18 (and .cse0 .cse1 .cse2 .cse3 .cse19 .cse4 (<= ~d0_ev~0 1) .cse16 .cse13) .cse5 .cse12 .cse9 .cse7) (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)|) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse20 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (and .cse0 .cse1 .cse2 .cse21 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13) (< 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) (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~z_val~0)| 0) (and .cse14 .cse0 .cse15 .cse1 .cse2 .cse3 .cse5 (not .cse21) .cse6 .cse7 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13)))) [2018-11-10 03:49:22,158 INFO L421 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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and (= ~z_val~0 ~z_val_t~0) (= 0 ~z_val~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) (= |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)) (< |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)|) (<= (+ |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-11-10 03:49:22,165 INFO L421 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 (= ~z_val~0 ~z_val_t~0)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse9 (= 0 ~z_val~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)) (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(~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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~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_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)|) (<= (+ |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-11-10 03:49:22,165 INFO L421 ceAbstractionStarter]: At program point L445(lines 408 450) the Hoare annotation is: (or (not (= |old(~d0_req_up~0)| 1)) (and (not (= 1 ~b1_req_up~0)) (not (= ~b0_req_up~0 1)) (let ((.cse0 (and (not (= ~d1_ev~0 1)) (and (and (not (= ~d0_ev~0 0)) (and (not (= ~b0_ev~0 0)) (not (= ~b1_ev~0 0)))) (not (= ~d0_ev~0 1)))))) (or (and (<= 2 ~comp_m1_st~0) .cse0) (and .cse0 (= 0 ~comp_m1_st~0)))) (not (= ~b0_ev~0 1)) (not (= ~b1_ev~0 1)) (= ~z_val~0 |old(~z_val~0)|)) (< |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) (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)|) (< ~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)|) (<= (+ |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-11-10 03:49:22,165 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-11-10 03:49:22,168 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L421 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse5 (<= 2 ~d0_ev~0)) (.cse8 (= ~z_val~0 |old(~z_val~0)|)) (.cse7 (= 0 ~comp_m1_st~0)) (.cse1 (= 1 ~d1_ev~0)) (.cse16 (<= 2 ~comp_m1_st~0)) (.cse2 (not (= 1 ~b1_req_up~0))) (.cse17 (not (= ~d1_ev~0 1))) (.cse4 (not (= ~b0_req_up~0 1))) (.cse6 (<= ~b0_val_t~0 ~b0_val~0)) (.cse15 (= ~z_val~0 ~z_val_t~0)) (.cse10 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b1_ev~0 1))) (.cse14 (<= ~d1_val_t~0 ~d1_val~0)) (.cse3 (= ~d0_val~0 ~d0_val_t~0)) (.cse18 (= 0 ~z_val~0)) (.cse19 (<= ~d0_ev~0 0)) (.cse20 (not (= ~d0_ev~0 0))) (.cse9 (not (= ~b1_ev~0 0))) (.cse11 (not (= ~b0_ev~0 1))) (.cse0 (<= ~b1_val_t~0 ~b1_val~0)) (.cse13 (<= 2 ~z_ev~0))) (or (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (and .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (< 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) (not (= |old(~z_val~0)| |old(~z_val_t~0)|)) (< 0 |old(~d1_val~0)|) (and .cse15 .cse0 (and .cse16 .cse2 .cse17 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (< |old(~b0_val~0)| 0) (and .cse2 .cse4 .cse6 .cse7 .cse10 .cse12 .cse14 .cse1 .cse3 .cse18 .cse19 .cse20 .cse9 .cse11 .cse0 .cse13) (< |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)|) (<= (+ |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)|)) (and .cse16 .cse2 .cse17 .cse4 .cse6 .cse15 .cse10 .cse12 .cse14 .cse3 .cse18 .cse19 .cse20 .cse9 .cse11 .cse0 .cse13))) [2018-11-10 03:49:22,169 INFO L425 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L421 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 ~z_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) (<= ~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-11-10 03:49:22,169 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 03:49:22,169 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-11-10 03:49:22,169 INFO L421 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)|) (not (= |old(~z_val~0)| ~z_val_t~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)|) (<= (+ |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) (<= ~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 ~z_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-11-10 03:49:22,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:49:22 BoogieIcfgContainer [2018-11-10 03:49:22,226 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 03:49:22,226 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 03:49:22,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 03:49:22,227 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 03:49:22,227 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 03:47:14" (3/4) ... [2018-11-10 03:49:22,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 03:49:22,239 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-11-10 03:49:22,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-11-10 03:49:22,241 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-11-10 03:49:22,249 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-10 03:49:22,250 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 03:49:22,273 WARN L220 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) || ((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b0_ev == 0)) && z_val == z_val_t) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && 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))) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || !(\old(z_val) == \old(z_val_t))) || ((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) || (d0_val_t == d0_val && ((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && 0 == comp_m1_st) && !(b1_ev == 1)) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && 2 <= z_ev) && z_req_up == \old(z_req_up))) && z_val == z_val_t) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || 0 < \old(d1_val)) || ((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((z_val == z_val_t && b1_val_t <= b1_val) && (((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || (((((((((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b0_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && 2 <= d1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && b1_val_t <= b1_val) && !(b0_ev == 1)) && 2 <= z_ev)) || 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) || \old(z_ev) < 2) || 0 < \old(z_val)) || \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))) || ((((((((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && z_val == z_val_t) && !(b0_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) [2018-11-10 03:49:22,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((!(\old(d0_req_up) == 1) || (((((!(1 == b1_req_up) && !(b0_req_up == 1)) && ((2 <= comp_m1_st && !(d1_ev == 1) && (!(d0_ev == 0) && !(b0_ev == 0) && !(b1_ev == 0)) && !(d0_ev == 1)) || ((!(d1_ev == 1) && (!(d0_ev == 0) && !(b0_ev == 0) && !(b1_ev == 0)) && !(d0_ev == 1)) && 0 == comp_m1_st))) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || \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) || !(\old(z_val) == \old(z_val_t))) || 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) || \old(z_ev) < 2) || 0 < \old(z_val)) || \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-11-10 03:49:22,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || b0_val < b0_val_t) || b1_ev == 0) || \old(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) || 0 == d0_ev) || 1 == d1_ev) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || b1_ev == 0) || \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)))) && (((((((((((((((((((((((((1 < d1_ev || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || (2 <= comp_m1_st && z_val == z_val_t)) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || 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) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || b1_ev == 0) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || d1_val_t < 1) || !(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) || b0_val < b0_val_t) || 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)) || (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 == d0_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 || 0 == b0_ev) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) && ((((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || ((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || 1 < d1_ev) || 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))) || 1 == d1_ev) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((!(d0_val_t == d0_val) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || 1 < d1_ev) || 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))) || 1 == d1_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && (((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 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) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1))) || (z_val == z_val_t && 2 <= comp_m1_st)) || !(z_val == \old(z_val_t))) [2018-11-10 03:49:22,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((2 <= comp_m1_st && z_val == z_val_t) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || b1_ev == 0) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || d1_val_t < 1) || !(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) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 1 == d1_ev)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || b0_val < b0_val_t) || b1_ev == 0) || \old(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) || 0 == d0_ev) || 1 == d1_ev) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || b1_ev == 0) || \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))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && 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) || !(z_val == \old(z_val_t))) || 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) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || (2 <= comp_m1_st && z_val == z_val_t)) || 1 == d1_ev)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((((((b0_val < b0_val_t || (((((((((((b1_req_up == 1 || b0_ev < 2) || 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))) || 1 == d1_ev) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((!(d0_val_t == d0_val) || (((((((((((b1_req_up == 1 || 0 == b0_ev) || 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))) || 1 == d1_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b1_ev == 0) || 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) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1))) || !(z_val == \old(z_val_t))) || (2 <= comp_m1_st && z_val == z_val_t))) && ((2 <= comp_m1_st && z_val == z_val_t) || (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 == d0_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 || 0 == b0_ev) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) [2018-11-10 03:49:22,314 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cfd571b-586e-494f-bc18-8c223eacc8bd/bin-2019/uautomizer/witness.graphml [2018-11-10 03:49:22,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 03:49:22,315 INFO L168 Benchmark]: Toolchain (without parser) took 129007.60 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 959.2 MB in the beginning and 992.7 MB in the end (delta: -33.4 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 03:49:22,315 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:49:22,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 03:49:22,316 INFO L168 Benchmark]: Boogie Preprocessor took 35.69 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:49:22,316 INFO L168 Benchmark]: RCFGBuilder took 476.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-11-10 03:49:22,316 INFO L168 Benchmark]: TraceAbstraction took 128145.84 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 116.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-11-10 03:49:22,317 INFO L168 Benchmark]: Witness Printer took 87.59 ms. Allocated memory is still 5.0 GB. Free memory is still 992.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 03:49:22,318 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 943.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.69 ms. Allocated memory is still 1.0 GB. Free memory is still 943.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 476.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 128145.84 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 116.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 87.59 ms. Allocated memory is still 5.0 GB. Free memory is still 992.7 MB. 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) || (((((!(1 == b1_req_up) && !(b0_req_up == 1)) && ((2 <= comp_m1_st && !(d1_ev == 1) && (!(d0_ev == 0) && !(b0_ev == 0) && !(b1_ev == 0)) && !(d0_ev == 1)) || ((!(d1_ev == 1) && (!(d0_ev == 0) && !(b0_ev == 0) && !(b1_ev == 0)) && !(d0_ev == 1)) && 0 == comp_m1_st))) && !(b0_ev == 1)) && !(b1_ev == 1)) && z_val == \old(z_val))) || \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) || !(\old(z_val) == \old(z_val_t))) || 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) || \old(z_ev) < 2) || 0 < \old(z_val)) || \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 || 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) || !(z_val == z_val_t)) || 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) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || 0 == __retres1) || !(z_val == z_val_t)) || ((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 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)) && (1 <= __retres1 || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || b1_ev == 0) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == comp_m1_st)) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || d1_val_t < 1) || !(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) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && (1 <= __retres1 || (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 == d0_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 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)) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || 1 <= __retres1) || ((((((b0_val < b0_val_t || (((((((((((b1_req_up == 1 || b0_ev < 2) || 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)) || 1 == d1_ev) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((!(d0_val_t == d0_val) || (((((((((((b1_req_up == 1 || 0 == b0_ev) || 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)) || 1 == d1_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < z_req_up) || b0_val < b0_val_t) || b1_ev == 0) || 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) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_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) || !(z_val == z_val_t)) || 0 == __retres1) || 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) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((((2 <= comp_m1_st && z_val == z_val_t) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || b1_ev == 0) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || d1_val_t < 1) || !(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) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1) && (((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 1 == d1_ev)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || b0_val < b0_val_t) || b1_ev == 0) || \old(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) || 0 == d0_ev) || 1 == d1_ev) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || b1_ev == 0) || \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))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && 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) || !(z_val == \old(z_val_t))) || 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) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || (2 <= comp_m1_st && z_val == z_val_t)) || 1 == d1_ev)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((((((b0_val < b0_val_t || (((((((((((b1_req_up == 1 || b0_ev < 2) || 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))) || 1 == d1_ev) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((!(d0_val_t == d0_val) || (((((((((((b1_req_up == 1 || 0 == b0_ev) || 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))) || 1 == d1_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b1_ev == 0) || 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) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1))) || !(z_val == \old(z_val_t))) || (2 <= comp_m1_st && z_val == z_val_t))) && ((2 <= comp_m1_st && z_val == z_val_t) || (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 == d0_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 || 0 == b0_ev) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || \old(comp_m1_st) < 2) || b0_val_t < 1) || d1_val_t < 1) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (((!(d0_val_t == d0_val) || d0_val_t < 1) || ((((((((((((((b1_req_up == 1 || b0_ev < 2) || b0_val < b0_val_t) || b1_ev == 0) || \old(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) || 0 == d0_ev) || 1 == d1_ev) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || b1_ev == 0) || \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)))) && (((((((((((((((((((((((((1 < d1_ev || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 0 < d0_ev) || 0 == d0_ev) || b1_ev < 2) || !(z_val == \old(z_val_t))) || b1_req_up == 1) || b1_val < b1_val_t) || (2 <= comp_m1_st && z_val == z_val_t)) || 0 == b0_ev) || d0_val_t < 1) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || b0_val_t < 1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || 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) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (((((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || b1_ev == 0) || b1_ev == 1) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(0 == \old(comp_m1_st))) || d1_ev < 2) || 0 < d0_ev) || 0 == d0_ev) || d1_val_t < 1) || !(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) || b0_val < b0_val_t) || 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)) || (((((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 == d0_ev) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && ((!(d0_val_t == d0_val) || d0_val_t < 1) || (((((((((((((b1_req_up == 1 || b0_ev < 2) || 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 || 0 == b0_ev) || 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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1)) && ((((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || ((((((b0_val < b0_val_t || ((((((((((((b1_req_up == 1 || b0_ev < 2) || 1 < d1_ev) || 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))) || 1 == d1_ev) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((!(d0_val_t == d0_val) || ((((((((((((b1_req_up == 1 || 0 == b0_ev) || 1 < d1_ev) || 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))) || 1 == d1_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 0 < b0_ev) || b0_val_t < 1)) && (((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 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) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1))) || (z_val == z_val_t && 2 <= comp_m1_st)) || !(z_val == \old(z_val_t))) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((d1_val < d1_val_t || b1_val < b1_val_t) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || 1 == __retres1) || ((((((((((((((b1_req_up == 1 || 0 < z_req_up) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 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) || z_val < 0) || !(1 == b0_ev)) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == z_val_t)) && (((((((((((((((((((((((b1_ev == 0 || 0 == __retres1) || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == z_val_t)) || 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)) && ((((((((((((((((((((((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) || 0 < b0_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 == __retres1)) && ((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || comp_m1_st < 2) || 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) || 0 == d0_ev) || !(1 == d1_ev)) || b0_val < b0_val_t) || b0_val_t < 1) || !(d0_val_t == d0_val)) || d0_val_t < 1) && (((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 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)))) || 1 == __retres1)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || ((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 1) || 0 < z_req_up) || b0_val < b0_val_t) || 0 < b0_ev) || 1 < d1_ev) || b1_ev == 0) || 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)) || !(d0_val_t == d0_val)) || z_val < 0) || b1_val_t < 1) || !(z_val == z_val_t)) || 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) || 1 == __retres1) || !(z_val == z_val_t)) || (((((((((((((b1_req_up == 1 || 0 < z_req_up) || b0_val < b0_val_t) || 1 < d1_ev) || b1_ev == 0) || 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))) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == z_val_t)) || ((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 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) || 0 == __retres1)) && (((((((((((((((((((((((1 < d1_ev || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == z_val_t)) || 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) || comp_m1_st < 2) || b0_val_t < 1) || 1 == __retres1) || d1_val_t < 1) || z_ev < 2) || 0 < z_val) || !(b1_ev == 1)) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) - InvariantResult [Line: 419]: 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) || ((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b0_ev == 0)) && z_val == z_val_t) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && 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))) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || !(\old(z_val) == \old(z_val_t))) || ((((((((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) || (d0_val_t == d0_val && ((((((((((!(1 == b1_req_up) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 2 <= b0_ev) && 0 == comp_m1_st) && !(b1_ev == 1)) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && 2 <= z_ev) && z_req_up == \old(z_req_up))) && z_val == z_val_t) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || 0 < \old(d1_val)) || ((((((((((((((!(1 == b1_req_up) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && 2 <= d1_ev) && 0 == comp_m1_st) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && b1_val_t <= b1_val) && d1_val_t <= d1_val)) || (((z_val == z_val_t && b1_val_t <= b1_val) && (((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && d0_val == d0_val_t) && !(b0_req_up == 1)) && 2 <= d0_ev) && b0_val_t <= b0_val) && z_val == \old(z_val)) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && d1_val_t <= d1_val)) || \old(b0_val) < 0) || \old(b0_ev) < 2) || d0_val_t < 1) || (((((((((((((((!(1 == b1_req_up) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && 0 == comp_m1_st) && !(b0_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && 2 <= d1_ev) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && b1_val_t <= b1_val) && !(b0_ev == 1)) && 2 <= z_ev)) || 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) || \old(z_ev) < 2) || 0 < \old(z_val)) || \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))) || ((((((((((((((((2 <= comp_m1_st && !(1 == b1_req_up)) && !(d1_ev == 1)) && !(b0_req_up == 1)) && b0_val_t <= b0_val) && z_val == z_val_t) && !(b0_ev == 0)) && !(b1_ev == 1)) && d1_val_t <= d1_val) && d0_val == d0_val_t) && 0 == z_val) && d0_ev <= 0) && !(d0_ev == 0)) && !(b1_ev == 0)) && !(b0_ev == 1)) && b1_val_t <= b1_val) && 2 <= z_ev) - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((0 == tmp || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == z_val_t)) || ((((((((((((((((b1_req_up == 1 || 0 == b0_ev) || d0_val_t < 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_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(z_val == z_val_t)) || 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) || d1_val < d1_val_t) || 1 == b0_ev) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev) - StatisticsResult: Ultimate Automizer benchmark data CFG has 21 procedures, 143 locations, 1 error locations. SAFE Result, 128.0s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 72.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5348 SDtfs, 11902 SDslu, 9729 SDs, 0 SdLazy, 14373 SolverSat, 4164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3205 GetRequests, 2905 SyntacticMatches, 6 SemanticMatches, 294 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55933occurred 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: 18.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 38972 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 76859 PreInvPairs, 77200 NumberOfFragments, 23007 HoareAnnotationTreeSize, 76859 FomulaSimplifications, 2051292 FormulaSimplificationTreeSizeReduction, 9.7s HoareSimplificationTime, 52 FomulaSimplificationsInter, 3256861 FormulaSimplificationTreeSizeReductionInter, 62.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 6302 NumberOfCodeBlocks, 6302 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 6259 ConstructedInterpolants, 0 QuantifiedInterpolants, 1519046 SizeOfPredicates, 14 NumberOfNonLiveVariables, 17085 ConjunctsInSsa, 122 ConjunctsInUnsatCore, 43 InterpolantComputations, 14 PerfectInterpolantSequences, 1447/1780 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...