./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_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:13,331 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:28:13,332 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:28:13,340 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:28:13,341 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:28:13,342 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:28:13,343 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:28:13,344 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:28:13,346 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:28:13,347 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:28:13,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:28:13,348 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:28:13,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:28:13,350 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:28:13,351 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:28:13,351 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:28:13,352 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:28:13,354 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:28:13,355 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:28:13,356 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:28:13,358 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:28:13,359 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:28:13,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:28:13,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:28:13,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:28:13,362 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:28:13,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:28:13,363 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:28:13,364 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:28:13,365 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:28:13,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:28:13,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:28:13,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:28:13,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:28:13,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:28:13,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:28:13,368 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 23:28:13,380 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:28:13,380 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:28:13,381 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:28:13,381 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 23:28:13,382 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 23:28:13,382 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 23:28:13,382 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 23:28:13,382 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:28:13,382 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:28:13,382 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:28:13,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:28:13,384 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:28:13,384 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:28:13,384 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:28:13,384 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:28:13,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:28:13,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:28:13,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:28:13,385 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:28:13,387 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:28:13,387 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 23:28:13,387 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:28:13,387 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:28:13,387 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_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:13,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:28:13,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:28:13,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:28:13,436 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:28:13,437 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:28:13,437 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-10-26 23:28:13,485 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/data/e7d7357bc/a34ae4146901484996d5f2a1dbd2ac96/FLAGca93ffa86 [2018-10-26 23:28:13,871 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:28:13,872 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/sv-benchmarks/c/systemc/bist_cell_true-unreach-call_false-termination.cil.c [2018-10-26 23:28:13,880 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/data/e7d7357bc/a34ae4146901484996d5f2a1dbd2ac96/FLAGca93ffa86 [2018-10-26 23:28:13,892 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/data/e7d7357bc/a34ae4146901484996d5f2a1dbd2ac96 [2018-10-26 23:28:13,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:28:13,896 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 23:28:13,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:28:13,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:28:13,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:28:13,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:28:13" (1/1) ... [2018-10-26 23:28:13,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ba8991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:13, skipping insertion in model container [2018-10-26 23:28:13,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:28:13" (1/1) ... [2018-10-26 23:28:13,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:28:13,959 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:28:14,112 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:28:14,117 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:28:14,158 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:28:14,174 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:28:14,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14 WrapperNode [2018-10-26 23:28:14,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:28:14,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:28:14,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:28:14,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:28:14,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... [2018-10-26 23:28:14,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:28:14,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:28:14,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:28:14,214 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:28:14,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:14,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:28:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:28:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2018-10-26 23:28:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure method1 [2018-10-26 23:28:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure is_method1_triggered [2018-10-26 23:28:14,344 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b0 [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_b1 [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d0 [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_d1 [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_z [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2018-10-26 23:28:14,345 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2018-10-26 23:28:14,346 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2018-10-26 23:28:14,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2018-10-26 23:28:14,346 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2018-10-26 23:28:14,346 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2018-10-26 23:28:14,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:28:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 23:28:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 23:28:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure error [2018-10-26 23:28:14,346 INFO L130 BoogieDeclarations]: Found specification of procedure method1 [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure is_method1_triggered [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_b0 [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_b1 [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_d0 [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_d1 [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_z [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2018-10-26 23:28:14,347 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:28:14,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:28:14,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:28:15,161 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:28:15,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:28:15 BoogieIcfgContainer [2018-10-26 23:28:15,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:28:15,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:28:15,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:28:15,167 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:28:15,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:28:13" (1/3) ... [2018-10-26 23:28:15,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3561628f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:28:15, skipping insertion in model container [2018-10-26 23:28:15,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:28:14" (2/3) ... [2018-10-26 23:28:15,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3561628f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:28:15, skipping insertion in model container [2018-10-26 23:28:15,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:28:15" (3/3) ... [2018-10-26 23:28:15,172 INFO L112 eAbstractionObserver]: Analyzing ICFG bist_cell_true-unreach-call_false-termination.cil.c [2018-10-26 23:28:15,184 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:28:15,193 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:28:15,208 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:28:15,242 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 23:28:15,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:28:15,243 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:28:15,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:28:15,243 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:28:15,243 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:28:15,243 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:28:15,243 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:28:15,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:28:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2018-10-26 23:28:15,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 23:28:15,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:15,278 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-10-26 23:28:15,280 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1766200525, now seen corresponding path program 1 times [2018-10-26 23:28:15,288 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:15,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:15,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:15,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:15,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:15,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:28:15,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:28:15,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:28:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:28:15,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:28:15,598 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 4 states. [2018-10-26 23:28:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:16,021 INFO L93 Difference]: Finished difference Result 269 states and 371 transitions. [2018-10-26 23:28:16,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:28:16,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-10-26 23:28:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:16,035 INFO L225 Difference]: With dead ends: 269 [2018-10-26 23:28:16,035 INFO L226 Difference]: Without dead ends: 136 [2018-10-26 23:28:16,039 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-10-26 23:28:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-26 23:28:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-10-26 23:28:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-26 23:28:16,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 181 transitions. [2018-10-26 23:28:16,092 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 181 transitions. Word has length 58 [2018-10-26 23:28:16,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:16,094 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 181 transitions. [2018-10-26 23:28:16,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:28:16,094 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2018-10-26 23:28:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 23:28:16,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:16,099 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-10-26 23:28:16,099 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:16,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1105971296, now seen corresponding path program 1 times [2018-10-26 23:28:16,100 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:16,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:16,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:28:16,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:16,465 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:28:16,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:28:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:16,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-10-26 23:28:16,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:16,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 23:28:16,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:28:16,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:28:16,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:28:16,772 INFO L87 Difference]: Start difference. First operand 136 states and 181 transitions. Second operand 8 states. [2018-10-26 23:28:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:18,209 INFO L93 Difference]: Finished difference Result 436 states and 610 transitions. [2018-10-26 23:28:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 23:28:18,210 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-10-26 23:28:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:18,216 INFO L225 Difference]: With dead ends: 436 [2018-10-26 23:28:18,216 INFO L226 Difference]: Without dead ends: 318 [2018-10-26 23:28:18,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:28:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-26 23:28:18,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 297. [2018-10-26 23:28:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-26 23:28:18,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 406 transitions. [2018-10-26 23:28:18,257 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 406 transitions. Word has length 127 [2018-10-26 23:28:18,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:18,257 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 406 transitions. [2018-10-26 23:28:18,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:28:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 406 transitions. [2018-10-26 23:28:18,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:28:18,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:18,265 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-10-26 23:28:18,265 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:18,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:18,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1903501912, now seen corresponding path program 1 times [2018-10-26 23:28:18,265 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:18,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:18,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:28:18,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:18,392 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:18,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:28:18,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:18,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-10-26 23:28:18,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:28:18,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:28:18,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:28:18,799 INFO L87 Difference]: Start difference. First operand 297 states and 406 transitions. Second operand 8 states. [2018-10-26 23:28:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:20,369 INFO L93 Difference]: Finished difference Result 1273 states and 1987 transitions. [2018-10-26 23:28:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 23:28:20,370 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-10-26 23:28:20,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:20,383 INFO L225 Difference]: With dead ends: 1273 [2018-10-26 23:28:20,383 INFO L226 Difference]: Without dead ends: 999 [2018-10-26 23:28:20,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2018-10-26 23:28:20,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-10-26 23:28:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 817. [2018-10-26 23:28:20,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-10-26 23:28:20,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1133 transitions. [2018-10-26 23:28:20,500 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1133 transitions. Word has length 129 [2018-10-26 23:28:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:20,501 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 1133 transitions. [2018-10-26 23:28:20,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:28:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1133 transitions. [2018-10-26 23:28:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 23:28:20,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:20,507 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-10-26 23:28:20,507 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:20,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1712106708, now seen corresponding path program 1 times [2018-10-26 23:28:20,508 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:20,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:28:20,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:20,600 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:20,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:20,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-26 23:28:20,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:20,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-26 23:28:20,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:28:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:28:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:28:20,820 INFO L87 Difference]: Start difference. First operand 817 states and 1133 transitions. Second operand 9 states. [2018-10-26 23:28:22,355 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-26 23:28:24,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:24,572 INFO L93 Difference]: Finished difference Result 3179 states and 5143 transitions. [2018-10-26 23:28:24,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 23:28:24,572 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 129 [2018-10-26 23:28:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:24,586 INFO L225 Difference]: With dead ends: 3179 [2018-10-26 23:28:24,587 INFO L226 Difference]: Without dead ends: 2415 [2018-10-26 23:28:24,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=176, Invalid=636, Unknown=0, NotChecked=0, Total=812 [2018-10-26 23:28:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2018-10-26 23:28:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 2065. [2018-10-26 23:28:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2018-10-26 23:28:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2933 transitions. [2018-10-26 23:28:24,726 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2933 transitions. Word has length 129 [2018-10-26 23:28:24,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:24,727 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 2933 transitions. [2018-10-26 23:28:24,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:28:24,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2933 transitions. [2018-10-26 23:28:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 23:28:24,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:24,736 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-10-26 23:28:24,737 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:24,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -739180416, now seen corresponding path program 1 times [2018-10-26 23:28:24,738 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:24,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:24,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 23:28:24,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:24,847 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:24,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:24,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 23:28:25,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:25,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-26 23:28:25,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:28:25,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:28:25,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:28:25,091 INFO L87 Difference]: Start difference. First operand 2065 states and 2933 transitions. Second operand 10 states. [2018-10-26 23:28:26,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:26,718 INFO L93 Difference]: Finished difference Result 6040 states and 9013 transitions. [2018-10-26 23:28:26,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 23:28:26,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2018-10-26 23:28:26,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:26,737 INFO L225 Difference]: With dead ends: 6040 [2018-10-26 23:28:26,737 INFO L226 Difference]: Without dead ends: 4076 [2018-10-26 23:28:26,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:28:26,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4076 states. [2018-10-26 23:28:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4076 to 3944. [2018-10-26 23:28:27,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3944 states. [2018-10-26 23:28:27,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3944 states to 3944 states and 5562 transitions. [2018-10-26 23:28:27,028 INFO L78 Accepts]: Start accepts. Automaton has 3944 states and 5562 transitions. Word has length 131 [2018-10-26 23:28:27,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:27,028 INFO L481 AbstractCegarLoop]: Abstraction has 3944 states and 5562 transitions. [2018-10-26 23:28:27,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:28:27,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3944 states and 5562 transitions. [2018-10-26 23:28:27,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:28:27,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:27,042 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-10-26 23:28:27,043 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:27,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:27,043 INFO L82 PathProgramCache]: Analyzing trace with hash 198751002, now seen corresponding path program 1 times [2018-10-26 23:28:27,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:27,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:27,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:27,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:27,285 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 4 [2018-10-26 23:28:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 23:28:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:27,615 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-26 23:28:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:28:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:27,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-26 23:28:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:28,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-10-26 23:28:28,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:28:28,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:28:28,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:28:28,363 INFO L87 Difference]: Start difference. First operand 3944 states and 5562 transitions. Second operand 10 states. [2018-10-26 23:28:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:30,251 INFO L93 Difference]: Finished difference Result 14228 states and 22188 transitions. [2018-10-26 23:28:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-26 23:28:30,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-10-26 23:28:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:30,302 INFO L225 Difference]: With dead ends: 14228 [2018-10-26 23:28:30,302 INFO L226 Difference]: Without dead ends: 10377 [2018-10-26 23:28:30,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:28:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10377 states. [2018-10-26 23:28:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10377 to 9427. [2018-10-26 23:28:30,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9427 states. [2018-10-26 23:28:30,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9427 states to 9427 states and 13304 transitions. [2018-10-26 23:28:30,908 INFO L78 Accepts]: Start accepts. Automaton has 9427 states and 13304 transitions. Word has length 133 [2018-10-26 23:28:30,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:30,909 INFO L481 AbstractCegarLoop]: Abstraction has 9427 states and 13304 transitions. [2018-10-26 23:28:30,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:28:30,910 INFO L276 IsEmpty]: Start isEmpty. Operand 9427 states and 13304 transitions. [2018-10-26 23:28:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:28:31,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:31,013 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-10-26 23:28:31,013 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:31,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash -381846254, now seen corresponding path program 1 times [2018-10-26 23:28:31,014 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:31,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:31,420 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:31,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:31,420 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:31,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:31,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:28:31,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:28:31,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2018-10-26 23:28:31,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:28:31,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:28:31,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:28:31,674 INFO L87 Difference]: Start difference. First operand 9427 states and 13304 transitions. Second operand 10 states. [2018-10-26 23:28:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:32,986 INFO L93 Difference]: Finished difference Result 19233 states and 26994 transitions. [2018-10-26 23:28:32,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:28:32,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-10-26 23:28:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:33,036 INFO L225 Difference]: With dead ends: 19233 [2018-10-26 23:28:33,037 INFO L226 Difference]: Without dead ends: 10091 [2018-10-26 23:28:33,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-26 23:28:33,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10091 states. [2018-10-26 23:28:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10091 to 9707. [2018-10-26 23:28:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2018-10-26 23:28:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 13608 transitions. [2018-10-26 23:28:33,633 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 13608 transitions. Word has length 133 [2018-10-26 23:28:33,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:33,634 INFO L481 AbstractCegarLoop]: Abstraction has 9707 states and 13608 transitions. [2018-10-26 23:28:33,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:28:33,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 13608 transitions. [2018-10-26 23:28:33,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:28:33,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:33,668 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-10-26 23:28:33,669 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:33,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:33,669 INFO L82 PathProgramCache]: Analyzing trace with hash -943606120, now seen corresponding path program 1 times [2018-10-26 23:28:33,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:33,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:33,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:33,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:33,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:33,954 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-10-26 23:28:33,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:33,954 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:33,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:34,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 23:28:34,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:28:34,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-10-26 23:28:34,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:28:34,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:28:34,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:28:34,093 INFO L87 Difference]: Start difference. First operand 9707 states and 13608 transitions. Second operand 7 states. [2018-10-26 23:28:35,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:35,566 INFO L93 Difference]: Finished difference Result 22214 states and 32278 transitions. [2018-10-26 23:28:35,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:28:35,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-10-26 23:28:35,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:35,610 INFO L225 Difference]: With dead ends: 22214 [2018-10-26 23:28:35,610 INFO L226 Difference]: Without dead ends: 12824 [2018-10-26 23:28:35,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:28:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12824 states. [2018-10-26 23:28:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12824 to 12168. [2018-10-26 23:28:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-10-26 23:28:36,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 16702 transitions. [2018-10-26 23:28:36,445 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 16702 transitions. Word has length 133 [2018-10-26 23:28:36,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:36,446 INFO L481 AbstractCegarLoop]: Abstraction has 12168 states and 16702 transitions. [2018-10-26 23:28:36,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:28:36,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 16702 transitions. [2018-10-26 23:28:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:28:36,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:36,492 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-10-26 23:28:36,493 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:36,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:36,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1964674474, now seen corresponding path program 1 times [2018-10-26 23:28:36,493 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:36,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:36,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:36,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-10-26 23:28:36,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:28:36,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:28:36,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:28:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:28:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:28:36,898 INFO L87 Difference]: Start difference. First operand 12168 states and 16702 transitions. Second operand 6 states. [2018-10-26 23:28:37,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:37,454 INFO L93 Difference]: Finished difference Result 23708 states and 31974 transitions. [2018-10-26 23:28:37,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:28:37,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2018-10-26 23:28:37,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:37,490 INFO L225 Difference]: With dead ends: 23708 [2018-10-26 23:28:37,491 INFO L226 Difference]: Without dead ends: 12264 [2018-10-26 23:28:37,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:28:37,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12264 states. [2018-10-26 23:28:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12264 to 12168. [2018-10-26 23:28:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-10-26 23:28:38,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 16670 transitions. [2018-10-26 23:28:38,241 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 16670 transitions. Word has length 133 [2018-10-26 23:28:38,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:38,241 INFO L481 AbstractCegarLoop]: Abstraction has 12168 states and 16670 transitions. [2018-10-26 23:28:38,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:28:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 16670 transitions. [2018-10-26 23:28:38,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 23:28:38,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:38,260 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-10-26 23:28:38,260 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:38,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:38,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1263609896, now seen corresponding path program 1 times [2018-10-26 23:28:38,261 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:38,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:38,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:38,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:38,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:38,546 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:38,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:38,547 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:38,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:38,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:38,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:38,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2018-10-26 23:28:38,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:28:38,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:28:38,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:28:38,852 INFO L87 Difference]: Start difference. First operand 12168 states and 16670 transitions. Second operand 9 states. [2018-10-26 23:28:39,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:39,994 INFO L93 Difference]: Finished difference Result 28172 states and 38677 transitions. [2018-10-26 23:28:39,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 23:28:39,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-10-26 23:28:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:40,026 INFO L225 Difference]: With dead ends: 28172 [2018-10-26 23:28:40,026 INFO L226 Difference]: Without dead ends: 16302 [2018-10-26 23:28:40,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2018-10-26 23:28:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16302 states. [2018-10-26 23:28:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16302 to 12657. [2018-10-26 23:28:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12657 states. [2018-10-26 23:28:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12657 states to 12657 states and 17408 transitions. [2018-10-26 23:28:40,808 INFO L78 Accepts]: Start accepts. Automaton has 12657 states and 17408 transitions. Word has length 133 [2018-10-26 23:28:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:40,809 INFO L481 AbstractCegarLoop]: Abstraction has 12657 states and 17408 transitions. [2018-10-26 23:28:40,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:28:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 12657 states and 17408 transitions. [2018-10-26 23:28:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 23:28:40,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:40,837 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-10-26 23:28:40,838 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:40,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash -2119885873, now seen corresponding path program 1 times [2018-10-26 23:28:40,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:40,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:40,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:40,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 23:28:41,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:41,019 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:41,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-26 23:28:41,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:41,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2018-10-26 23:28:41,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:28:41,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:28:41,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:28:41,262 INFO L87 Difference]: Start difference. First operand 12657 states and 17408 transitions. Second operand 10 states. [2018-10-26 23:28:43,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:43,480 INFO L93 Difference]: Finished difference Result 37072 states and 51266 transitions. [2018-10-26 23:28:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:28:43,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2018-10-26 23:28:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:43,544 INFO L225 Difference]: With dead ends: 37072 [2018-10-26 23:28:43,544 INFO L226 Difference]: Without dead ends: 24863 [2018-10-26 23:28:43,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-10-26 23:28:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24863 states. [2018-10-26 23:28:44,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24863 to 23303. [2018-10-26 23:28:44,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23303 states. [2018-10-26 23:28:44,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23303 states to 23303 states and 31733 transitions. [2018-10-26 23:28:44,777 INFO L78 Accepts]: Start accepts. Automaton has 23303 states and 31733 transitions. Word has length 142 [2018-10-26 23:28:44,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:44,778 INFO L481 AbstractCegarLoop]: Abstraction has 23303 states and 31733 transitions. [2018-10-26 23:28:44,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:28:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 23303 states and 31733 transitions. [2018-10-26 23:28:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-26 23:28:44,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:44,815 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-10-26 23:28:44,815 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:44,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:44,816 INFO L82 PathProgramCache]: Analyzing trace with hash -837713587, now seen corresponding path program 1 times [2018-10-26 23:28:44,816 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:44,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:44,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-26 23:28:45,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:45,041 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:45,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-10-26 23:28:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:28:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2018-10-26 23:28:45,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-26 23:28:45,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-26 23:28:45,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-10-26 23:28:45,234 INFO L87 Difference]: Start difference. First operand 23303 states and 31733 transitions. Second operand 18 states. [2018-10-26 23:28:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:48,147 INFO L93 Difference]: Finished difference Result 47438 states and 67903 transitions. [2018-10-26 23:28:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-26 23:28:48,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-26 23:28:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:48,229 INFO L225 Difference]: With dead ends: 47438 [2018-10-26 23:28:48,229 INFO L226 Difference]: Without dead ends: 24539 [2018-10-26 23:28:48,265 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-10-26 23:28:48,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24539 states. [2018-10-26 23:28:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24539 to 21931. [2018-10-26 23:28:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21931 states. [2018-10-26 23:28:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21931 states to 21931 states and 29813 transitions. [2018-10-26 23:28:49,508 INFO L78 Accepts]: Start accepts. Automaton has 21931 states and 29813 transitions. Word has length 142 [2018-10-26 23:28:49,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:49,508 INFO L481 AbstractCegarLoop]: Abstraction has 21931 states and 29813 transitions. [2018-10-26 23:28:49,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-26 23:28:49,509 INFO L276 IsEmpty]: Start isEmpty. Operand 21931 states and 29813 transitions. [2018-10-26 23:28:49,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-26 23:28:49,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:49,534 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-10-26 23:28:49,534 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:49,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1745548876, now seen corresponding path program 1 times [2018-10-26 23:28:49,535 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:49,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:49,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:49,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:49,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:49,743 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2018-10-26 23:28:49,762 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:49,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:49,763 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:49,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:49,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:49,899 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-10-26 23:28:49,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 23:28:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 23:28:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:28:49,930 INFO L87 Difference]: Start difference. First operand 21931 states and 29813 transitions. Second operand 11 states. [2018-10-26 23:28:51,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:51,435 INFO L93 Difference]: Finished difference Result 39611 states and 54904 transitions. [2018-10-26 23:28:51,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 23:28:51,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2018-10-26 23:28:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:51,473 INFO L225 Difference]: With dead ends: 39611 [2018-10-26 23:28:51,474 INFO L226 Difference]: Without dead ends: 17910 [2018-10-26 23:28:51,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:28:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-10-26 23:28:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 17384. [2018-10-26 23:28:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17384 states. [2018-10-26 23:28:52,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17384 states to 17384 states and 22499 transitions. [2018-10-26 23:28:52,434 INFO L78 Accepts]: Start accepts. Automaton has 17384 states and 22499 transitions. Word has length 143 [2018-10-26 23:28:52,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:52,434 INFO L481 AbstractCegarLoop]: Abstraction has 17384 states and 22499 transitions. [2018-10-26 23:28:52,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 23:28:52,434 INFO L276 IsEmpty]: Start isEmpty. Operand 17384 states and 22499 transitions. [2018-10-26 23:28:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 23:28:52,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:52,452 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-10-26 23:28:52,452 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:52,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -371199058, now seen corresponding path program 1 times [2018-10-26 23:28:52,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:52,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:52,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-26 23:28:52,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:52,609 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:52,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:52,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:28:52,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:28:52,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-26 23:28:52,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:28:52,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:28:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:28:52,712 INFO L87 Difference]: Start difference. First operand 17384 states and 22499 transitions. Second operand 4 states. [2018-10-26 23:28:53,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:53,637 INFO L93 Difference]: Finished difference Result 33824 states and 44184 transitions. [2018-10-26 23:28:53,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:28:53,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-10-26 23:28:53,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:53,671 INFO L225 Difference]: With dead ends: 33824 [2018-10-26 23:28:53,671 INFO L226 Difference]: Without dead ends: 16936 [2018-10-26 23:28:53,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:28:53,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16936 states. [2018-10-26 23:28:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16936 to 16936. [2018-10-26 23:28:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16936 states. [2018-10-26 23:28:54,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16936 states to 16936 states and 21629 transitions. [2018-10-26 23:28:54,532 INFO L78 Accepts]: Start accepts. Automaton has 16936 states and 21629 transitions. Word has length 148 [2018-10-26 23:28:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:54,532 INFO L481 AbstractCegarLoop]: Abstraction has 16936 states and 21629 transitions. [2018-10-26 23:28:54,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:28:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16936 states and 21629 transitions. [2018-10-26 23:28:54,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-26 23:28:54,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:54,547 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-10-26 23:28:54,547 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:54,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:54,547 INFO L82 PathProgramCache]: Analyzing trace with hash -97223186, now seen corresponding path program 1 times [2018-10-26 23:28:54,547 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:54,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:54,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:54,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:54,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:54,760 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2018-10-26 23:28:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:54,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:54,780 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:54,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:54,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:28:54,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:28:54,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2018-10-26 23:28:54,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-26 23:28:54,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-26 23:28:54,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:28:54,922 INFO L87 Difference]: Start difference. First operand 16936 states and 21629 transitions. Second operand 11 states. [2018-10-26 23:28:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:55,979 INFO L93 Difference]: Finished difference Result 31319 states and 40532 transitions. [2018-10-26 23:28:55,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 23:28:55,979 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 148 [2018-10-26 23:28:55,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:56,007 INFO L225 Difference]: With dead ends: 31319 [2018-10-26 23:28:56,007 INFO L226 Difference]: Without dead ends: 14986 [2018-10-26 23:28:56,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:28:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14986 states. [2018-10-26 23:28:56,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14986 to 14666. [2018-10-26 23:28:56,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14666 states. [2018-10-26 23:28:56,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14666 states to 14666 states and 18136 transitions. [2018-10-26 23:28:56,675 INFO L78 Accepts]: Start accepts. Automaton has 14666 states and 18136 transitions. Word has length 148 [2018-10-26 23:28:56,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:56,675 INFO L481 AbstractCegarLoop]: Abstraction has 14666 states and 18136 transitions. [2018-10-26 23:28:56,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-26 23:28:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 14666 states and 18136 transitions. [2018-10-26 23:28:56,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 23:28:56,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:56,687 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-10-26 23:28:56,687 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:56,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:56,687 INFO L82 PathProgramCache]: Analyzing trace with hash 724172170, now seen corresponding path program 1 times [2018-10-26 23:28:56,687 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:56,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:56,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:56,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 23:28:56,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:28:56,847 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:28:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:56,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:28:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-26 23:28:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:28:56,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-10-26 23:28:56,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:28:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:28:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:28:56,961 INFO L87 Difference]: Start difference. First operand 14666 states and 18136 transitions. Second operand 4 states. [2018-10-26 23:28:57,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:28:57,799 INFO L93 Difference]: Finished difference Result 27564 states and 34437 transitions. [2018-10-26 23:28:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:28:57,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-10-26 23:28:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:28:57,833 INFO L225 Difference]: With dead ends: 27564 [2018-10-26 23:28:57,833 INFO L226 Difference]: Without dead ends: 13802 [2018-10-26 23:28:57,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:28:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13802 states. [2018-10-26 23:28:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13802 to 13802. [2018-10-26 23:28:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13802 states. [2018-10-26 23:28:58,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13802 states to 13802 states and 16772 transitions. [2018-10-26 23:28:58,466 INFO L78 Accepts]: Start accepts. Automaton has 13802 states and 16772 transitions. Word has length 153 [2018-10-26 23:28:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:28:58,466 INFO L481 AbstractCegarLoop]: Abstraction has 13802 states and 16772 transitions. [2018-10-26 23:28:58,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:28:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13802 states and 16772 transitions. [2018-10-26 23:28:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 23:28:58,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:28:58,477 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-10-26 23:28:58,478 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:28:58,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:28:58,478 INFO L82 PathProgramCache]: Analyzing trace with hash 627489610, now seen corresponding path program 1 times [2018-10-26 23:28:58,478 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:28:58,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:28:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:58,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:28:58,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:28:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:28:58,703 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 6 DAG size of output: 5 [2018-10-26 23:28:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-26 23:28:58,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:28:58,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:28:58,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:28:58,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:28:58,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:28:58,723 INFO L87 Difference]: Start difference. First operand 13802 states and 16772 transitions. Second operand 5 states. [2018-10-26 23:29:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:01,113 INFO L93 Difference]: Finished difference Result 48590 states and 59377 transitions. [2018-10-26 23:29:01,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:29:01,114 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2018-10-26 23:29:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:01,194 INFO L225 Difference]: With dead ends: 48590 [2018-10-26 23:29:01,194 INFO L226 Difference]: Without dead ends: 36944 [2018-10-26 23:29:01,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:29:01,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36944 states. [2018-10-26 23:29:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36944 to 36938. [2018-10-26 23:29:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36938 states. [2018-10-26 23:29:03,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36938 states to 36938 states and 44786 transitions. [2018-10-26 23:29:03,334 INFO L78 Accepts]: Start accepts. Automaton has 36938 states and 44786 transitions. Word has length 153 [2018-10-26 23:29:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:03,334 INFO L481 AbstractCegarLoop]: Abstraction has 36938 states and 44786 transitions. [2018-10-26 23:29:03,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:29:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36938 states and 44786 transitions. [2018-10-26 23:29:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-26 23:29:03,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:03,359 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-10-26 23:29:03,360 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:03,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:03,360 INFO L82 PathProgramCache]: Analyzing trace with hash -398865530, now seen corresponding path program 1 times [2018-10-26 23:29:03,360 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:03,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:03,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:03,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:29:03,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:03,751 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:29:03,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:03,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 23:29:04,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-26 23:29:04,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2018-10-26 23:29:04,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 23:29:04,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 23:29:04,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:29:04,407 INFO L87 Difference]: Start difference. First operand 36938 states and 44786 transitions. Second operand 9 states. [2018-10-26 23:29:04,797 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-26 23:29:09,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:09,066 INFO L93 Difference]: Finished difference Result 103701 states and 126581 transitions. [2018-10-26 23:29:09,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:29:09,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2018-10-26 23:29:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:09,212 INFO L225 Difference]: With dead ends: 103701 [2018-10-26 23:29:09,212 INFO L226 Difference]: Without dead ends: 66895 [2018-10-26 23:29:09,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2018-10-26 23:29:09,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66895 states. [2018-10-26 23:29:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66895 to 55933. [2018-10-26 23:29:12,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55933 states. [2018-10-26 23:29:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55933 states to 55933 states and 66127 transitions. [2018-10-26 23:29:12,623 INFO L78 Accepts]: Start accepts. Automaton has 55933 states and 66127 transitions. Word has length 158 [2018-10-26 23:29:12,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:12,623 INFO L481 AbstractCegarLoop]: Abstraction has 55933 states and 66127 transitions. [2018-10-26 23:29:12,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 23:29:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 55933 states and 66127 transitions. [2018-10-26 23:29:12,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:29:12,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:12,645 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, 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] [2018-10-26 23:29:12,645 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:12,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:12,645 INFO L82 PathProgramCache]: Analyzing trace with hash -29264883, now seen corresponding path program 1 times [2018-10-26 23:29:12,646 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:12,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:12,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:12,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-10-26 23:29:12,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:12,942 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:29:12,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:13,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:13,041 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:29:13,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:29:13,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-26 23:29:13,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:29:13,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:29:13,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:29:13,060 INFO L87 Difference]: Start difference. First operand 55933 states and 66127 transitions. Second operand 6 states. [2018-10-26 23:29:16,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:16,549 INFO L93 Difference]: Finished difference Result 111853 states and 133320 transitions. [2018-10-26 23:29:16,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:29:16,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-10-26 23:29:16,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:16,646 INFO L225 Difference]: With dead ends: 111853 [2018-10-26 23:29:16,646 INFO L226 Difference]: Without dead ends: 56721 [2018-10-26 23:29:16,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:29:16,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56721 states. [2018-10-26 23:29:18,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56721 to 42030. [2018-10-26 23:29:18,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42030 states. [2018-10-26 23:29:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42030 states to 42030 states and 49646 transitions. [2018-10-26 23:29:19,044 INFO L78 Accepts]: Start accepts. Automaton has 42030 states and 49646 transitions. Word has length 178 [2018-10-26 23:29:19,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:19,044 INFO L481 AbstractCegarLoop]: Abstraction has 42030 states and 49646 transitions. [2018-10-26 23:29:19,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:29:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states and 49646 transitions. [2018-10-26 23:29:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 23:29:19,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:19,065 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] [2018-10-26 23:29:19,066 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1367882433, now seen corresponding path program 1 times [2018-10-26 23:29:19,066 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:19,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:19,265 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-26 23:29:19,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:19,265 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:29:19,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:19,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:29:19,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:29:19,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2018-10-26 23:29:19,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:29:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:29:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:29:19,412 INFO L87 Difference]: Start difference. First operand 42030 states and 49646 transitions. Second operand 7 states. [2018-10-26 23:29:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:21,173 INFO L93 Difference]: Finished difference Result 63019 states and 74726 transitions. [2018-10-26 23:29:21,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:29:21,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 178 [2018-10-26 23:29:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:21,228 INFO L225 Difference]: With dead ends: 63019 [2018-10-26 23:29:21,228 INFO L226 Difference]: Without dead ends: 21649 [2018-10-26 23:29:21,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:29:21,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21649 states. [2018-10-26 23:29:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21649 to 21475. [2018-10-26 23:29:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21475 states. [2018-10-26 23:29:22,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21475 states to 21475 states and 25124 transitions. [2018-10-26 23:29:22,498 INFO L78 Accepts]: Start accepts. Automaton has 21475 states and 25124 transitions. Word has length 178 [2018-10-26 23:29:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:22,499 INFO L481 AbstractCegarLoop]: Abstraction has 21475 states and 25124 transitions. [2018-10-26 23:29:22,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:29:22,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21475 states and 25124 transitions. [2018-10-26 23:29:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 23:29:22,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:22,513 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-10-26 23:29:22,513 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:22,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:22,514 INFO L82 PathProgramCache]: Analyzing trace with hash -328506733, now seen corresponding path program 1 times [2018-10-26 23:29:22,514 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:22,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:22,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:22,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:22,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:23,015 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-26 23:29:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-10-26 23:29:23,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:23,058 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:29:23,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:23,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:29:23,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:29:23,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2018-10-26 23:29:23,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-26 23:29:23,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-26 23:29:23,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:29:23,320 INFO L87 Difference]: Start difference. First operand 21475 states and 25124 transitions. Second operand 12 states. [2018-10-26 23:29:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:25,124 INFO L93 Difference]: Finished difference Result 36029 states and 42486 transitions. [2018-10-26 23:29:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-26 23:29:25,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-10-26 23:29:25,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:25,151 INFO L225 Difference]: With dead ends: 36029 [2018-10-26 23:29:25,151 INFO L226 Difference]: Without dead ends: 15007 [2018-10-26 23:29:25,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-10-26 23:29:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2018-10-26 23:29:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 7300. [2018-10-26 23:29:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7300 states. [2018-10-26 23:29:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7300 states to 7300 states and 8191 transitions. [2018-10-26 23:29:27,065 INFO L78 Accepts]: Start accepts. Automaton has 7300 states and 8191 transitions. Word has length 179 [2018-10-26 23:29:27,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:27,065 INFO L481 AbstractCegarLoop]: Abstraction has 7300 states and 8191 transitions. [2018-10-26 23:29:27,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-26 23:29:27,066 INFO L276 IsEmpty]: Start isEmpty. Operand 7300 states and 8191 transitions. [2018-10-26 23:29:27,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-26 23:29:27,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:27,069 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-10-26 23:29:27,069 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:27,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:27,069 INFO L82 PathProgramCache]: Analyzing trace with hash -263820910, now seen corresponding path program 1 times [2018-10-26 23:29:27,070 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:27,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:27,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:27,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-26 23:29:27,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:27,229 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/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-10-26 23:29:27,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:27,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:27,530 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:29:27,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:29:27,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-10-26 23:29:27,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:29:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:29:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:29:27,548 INFO L87 Difference]: Start difference. First operand 7300 states and 8191 transitions. Second operand 8 states. [2018-10-26 23:29:28,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:28,239 INFO L93 Difference]: Finished difference Result 11359 states and 12760 transitions. [2018-10-26 23:29:28,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:29:28,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2018-10-26 23:29:28,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:28,251 INFO L225 Difference]: With dead ends: 11359 [2018-10-26 23:29:28,251 INFO L226 Difference]: Without dead ends: 4557 [2018-10-26 23:29:28,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-10-26 23:29:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-10-26 23:29:28,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4509. [2018-10-26 23:29:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4509 states. [2018-10-26 23:29:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 4996 transitions. [2018-10-26 23:29:28,877 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 4996 transitions. Word has length 180 [2018-10-26 23:29:28,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:28,878 INFO L481 AbstractCegarLoop]: Abstraction has 4509 states and 4996 transitions. [2018-10-26 23:29:28,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:29:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 4996 transitions. [2018-10-26 23:29:28,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 23:29:28,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:28,880 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-10-26 23:29:28,881 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:28,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:28,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1041738037, now seen corresponding path program 1 times [2018-10-26 23:29:28,881 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:28,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:28,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:28,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:28,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-10-26 23:29:29,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:29:29,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:29:29,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:29:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:29:29,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:29:29,144 INFO L87 Difference]: Start difference. First operand 4509 states and 4996 transitions. Second operand 5 states. [2018-10-26 23:29:29,378 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-26 23:29:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:30,928 INFO L93 Difference]: Finished difference Result 13945 states and 15849 transitions. [2018-10-26 23:29:30,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:29:30,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2018-10-26 23:29:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:30,951 INFO L225 Difference]: With dead ends: 13945 [2018-10-26 23:29:30,951 INFO L226 Difference]: Without dead ends: 11296 [2018-10-26 23:29:30,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:29:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2018-10-26 23:29:31,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 10003. [2018-10-26 23:29:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10003 states. [2018-10-26 23:29:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10003 states to 10003 states and 11256 transitions. [2018-10-26 23:29:31,925 INFO L78 Accepts]: Start accepts. Automaton has 10003 states and 11256 transitions. Word has length 181 [2018-10-26 23:29:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:31,925 INFO L481 AbstractCegarLoop]: Abstraction has 10003 states and 11256 transitions. [2018-10-26 23:29:31,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:29:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 10003 states and 11256 transitions. [2018-10-26 23:29:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-26 23:29:31,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:29:31,929 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-10-26 23:29:31,929 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:29:31,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:29:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1686471309, now seen corresponding path program 1 times [2018-10-26 23:29:31,930 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 23:29:31,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 23:29:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:31,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:29:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:32,473 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 23:29:32,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:29:32,473 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 23:29:32,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:29:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:29:32,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 23:29:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-26 23:29:32,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:29:32,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-10-26 23:29:32,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:29:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:29:32,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:29:32,800 INFO L87 Difference]: Start difference. First operand 10003 states and 11256 transitions. Second operand 8 states. [2018-10-26 23:29:33,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:29:33,218 INFO L93 Difference]: Finished difference Result 11345 states and 12703 transitions. [2018-10-26 23:29:33,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:29:33,219 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2018-10-26 23:29:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:29:33,220 INFO L225 Difference]: With dead ends: 11345 [2018-10-26 23:29:33,220 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:29:33,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:29:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:29:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:29:33,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:29:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:29:33,232 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 181 [2018-10-26 23:29:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:29:33,232 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:29:33,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:29:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:29:33,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:29:33,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:29:33,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,460 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,529 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,557 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,641 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,674 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 193 [2018-10-26 23:29:33,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,978 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:33,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,281 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,415 WARN L179 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 369 DAG size of output: 234 [2018-10-26 23:29:34,620 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,631 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,693 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:34,982 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 295 DAG size of output: 193 [2018-10-26 23:29:35,565 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,687 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:35,948 WARN L179 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 248 [2018-10-26 23:29:36,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:36,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:36,803 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:36,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,489 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,516 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,599 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,656 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,686 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,710 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,744 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:37,835 WARN L179 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 386 DAG size of output: 248 [2018-10-26 23:29:38,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,498 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:38,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,684 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,690 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,752 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,810 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,842 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,967 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:40,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:41,096 WARN L179 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 345 DAG size of output: 223 [2018-10-26 23:29:41,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:42,682 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2018-10-26 23:29:42,791 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 285 [2018-10-26 23:29:43,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,373 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,458 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,527 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,555 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,587 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,595 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 221 [2018-10-26 23:29:43,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:43,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:44,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:44,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:44,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:44,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:44,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,778 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:45,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:29:46,443 WARN L179 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 113 [2018-10-26 23:29:47,111 WARN L179 SmtUtils]: Spent 664.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 119 [2018-10-26 23:29:48,112 WARN L179 SmtUtils]: Spent 987.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 133 [2018-10-26 23:29:48,999 WARN L179 SmtUtils]: Spent 815.00 ms on a formula simplification. DAG size of input: 244 DAG size of output: 122 [2018-10-26 23:29:50,861 WARN L179 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 272 DAG size of output: 115 [2018-10-26 23:29:51,522 WARN L179 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 214 DAG size of output: 119 [2018-10-26 23:29:54,624 WARN L179 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 345 DAG size of output: 99 [2018-10-26 23:29:54,804 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 112 [2018-10-26 23:29:56,032 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 255 DAG size of output: 138 [2018-10-26 23:29:56,317 WARN L179 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 115 [2018-10-26 23:29:58,685 WARN L179 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 321 DAG size of output: 105 [2018-10-26 23:30:01,642 WARN L179 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 346 DAG size of output: 100 [2018-10-26 23:30:02,873 WARN L179 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 255 DAG size of output: 138 [2018-10-26 23:30:03,262 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 1 [2018-10-26 23:30:03,402 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 75 [2018-10-26 23:30:04,444 WARN L179 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 289 DAG size of output: 68 [2018-10-26 23:30:07,213 WARN L179 SmtUtils]: Spent 2.76 s on a formula simplification. DAG size of input: 345 DAG size of output: 99 [2018-10-26 23:30:07,552 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 66 [2018-10-26 23:30:08,894 WARN L179 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 249 DAG size of output: 90 [2018-10-26 23:30:10,211 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 397 DAG size of output: 80 [2018-10-26 23:30:11,334 WARN L179 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 193 DAG size of output: 142 [2018-10-26 23:30:14,215 WARN L179 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 355 DAG size of output: 119 [2018-10-26 23:30:15,152 WARN L179 SmtUtils]: Spent 934.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 125 [2018-10-26 23:30:16,654 WARN L179 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 210 DAG size of output: 103 [2018-10-26 23:30:16,869 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 343 DAG size of output: 1 [2018-10-26 23:30:19,294 WARN L179 SmtUtils]: Spent 2.42 s on a formula simplification. DAG size of input: 323 DAG size of output: 117 [2018-10-26 23:30:19,475 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 112 [2018-10-26 23:30:19,647 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 83 [2018-10-26 23:30:21,166 WARN L179 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 298 DAG size of output: 91 [2018-10-26 23:30:21,338 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2018-10-26 23:30:27,651 WARN L179 SmtUtils]: Spent 6.30 s on a formula simplification. DAG size of input: 622 DAG size of output: 270 [2018-10-26 23:30:27,834 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 114 [2018-10-26 23:30:28,814 WARN L179 SmtUtils]: Spent 978.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 134 [2018-10-26 23:30:28,983 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 113 [2018-10-26 23:30:31,964 WARN L179 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 364 DAG size of output: 112 [2018-10-26 23:30:32,954 WARN L179 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 125 [2018-10-26 23:30:33,435 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 284 DAG size of output: 1 [2018-10-26 23:30:33,830 WARN L179 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 318 DAG size of output: 1 [2018-10-26 23:30:36,679 WARN L179 SmtUtils]: Spent 2.84 s on a formula simplification. DAG size of input: 361 DAG size of output: 156 [2018-10-26 23:30:39,223 WARN L179 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 325 DAG size of output: 117 [2018-10-26 23:30:41,180 WARN L179 SmtUtils]: Spent 1.95 s on a formula simplification. DAG size of input: 305 DAG size of output: 151 [2018-10-26 23:30:41,352 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 109 [2018-10-26 23:30:42,966 WARN L179 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 253 DAG size of output: 100 [2018-10-26 23:30:43,857 WARN L179 SmtUtils]: Spent 886.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 131 [2018-10-26 23:30:45,722 WARN L179 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 314 DAG size of output: 150 [2018-10-26 23:30:46,056 WARN L179 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 115 [2018-10-26 23:30:49,297 WARN L179 SmtUtils]: Spent 3.23 s on a formula simplification. DAG size of input: 355 DAG size of output: 119 [2018-10-26 23:30:49,300 INFO L421 ceAbstractionStarter]: At program point activate_threadsENTRY(lines 373 388) the Hoare annotation is: (let ((.cse26 (= 1 ~b0_ev~0))) (let ((.cse14 (< 0 ~d0_ev~0)) (.cse15 (= 0 ~d0_ev~0)) (.cse25 (= ~b1_ev~0 1)) (.cse28 (< ~d0_ev~0 2)) (.cse23 (not (= 1 ~d1_ev~0))) (.cse24 (= 0 ~b0_ev~0)) (.cse27 (< 0 ~b0_ev~0)) (.cse9 (< 0 ~z_val~0)) (.cse12 (< ~z_val~0 0)) (.cse2 (= ~b1_req_up~0 1)) (.cse3 (< 0 ~z_req_up~0)) (.cse4 (< 1 ~d1_ev~0)) (.cse5 (= ~b1_ev~0 0)) (.cse6 (< |old(~comp_m1_st~0)| 2)) (.cse8 (< ~z_ev~0 2)) (.cse10 (= ~b0_req_up~0 1)) (.cse11 (< 0 ~comp_m1_i~0)) (.cse29 (not (= 1 ~d0_ev~0))) (.cse13 (not .cse26)) (.cse7 (< ~d1_val_t~0 1)) (.cse19 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse16 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse17 (< ~b1_val_t~0 1)) (.cse18 (< ~d0_val_t~0 1)) (.cse20 (< ~b0_val~0 ~b0_val_t~0)) (.cse21 (not (= ~z_val~0 ~z_val_t~0))) (.cse22 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse19 (or .cse5 .cse10 .cse11 .cse17 .cse14 .cse15 .cse23 .cse2 .cse1 .cse24 .cse18 .cse20 .cse6 .cse22 .cse7 .cse8 .cse25 .cse9 .cse0 .cse26 .cse16 .cse12)) (or .cse5 .cse10 .cse11 .cse17 .cse14 .cse15 .cse21 .cse2 .cse1 .cse24 .cse18 .cse20 .cse27 .cse6 .cse22 .cse19 .cse7 .cse8 .cse25 .cse9 .cse0 .cse16 .cse12) (or .cse4 .cse10 .cse11 .cse17 .cse14 .cse15 .cse21 .cse2 .cse1 .cse24 .cse18 .cse19 .cse3 .cse20 .cse27 .cse6 .cse22 .cse7 .cse8 .cse9 (not .cse25) .cse0 .cse16 .cse12) (or .cse0 .cse1 .cse19 .cse17 (and (or (or .cse2 (< ~b0_ev~0 2) .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) .cse16 .cse18 .cse20 .cse22) (or .cse2 .cse24 .cse18 .cse20 .cse5 .cse6 .cse22 .cse7 .cse25 .cse8 .cse9 .cse28 .cse10 .cse11 .cse26 .cse16 .cse12)) .cse21) (or .cse19 (or .cse0 .cse1 (or .cse2 .cse24 .cse18 .cse20 .cse5 .cse6 .cse22 .cse7 .cse25 .cse8 .cse9 .cse28 .cse10 .cse11 .cse26 .cse16 .cse12 .cse23) .cse17)) (or .cse19 .cse0 .cse1 (or .cse2 .cse24 .cse18 .cse3 .cse20 .cse27 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse16 .cse12) .cse17 .cse21) (or (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse29 .cse13) .cse7 (not (= ~z_val~0 0)) .cse19 .cse0 .cse1 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22)))) [2018-10-26 23:30:49,300 INFO L425 ceAbstractionStarter]: For program point L380(lines 380 384) no Hoare annotation was computed. [2018-10-26 23:30:49,300 INFO L425 ceAbstractionStarter]: For program point activate_threadsEXIT(lines 373 388) no Hoare annotation was computed. [2018-10-26 23:30:49,301 INFO L421 ceAbstractionStarter]: At program point L378(line 378) the Hoare annotation is: (let ((.cse26 (= 1 ~b0_ev~0))) (let ((.cse14 (< 0 ~d0_ev~0)) (.cse15 (= 0 ~d0_ev~0)) (.cse25 (= ~b1_ev~0 1)) (.cse28 (< ~d0_ev~0 2)) (.cse23 (not (= 1 ~d1_ev~0))) (.cse24 (= 0 ~b0_ev~0)) (.cse27 (< 0 ~b0_ev~0)) (.cse9 (< 0 ~z_val~0)) (.cse12 (< ~z_val~0 0)) (.cse2 (= ~b1_req_up~0 1)) (.cse3 (< 0 ~z_req_up~0)) (.cse4 (< 1 ~d1_ev~0)) (.cse5 (= ~b1_ev~0 0)) (.cse6 (< |old(~comp_m1_st~0)| 2)) (.cse8 (< ~z_ev~0 2)) (.cse10 (= ~b0_req_up~0 1)) (.cse11 (< 0 ~comp_m1_i~0)) (.cse29 (not (= 1 ~d0_ev~0))) (.cse13 (not .cse26)) (.cse7 (< ~d1_val_t~0 1)) (.cse19 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse16 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse17 (< ~b1_val_t~0 1)) (.cse18 (< ~d0_val_t~0 1)) (.cse20 (< ~b0_val~0 ~b0_val_t~0)) (.cse21 (not (= ~z_val~0 ~z_val_t~0))) (.cse22 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (or .cse19 (or .cse5 .cse10 .cse11 .cse17 .cse14 .cse15 .cse23 .cse2 .cse1 .cse24 .cse18 .cse20 .cse6 .cse22 .cse7 .cse8 .cse25 .cse9 .cse0 .cse26 .cse16 .cse12)) (or .cse5 .cse10 .cse11 .cse17 .cse14 .cse15 .cse21 .cse2 .cse1 .cse24 .cse18 .cse20 .cse27 .cse6 .cse22 .cse19 .cse7 .cse8 .cse25 .cse9 .cse0 .cse16 .cse12) (or .cse4 .cse10 .cse11 .cse17 .cse14 .cse15 .cse21 .cse2 .cse1 .cse24 .cse18 .cse19 .cse3 .cse20 .cse27 .cse6 .cse22 .cse7 .cse8 .cse9 (not .cse25) .cse0 .cse16 .cse12) (or .cse0 .cse1 .cse19 .cse17 (and (or (or .cse2 (< ~b0_ev~0 2) .cse5 .cse6 .cse7 .cse25 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15) .cse16 .cse18 .cse20 .cse22) (or .cse2 .cse24 .cse18 .cse20 .cse5 .cse6 .cse22 .cse7 .cse25 .cse8 .cse9 .cse28 .cse10 .cse11 .cse26 .cse16 .cse12)) .cse21) (or .cse19 (or .cse0 .cse1 (or .cse2 .cse24 .cse18 .cse20 .cse5 .cse6 .cse22 .cse7 .cse25 .cse8 .cse9 .cse28 .cse10 .cse11 .cse26 .cse16 .cse12 .cse23) .cse17)) (or .cse19 .cse0 .cse1 (or .cse2 .cse24 .cse18 .cse3 .cse20 .cse27 .cse4 .cse5 .cse6 .cse22 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29 .cse16 .cse12) .cse17 .cse21) (or (or .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse10 .cse11 .cse29 .cse13) .cse7 (not (= ~z_val~0 0)) .cse19 .cse0 .cse1 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22)))) [2018-10-26 23:30:49,301 INFO L425 ceAbstractionStarter]: For program point L380-2(lines 373 388) no Hoare annotation was computed. [2018-10-26 23:30:49,301 INFO L425 ceAbstractionStarter]: For program point L378-1(line 378) no Hoare annotation was computed. [2018-10-26 23:30:49,301 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadEXIT(lines 254 268) no Hoare annotation was computed. [2018-10-26 23:30:49,301 INFO L421 ceAbstractionStarter]: At program point L265(lines 257 267) the Hoare annotation is: (let ((.cse27 (< ~d1_ev~0 2)) (.cse23 (< ~b0_ev~0 2)) (.cse12 (< 0 ~z_req_up~0)) (.cse26 (< ~d0_ev~0 2)) (.cse3 (not (= 0 ~comp_m1_st~0))) (.cse28 (< 0 ~b0_ev~0)) (.cse0 (<= 1 exists_runnable_thread_~__retres1~1)) (.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))) (.cse29 (= 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)) (.cse30 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (< ~z_ev~0 2)) (.cse25 (= ~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 (or .cse18 .cse9 .cse4 (and (or (or .cse8 .cse23 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26 .cse1 .cse2 .cse21 .cse3 .cse27) .cse20 .cse11 .cse13 .cse14) (or .cse20 (or .cse8 .cse23 .cse24 .cse15 .cse25 .cse16 .cse17 .cse1 .cse2 .cse21 .cse3 .cse27 .cse5 .cse6) .cse11 .cse13 .cse14) (or (or .cse8 .cse10 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26 .cse1 .cse2 .cse21 .cse3 .cse27) .cse20 .cse11 .cse13 .cse28 .cse14))) .cse0) (or (or (or .cse8 .cse10 .cse24 .cse25 .cse16 .cse1 .cse2 .cse3 .cse27 .cse5 .cse6) .cse15 (not (= ~z_val~0 0)) .cse18 .cse9 .cse20 .cse4 .cse11 .cse13 .cse28 .cse14) .cse0) (or .cse29 .cse18 .cse9 .cse4 (or .cse8 .cse10 .cse11 .cse13 .cse24 .cse30 .cse14 .cse15 .cse25 .cse16 .cse17 .cse26 .cse1 .cse2 .cse19 .cse20 .cse21 .cse22) .cse7) (or (and (or (or .cse8 .cse23 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26 .cse1 .cse2 .cse21 .cse3 .cse22) .cse20 .cse11 .cse13 .cse14) (or (or .cse8 .cse23 .cse12 .cse24 .cse15 .cse25 .cse16 .cse17 .cse1 .cse2 .cse21 .cse3 .cse5 .cse6 .cse22) .cse20 .cse11 .cse13 .cse14) (or .cse20 (or .cse8 .cse10 .cse24 .cse15 .cse25 .cse16 .cse17 .cse26 .cse1 .cse2 .cse21 .cse3 .cse22) .cse11 .cse13 .cse28 .cse14)) .cse0 .cse18 .cse9 .cse4 .cse7) (or .cse24 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse30 .cse14 .cse15 .cse16 .cse25 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) [2018-10-26 23:30:49,302 INFO L428 ceAbstractionStarter]: At program point exists_runnable_threadENTRY(lines 254 268) the Hoare annotation is: true [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L258(lines 258 263) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point exists_runnable_threadFINAL(lines 254 268) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L81(lines 81 85) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L81-2(lines 78 86) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L69(lines 41 91) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L421 ceAbstractionStarter]: At program point method1ENTRY(lines 36 92) the Hoare annotation is: (let ((.cse5 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse6 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse15 (< 0 |old(~z_req_up~0)|)) (.cse1 (< 1 ~d1_ev~0)) (.cse22 (= 1 ~b0_ev~0)) (.cse25 (= 1 ~d1_ev~0)) (.cse10 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse4 (= ~z_val~0 ~z_val_t~0)) (.cse26 (< ~b0_ev~0 2)) (.cse29 (< ~d0_ev~0 2)) (.cse30 (and .cse5 .cse6)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse12 (< ~b1_val~0 ~b1_val_t~0)) (.cse23 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse7 (< ~b1_val_t~0 1)) (.cse14 (< ~d0_val_t~0 1)) (.cse0 (= 0 |old(~comp_m1_st~0)|)) (.cse11 (= ~b1_req_up~0 1)) (.cse13 (= 0 ~b0_ev~0)) (.cse27 (= ~b1_ev~0 0)) (.cse18 (< ~d1_val_t~0 1)) (.cse28 (= ~b1_ev~0 1)) (.cse19 (< ~z_ev~0 2)) (.cse20 (< 0 ~z_val~0)) (.cse2 (= ~b0_req_up~0 1)) (.cse3 (< 0 ~comp_m1_i~0)) (.cse24 (< ~z_val~0 0)) (.cse31 (< ~d1_ev~0 2)) (.cse8 (< 0 ~d0_ev~0)) (.cse9 (= 0 ~d0_ev~0)) (.cse16 (< ~b0_val~0 ~b0_val_t~0)) (.cse32 (< 0 ~b0_ev~0)) (.cse17 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6) .cse7 .cse8 .cse9 (< ~b1_ev~0 2) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or .cse21 .cse12 (and (or (or .cse0 .cse11 .cse26 .cse15 .cse1 .cse27 .cse18 .cse28 .cse19 .cse20 .cse2 .cse3 .cse24 .cse8 .cse9 .cse25) .cse23 .cse14 .cse16 .cse17) (or .cse23 .cse14 .cse16 (or .cse0 .cse11 .cse13 .cse1 .cse27 .cse18 .cse28 .cse19 .cse20 .cse29 .cse2 .cse3 .cse22 .cse24 .cse25) .cse17)) .cse7 .cse10 (and .cse4 .cse30)) (or (or .cse21 .cse12 (and (or (or .cse0 .cse11 .cse13 .cse27 .cse18 .cse28 .cse19 .cse20 .cse29 .cse2 .cse3 .cse24 .cse31) .cse23 .cse14 .cse16 .cse32 .cse17) (or (or .cse0 .cse11 .cse26 .cse27 .cse18 .cse28 .cse19 .cse20 .cse2 .cse3 .cse24 .cse31 .cse8 .cse9) .cse23 .cse14 .cse16 .cse17) (or .cse23 .cse14 (or .cse0 .cse11 .cse26 .cse27 .cse18 .cse28 .cse19 .cse20 .cse29 .cse2 .cse3 .cse24 .cse31) .cse16 .cse17)) .cse7) .cse30) (or .cse30 (or .cse21 .cse12 .cse23 .cse7 .cse14 (or .cse0 .cse11 .cse13 .cse27 .cse18 .cse28 .cse19 .cse20 .cse2 .cse3 .cse24 .cse31 .cse8 .cse9) .cse16 .cse32 .cse17))))) [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point method1FINAL(lines 36 92) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L70(lines 70 74) no Hoare annotation was computed. [2018-10-26 23:30:49,302 INFO L425 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 41 91) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point method1EXIT(lines 36 92) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L63(lines 63 67) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L63-2(lines 41 91) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L51(lines 41 91) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L349-1(lines 343 371) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L421 ceAbstractionStarter]: At program point reset_delta_eventsENTRY(lines 340 372) the Hoare annotation is: (let ((.cse12 (= 1 |old(~b0_ev~0)|)) (.cse33 (= 1 |old(~d1_ev~0)|)) (.cse34 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse35 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse36 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse37 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse17 (not (= ~z_val~0 0))) (.cse21 (and .cse34 .cse35 (= 1 ~d0_ev~0) .cse36 .cse37)) (.cse24 (not (= 1 |old(~d0_ev~0)|))) (.cse29 (< 0 |old(~b0_ev~0)|)) (.cse30 (< ~comp_m1_st~0 2)) (.cse9 (< |old(~d0_ev~0)| 2)) (.cse15 (not .cse33)) (.cse2 (= 0 |old(~b0_ev~0)|)) (.cse7 (= |old(~b1_ev~0)| 1)) (.cse0 (and .cse34 .cse35 (= |old(~d0_ev~0)| ~d0_ev~0) .cse36 .cse37)) (.cse18 (< ~d1_val~0 ~d1_val_t~0)) (.cse19 (< ~b1_val~0 ~b1_val_t~0)) (.cse13 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (< ~b1_val_t~0 1)) (.cse3 (< ~d0_val_t~0 1)) (.cse1 (= ~b1_req_up~0 1)) (.cse22 (< 0 ~z_req_up~0)) (.cse23 (< 1 |old(~d1_ev~0)|)) (.cse5 (= |old(~b1_ev~0)| 0)) (.cse16 (< ~d1_val_t~0 1)) (.cse8 (< |old(~z_ev~0)| 2)) (.cse31 (< 0 ~z_val~0)) (.cse10 (= ~b0_req_up~0 1)) (.cse11 (< 0 ~comp_m1_i~0)) (.cse32 (< ~z_val~0 0)) (.cse14 (not (= 0 ~comp_m1_st~0))) (.cse25 (not .cse12)) (.cse27 (< 0 |old(~d0_ev~0)|)) (.cse28 (= 0 |old(~d0_ev~0)|)) (.cse4 (< ~b0_val~0 ~b0_val_t~0)) (.cse26 (not (= ~z_val~0 ~z_val_t~0))) (.cse6 (< ~b0_val_t~0 1))) (and (or .cse0 (or (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19 .cse20)) (or .cse21 (or .cse1 .cse22 .cse23 .cse5 .cse16 .cse8 .cse10 .cse11 .cse24 .cse14 .cse25) .cse17 .cse18 .cse19 .cse13 .cse20 .cse3 .cse4 .cse26 .cse6) (or .cse5 .cse10 .cse11 .cse20 .cse27 .cse28 .cse26 .cse1 .cse19 .cse2 .cse3 .cse4 .cse29 .cse30 .cse6 .cse0 .cse16 .cse8 .cse7 .cse31 .cse18 .cse13 .cse32 .cse33) (or .cse21 (or .cse1 .cse2 .cse3 .cse22 .cse4 .cse29 .cse23 .cse5 .cse6 .cse16 .cse8 .cse31 .cse10 .cse11 .cse24 .cse13 .cse32 .cse14) .cse18 .cse19 .cse20 .cse26) (or .cse23 .cse10 .cse11 .cse14 .cse20 .cse27 .cse28 .cse26 .cse0 .cse1 .cse19 .cse2 .cse3 .cse22 .cse4 .cse29 .cse6 .cse16 .cse8 .cse31 (not .cse7) .cse18 .cse13 .cse32) (or .cse18 .cse19 .cse0 .cse20 (and (or (or .cse1 (< |old(~b0_ev~0)| 2) .cse5 .cse30 .cse16 .cse7 .cse8 .cse31 .cse10 .cse11 .cse32 .cse27 .cse28 .cse33) .cse13 .cse3 .cse4 .cse6) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse30 .cse6 .cse16 .cse7 .cse8 .cse31 .cse9 .cse10 .cse11 .cse12 .cse13 .cse32 .cse33)) .cse26) (or .cse0 (or .cse5 .cse10 .cse11 .cse14 .cse20 .cse27 .cse28 .cse15 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse16 .cse8 .cse7 .cse31 .cse18 .cse12 .cse13 .cse32)) (or .cse0 .cse18 .cse19 .cse13 .cse20 .cse3 (or .cse1 .cse22 .cse23 .cse5 .cse16 .cse8 .cse31 .cse10 .cse11 .cse32 .cse14 .cse25 .cse27 .cse28) .cse4 .cse26 .cse6)))) [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L364-1(lines 340 372) no Hoare annotation was computed. [2018-10-26 23:30:49,303 INFO L425 ceAbstractionStarter]: For program point L354-1(lines 343 371) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point L344-1(lines 343 371) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point reset_delta_eventsEXIT(lines 340 372) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point L359-1(lines 343 371) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point init_threadsEXIT(lines 241 253) no Hoare annotation was computed. [2018-10-26 23:30:49,304 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-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point L245-1(lines 241 253) no Hoare annotation was computed. [2018-10-26 23:30:49,304 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) (= 1 |old(~d1_ev~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))) [2018-10-26 23:30:49,304 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-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 483 501) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point L491(lines 491 497) no Hoare annotation was computed. [2018-10-26 23:30:49,304 INFO L425 ceAbstractionStarter]: For program point L489(lines 486 500) no Hoare annotation was computed. [2018-10-26 23:30:49,305 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 483 501) no Hoare annotation was computed. [2018-10-26 23:30:49,305 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) (= 1 |old(~d1_ev~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))) [2018-10-26 23:30:49,305 INFO L421 ceAbstractionStarter]: At program point L488-1(line 488) the Hoare annotation is: (or (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)) (< 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-10-26 23:30:49,305 INFO L425 ceAbstractionStarter]: For program point errorEXIT(lines 5 12) no Hoare annotation was computed. [2018-10-26 23:30:49,305 INFO L425 ceAbstractionStarter]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2018-10-26 23:30:49,305 INFO L428 ceAbstractionStarter]: At program point errorENTRY(lines 5 12) the Hoare annotation is: true [2018-10-26 23:30:49,305 INFO L425 ceAbstractionStarter]: For program point errorFINAL(lines 5 12) no Hoare annotation was computed. [2018-10-26 23:30:49,305 INFO L425 ceAbstractionStarter]: For program point L187-1(lines 187 192) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point update_zEXIT(lines 183 197) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L421 ceAbstractionStarter]: At program point update_zENTRY(lines 183 197) the Hoare annotation is: (let ((.cse5 (= ~b1_req_up~0 1)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse4 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse6 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse14 (< ~b0_val_t~0 1)) (.cse15 (< ~d1_val_t~0 1)) (.cse16 (= ~b1_ev~0 1)) (.cse17 (< 0 |old(~z_val~0)|)) (.cse18 (= ~b0_req_up~0 1)) (.cse7 (< |old(~z_ev~0)| 2)) (.cse8 (< 0 ~comp_m1_i~0)) (.cse9 (= 0 ~b0_ev~0)) (.cse10 (= ~b1_ev~0 0)) (.cse11 (< ~comp_m1_st~0 2)) (.cse12 (= 1 ~d1_ev~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse19 (= 1 ~b0_ev~0)) (.cse20 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse21 (< |old(~z_val~0)| 0)) (.cse2 (< ~b1_val_t~0 1)) (.cse23 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse22 (< |old(~z_req_up~0)| 1))) (and (or .cse0 .cse1 .cse2 (and (= ~z_val~0 |old(~z_val~0)|) .cse3 .cse4) (or .cse5 .cse6 (or .cse7 (< ~d0_ev~0 2) .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) .cse23) (or .cse5 .cse1 (and (= 0 ~z_val~0) .cse3 .cse4) .cse6 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (or .cse7 .cse8 .cse9 (= 0 ~d0_ev~0) .cse10 .cse11 .cse12) .cse0 .cse19 .cse20 .cse21 .cse2 (< 0 ~d0_ev~0) .cse23 .cse22))) [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point update_zFINAL(lines 183 197) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L421 ceAbstractionStarter]: At program point update_d1ENTRY(lines 168 182) the Hoare annotation is: (let ((.cse22 (< 0 ~d0_ev~0)) (.cse17 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse21 (< ~b1_val_t~0 1)) (.cse2 (< ~d0_val_t~0 1)) (.cse3 (= ~b1_req_up~0 |old(~d1_req_up~0)|)) (.cse6 (< ~z_ev~0 2)) (.cse7 (< 0 ~comp_m1_i~0)) (.cse8 (= 0 ~b0_ev~0)) (.cse9 (not (= 1 |old(~d1_req_up~0)|))) (.cse10 (= ~b1_ev~0 0)) (.cse11 (< ~comp_m1_st~0 2)) (.cse12 (= 1 |old(~d1_ev~0)|)) (.cse4 (< ~b0_val~0 ~b0_val_t~0)) (.cse5 (< ~b0_val_t~0 1)) (.cse13 (< ~d1_val_t~0 1)) (.cse14 (= ~b1_ev~0 1)) (.cse15 (< 0 ~z_val~0)) (.cse16 (= ~b0_req_up~0 1)) (.cse18 (= 1 ~b0_ev~0)) (.cse19 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse20 (< ~z_val~0 0)) (.cse23 (not (= ~z_val~0 ~z_val_t~0))) (.cse0 (and (= |old(~d1_val~0)| ~d1_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d1_req_up~0 |old(~d1_req_up~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or .cse6 .cse7 .cse8 (= 0 ~d0_ev~0) .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse16 .cse7 .cse0 (not (= 0 ~comp_m1_st~0)) .cse21 (< |old(~d1_ev~0)| 2) .cse22 .cse23 (< 0 |old(~d1_val~0)|) (= ~b1_req_up~0 1) .cse1 .cse2 (< 0 ~z_req_up~0) .cse4 (< 0 ~b0_ev~0) .cse5 .cse13 .cse6 .cse14 .cse15 .cse19 .cse20 .cse9) (or .cse17 .cse1 .cse21 (or .cse2 .cse3 (or .cse6 (< ~d0_ev~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse4 .cse5 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse20) .cse23 .cse0))) [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point L172-1(lines 172 177) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point update_d1FINAL(lines 168 182) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point update_d1EXIT(lines 168 182) no Hoare annotation was computed. [2018-10-26 23:30:49,306 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:30:49,307 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(~b0_val~0)| ~b0_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-10-26 23:30:49,307 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:30:49,307 INFO L421 ceAbstractionStarter]: At program point update_d0ENTRY(lines 153 167) the Hoare annotation is: (let ((.cse1 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse2 (= ~d0_req_up~0 1))) (let ((.cse12 (< 0 ~b0_ev~0)) (.cse25 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse6 (< ~b1_val_t~0 1)) (.cse22 (= 0 ~b0_ev~0)) (.cse3 (< |old(~d0_ev~0)| 2)) (.cse26 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse0 (not (= |old(~d0_req_up~0)| 1))) (.cse8 (= ~b1_req_up~0 1)) (.cse19 (= ~b1_ev~0 0)) (.cse23 (< ~comp_m1_st~0 2)) (.cse14 (< ~d1_val_t~0 1)) (.cse16 (= ~b1_ev~0 1)) (.cse15 (< ~z_ev~0 2)) (.cse17 (< 0 ~z_val~0)) (.cse4 (= ~b0_req_up~0 1)) (.cse5 (< 0 ~comp_m1_i~0)) (.cse18 (< ~z_val~0 0)) (.cse20 (< 0 |old(~d0_ev~0)|)) (.cse21 (= 0 |old(~d0_ev~0)|)) (.cse27 (= 1 ~d1_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse13 (< ~b0_val_t~0 1)) (.cse7 (not (= ~z_val~0 ~z_val_t~0))) (.cse24 (and (= ~d0_val~0 ~d0_val_t~0) .cse1 .cse2))) (and (or .cse0 (and (= 0 ~d0_val~0) .cse1 .cse2) .cse3 .cse4 .cse5 (not (= 0 ~comp_m1_st~0)) .cse6 (< ~d1_ev~0 2) .cse7 (< 0 ~d1_val~0) .cse8 .cse9 .cse10 (< 0 ~z_req_up~0) .cse11 .cse12 .cse13 (not (= |old(~d0_val~0)| 0)) .cse14 .cse15 .cse16 .cse17 .cse18 (not (= 1 ~d1_req_up~0))) (or .cse0 .cse19 .cse4 .cse5 .cse6 .cse20 .cse21 .cse7 .cse8 .cse9 .cse22 .cse10 .cse11 .cse12 .cse23 .cse13 .cse14 .cse15 .cse16 .cse17 .cse24 .cse25 .cse26 .cse18 .cse27) (or .cse25 .cse9 .cse6 (and (or .cse0 .cse8 .cse22 .cse10 .cse11 .cse19 .cse23 .cse13 .cse14 .cse16 .cse15 .cse17 .cse3 .cse4 .cse5 (= 1 ~b0_ev~0) .cse26 .cse18 .cse27) (or .cse26 (or .cse0 .cse8 (< ~b0_ev~0 2) .cse19 .cse23 .cse14 .cse16 .cse15 .cse17 .cse4 .cse5 .cse18 .cse20 .cse21 .cse27) .cse10 .cse11 .cse13)) .cse7 .cse24)))) [2018-10-26 23:30:49,307 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 157 162) no Hoare annotation was computed. [2018-10-26 23:30:49,307 INFO L425 ceAbstractionStarter]: For program point update_d0FINAL(lines 153 167) no Hoare annotation was computed. [2018-10-26 23:30:49,307 INFO L425 ceAbstractionStarter]: For program point update_d0EXIT(lines 153 167) no Hoare annotation was computed. [2018-10-26 23:30:49,307 INFO L421 ceAbstractionStarter]: At program point evalENTRY(lines 269 306) the Hoare annotation is: (let ((.cse29 (= ~z_val~0 ~z_val_t~0)) (.cse33 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse34 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse27 (< ~d1_ev~0 2)) (.cse12 (< 0 ~b0_ev~0)) (.cse30 (< 1 ~d1_ev~0)) (.cse26 (not (= 0 |old(~comp_m1_st~0)|))) (.cse15 (and .cse29 .cse33 .cse34)) (.cse31 (< 0 |old(~z_req_up~0)|)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse28 (and .cse33 .cse34)) (.cse3 (< ~b1_val_t~0 1)) (.cse24 (< ~b0_ev~0 2)) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse7 (= ~b1_req_up~0 1)) (.cse9 (= 0 ~b0_ev~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse0 (= ~b1_ev~0 0)) (.cse13 (< |old(~comp_m1_st~0)| 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse18 (= ~b1_ev~0 1)) (.cse17 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse25 (< ~d0_ev~0 2)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse32 (= 1 ~b0_ev~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (< ~z_val~0 0)) (.cse23 (= 1 ~d1_ev~0)) (.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 (or .cse20 .cse8 .cse3 (and (or (or .cse7 .cse24 .cse0 .cse16 .cse18 .cse17 .cse19 .cse25 .cse1 .cse2 .cse22 .cse26 .cse27) .cse21 .cse10 .cse11 .cse14) (or .cse21 (or .cse7 .cse24 .cse0 .cse16 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse26 .cse27 .cse4 .cse5) .cse10 .cse11 .cse14) (or (or .cse7 .cse9 .cse0 .cse16 .cse18 .cse17 .cse19 .cse25 .cse1 .cse2 .cse22 .cse26 .cse27) .cse21 .cse10 .cse11 .cse12 .cse14))) .cse28) (or (and .cse29 .cse28) (and (or (or .cse7 .cse24 .cse30 .cse0 .cse16 .cse18 .cse17 .cse19 .cse25 .cse1 .cse2 .cse22 .cse26 .cse23) .cse21 .cse10 .cse11 .cse14) (or (or .cse7 .cse24 .cse31 .cse30 .cse0 .cse16 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse26 .cse4 .cse5 .cse23) .cse21 .cse10 .cse11 .cse14) (or .cse21 (or .cse7 .cse9 .cse30 .cse0 .cse16 .cse18 .cse17 .cse19 .cse25 .cse1 .cse2 .cse22 .cse26 .cse23) .cse10 .cse11 .cse12 .cse14)) .cse20 .cse8 .cse3 .cse6) (or .cse28 (or (or .cse7 .cse9 .cse0 .cse18 .cse17 .cse1 .cse2 .cse26 .cse27 .cse4 .cse5) .cse16 (not (= ~z_val~0 0)) .cse20 .cse8 .cse21 .cse3 .cse10 .cse11 .cse12 .cse14)) (or .cse30 .cse1 .cse2 .cse26 .cse3 .cse4 .cse5 (< ~b1_ev~0 2) .cse6 .cse15 .cse7 .cse8 .cse9 .cse10 .cse31 .cse11 .cse14 .cse16 .cse17 .cse19 .cse20 .cse32 .cse21 .cse22 .cse23) (or .cse20 .cse8 (and .cse28 .cse29) .cse3 (and (or (or .cse7 .cse24 .cse0 .cse13 .cse16 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse4 .cse5 .cse23) .cse21 .cse10 .cse11 .cse14) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse16 .cse18 .cse17 .cse19 .cse25 .cse1 .cse2 .cse32 .cse21 .cse22 .cse23)) .cse6)))) [2018-10-26 23:30:49,308 INFO L425 ceAbstractionStarter]: For program point L289(lines 289 296) no Hoare annotation was computed. [2018-10-26 23:30:49,308 INFO L421 ceAbstractionStarter]: At program point L285(lines 275 300) the Hoare annotation is: (let ((.cse36 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse37 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse24 (and .cse36 .cse37)) (.cse35 (<= 2 ~comp_m1_st~0)) (.cse34 (= ~z_val~0 ~z_val_t~0))) (let ((.cse27 (< |old(~comp_m1_st~0)| 2)) (.cse28 (and .cse34 .cse36 .cse37)) (.cse15 (< ~d1_ev~0 2)) (.cse33 (and .cse35 .cse34)) (.cse4 (< ~b0_ev~0 2)) (.cse32 (< 0 |old(~z_req_up~0)|)) (.cse20 (< 0 ~d0_ev~0)) (.cse21 (= 0 ~d0_ev~0)) (.cse16 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (= ~b1_req_up~0 1)) (.cse22 (= 0 ~b0_ev~0)) (.cse31 (< 1 ~d1_ev~0)) (.cse5 (= ~b1_ev~0 0)) (.cse6 (< ~d1_val_t~0 1)) (.cse7 (= ~b1_ev~0 1)) (.cse8 (< ~z_ev~0 2)) (.cse9 (< 0 ~z_val~0)) (.cse10 (< ~d0_ev~0 2)) (.cse11 (= ~b0_req_up~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~z_val~0 0)) (.cse14 (not (= 0 |old(~comp_m1_st~0)|))) (.cse29 (= 1 ~d1_ev~0)) (.cse17 (< ~d0_val_t~0 1)) (.cse18 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< 0 ~b0_ev~0)) (.cse19 (< ~b0_val_t~0 1)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse30 (and .cse24 .cse34)) (.cse26 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse25 (and .cse34 .cse35))) (and (or (or .cse0 .cse1 .cse2 (and (or (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse16 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21) .cse17 .cse18 .cse19) (or (or .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse23 .cse19))) .cse24 .cse25) (or .cse5 .cse11 .cse12 .cse2 .cse20 .cse21 .cse26 .cse3 .cse1 .cse22 .cse17 .cse18 .cse23 .cse27 .cse19 .cse6 .cse8 .cse7 .cse9 .cse0 .cse16 .cse13 .cse28 .cse29) (or .cse0 .cse1 .cse2 (and (or (or .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse29) .cse16 .cse17 .cse18 .cse19) (or .cse3 .cse22 .cse17 .cse18 .cse5 .cse27 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 1 ~b0_ev~0) .cse16 .cse13 .cse29)) .cse26 .cse30) (or .cse31 .cse11 .cse12 .cse14 .cse2 .cse20 .cse21 (< ~b1_ev~0 2) .cse26 .cse3 .cse1 .cse22 .cse17 .cse28 .cse32 .cse18 .cse23 .cse19 .cse6 .cse8 .cse9 .cse0 .cse33 .cse16 .cse13 .cse29) (or .cse24 (or (or .cse3 .cse22 .cse5 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse20 .cse21) .cse6 (not (= ~z_val~0 0)) .cse0 .cse1 .cse16 .cse2 .cse17 .cse18 .cse23 .cse19) .cse33) (or (and (or (or .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29) .cse16 .cse17 .cse18 .cse19) (or (or .cse3 .cse4 .cse32 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse21 .cse29) .cse16 .cse17 .cse18 .cse19) (or .cse16 (or .cse3 .cse22 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29) .cse17 .cse18 .cse23 .cse19)) .cse0 .cse1 .cse2 .cse30 .cse26 .cse25))))) [2018-10-26 23:30:49,308 INFO L425 ceAbstractionStarter]: For program point L275-1(lines 275 300) no Hoare annotation was computed. [2018-10-26 23:30:49,308 INFO L421 ceAbstractionStarter]: At program point L292(line 292) the Hoare annotation is: (let ((.cse14 (not (= 0 ~comp_m1_st~0))) (.cse16 (<= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse17 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse28 (< |old(~comp_m1_st~0)| 2)) (.cse23 (= 1 ~b0_ev~0)) (.cse32 (< ~d1_ev~0 2)) (.cse30 (< ~b0_ev~0 2)) (.cse12 (< 0 |old(~z_req_up~0)|)) (.cse5 (< 0 ~d0_ev~0)) (.cse6 (= 0 ~d0_ev~0)) (.cse24 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse8 (= ~b1_req_up~0 1)) (.cse10 (= 0 ~b0_ev~0)) (.cse0 (< 1 ~d1_ev~0)) (.cse27 (= ~b1_ev~0 0)) (.cse19 (< ~d1_val_t~0 1)) (.cse29 (= ~b1_ev~0 1)) (.cse20 (< ~z_ev~0 2)) (.cse21 (< 0 ~z_val~0)) (.cse31 (< ~d0_ev~0 2)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse25 (< ~z_val~0 0)) (.cse3 (not (= 0 |old(~comp_m1_st~0)|))) (.cse26 (= 1 ~d1_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse33 (< 0 ~b0_ev~0)) (.cse18 (< ~b0_val_t~0 1)) (.cse22 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse4 (< ~b1_val_t~0 1)) (.cse15 (= ~z_val~0 ~z_val_t~0)) (.cse34 (and .cse14 .cse16 .cse17)) (.cse7 (not (= ~z_val~0 |old(~z_val_t~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (< ~b1_ev~0 2) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (and .cse14 .cse15 .cse16 .cse17) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or .cse27 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse28 .cse18 .cse19 .cse20 .cse29 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (or (or .cse22 .cse9 .cse4 (and (or (or .cse8 .cse30 .cse27 .cse19 .cse29 .cse20 .cse21 .cse31 .cse1 .cse2 .cse25 .cse3 .cse32) .cse24 .cse11 .cse13 .cse18) (or .cse24 (or .cse8 .cse30 .cse27 .cse19 .cse29 .cse20 .cse21 .cse1 .cse2 .cse25 .cse3 .cse32 .cse5 .cse6) .cse11 .cse13 .cse18) (or (or .cse8 .cse10 .cse27 .cse19 .cse29 .cse20 .cse21 .cse31 .cse1 .cse2 .cse25 .cse3 .cse32) .cse24 .cse11 .cse13 .cse33 .cse18))) .cse34) (or .cse22 .cse9 .cse4 (or .cse8 .cse10 .cse11 .cse13 .cse27 .cse28 .cse18 .cse19 .cse29 .cse20 .cse21 .cse31 .cse1 .cse2 .cse23 .cse24 .cse25 .cse26) .cse7) (or (or (or .cse8 .cse10 .cse27 .cse29 .cse20 .cse1 .cse2 .cse3 .cse32 .cse5 .cse6) .cse19 (not (= ~z_val~0 0)) .cse22 .cse9 .cse24 .cse4 .cse11 .cse13 .cse33 .cse18) .cse34) (or (and (or (or .cse8 .cse30 .cse0 .cse27 .cse19 .cse29 .cse20 .cse21 .cse31 .cse1 .cse2 .cse25 .cse3 .cse26) .cse24 .cse11 .cse13 .cse18) (or (or .cse8 .cse30 .cse12 .cse0 .cse27 .cse19 .cse29 .cse20 .cse21 .cse1 .cse2 .cse25 .cse3 .cse5 .cse6 .cse26) .cse24 .cse11 .cse13 .cse18) (or .cse24 (or .cse8 .cse10 .cse0 .cse27 .cse19 .cse29 .cse20 .cse21 .cse31 .cse1 .cse2 .cse25 .cse3 .cse26) .cse11 .cse13 .cse33 .cse18)) .cse22 .cse9 .cse4 (and .cse15 .cse34) .cse7)))) [2018-10-26 23:30:49,309 INFO L425 ceAbstractionStarter]: For program point evalEXIT(lines 269 306) no Hoare annotation was computed. [2018-10-26 23:30:49,309 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2018-10-26 23:30:49,309 INFO L425 ceAbstractionStarter]: For program point L280-1(lines 275 300) no Hoare annotation was computed. [2018-10-26 23:30:49,309 INFO L425 ceAbstractionStarter]: For program point L278(line 278) no Hoare annotation was computed. [2018-10-26 23:30:49,309 INFO L421 ceAbstractionStarter]: At program point L276(line 276) the Hoare annotation is: (let ((.cse36 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse37 (= ~z_req_up~0 |old(~z_req_up~0)|))) (let ((.cse24 (and .cse36 .cse37)) (.cse35 (<= 2 ~comp_m1_st~0)) (.cse34 (= ~z_val~0 ~z_val_t~0))) (let ((.cse27 (< |old(~comp_m1_st~0)| 2)) (.cse28 (and .cse34 .cse36 .cse37)) (.cse15 (< ~d1_ev~0 2)) (.cse33 (and .cse35 .cse34)) (.cse4 (< ~b0_ev~0 2)) (.cse32 (< 0 |old(~z_req_up~0)|)) (.cse20 (< 0 ~d0_ev~0)) (.cse21 (= 0 ~d0_ev~0)) (.cse16 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse3 (= ~b1_req_up~0 1)) (.cse22 (= 0 ~b0_ev~0)) (.cse31 (< 1 ~d1_ev~0)) (.cse5 (= ~b1_ev~0 0)) (.cse6 (< ~d1_val_t~0 1)) (.cse7 (= ~b1_ev~0 1)) (.cse8 (< ~z_ev~0 2)) (.cse9 (< 0 ~z_val~0)) (.cse10 (< ~d0_ev~0 2)) (.cse11 (= ~b0_req_up~0 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse13 (< ~z_val~0 0)) (.cse14 (not (= 0 |old(~comp_m1_st~0)|))) (.cse29 (= 1 ~d1_ev~0)) (.cse17 (< ~d0_val_t~0 1)) (.cse18 (< ~b0_val~0 ~b0_val_t~0)) (.cse23 (< 0 ~b0_ev~0)) (.cse19 (< ~b0_val_t~0 1)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse30 (and .cse24 .cse34)) (.cse26 (not (= ~z_val~0 |old(~z_val_t~0)|))) (.cse25 (and .cse34 .cse35))) (and (or (or .cse0 .cse1 .cse2 (and (or (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse19) (or .cse16 (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse15 .cse20 .cse21) .cse17 .cse18 .cse19) (or (or .cse3 .cse22 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) .cse16 .cse17 .cse18 .cse23 .cse19))) .cse24 .cse25) (or .cse5 .cse11 .cse12 .cse2 .cse20 .cse21 .cse26 .cse3 .cse1 .cse22 .cse17 .cse18 .cse23 .cse27 .cse19 .cse6 .cse8 .cse7 .cse9 .cse0 .cse16 .cse13 .cse28 .cse29) (or .cse0 .cse1 .cse2 (and (or (or .cse3 .cse4 .cse5 .cse27 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse20 .cse21 .cse29) .cse16 .cse17 .cse18 .cse19) (or .cse3 .cse22 .cse17 .cse18 .cse5 .cse27 .cse19 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (= 1 ~b0_ev~0) .cse16 .cse13 .cse29)) .cse26 .cse30) (or .cse31 .cse11 .cse12 .cse14 .cse2 .cse20 .cse21 (< ~b1_ev~0 2) .cse26 .cse3 .cse1 .cse22 .cse17 .cse28 .cse32 .cse18 .cse23 .cse19 .cse6 .cse8 .cse9 .cse0 .cse33 .cse16 .cse13 .cse29) (or .cse24 (or (or .cse3 .cse22 .cse5 .cse7 .cse8 .cse11 .cse12 .cse14 .cse15 .cse20 .cse21) .cse6 (not (= ~z_val~0 0)) .cse0 .cse1 .cse16 .cse2 .cse17 .cse18 .cse23 .cse19) .cse33) (or (and (or (or .cse3 .cse4 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29) .cse16 .cse17 .cse18 .cse19) (or (or .cse3 .cse4 .cse32 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14 .cse20 .cse21 .cse29) .cse16 .cse17 .cse18 .cse19) (or .cse16 (or .cse3 .cse22 .cse31 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse29) .cse17 .cse18 .cse23 .cse19)) .cse0 .cse1 .cse2 .cse30 .cse26 .cse25))))) [2018-10-26 23:30:49,310 INFO L421 ceAbstractionStarter]: At program point L301(lines 269 306) the Hoare annotation is: (let ((.cse28 (<= 2 ~comp_m1_st~0)) (.cse27 (= ~z_val~0 ~z_val_t~0))) (let ((.cse29 (< ~d1_ev~0 2)) (.cse21 (< 0 ~b0_ev~0)) (.cse11 (not (= 0 |old(~comp_m1_st~0)|))) (.cse26 (and .cse28 .cse27)) (.cse17 (< 0 |old(~z_req_up~0)|)) (.cse22 (< ~d1_val~0 ~d1_val_t~0)) (.cse23 (< ~b1_val~0 ~b1_val_t~0)) (.cse31 (= |old(~comp_m1_st~0)| ~comp_m1_st~0)) (.cse32 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse24 (< ~b1_val_t~0 1)) (.cse1 (< ~b0_ev~0 2)) (.cse18 (< 0 ~d0_ev~0)) (.cse19 (= 0 ~d0_ev~0)) (.cse0 (= ~b1_req_up~0 1)) (.cse20 (= 0 ~b0_ev~0)) (.cse14 (< ~d0_val_t~0 1)) (.cse15 (< ~b0_val~0 ~b0_val_t~0)) (.cse2 (= ~b1_ev~0 0)) (.cse30 (< |old(~comp_m1_st~0)| 2)) (.cse16 (< ~b0_val_t~0 1)) (.cse3 (< ~d1_val_t~0 1)) (.cse4 (= ~b1_ev~0 1)) (.cse5 (< ~z_ev~0 2)) (.cse6 (< 0 ~z_val~0)) (.cse7 (< ~d0_ev~0 2)) (.cse8 (= ~b0_req_up~0 1)) (.cse9 (< 0 ~comp_m1_i~0)) (.cse33 (= 1 ~b0_ev~0)) (.cse13 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse10 (< ~z_val~0 0)) (.cse12 (= 1 ~d1_ev~0)) (.cse25 (not (= ~z_val~0 |old(~z_val_t~0)|)))) (and (or (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse13 .cse14 .cse15 .cse16) (or (or .cse0 .cse1 .cse17 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse18 .cse19 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse13 (or .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) .cse14 .cse15 .cse21 .cse16)) .cse22 .cse23 .cse24 .cse25 .cse26) (or (and .cse27 .cse28) (or .cse22 .cse23 .cse24 (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29) .cse13 .cse14 .cse15 .cse16) (or .cse13 (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse29 .cse18 .cse19) .cse14 .cse15 .cse16) (or (or .cse0 .cse20 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse29) .cse13 .cse14 .cse15 .cse21 .cse16)))) (or (or (or .cse0 .cse20 .cse2 .cse4 .cse5 .cse8 .cse9 .cse11 .cse29 .cse18 .cse19) .cse3 (not (= ~z_val~0 0)) .cse22 .cse23 .cse13 .cse24 .cse14 .cse15 .cse21 .cse16) .cse26) (or .cse2 .cse8 .cse9 .cse24 .cse18 .cse19 .cse25 .cse0 .cse23 .cse20 .cse14 .cse15 .cse21 .cse30 .cse16 (and .cse27 .cse31 .cse32) .cse3 .cse5 .cse4 .cse6 .cse22 .cse13 .cse10 .cse12) (or .cse8 .cse9 .cse11 .cse24 .cse18 .cse19 (< ~b1_ev~0 2) .cse25 .cse26 .cse0 .cse23 .cse20 .cse14 .cse17 .cse15 .cse16 .cse3 .cse5 .cse6 .cse22 .cse33 .cse13 .cse10 .cse12) (or .cse22 .cse23 (and (and .cse31 .cse32) .cse27) .cse24 (and (or (or .cse0 .cse1 .cse2 .cse30 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse18 .cse19 .cse12) .cse13 .cse14 .cse15 .cse16) (or .cse0 .cse20 .cse14 .cse15 .cse2 .cse30 .cse16 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse33 .cse13 .cse10 .cse12)) .cse25)))) [2018-10-26 23:30:49,310 INFO L425 ceAbstractionStarter]: For program point L397(lines 397 402) no Hoare annotation was computed. [2018-10-26 23:30:49,310 INFO L428 ceAbstractionStarter]: At program point L395(line 395) the Hoare annotation is: true [2018-10-26 23:30:49,310 INFO L425 ceAbstractionStarter]: For program point L395-1(line 395) no Hoare annotation was computed. [2018-10-26 23:30:49,310 INFO L425 ceAbstractionStarter]: For program point stop_simulationEXIT(lines 389 407) no Hoare annotation was computed. [2018-10-26 23:30:49,310 INFO L421 ceAbstractionStarter]: At program point L404(lines 393 406) the Hoare annotation is: (let ((.cse8 (= ~b1_ev~0 0)) (.cse15 (= ~b0_req_up~0 1)) (.cse16 (< 0 ~comp_m1_i~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse21 (not (= ~z_val~0 ~z_val_t~0))) (.cse3 (= 0 stop_simulation_~tmp~2)) (.cse4 (= ~b1_req_up~0 1)) (.cse1 (< ~b1_val~0 ~b1_val_t~0)) (.cse5 (= 0 ~b0_ev~0)) (.cse6 (< ~d0_val_t~0 1)) (.cse7 (< ~b0_val~0 ~b0_val_t~0)) (.cse9 (< ~comp_m1_st~0 2)) (.cse10 (< ~b0_val_t~0 1)) (.cse11 (< ~d1_val_t~0 1)) (.cse13 (< ~z_ev~0 2)) (.cse12 (= ~b1_ev~0 1)) (.cse14 (< 0 ~z_val~0)) (.cse0 (< ~d1_val~0 ~d1_val_t~0)) (.cse17 (= 1 ~b0_ev~0)) (.cse18 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse19 (< ~z_val~0 0)) (.cse20 (= 1 ~d1_ev~0))) (and (or .cse0 .cse1 .cse2 .cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (< ~d0_ev~0 2) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) .cse21) (or .cse8 .cse15 .cse16 .cse2 (< 0 ~d0_ev~0) (= 0 ~d0_ev~0) .cse21 .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse9 .cse10 .cse11 .cse13 .cse12 .cse14 .cse0 .cse17 .cse18 .cse19 .cse20))) [2018-10-26 23:30:49,310 INFO L428 ceAbstractionStarter]: At program point stop_simulationENTRY(lines 389 407) the Hoare annotation is: true [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point stop_simulationFINAL(lines 389 407) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 142 147) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point update_b1EXIT(lines 138 152) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L421 ceAbstractionStarter]: At program point update_b1ENTRY(lines 138 152) the Hoare annotation is: (or (not (= ~d0_req_up~0 1)) (and (= 1 ~b1_req_up~0) (= |old(~b1_ev~0)| ~b1_ev~0)) (< ~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)) (< 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-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point update_b1FINAL(lines 138 152) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 127 132) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point update_b0EXIT(lines 123 137) no Hoare annotation was computed. [2018-10-26 23:30:49,311 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) (and (= ~b0_req_up~0 1) (= |old(~b0_ev~0)| ~b0_ev~0) (= |old(~b0_val~0)| ~b0_val~0)) (< 0 ~comp_m1_i~0) (not (= 0 ~comp_m1_st~0)) (< ~b1_val_t~0 1) (< 0 |old(~b0_val~0)|) (< ~d1_ev~0 2) (< ~d1_req_up~0 ~b1_req_up~0) (< ~b1_ev~0 2) (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-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point update_b0FINAL(lines 123 137) no Hoare annotation was computed. [2018-10-26 23:30:49,311 INFO L425 ceAbstractionStarter]: For program point L97(lines 97 117) no Hoare annotation was computed. [2018-10-26 23:30:49,312 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredFINAL(lines 93 122) no Hoare annotation was computed. [2018-10-26 23:30:49,312 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 ((.cse29 (not .cse27)) (.cse4 (< 0 ~d0_ev~0)) (.cse5 (= 0 ~d0_ev~0)) (.cse14 (< 0 ~b0_ev~0)) (.cse12 (< 0 ~z_req_up~0)) (.cse0 (< 1 ~d1_ev~0)) (.cse31 (not (= 1 ~d0_ev~0))) (.cse30 (not .cse26)) (.cse7 (= 1 is_method1_triggered_~__retres1~0)) (.cse21 (< ~d1_val~0 ~d1_val_t~0)) (.cse9 (< ~b1_val~0 ~b1_val_t~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse25 (= 0 is_method1_triggered_~__retres1~0)) (.cse8 (= ~b1_req_up~0 1)) (.cse10 (= 0 ~b0_ev~0)) (.cse11 (< ~d0_val_t~0 1)) (.cse13 (< ~b0_val~0 ~b0_val_t~0)) (.cse24 (= ~b1_ev~0 0)) (.cse15 (< ~comp_m1_st~0 2)) (.cse16 (< ~b0_val_t~0 1)) (.cse17 (< ~d1_val_t~0 1)) (.cse20 (= ~b1_ev~0 1)) (.cse18 (< ~z_ev~0 2)) (.cse19 (< 0 ~z_val~0)) (.cse28 (< ~d0_ev~0 2)) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse22 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse23 (< ~z_val~0 0)) (.cse6 (not (= ~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 (not .cse20) .cse21 .cse22 .cse23) (or .cse24 .cse25 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse13 .cse15 .cse16 .cse17 .cse18 .cse20 .cse19 .cse21 .cse26 .cse22 .cse23 .cse27) (or .cse7 (or .cse21 .cse9 (and (or .cse8 .cse10 .cse11 .cse13 .cse24 .cse15 .cse16 .cse17 .cse20 .cse18 .cse19 .cse28 .cse1 .cse2 .cse26 .cse22 .cse23 .cse29) (or (or .cse8 (< ~b0_ev~0 2) .cse24 .cse15 .cse17 .cse20 .cse18 .cse19 .cse1 .cse2 .cse23 .cse4 .cse5 .cse29) .cse22 .cse11 .cse13 .cse16)) .cse3)) (or (or .cse24 .cse1 .cse2 .cse3 .cse4 .cse5 .cse29 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse19 .cse21 .cse22 .cse23) .cse7) (or .cse7 .cse21 .cse9 (or .cse8 .cse12 .cse0 .cse24 .cse15 .cse17 .cse18 .cse19 .cse1 .cse2 .cse23 .cse30 .cse4 .cse5) .cse22 .cse3 .cse11 .cse13 .cse6 .cse16) (or .cse21 .cse9 (or .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse0 .cse24 .cse15 .cse16 .cse17 .cse18 .cse19 .cse1 .cse2 .cse31 .cse22 .cse23) .cse3 .cse7 .cse6) (or (or .cse8 .cse12 .cse0 .cse24 .cse15 .cse18 .cse1 .cse2 .cse31 .cse30) .cse17 (not (= ~z_val~0 0)) .cse21 .cse9 .cse22 .cse3 .cse11 .cse13 .cse6 .cse16 .cse7) (or .cse21 .cse9 .cse3 .cse25 (or .cse8 .cse10 .cse11 .cse13 .cse24 .cse15 .cse16 .cse17 .cse20 .cse18 .cse19 .cse28 .cse1 .cse2 .cse26 .cse22 .cse23 .cse27) .cse6)))) [2018-10-26 23:30:49,312 INFO L425 ceAbstractionStarter]: For program point is_method1_triggeredEXIT(lines 93 122) no Hoare annotation was computed. [2018-10-26 23:30:49,312 INFO L425 ceAbstractionStarter]: For program point L109(lines 109 114) no Hoare annotation was computed. [2018-10-26 23:30:49,312 INFO L428 ceAbstractionStarter]: At program point is_method1_triggeredENTRY(lines 93 122) the Hoare annotation is: true [2018-10-26 23:30:49,312 INFO L425 ceAbstractionStarter]: For program point L105(lines 105 115) no Hoare annotation was computed. [2018-10-26 23:30:49,312 INFO L425 ceAbstractionStarter]: For program point L101(lines 101 116) no Hoare annotation was computed. [2018-10-26 23:30:49,313 INFO L421 ceAbstractionStarter]: At program point L225(line 225) the Hoare annotation is: (let ((.cse1 (< |old(~d0_ev~0)| 2)) (.cse37 (= |old(~b1_ev~0)| 0)) (.cse40 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse18 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse34 (= |old(~b1_req_up~0)| 1)) (.cse26 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse35 (= 0 |old(~b0_ev~0)|)) (.cse19 (< ~d0_val_t~0 1)) (.cse36 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse32 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse33 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse31 (= |old(~b0_val~0)| ~b0_val~0)) (.cse9 (= 0 ~z_val~0)) (.cse28 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse7 (= |old(~d1_val~0)| ~d1_val~0)) (.cse10 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse29 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse0 (= |old(~d0_req_up~0)| 1)) (.cse30 (= ~d1_req_up~0 1)) (.cse27 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse15 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse17 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse13 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse16 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse38 (< ~comp_m1_st~0 2)) (.cse20 (< ~b0_val_t~0 1)) (.cse21 (< ~d1_val_t~0 1)) (.cse22 (< |old(~z_ev~0)| 2)) (.cse39 (= |old(~b1_ev~0)| 1)) (.cse23 (< 0 |old(~z_val~0)|)) (.cse25 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse41 (= 1 |old(~b0_ev~0)|)) (.cse42 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse24 (< |old(~z_val~0)| 0)) (.cse43 (= 1 |old(~d1_ev~0)|))) (and (let ((.cse4 (not (= 1 ~b1_req_up~0))) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (<= ~b0_val_t~0 ~b0_val~0)) (.cse11 (<= ~d0_ev~0 0)) (.cse12 (<= ~b0_ev~0 0))) (or (not .cse0) .cse1 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) .cse18 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) .cse19 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse20 (not (= |old(~d0_val~0)| 0)) .cse21 .cse22 .cse23 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse24 (and .cse4 .cse5 .cse6 (not (= ~b1_ev~0 1)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (<= ~b1_ev~0 1) .cse16 .cse17) (not (= 1 |old(~d1_req_up~0)|)))) (or .cse25 .cse26 .cse3 (and .cse14 (and .cse27 (= ~d0_val_t~0 ~d0_val~0) (and (or (and .cse28 .cse7 .cse10 .cse29 .cse30 .cse15 .cse17) (and .cse7 .cse10 .cse29 .cse0 .cse30 .cse15 .cse17)) .cse31 (= ~z_val~0 |old(~z_val~0)|) .cse32 .cse33 .cse13 .cse16))) (or .cse34 .cse35 .cse19 .cse36 .cse37 .cse38 .cse20 .cse21 .cse39 .cse22 .cse23 .cse1 .cse40 .cse2 .cse41 .cse42 .cse24 .cse43) .cse18) (or .cse37 .cse40 .cse2 .cse3 (< 0 |old(~d0_ev~0)|) (= 0 |old(~d0_ev~0)|) .cse18 .cse34 .cse26 .cse35 .cse19 .cse36 (and .cse32 .cse33 .cse8 .cse31 .cse9 (or (and .cse28 .cse7 .cse10 .cse29 .cse30 .cse27 .cse15 .cse17) (and .cse7 .cse10 .cse29 .cse0 .cse30 .cse27 .cse15 .cse17)) .cse13 .cse14 .cse16) .cse38 .cse20 .cse21 .cse22 .cse39 .cse23 .cse25 .cse41 .cse42 .cse24 .cse43))) [2018-10-26 23:30:49,313 INFO L425 ceAbstractionStarter]: For program point L223(lines 201 239) no Hoare annotation was computed. [2018-10-26 23:30:49,313 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)) (.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)|)) (.cse4 (not (= |old(~z_val~0)| ~z_val_t~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 (or .cse5 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse21 .cse1 .cse2 .cse17 .cse18 .cse19 .cse20) .cse4))) [2018-10-26 23:30:49,313 INFO L425 ceAbstractionStarter]: For program point L209(lines 201 239) no Hoare annotation was computed. [2018-10-26 23:30:49,314 INFO L421 ceAbstractionStarter]: At program point L232(line 232) the Hoare annotation is: (let ((.cse33 (= |old(~d0_req_up~0)| 1)) (.cse34 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse55 (not (= ~d1_ev~0 1))) (.cse56 (<= ~d1_ev~0 1)) (.cse37 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse38 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse39 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse42 (= ~z_val~0 ~z_val_t~0)) (.cse11 (< 0 |old(~z_req_up~0)|)) (.cse53 (= ~d1_val_t~0 |old(~d1_val~0)|)) (.cse54 (<= ~d1_val~0 |old(~d1_val~0)|)) (.cse52 (not (= 1 |old(~d1_req_up~0)|))) (.cse49 (< 1 |old(~d1_ev~0)|)) (.cse23 (= 1 |old(~d1_ev~0)|)) (.cse57 (<= |old(~d1_ev~0)| ~d1_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)) (.cse46 (or (and .cse55 .cse56 .cse37 .cse33 .cse38 .cse39) (and .cse34 .cse55 .cse56 .cse37 .cse38 .cse39))) (.cse48 (= 0 ~z_val~0)) (.cse47 (<= ~d1_val_t~0 ~d1_val~0)) (.cse43 (<= ~b1_val_t~0 ~b1_val~0)) (.cse58 (<= ~d0_ev~0 1)) (.cse67 (<= 2 ~b1_ev~0)) (.cse24 (= ~d0_val~0 ~d0_val_t~0)) (.cse25 (= |old(~b0_val~0)| ~b0_val~0)) (.cse62 (<= 1 |old(~z_req_up~0)|)) (.cse40 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse41 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse28 (not (= |old(~b0_req_up~0)| |old(~d1_req_up~0)|))) (.cse27 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse30 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse31 (not (= |old(~b1_req_up~0)| |old(~d1_req_up~0)|))) (.cse35 (= |old(~d1_val~0)| ~d1_val~0)) (.cse36 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse59 (not (= ~b0_ev~0 0))) (.cse68 (<= ~b1_ev~0 1)) (.cse44 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse6 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse9 (= 0 |old(~b0_ev~0)|)) (.cse60 (< |old(~d0_ev~0)| 2)) (.cse20 (= 1 |old(~b0_ev~0)|)) (.cse7 (= |old(~b1_req_up~0)| 1)) (.cse61 (< |old(~b0_ev~0)| 2)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse13 (< ~comp_m1_st~0 2)) (.cse15 (< ~d1_val_t~0 1)) (.cse17 (= |old(~b1_ev~0)| 1)) (.cse16 (< |old(~z_ev~0)| 2)) (.cse18 (< 0 |old(~z_val~0)|)) (.cse1 (= |old(~b0_req_up~0)| 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse22 (< |old(~z_val~0)| 0)) (.cse45 (< |old(~d1_ev~0)| 2)) (.cse4 (< 0 |old(~d0_ev~0)|)) (.cse5 (= 0 |old(~d0_ev~0)|)) (.cse21 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse10 (< ~d0_val_t~0 1)) (.cse12 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse14 (< ~b0_val_t~0 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or (and .cse24 .cse25 (let ((.cse26 (let ((.cse29 (let ((.cse32 (and .cse35 .cse36 .cse37 .cse38 .cse39))) (or (and .cse32 .cse33) (and .cse34 .cse32))))) (or (and .cse29 .cse30 .cse31) (and .cse29 .cse30 .cse27))))) (or (and .cse26 .cse27) (and .cse26 .cse28))) .cse40 .cse41 .cse42 .cse43 .cse44) .cse0 .cse1 .cse2 .cse3 .cse45 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 (< 0 |old(~b0_ev~0)|) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse21 .cse22 (and .cse28 .cse40 .cse41 .cse30 .cse46 .cse47 .cse24 .cse25 .cse48 .cse43 .cse31 .cse44)) (let ((.cse50 (and .cse55 .cse56 .cse37 (<= ~comp_m1_i~0 0) .cse57 .cse58 (not (= ~b1_ev~0 0)) .cse59 (not (= ~d0_ev~0 1)) .cse38 .cse39))) (or .cse49 .cse0 (and .cse28 .cse40 .cse41 .cse30 .cse47 .cse24 .cse25 .cse48 (or (and .cse34 .cse50) (and .cse50 .cse33)) .cse43 .cse31 .cse44) .cse1 .cse2 .cse3 .cse4 (and .cse24 .cse25 .cse40 .cse41 (and (and .cse30 (let ((.cse51 (or (and .cse35 (and .cse50 .cse52)) (and .cse53 .cse54 .cse50)))) (or (and .cse34 .cse51) (and .cse51 .cse33)))) .cse27) .cse42 .cse43 .cse47 .cse44) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23)) (or (not .cse33) .cse60 .cse2 (not (= 0 ~comp_m1_st~0)) .cse3 (< 0 |old(~b0_val~0)|) .cse45 (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) .cse6 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse61 .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 .cse52) (let ((.cse64 (and .cse55 .cse56 .cse37 .cse57 .cse59 .cse38 .cse68 .cse39)) (.cse63 (and .cse55 .cse56 .cse37 .cse67 .cse57 .cse41 .cse38 .cse39))) (or (and (or (and .cse24 .cse25 .cse28 .cse62 .cse40 (or (and .cse63 .cse33) (and .cse34 .cse63)) .cse30 .cse31 .cse44) (and .cse24 .cse25 .cse28 .cse62 .cse40 (or (and .cse64 .cse33) (and .cse34 .cse64)) .cse41 .cse30 .cse31 .cse44)) .cse43 .cse48 .cse47) (and (or (and .cse24 .cse25 .cse62 .cse40 .cse41 (and (and .cse30 (let ((.cse65 (or (and .cse53 .cse64 .cse54) (and .cse35 (and .cse64 .cse52))))) (or (and .cse65 .cse33) (and .cse34 .cse65)))) .cse27) .cse44) (and (and .cse27 (and .cse30 (let ((.cse66 (or (and .cse53 .cse63 .cse54) (and .cse35 (and .cse63 .cse27 .cse52))))) (or (and .cse66 .cse33) (and .cse34 .cse66))))) .cse24 .cse25 .cse62 .cse40 .cse44)) .cse43 .cse48 .cse47) .cse19 .cse8 .cse3 (or .cse7 .cse9 .cse10 .cse12 .cse49 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse60 .cse1 .cse2 .cse20 .cse21 .cse22 .cse23) .cse6)) (or .cse19 .cse8 .cse3 (and (and .cse46 .cse24 .cse25 .cse28 .cse62 .cse40 .cse41 .cse30 .cse31 .cse44) .cse43 .cse48 .cse47) (and .cse43 (let ((.cse73 (= ~z_val~0 |old(~z_val~0)|)) (.cse72 (= ~d0_ev~0 |old(~d0_ev~0)|))) (or (and (= ~d0_val_t~0 ~d0_val~0) (and (let ((.cse69 (let ((.cse70 (let ((.cse71 (and .cse35 .cse36 .cse41 .cse58 .cse38 .cse68 .cse39))) (or (and .cse71 .cse72 .cse33) (and .cse34 .cse71 .cse72))))) (or (and .cse70 .cse30 .cse31) (and .cse70 .cse30 .cse27))))) (or (and .cse27 .cse69) (and .cse28 .cse69))) .cse25 .cse44 .cse73 .cse40)) (and (let ((.cse74 (let ((.cse75 (let ((.cse76 (and .cse35 .cse36 .cse37 .cse67 .cse41 .cse38 .cse39))) (or (and .cse34 .cse76) (and .cse76 .cse33))))) (or (and .cse30 .cse27 .cse75) (and .cse30 .cse31 .cse75))))) (or (and .cse28 .cse74) (and .cse27 .cse74))) .cse24 .cse25 .cse62 .cse73 .cse40 .cse44) (and .cse24 .cse25 .cse62 .cse73 .cse40 .cse41 (let ((.cse77 (let ((.cse78 (let ((.cse79 (and .cse35 (<= 2 ~d0_ev~0) .cse36 .cse59 .cse38 .cse68 .cse39))) (or (and .cse34 .cse79 .cse72) (and .cse79 .cse72 .cse33))))) (or (and .cse30 .cse27 .cse78) (and .cse30 .cse31 .cse78))))) (or (and .cse27 .cse77) (and .cse28 .cse77))) .cse44)))) .cse6 (and (or .cse7 .cse9 .cse10 .cse12 .cse0 .cse13 .cse14 .cse15 .cse17 .cse16 .cse18 .cse60 .cse1 .cse2 .cse20 .cse21 .cse22 .cse45) (or (or .cse7 .cse61 .cse0 .cse13 .cse15 .cse17 .cse16 .cse18 .cse1 .cse2 .cse22 .cse45 .cse4 .cse5) .cse21 .cse10 .cse12 .cse14)))))) [2018-10-26 23:30:49,327 INFO L425 ceAbstractionStarter]: For program point L230(lines 198 240) no Hoare annotation was computed. [2018-10-26 23:30:49,328 INFO L421 ceAbstractionStarter]: At program point L218(line 218) the Hoare annotation is: (let ((.cse22 (< |old(~d0_ev~0)| 2)) (.cse4 (< |old(~b0_ev~0)| 2)) (.cse5 (= |old(~b1_ev~0)| 0)) (.cse11 (= |old(~b0_req_up~0)| 1)) (.cse12 (< 0 ~comp_m1_i~0)) (.cse2 (< ~b1_val_t~0 1)) (.cse14 (< 0 |old(~d0_ev~0)|)) (.cse15 (= 0 |old(~d0_ev~0)|)) (.cse23 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse3 (= |old(~b1_req_up~0)| 1)) (.cse1 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse21 (= 0 |old(~b0_ev~0)|)) (.cse18 (< ~d0_val_t~0 1)) (.cse19 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse6 (< ~comp_m1_st~0 2)) (.cse20 (< ~b0_val_t~0 1)) (.cse7 (< ~d1_val_t~0 1)) (.cse9 (< |old(~z_ev~0)| 2)) (.cse8 (= |old(~b1_ev~0)| 1)) (.cse10 (< 0 |old(~z_val~0)|)) (.cse24 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse25 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse26 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse27 (= |old(~d1_val~0)| ~d1_val~0)) (.cse28 (= ~d0_val~0 ~d0_val_t~0)) (.cse29 (= |old(~b0_val~0)| ~b0_val~0)) (.cse39 (= 0 ~z_val~0)) (.cse30 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse31 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse32 (= |old(~d0_req_up~0)| 1)) (.cse33 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse38 (<= ~b1_val_t~0 ~b1_val~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)) (.cse0 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse17 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse13 (< |old(~z_val~0)| 0)) (.cse16 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 (and (or (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse3 .cse21 .cse18 .cse19 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse22 .cse11 .cse12 (= 1 |old(~b0_ev~0)|) .cse17 .cse13 .cse16)) .cse23 (and (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37) .cse38 .cse39)) (let ((.cse40 (not (= 1 ~b1_req_up~0))) (.cse41 (not (= ~b0_req_up~0 1))) (.cse42 (<= ~b0_val_t~0 ~b0_val~0)) (.cse43 (= 0 ~d0_val~0)) (.cse44 (<= ~b0_ev~0 0))) (or (not .cse32) (and .cse40 .cse41 .cse42 .cse43 .cse27 .cse39 .cse30 .cse31 .cse44 .cse33 .cse38 .cse34 .cse35 .cse36 .cse37) .cse22 .cse12 (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) .cse23 (< 0 |old(~d1_val~0)|) (and .cse40 .cse41 .cse42 (not (= ~b1_ev~0 1)) .cse43 .cse27 .cse39 .cse30 .cse31 .cse44 .cse33 .cse38 (<= ~b1_ev~0 1) .cse35 .cse36 .cse37) (< |old(~b0_val~0)| 0) .cse4 .cse18 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse20 (not (= |old(~d0_val~0)| 0)) .cse7 .cse9 .cse10 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse13 (not (= 1 |old(~d1_req_up~0)|)))) (or .cse5 .cse11 .cse12 .cse2 .cse14 .cse15 .cse23 .cse3 .cse1 .cse21 .cse18 .cse19 (< 0 |old(~b0_ev~0)|) .cse6 .cse20 .cse7 .cse9 .cse8 .cse10 (and .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse39 .cse30 .cse31 .cse32 .cse33 .cse38 .cse34 .cse35 .cse36 .cse37) .cse0 .cse17 .cse13 .cse16))) [2018-10-26 23:30:49,331 INFO L425 ceAbstractionStarter]: For program point L216(lines 201 239) no Hoare annotation was computed. [2018-10-26 23:30:49,331 INFO L421 ceAbstractionStarter]: At program point update_channelsENTRY(lines 198 240) the Hoare annotation is: (let ((.cse36 (< |old(~d0_ev~0)| 2)) (.cse18 (< |old(~b0_ev~0)| 2)) (.cse19 (= |old(~b1_ev~0)| 0)) (.cse25 (= |old(~b0_req_up~0)| 1)) (.cse26 (< 0 ~comp_m1_i~0)) (.cse16 (< ~b1_val_t~0 1)) (.cse28 (< 0 |old(~d0_ev~0)|)) (.cse29 (= 0 |old(~d0_ev~0)|)) (.cse37 (not (= |old(~z_val~0)| ~z_val_t~0))) (.cse17 (= |old(~b1_req_up~0)| 1)) (.cse1 (< |old(~b1_val~0)| ~b1_val_t~0)) (.cse35 (= 0 |old(~b0_ev~0)|)) (.cse32 (< ~d0_val_t~0 1)) (.cse33 (< |old(~b0_val~0)| ~b0_val_t~0)) (.cse20 (< ~comp_m1_st~0 2)) (.cse34 (< ~b0_val_t~0 1)) (.cse2 (= |old(~b0_req_up~0)| ~b0_req_up~0)) (.cse3 (= |old(~b0_ev~0)| ~b0_ev~0)) (.cse4 (= |old(~b1_req_up~0)| ~b1_req_up~0)) (.cse5 (= |old(~d0_req_up~0)| ~d0_req_up~0)) (.cse6 (= |old(~d1_val~0)| ~d1_val~0)) (.cse7 (= |old(~b0_val~0)| ~b0_val~0)) (.cse15 (= 0 ~z_val~0)) (.cse8 (= |old(~d1_ev~0)| ~d1_ev~0)) (.cse9 (= |old(~d0_ev~0)| ~d0_ev~0)) (.cse10 (= ~d1_req_up~0 |old(~d1_req_up~0)|)) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse11 (= |old(~b1_ev~0)| ~b1_ev~0)) (.cse12 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse13 (<= |old(~z_ev~0)| ~z_ev~0)) (.cse21 (< ~d1_val_t~0 1)) (.cse23 (< |old(~z_ev~0)| 2)) (.cse22 (= |old(~b1_ev~0)| 1)) (.cse24 (< 0 |old(~z_val~0)|)) (.cse0 (< |old(~d1_val~0)| ~d1_val_t~0)) (.cse31 (not (= ~d0_val_t~0 |old(~d0_val~0)|))) (.cse27 (< |old(~z_val~0)| 0)) (.cse30 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 (and (and (= ~d0_val_t~0 ~d0_val~0) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13)) .cse14 .cse15) .cse16 (and (or (or .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) .cse31 .cse32 .cse33 .cse34) (or .cse17 .cse35 .cse32 .cse33 .cse19 .cse20 .cse34 .cse21 .cse22 .cse23 .cse24 .cse36 .cse25 .cse26 (= 1 |old(~b0_ev~0)|) .cse31 .cse27 .cse30)) .cse37) (or (not (= |old(~d0_req_up~0)| 1)) .cse36 .cse26 (not (= 0 ~comp_m1_st~0)) .cse16 (< 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) .cse37 (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) .cse18 .cse32 (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) .cse34 (not (= |old(~d0_val~0)| 0)) .cse21 (and .cse15 .cse9 .cse11 (<= ~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)) .cse12 (<= ~b1_req_up~0 ~d1_req_up~0) (= ~b0_req_up~0 1) .cse3 (= 0 ~d0_val~0) .cse6 .cse7 .cse8 (= ~d0_req_up~0 1) .cse13) .cse23 .cse24 (<= (+ |old(~d1_req_up~0)| 1) |old(~b0_req_up~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) .cse27 (not (= 1 |old(~d1_req_up~0)|))) (or .cse19 .cse25 .cse26 .cse16 .cse28 .cse29 .cse37 .cse17 .cse1 .cse35 .cse32 .cse33 (< 0 |old(~b0_ev~0)|) .cse20 .cse34 (and .cse2 .cse3 .cse4 .cse5 .cse6 (= ~d0_val~0 ~d0_val_t~0) .cse7 .cse15 .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13) .cse21 .cse23 .cse22 .cse24 .cse0 .cse31 .cse27 .cse30))) [2018-10-26 23:30:49,335 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)) (.cse3 (< ~b1_val_t~0 1)) (.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)|)) (.cse4 (not (= |old(~z_val~0)| ~z_val_t~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)) .cse21 (and (= 0 ~z_val~0) (= |old(~d0_ev~0)| ~d0_ev~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) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) .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 (or .cse5 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15 .cse21 .cse1 .cse2 .cse17 .cse18 .cse19 .cse20) .cse4))) [2018-10-26 23:30:49,339 INFO L425 ceAbstractionStarter]: For program point update_channelsEXIT(lines 198 240) no Hoare annotation was computed. [2018-10-26 23:30:49,339 INFO L425 ceAbstractionStarter]: For program point L202(lines 201 239) no Hoare annotation was computed. [2018-10-26 23:30:49,339 INFO L421 ceAbstractionStarter]: At program point fire_delta_eventsENTRY(lines 307 339) the Hoare annotation is: (let ((.cse5 (= 0 |old(~d0_ev~0)|)) (.cse9 (= 0 |old(~b0_ev~0)|)) (.cse0 (= |old(~b1_ev~0)| 0)) (.cse15 (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))) (.cse1 (= ~b0_req_up~0 1)) (.cse2 (< 0 ~comp_m1_i~0)) (.cse3 (< ~b1_val_t~0 1)) (.cse4 (< 0 |old(~d0_ev~0)|)) (.cse6 (not (= ~z_val~0 ~z_val_t~0))) (.cse7 (= ~b1_req_up~0 1)) (.cse8 (< ~b1_val~0 ~b1_val_t~0)) (.cse10 (< ~d0_val_t~0 1)) (.cse11 (< ~b0_val~0 ~b0_val_t~0)) (.cse12 (< 0 |old(~b0_ev~0)|)) (.cse13 (< ~comp_m1_st~0 2)) (.cse14 (< ~b0_val_t~0 1)) (.cse16 (< ~d1_val_t~0 1)) (.cse17 (< |old(~z_ev~0)| 2)) (.cse18 (= |old(~b1_ev~0)| 1)) (.cse19 (< 0 ~z_val~0)) (.cse20 (< ~d1_val~0 ~d1_val_t~0)) (.cse21 (not (= ~d0_val_t~0 ~d0_val~0))) (.cse22 (< ~z_val~0 0)) (.cse23 (= 1 |old(~d1_ev~0)|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (or .cse20 .cse8 .cse15 .cse3 (and (or (or .cse7 (< |old(~b0_ev~0)| 2) .cse0 .cse13 .cse16 .cse18 .cse17 .cse19 .cse1 .cse2 .cse22 .cse4 .cse5 .cse23) .cse21 .cse10 .cse11 .cse14) (or .cse7 .cse9 .cse10 .cse11 .cse0 .cse13 .cse14 .cse16 .cse18 .cse17 .cse19 (< |old(~d0_ev~0)| 2) .cse1 .cse2 (= 1 |old(~b0_ev~0)|) .cse21 .cse22 .cse23)) .cse6) (or .cse15 (< 1 |old(~d1_ev~0)|) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse10 (< 0 ~z_req_up~0) .cse11 .cse12 .cse13 .cse14 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23))) [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point L316-1(lines 310 338) no Hoare annotation was computed. [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point L331-1(lines 307 339) no Hoare annotation was computed. [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point L321-1(lines 310 338) no Hoare annotation was computed. [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point L311-1(lines 310 338) no Hoare annotation was computed. [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point fire_delta_eventsEXIT(lines 307 339) no Hoare annotation was computed. [2018-10-26 23:30:49,343 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 310 338) no Hoare annotation was computed. [2018-10-26 23:30:49,344 INFO L421 ceAbstractionStarter]: At program point L417(line 417) the Hoare annotation is: (let ((.cse19 (not (= ~d0_ev~0 0))) (.cse20 (not (= ~b0_ev~0 0))) (.cse21 (<= 2 ~z_ev~0)) (.cse22 (<= ~comp_m1_i~0 0)) (.cse23 (<= |old(~z_ev~0)| ~z_ev~0))) (let ((.cse10 (<= ~d0_ev~0 0)) (.cse17 (and .cse19 (not (= ~b1_ev~0 0)) .cse20 (<= ~b1_ev~0 1) .cse21 .cse22 .cse23)) (.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) .cse19 .cse20 .cse21 (<= 2 ~b1_ev~0) .cse22 .cse23)) (.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) (and (= ~d0_val_t~0 ~d0_val~0) .cse4 .cse5 .cse12 (let ((.cse14 (= ~b0_ev~0 1)) (.cse15 (= ~z_val~0 |old(~z_val~0)|)) (.cse16 (<= ~d0_ev~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse14 .cse15 .cse16 .cse17 .cse13))) .cse6) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< 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 .cse17 .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 ((.cse18 (= 1 ~d0_ev~0))) (or (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse18 .cse11 .cse17 .cse13) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse18 .cse11 .cse7 .cse13))) .cse5 .cse12 .cse9 .cse6)))) [2018-10-26 23:30:49,346 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)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (and (= ~z_val~0 ~z_val_t~0) (= 0 ~z_val~0) (= |old(~d0_ev~0)| ~d0_ev~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) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< |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-10-26 23:30:49,346 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-10-26 23:30:49,348 INFO L425 ceAbstractionStarter]: For program point start_simulationEXIT(lines 408 450) no Hoare annotation was computed. [2018-10-26 23:30:49,349 INFO L421 ceAbstractionStarter]: At program point L436(line 436) the Hoare annotation is: (let ((.cse16 (<= 2 ~comp_m1_st~0)) (.cse17 (not (= ~d1_ev~0 1))) (.cse19 (= ~z_val~0 ~z_val_t~0)) (.cse8 (= 0 ~z_val~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse7 (= ~d0_val~0 ~d0_val_t~0)) (.cse1 (not (= ~b0_req_up~0 1))) (.cse18 (<= 2 ~d0_ev~0)) (.cse2 (<= ~b0_val_t~0 ~b0_val~0)) (.cse9 (<= 2 ~d1_ev~0)) (.cse3 (= 0 ~comp_m1_st~0)) (.cse12 (not (= ~b1_ev~0 0))) (.cse4 (not (= ~b0_ev~0 0))) (.cse14 (not (= ~b0_ev~0 1))) (.cse5 (not (= ~b1_ev~0 1))) (.cse15 (<= 2 ~z_ev~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse6 (<= ~d1_val_t~0 ~d1_val~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)|) (< |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 .cse13 .cse14 .cse15) (< 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)|) (and (and .cse16 .cse0 .cse17 .cse7 .cse1 .cse18 .cse2 .cse12 .cse4 .cse14 .cse5 .cse15) .cse19 .cse13 .cse8 .cse6) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (and .cse16 .cse0 .cse17 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse14 .cse13 .cse15) (and (and .cse0 .cse7 .cse1 .cse18 .cse2 .cse9 .cse3 (= ~z_val~0 |old(~z_val~0)|) .cse12 .cse4 .cse14 .cse5 .cse15) .cse13 .cse6) (not (= 1 |old(~d1_req_up~0)|)))) [2018-10-26 23:30:49,349 INFO L421 ceAbstractionStarter]: At program point L434(line 434) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse4 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~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)) (.cse3 (= ~d0_val~0 ~d0_val_t~0)) (.cse13 (= 0 ~z_val~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)) (< |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)|) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~d0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse7 .cse9 .cse14 .cse3 .cse13 (<= ~d0_ev~0 0) (not (= ~d0_ev~0 0)) .cse6 .cse8 .cse12 .cse10) (not (= 1 |old(~d1_req_up~0)|)))) [2018-10-26 23:30:49,351 INFO L421 ceAbstractionStarter]: At program point L434-1(line 434) the Hoare annotation is: (let ((.cse0 (= ~z_val~0 ~z_val_t~0)) (.cse16 (= 0 ~z_val~0)) (.cse17 (<= ~d0_ev~0 0)) (.cse18 (not (= ~d0_ev~0 0))) (.cse1 (<= ~b1_val_t~0 ~b1_val~0)) (.cse2 (<= 2 ~comp_m1_st~0)) (.cse15 (= 1 ~d1_ev~0)) (.cse3 (not (= 1 ~b1_req_up~0))) (.cse4 (= ~d0_val~0 ~d0_val_t~0)) (.cse5 (not (= ~b0_req_up~0 1))) (.cse6 (<= 2 ~d0_ev~0)) (.cse7 (<= ~b0_val_t~0 ~b0_val~0)) (.cse8 (= ~z_val~0 |old(~z_val~0)|)) (.cse9 (not (= ~b1_ev~0 0))) (.cse10 (not (= ~b0_ev~0 0))) (.cse11 (not (= ~b0_ev~0 1))) (.cse12 (not (= ~b1_ev~0 1))) (.cse13 (<= 2 ~z_ev~0)) (.cse14 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (not (= |old(~d0_req_up~0)| 1)) (and .cse2 .cse3 .cse5 .cse7 .cse10 .cse12 .cse14 .cse15 .cse4 .cse16 .cse17 .cse18 .cse9 .cse11 .cse1 .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)|) (< |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 .cse2 .cse3 .cse5 .cse7 .cse0 .cse10 .cse12 .cse14 .cse4 .cse16 .cse17 .cse18 .cse9 .cse11 .cse1 .cse13) (< ~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 .cse1 (and .cse2 .cse15 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14) (not (= 1 |old(~d1_req_up~0)|)))) [2018-10-26 23:30:49,351 INFO L421 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (let ((.cse0 (<= 2 ~comp_m1_st~0)) (.cse1 (not (= 1 ~b1_req_up~0))) (.cse2 (not (= ~d1_ev~0 1))) (.cse4 (not (= ~b0_req_up~0 1))) (.cse5 (<= ~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)) (.cse3 (= ~d0_val~0 ~d0_val_t~0)) (.cse13 (= 0 ~z_val~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)) (< |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)|) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 ~d0_ev~0) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 .cse13 .cse14) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse11 .cse7 .cse9 .cse14 .cse3 .cse13 (<= ~d0_ev~0 0) (not (= ~d0_ev~0 0)) .cse6 .cse8 .cse12 .cse10) (not (= 1 |old(~d1_req_up~0)|)))) [2018-10-26 23:30:49,355 INFO L425 ceAbstractionStarter]: For program point L430-1(line 430) no Hoare annotation was computed. [2018-10-26 23:30:49,355 INFO L421 ceAbstractionStarter]: At program point L426(line 426) the Hoare annotation is: (let ((.cse15 (= ~z_req_up~0 |old(~z_req_up~0)|)) (.cse4 (= 0 ~comp_m1_st~0)) (.cse20 (<= 2 ~d1_ev~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse16 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse5 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse17 (not (= ~b1_ev~0 1))) (.cse14 (<= 2 ~z_ev~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (= 0 ~z_val~0)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~b1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< 0 |old(~z_val~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse6 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (and .cse6 (or (and .cse0 .cse1 .cse8 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse12 .cse17 .cse14) (and (= ~d0_val_t~0 ~d0_val~0) (and .cse0 .cse1 .cse2 (<= 2 ~b0_ev~0) .cse4 .cse11 .cse18 (not (= ~d0_ev~0 1)) .cse17 .cse14 .cse15) .cse3)) .cse13 .cse9 .cse7) (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)|)) (and .cse13 (and .cse0 .cse8 .cse2 .cse19 .cse3 .cse20 .cse4 (= ~z_val~0 |old(~z_val~0)|) .cse18 .cse5 .cse12 .cse17 .cse14) .cse7) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse18 .cse13 .cse12 .cse14) (< 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)|) (and (and .cse16 .cse0 .cse1 .cse8 .cse2 .cse19 .cse3 .cse18 .cse5 .cse12 .cse17 .cse14) .cse6 .cse13 .cse9 .cse7) (< |old(~z_val~0)| 0))) [2018-10-26 23:30:49,355 INFO L425 ceAbstractionStarter]: For program point L426-1(line 426) no Hoare annotation was computed. [2018-10-26 23:30:49,357 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 444) no Hoare annotation was computed. [2018-10-26 23:30:49,357 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)|)) (.cse4 (= 0 ~comp_m1_st~0)) (.cse20 (<= 2 ~d1_ev~0)) (.cse10 (<= ~d0_ev~0 0)) (.cse11 (not (= ~d0_ev~0 0))) (.cse16 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse1 (not (= ~d1_ev~0 1))) (.cse8 (= ~d0_val~0 ~d0_val_t~0)) (.cse2 (not (= ~b0_req_up~0 1))) (.cse19 (<= 2 ~d0_ev~0)) (.cse3 (<= ~b0_val_t~0 ~b0_val~0)) (.cse18 (not (= ~b1_ev~0 0))) (.cse5 (not (= ~b0_ev~0 0))) (.cse12 (not (= ~b0_ev~0 1))) (.cse17 (not (= ~b1_ev~0 1))) (.cse14 (<= 2 ~z_ev~0)) (.cse6 (= ~z_val~0 ~z_val_t~0)) (.cse13 (<= ~b1_val_t~0 ~b1_val~0)) (.cse9 (= 0 ~z_val~0)) (.cse7 (<= ~d1_val_t~0 ~d1_val~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= 2 ~b1_ev~0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (< |old(~d1_ev~0)| 2) (< |old(~d1_req_up~0)| |old(~b1_req_up~0)|) (< |old(~b1_ev~0)| 2) (< ~b0_val_t~0 1) (< 0 |old(~z_val~0)|) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (and .cse16 .cse0 .cse1 .cse2 .cse3 .cse6 .cse5 .cse17 .cse7 .cse8 .cse9 .cse10 .cse11 .cse18 .cse12 .cse13 .cse14) (not (= 1 |old(~d1_req_up~0)|)) (not (= |old(~d0_req_up~0)| 1)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (and .cse6 (or (and .cse0 .cse1 .cse8 .cse2 .cse19 .cse3 .cse4 .cse18 .cse5 .cse12 .cse17 .cse14) (and (= ~d0_val_t~0 ~d0_val~0) (and .cse0 .cse1 .cse2 (<= 2 ~b0_ev~0) .cse4 .cse11 .cse18 (not (= ~d0_ev~0 1)) .cse17 .cse14 .cse15) .cse3)) .cse13 .cse9 .cse7) (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)|)) (and .cse13 (and .cse0 .cse8 .cse2 .cse19 .cse3 .cse20 .cse4 (= ~z_val~0 |old(~z_val~0)|) .cse18 .cse5 .cse12 .cse17 .cse14) .cse7) (< 0 |old(~d1_val~0)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse17 .cse7 .cse8 .cse9 .cse20 .cse10 .cse11 .cse18 .cse13 .cse12 .cse14) (< 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)|) (and (and .cse16 .cse0 .cse1 .cse8 .cse2 .cse19 .cse3 .cse18 .cse5 .cse12 .cse17 .cse14) .cse6 .cse13 .cse9 .cse7) (< |old(~z_val~0)| 0))) [2018-10-26 23:30:49,358 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)) (.cse19 (= ~b0_ev~0 1)) (.cse18 (= ~d0_val_t~0 ~d0_val~0)) (.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) (and (and .cse0 .cse1 .cse2 .cse19 .cse4 (<= ~d0_ev~0 1) .cse16 .cse13) .cse18 .cse3 .cse5 .cse12 .cse9 .cse7) (< 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)) (< |old(~d0_ev~0)| 2) (< 0 ~comp_m1_i~0) (not (= 0 |old(~comp_m1_st~0)|)) (< ~b1_val_t~0 1) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse7 .cse16 .cse20 .cse8 .cse9 .cse17 .cse11 .cse12 .cse13) (< 0 |old(~b0_val~0)|) (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-10-26 23:30:49,360 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)|) (< |old(~b0_val~0)| 0) (< |old(~b0_ev~0)| 2) (< ~d0_val_t~0 1) (< 0 |old(~z_req_up~0)|) (< |old(~b0_req_up~0)| |old(~d1_req_up~0)|) (< ~b0_val_t~0 1) (not (= |old(~d0_val~0)| 0)) (< ~d1_val_t~0 1) (and (= ~z_val~0 ~z_val_t~0) (= 0 ~z_val~0) (= |old(~d0_ev~0)| ~d0_ev~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) (= |old(~b0_val~0)| ~b0_val~0) (= |old(~d1_ev~0)| ~d1_ev~0) (= ~d0_req_up~0 1) (<= |old(~z_ev~0)| ~z_ev~0)) (< |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-10-26 23:30:49,366 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-10-26 23:30:49,366 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-10-26 23:30:49,366 INFO L425 ceAbstractionStarter]: For program point L439(lines 439 443) no Hoare annotation was computed. [2018-10-26 23:30:49,370 INFO L425 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-10-26 23:30:49,370 INFO L421 ceAbstractionStarter]: At program point L435(line 435) the Hoare annotation is: (let ((.cse7 (= 1 ~d1_ev~0)) (.cse3 (= 0 ~comp_m1_st~0)) (.cse16 (<= 2 ~d0_ev~0)) (.cse17 (<= 2 ~comp_m1_st~0)) (.cse0 (not (= 1 ~b1_req_up~0))) (.cse18 (not (= ~d1_ev~0 1))) (.cse1 (not (= ~b0_req_up~0 1))) (.cse2 (<= ~b0_val_t~0 ~b0_val~0)) (.cse19 (= ~z_val~0 ~z_val_t~0)) (.cse4 (not (= ~b0_ev~0 0))) (.cse5 (not (= ~b1_ev~0 1))) (.cse6 (<= ~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))) (.cse12 (not (= ~b1_ev~0 0))) (.cse13 (not (= ~b0_ev~0 1))) (.cse14 (<= ~b1_val_t~0 ~b1_val~0)) (.cse15 (<= 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)|) (< |old(~b0_val~0)| 0) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse14 .cse6 (and .cse7 .cse0 .cse8 .cse1 .cse16 .cse2 .cse3 (= ~z_val~0 |old(~z_val~0)|) .cse12 .cse4 .cse13 .cse5 .cse15)) (< |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)|) (and (and .cse17 .cse0 .cse18 .cse8 .cse1 .cse16 .cse2 .cse12 .cse4 .cse13 .cse5 .cse15) .cse19 .cse14 .cse9 .cse6) (< |old(~b1_req_up~0)| |old(~d1_req_up~0)|) (< |old(~z_val~0)| 0) (and .cse17 .cse0 .cse18 .cse1 .cse2 .cse19 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (not (= 1 |old(~d1_req_up~0)|)))) [2018-10-26 23:30:49,370 INFO L425 ceAbstractionStarter]: For program point L423(line 423) no Hoare annotation was computed. [2018-10-26 23:30:49,370 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 23:30:49,370 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-10-26 23:30:49,371 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 23:30:49,371 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 23:30:49,371 INFO L425 ceAbstractionStarter]: For program point init_modelFINAL(lines 451 482) no Hoare annotation was computed. [2018-10-26 23:30:49,371 INFO L425 ceAbstractionStarter]: For program point init_modelEXIT(lines 451 482) no Hoare annotation was computed. [2018-10-26 23:30:49,371 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) (= 1 |old(~d1_ev~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))) [2018-10-26 23:30:49,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 11:30:49 BoogieIcfgContainer [2018-10-26 23:30:49,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 23:30:49,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 23:30:49,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 23:30:49,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 23:30:49,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:28:15" (3/4) ... [2018-10-26 23:30:49,496 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 23:30:49,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure activate_threads [2018-10-26 23:30:49,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2018-10-26 23:30:49,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure method1 [2018-10-26 23:30:49,505 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure reset_delta_events [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_threads [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_z [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d1 [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_d0 [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure eval [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stop_simulation [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b1 [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_b0 [2018-10-26 23:30:49,506 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure is_method1_triggered [2018-10-26 23:30:49,507 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure update_channels [2018-10-26 23:30:49,507 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure fire_delta_events [2018-10-26 23:30:49,507 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure start_simulation [2018-10-26 23:30:49,507 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure init_model [2018-10-26 23:30:49,517 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-10-26 23:30:49,519 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-26 23:30:49,553 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((((((((((((((((((!(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_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || b0_val_t < 1) || 0 < \old(z_val)) || \old(b1_req_up) < \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)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || \old(d0_ev) < 2) || 0 < comp_m1_i) || ((((z_val == 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)) && 2 <= b0_ev) && 0 == comp_m1_st) && !(d0_ev == 0)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && z_req_up == \old(z_req_up)) && b0_val_t <= b0_val))) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || !(\old(z_val) == \old(z_val_t))) || ((b1_val_t <= b1_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) && d1_val_t <= d1_val)) || 0 < \old(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)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((((((((((((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) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && z_val == z_val_t) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || \old(z_val) < 0 [2018-10-26 23:30:49,554 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-10-26 23:30:49,554 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((!(d0_val_t == d0_val) || ((((((((((((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) || d0_val_t < 1) || 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))) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (z_val == z_val_t && 2 <= comp_m1_st)) && (((((((((((((((((((((((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) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || \old(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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((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))) || !(z_val == \old(z_val_t))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t))) && (((((((((((((((((((((((((1 < d1_ev || 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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 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) || (2 <= comp_m1_st && z_val == z_val_t)) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (((((((((((((((((((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) || (2 <= comp_m1_st && z_val == z_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 1 < d1_ev) || 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))) || 0 < d0_ev) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_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)) || 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)) || !(z_val == \old(z_val_t))) || (z_val == z_val_t && 2 <= comp_m1_st)) [2018-10-26 23:30:49,555 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 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))) || 0 < d0_ev) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (2 <= comp_m1_st && z_val == z_val_t)) && ((z_val == z_val_t && 2 <= comp_m1_st) || ((d1_val < d1_val_t || b1_val < b1_val_t) || b1_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((!(d0_val_t == d0_val) || ((((((((((((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) || d0_val_t < 1) || 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)))) && (((((((((((((((((((((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) || (2 <= comp_m1_st && 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 == \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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((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))) || (2 <= comp_m1_st && z_val == 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) || 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) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || b1_val_t < 1) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || \old(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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((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))) || !(z_val == \old(z_val_t))) [2018-10-26 23:30:49,608 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f7e5c500-94df-4439-af34-60fe316972cf/bin-2019/uautomizer/witness.graphml [2018-10-26 23:30:49,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 23:30:49,611 INFO L168 Benchmark]: Toolchain (without parser) took 155715.83 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 959.6 MB in the beginning and 3.3 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-10-26 23:30:49,611 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:30:49,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 943.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:49,612 INFO L168 Benchmark]: Boogie Preprocessor took 37.88 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 23:30:49,612 INFO L168 Benchmark]: RCFGBuilder took 947.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:49,612 INFO L168 Benchmark]: TraceAbstraction took 154316.70 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-10-26 23:30:49,613 INFO L168 Benchmark]: Witness Printer took 129.18 ms. Allocated memory is still 5.4 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 77.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 11.5 GB. [2018-10-26 23:30:49,614 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 278.57 ms. Allocated memory is still 1.0 GB. Free memory was 959.6 MB in the beginning and 943.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.88 ms. Allocated memory is still 1.0 GB. Free memory is still 943.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 947.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -162.1 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 154316.70 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.1 GB in the beginning and 3.4 GB in the end (delta: -2.3 GB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. * Witness Printer took 129.18 ms. Allocated memory is still 5.4 GB. Free memory was 3.4 GB in the beginning and 3.3 GB in the end (delta: 77.8 MB). Peak memory consumption was 77.8 MB. 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) || ((((((((((((((((((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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((!(d0_val_t == d0_val) || ((((((((((((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) || d0_val_t < 1) || 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))) || 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)) && (((((0 == __retres1 || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_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) || !(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) || d0_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || z_val < 0) || !(0 == comp_m1_st)) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < z_req_up) || 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)) || 0 < d0_ev) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_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)) || 1 <= __retres1) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_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: (((((((((((((((((((((((((((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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 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))) || 0 < d0_ev) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_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)) || d1_val < d1_val_t) || b1_val < b1_val_t) || b1_val_t < 1) || !(z_val == \old(z_val_t))) || (2 <= comp_m1_st && z_val == z_val_t)) && ((z_val == z_val_t && 2 <= comp_m1_st) || ((d1_val < d1_val_t || b1_val < b1_val_t) || b1_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((!(d0_val_t == d0_val) || ((((((((((((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) || d0_val_t < 1) || 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)))) && (((((((((((((((((((((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) || (2 <= comp_m1_st && 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 == \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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || d1_val_t < 1) || z_ev < 2) || b1_ev == 1) || 0 < z_val) || d1_val < d1_val_t) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((((((((((((((((((((((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))) || (2 <= comp_m1_st && z_val == 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) || 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) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t)) || b1_val_t < 1) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || \old(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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((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))) || !(z_val == \old(z_val_t))) - InvariantResult [Line: 275]: Loop Invariant Derived loop invariant: (((((((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && ((((!(d0_val_t == d0_val) || ((((((((((((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) || d0_val_t < 1) || 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))) || (\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up))) || (z_val == z_val_t && 2 <= comp_m1_st)) && (((((((((((((((((((((((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) || ((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || b1_ev == 0) || \old(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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((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))) || !(z_val == \old(z_val_t))) || ((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) && z_val == z_val_t))) && (((((((((((((((((((((((((1 < d1_ev || 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) || ((z_val == z_val_t && \old(comp_m1_st) == comp_m1_st) && z_req_up == \old(z_req_up))) || 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) || (2 <= comp_m1_st && z_val == z_val_t)) || !(d0_val_t == d0_val)) || z_val < 0) || 1 == d1_ev)) && (((\old(comp_m1_st) == comp_m1_st && z_req_up == \old(z_req_up)) || (((((((((((((((((((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) || (2 <= comp_m1_st && z_val == z_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) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1) && (((((((((((((((((((b1_req_up == 1 || b0_ev < 2) || 0 < \old(z_req_up)) || 1 < d1_ev) || 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))) || 0 < d0_ev) || 0 == d0_ev) || 1 == d1_ev) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_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)) || 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)) || !(z_val == \old(z_val_t))) || (z_val == z_val_t && 2 <= comp_m1_st)) - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((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)) || 1 == __retres1) || 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) || 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) && (((((((((((((((((((((((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)) && (1 == __retres1 || ((d1_val < d1_val_t || b1_val < b1_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_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)) || !(d0_val_t == d0_val)) || d0_val_t < 1) || b0_val < b0_val_t) || b0_val_t < 1))) || b1_val_t < 1)) && ((((((((((((((((((((((b1_ev == 0 || b0_req_up == 1) || 0 < comp_m1_i) || b1_val_t < 1) || 0 < d0_ev) || 0 == d0_ev) || !(1 == d1_ev)) || b1_req_up == 1) || b1_val < b1_val_t) || 0 == b0_ev) || d0_val_t < 1) || b0_val < b0_val_t) || 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)) && (((((((((1 == __retres1 || d1_val < d1_val_t) || b1_val < b1_val_t) || ((((((((((((b1_req_up == 1 || 0 < z_req_up) || 1 < d1_ev) || b1_ev == 0) || comp_m1_st < 2) || 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) || !(d0_val_t == d0_val)) || b1_val_t < 1) || d0_val_t < 1) || b0_val < b0_val_t) || !(z_val == z_val_t)) || b0_val_t < 1)) && (((((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) || 1 == __retres1) || !(z_val == z_val_t))) && ((((((((((((((((((((b1_req_up == 1 || 0 < z_req_up) || 1 < d1_ev) || b1_ev == 0) || comp_m1_st < 2) || z_ev < 2) || b0_req_up == 1) || 0 < comp_m1_i) || !(1 == d0_ev)) || !(1 == b0_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) || !(z_val == z_val_t)) || b0_val_t < 1) || 1 == __retres1)) && (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || 0 == __retres1) || ((((((((((((((((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) || !(z_val == z_val_t)) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((!(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_ev) < 2) || \old(d1_req_up) < \old(b1_req_up)) || \old(b1_ev) < 2) || b0_val_t < 1) || 0 < \old(z_val)) || \old(b1_req_up) < \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)) || !(1 == \old(d1_req_up))) || !(\old(d0_req_up) == 1)) || \old(d0_ev) < 2) || 0 < comp_m1_i) || ((((z_val == 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)) && 2 <= b0_ev) && 0 == comp_m1_st) && !(d0_ev == 0)) && !(b1_ev == 0)) && !(d0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && z_req_up == \old(z_req_up)) && b0_val_t <= b0_val))) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || !(0 == \old(comp_m1_st))) || b1_val_t < 1) || 0 < \old(b0_val)) || !(\old(z_val) == \old(z_val_t))) || ((b1_val_t <= b1_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) && d1_val_t <= d1_val)) || 0 < \old(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)) || !(\old(d0_val) == 0)) || d1_val_t < 1) || \old(z_ev) < 2) || \old(d1_req_up) + 1 <= \old(b0_req_up)) || (((((((((((((((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) && !(b1_ev == 0)) && !(b0_ev == 0)) && !(b0_ev == 1)) && !(b1_ev == 1)) && 2 <= z_ev) && z_val == z_val_t) && b1_val_t <= b1_val) && 0 == z_val) && d1_val_t <= d1_val)) || \old(z_val) < 0 - InvariantResult [Line: 393]: Loop Invariant Derived loop invariant: (((((d1_val < d1_val_t || b1_val < b1_val_t) || b1_val_t < 1) || 0 == tmp) || ((((((((((((((((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) || !(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 == 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, 154.1s OverallTime, 24 OverallIterations, 3 TraceHistogramMax, 43.1s AutomataDifference, 0.0s DeadEndRemovalTime, 76.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5346 SDtfs, 11909 SDslu, 9608 SDs, 0 SdLazy, 14810 SolverSat, 4147 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3392 GetRequests, 3087 SyntacticMatches, 6 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 737 ImplicationChecksByTransitivity, 10.5s 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: 22.0s AutomataMinimizationTime, 24 MinimizatonAttempts, 46311 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 52 LocationsWithAnnotation, 82299 PreInvPairs, 82640 NumberOfFragments, 21239 HoareAnnotationTreeSize, 82299 FomulaSimplifications, 2050609 FormulaSimplificationTreeSizeReduction, 12.3s HoareSimplificationTime, 52 FomulaSimplificationsInter, 3257975 FormulaSimplificationTreeSizeReductionInter, 63.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 6481 NumberOfCodeBlocks, 6481 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 6437 ConstructedInterpolants, 0 QuantifiedInterpolants, 1565515 SizeOfPredicates, 14 NumberOfNonLiveVariables, 18104 ConjunctsInSsa, 125 ConjunctsInUnsatCore, 44 InterpolantComputations, 14 PerfectInterpolantSequences, 1494/1834 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...