./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.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_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f258c90f36976c16d0d11e6e43c3b54011814f65 ...................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f258c90f36976c16d0d11e6e43c3b54011814f65 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:24:41,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:24:41,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:24:41,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:24:41,273 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:24:41,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:24:41,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:24:41,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:24:41,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:24:41,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:24:41,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:24:41,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:24:41,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:24:41,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:24:41,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:24:41,283 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:24:41,284 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:24:41,285 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:24:41,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:24:41,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:24:41,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:24:41,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:24:41,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:24:41,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:24:41,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:24:41,292 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:24:41,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:24:41,293 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:24:41,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:24:41,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:24:41,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:24:41,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:24:41,295 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:24:41,295 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:24:41,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:24:41,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:24:41,297 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:24:41,308 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:24:41,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:24:41,309 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:24:41,309 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:24:41,309 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:24:41,309 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:24:41,309 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:24:41,309 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:24:41,309 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:24:41,310 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:24:41,310 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:24:41,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:24:41,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:24:41,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:24:41,311 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:24:41,312 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:24:41,312 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:24:41,312 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:24:41,312 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:24:41,312 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:24:41,312 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:24:41,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:24:41,313 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan 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 -> Taipan 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 -> f258c90f36976c16d0d11e6e43c3b54011814f65 [2018-11-10 05:24:41,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:24:41,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:24:41,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:24:41,350 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:24:41,350 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:24:41,351 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-10 05:24:41,386 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/7f1a8b0f3/7d5a3156367e4aeeb0418109d7e11784/FLAG5bc713909 [2018-11-10 05:24:42,138 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:24:42,139 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-10 05:24:42,183 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/7f1a8b0f3/7d5a3156367e4aeeb0418109d7e11784/FLAG5bc713909 [2018-11-10 05:24:42,194 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/7f1a8b0f3/7d5a3156367e4aeeb0418109d7e11784 [2018-11-10 05:24:42,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:24:42,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:24:42,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:24:42,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:24:42,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:24:42,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:42" (1/1) ... [2018-11-10 05:24:42,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fdaecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:42, skipping insertion in model container [2018-11-10 05:24:42,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:42" (1/1) ... [2018-11-10 05:24:42,211 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:24:42,349 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:24:44,025 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizes.extractBooleanValue(TypeSizes.java:432) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizes.extractIntegerValueInteger(TypeSizes.java:391) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizes.extractIntegerValue(TypeSizes.java:342) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructBinaryBitwiseIntegerExpression(IntegerTranslation.java:179) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.ExpressionTranslation.constructBinaryBitwiseExpression(ExpressionTranslation.java:128) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleBitshiftOperation(CHandler.java:3728) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:882) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:663) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1519) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:229) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:960) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:364) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3316) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2119) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:537) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:188) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-10 05:24:44,029 INFO L168 Benchmark]: Toolchain (without parser) took 1832.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:24:44,030 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:24:44,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1830.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:24:44,033 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1830.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 198.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: NullPointerException: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizes.extractBooleanValue(TypeSizes.java:432) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 05:24:45,289 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:24:45,290 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:24:45,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:24:45,299 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:24:45,300 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:24:45,301 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:24:45,302 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:24:45,303 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:24:45,303 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:24:45,304 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:24:45,304 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:24:45,305 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:24:45,305 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:24:45,306 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:24:45,307 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:24:45,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:24:45,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:24:45,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:24:45,311 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:24:45,311 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:24:45,312 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:24:45,314 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:24:45,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:24:45,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:24:45,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:24:45,315 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:24:45,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:24:45,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:24:45,317 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:24:45,317 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:24:45,318 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:24:45,318 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:24:45,319 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:24:45,319 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:24:45,320 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:24:45,320 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 05:24:45,330 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:24:45,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:24:45,330 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:24:45,331 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:24:45,331 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:24:45,331 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:24:45,331 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:24:45,331 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:24:45,332 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:24:45,332 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:24:45,333 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:24:45,333 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:24:45,334 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 05:24:45,334 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:24:45,335 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 05:24:45,335 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 05:24:45,335 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_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan 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 -> Taipan 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 -> f258c90f36976c16d0d11e6e43c3b54011814f65 [2018-11-10 05:24:45,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:24:45,373 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:24:45,376 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:24:45,377 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:24:45,378 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:24:45,378 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-10 05:24:45,424 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/54cc2f458/074a7b3b8f104418bc689aa413d13419/FLAG037a40051 [2018-11-10 05:24:46,029 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:24:46,030 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/sv-benchmarks/c/ntdrivers/floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-10 05:24:46,064 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/54cc2f458/074a7b3b8f104418bc689aa413d13419/FLAG037a40051 [2018-11-10 05:24:46,073 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/data/54cc2f458/074a7b3b8f104418bc689aa413d13419 [2018-11-10 05:24:46,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:24:46,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:24:46,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:24:46,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:24:46,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:24:46,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:46" (1/1) ... [2018-11-10 05:24:46,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ca6eac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:46, skipping insertion in model container [2018-11-10 05:24:46,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:24:46" (1/1) ... [2018-11-10 05:24:46,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:24:46,222 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:24:48,556 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:24:48,588 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:24:49,224 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:24:49,355 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:24:49,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49 WrapperNode [2018-11-10 05:24:49,356 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:24:49,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:24:49,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:24:49,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:24:49,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,617 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:24:49,618 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:24:49,618 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:24:49,618 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:24:49,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,627 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... [2018-11-10 05:24:49,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:24:49,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:24:49,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:24:49,927 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:24:49,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:24:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-10 05:24:49,973 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-10 05:24:49,973 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure RtlInitUnicodeString [2018-11-10 05:24:49,974 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlInitUnicodeString [2018-11-10 05:24:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-10 05:24:49,974 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-10 05:24:49,974 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-10 05:24:49,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-10 05:24:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-10 05:24:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-10 05:24:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-10 05:24:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-10 05:24:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetHardErrorOrVerifyDevice [2018-11-10 05:24:49,975 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetHardErrorOrVerifyDevice [2018-11-10 05:24:49,975 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-10 05:24:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-10 05:24:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure IoDetachDevice [2018-11-10 05:24:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDetachDevice [2018-11-10 05:24:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 05:24:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 05:24:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-10 05:24:49,976 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-10 05:24:49,976 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-10 05:24:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-10 05:24:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure MmResetDriverPaging [2018-11-10 05:24:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure MmResetDriverPaging [2018-11-10 05:24:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-10 05:24:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-10 05:24:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-10 05:24:49,977 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-10 05:24:49,977 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-10 05:24:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-10 05:24:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure KeInitializeEvent [2018-11-10 05:24:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure KeInitializeEvent [2018-11-10 05:24:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-10 05:24:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-10 05:24:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-10 05:24:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-10 05:24:49,978 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-10 05:24:49,978 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-10 05:24:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-10 05:24:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-10 05:24:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-10 05:24:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-10 05:24:49,979 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-10 05:24:49,979 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-10 05:24:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-10 05:24:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-10 05:24:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-10 05:24:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-10 05:24:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteDevice [2018-11-10 05:24:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteDevice [2018-11-10 05:24:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure ExAcquireFastMutex [2018-11-10 05:24:49,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAcquireFastMutex [2018-11-10 05:24:49,980 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-10 05:24:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-10 05:24:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-10 05:24:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-10 05:24:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-10 05:24:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-10 05:24:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ExReleaseFastMutex [2018-11-10 05:24:49,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ExReleaseFastMutex [2018-11-10 05:24:49,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:24:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:24:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-10 05:24:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-10 05:24:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-10 05:24:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-10 05:24:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-10 05:24:49,982 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-10 05:24:49,982 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:24:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:24:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-10 05:24:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-10 05:24:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-10 05:24:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-10 05:24:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure PoStartNextPowerIrp [2018-11-10 05:24:49,983 INFO L138 BoogieDeclarations]: Found implementation of procedure PoStartNextPowerIrp [2018-11-10 05:24:49,983 INFO L130 BoogieDeclarations]: Found specification of procedure ExFreePool [2018-11-10 05:24:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ExFreePool [2018-11-10 05:24:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-10 05:24:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-10 05:24:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-10 05:24:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-10 05:24:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-10 05:24:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-10 05:24:49,984 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-10 05:24:49,984 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-10 05:24:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-10 05:24:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-10 05:24:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure ObfDereferenceObject [2018-11-10 05:24:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ObfDereferenceObject [2018-11-10 05:24:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-10 05:24:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-10 05:24:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-10 05:24:49,985 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-10 05:24:49,985 INFO L130 BoogieDeclarations]: Found specification of procedure RtlFreeUnicodeString [2018-11-10 05:24:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlFreeUnicodeString [2018-11-10 05:24:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-10 05:24:49,990 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-10 05:24:49,990 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-10 05:24:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-10 05:24:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-10 05:24:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-10 05:24:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-10 05:24:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-10 05:24:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-10 05:24:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure MmPageEntireDriver [2018-11-10 05:24:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure MmPageEntireDriver [2018-11-10 05:24:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-10 05:24:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-10 05:24:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-10 05:24:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-10 05:24:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-10 05:24:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-10 05:24:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-10 05:24:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-10 05:24:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-10 05:24:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-10 05:24:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-10 05:24:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-10 05:24:49,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:24:49,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:24:50,777 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:50,777 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:50,909 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:50,909 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:51,621 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:51,622 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:51,747 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:51,747 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:52,092 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:52,092 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:52,100 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:52,100 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,358 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,358 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,366 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,366 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,377 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,377 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,483 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,483 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,502 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,502 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,528 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,528 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,660 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,660 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,709 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,709 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:54,731 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:54,731 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:55,624 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:55,624 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:55,652 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:55,652 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:25:25,885 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:25:25,885 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:25:28,114 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:25:28,114 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:25:28,135 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:25:28,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:28 BoogieIcfgContainer [2018-11-10 05:25:28,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:25:28,136 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:25:28,136 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:25:28,139 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:25:28,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:24:46" (1/3) ... [2018-11-10 05:25:28,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a95ccf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:28, skipping insertion in model container [2018-11-10 05:25:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:24:49" (2/3) ... [2018-11-10 05:25:28,140 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a95ccf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:25:28, skipping insertion in model container [2018-11-10 05:25:28,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:28" (3/3) ... [2018-11-10 05:25:28,141 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy2_true-unreach-call_true-termination.i.cil.c [2018-11-10 05:25:28,149 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:25:28,156 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:25:28,169 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:25:28,191 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:25:28,191 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:25:28,191 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:25:28,191 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:25:28,191 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:25:28,191 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:25:28,191 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:25:28,192 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:25:28,192 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:25:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states. [2018-11-10 05:25:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-10 05:25:28,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:28,223 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] [2018-11-10 05:25:28,225 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:28,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:28,228 INFO L82 PathProgramCache]: Analyzing trace with hash 917331466, now seen corresponding path program 1 times [2018-11-10 05:25:28,232 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:28,233 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:28,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:28,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:28,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:28,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:28,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:28,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 05:25:28,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 05:25:28,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 05:25:28,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:25:28,544 INFO L87 Difference]: Start difference. First operand 990 states. Second operand 2 states. [2018-11-10 05:25:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:28,634 INFO L93 Difference]: Finished difference Result 1968 states and 2970 transitions. [2018-11-10 05:25:28,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 05:25:28,635 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 43 [2018-11-10 05:25:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:28,651 INFO L225 Difference]: With dead ends: 1968 [2018-11-10 05:25:28,652 INFO L226 Difference]: Without dead ends: 983 [2018-11-10 05:25:28,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 05:25:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2018-11-10 05:25:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 983. [2018-11-10 05:25:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-11-10 05:25:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1330 transitions. [2018-11-10 05:25:28,745 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1330 transitions. Word has length 43 [2018-11-10 05:25:28,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:28,745 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 1330 transitions. [2018-11-10 05:25:28,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 05:25:28,745 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1330 transitions. [2018-11-10 05:25:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-10 05:25:28,747 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:28,747 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] [2018-11-10 05:25:28,747 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:28,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1767034057, now seen corresponding path program 1 times [2018-11-10 05:25:28,749 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:28,749 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:28,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:29,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:29,072 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:29,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:29,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:29,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:29,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:29,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:29,076 INFO L87 Difference]: Start difference. First operand 983 states and 1330 transitions. Second operand 3 states. [2018-11-10 05:25:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:29,247 INFO L93 Difference]: Finished difference Result 1019 states and 1367 transitions. [2018-11-10 05:25:29,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:29,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-11-10 05:25:29,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:29,253 INFO L225 Difference]: With dead ends: 1019 [2018-11-10 05:25:29,253 INFO L226 Difference]: Without dead ends: 997 [2018-11-10 05:25:29,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-11-10 05:25:29,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2018-11-10 05:25:29,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2018-11-10 05:25:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1340 transitions. [2018-11-10 05:25:29,291 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1340 transitions. Word has length 44 [2018-11-10 05:25:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:29,291 INFO L481 AbstractCegarLoop]: Abstraction has 997 states and 1340 transitions. [2018-11-10 05:25:29,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1340 transitions. [2018-11-10 05:25:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 05:25:29,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:29,293 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:29,293 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:29,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash 154275035, now seen corresponding path program 1 times [2018-11-10 05:25:29,295 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:29,296 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:29,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:29,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:29,653 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:29,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:29,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:29,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:29,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:29,657 INFO L87 Difference]: Start difference. First operand 997 states and 1340 transitions. Second operand 3 states. [2018-11-10 05:25:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:32,023 INFO L93 Difference]: Finished difference Result 2771 states and 3828 transitions. [2018-11-10 05:25:32,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:32,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-11-10 05:25:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:32,033 INFO L225 Difference]: With dead ends: 2771 [2018-11-10 05:25:32,033 INFO L226 Difference]: Without dead ends: 1813 [2018-11-10 05:25:32,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-11-10 05:25:32,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1811. [2018-11-10 05:25:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2018-11-10 05:25:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2461 transitions. [2018-11-10 05:25:32,105 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2461 transitions. Word has length 58 [2018-11-10 05:25:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:32,105 INFO L481 AbstractCegarLoop]: Abstraction has 1811 states and 2461 transitions. [2018-11-10 05:25:32,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2461 transitions. [2018-11-10 05:25:32,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:25:32,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:32,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:32,111 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:32,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:32,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1432951899, now seen corresponding path program 1 times [2018-11-10 05:25:32,112 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:32,112 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:32,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:32,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:32,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:32,544 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:32,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:32,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:25:32,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:25:32,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:25:32,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:32,548 INFO L87 Difference]: Start difference. First operand 1811 states and 2461 transitions. Second operand 4 states. [2018-11-10 05:25:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:32,717 INFO L93 Difference]: Finished difference Result 3579 states and 4878 transitions. [2018-11-10 05:25:32,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:25:32,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-10 05:25:32,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:32,726 INFO L225 Difference]: With dead ends: 3579 [2018-11-10 05:25:32,726 INFO L226 Difference]: Without dead ends: 1839 [2018-11-10 05:25:32,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2018-11-10 05:25:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1821. [2018-11-10 05:25:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2018-11-10 05:25:32,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2471 transitions. [2018-11-10 05:25:32,791 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2471 transitions. Word has length 81 [2018-11-10 05:25:32,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:32,792 INFO L481 AbstractCegarLoop]: Abstraction has 1821 states and 2471 transitions. [2018-11-10 05:25:32,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:25:32,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2471 transitions. [2018-11-10 05:25:32,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 05:25:32,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:32,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:32,795 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:32,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1158719087, now seen corresponding path program 1 times [2018-11-10 05:25:32,796 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:32,797 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:32,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:33,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:33,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:33,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:33,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:25:33,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:25:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:25:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:33,237 INFO L87 Difference]: Start difference. First operand 1821 states and 2471 transitions. Second operand 4 states. [2018-11-10 05:25:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:33,395 INFO L93 Difference]: Finished difference Result 3589 states and 4888 transitions. [2018-11-10 05:25:33,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:25:33,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-10 05:25:33,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:33,405 INFO L225 Difference]: With dead ends: 3589 [2018-11-10 05:25:33,405 INFO L226 Difference]: Without dead ends: 1849 [2018-11-10 05:25:33,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1849 states. [2018-11-10 05:25:33,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1849 to 1831. [2018-11-10 05:25:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1831 states. [2018-11-10 05:25:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2481 transitions. [2018-11-10 05:25:33,469 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2481 transitions. Word has length 82 [2018-11-10 05:25:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:33,470 INFO L481 AbstractCegarLoop]: Abstraction has 1831 states and 2481 transitions. [2018-11-10 05:25:33,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:25:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2481 transitions. [2018-11-10 05:25:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 05:25:33,471 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:33,472 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:33,472 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:33,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:33,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1730623141, now seen corresponding path program 1 times [2018-11-10 05:25:33,473 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:33,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:33,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:33,824 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:33,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:33,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:33,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:33,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:33,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:33,828 INFO L87 Difference]: Start difference. First operand 1831 states and 2481 transitions. Second operand 3 states. [2018-11-10 05:25:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:36,088 INFO L93 Difference]: Finished difference Result 4489 states and 6260 transitions. [2018-11-10 05:25:36,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:36,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2018-11-10 05:25:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:36,097 INFO L225 Difference]: With dead ends: 4489 [2018-11-10 05:25:36,097 INFO L226 Difference]: Without dead ends: 2747 [2018-11-10 05:25:36,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:36,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2018-11-10 05:25:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 2744. [2018-11-10 05:25:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2018-11-10 05:25:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 3753 transitions. [2018-11-10 05:25:36,156 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 3753 transitions. Word has length 79 [2018-11-10 05:25:36,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:36,156 INFO L481 AbstractCegarLoop]: Abstraction has 2744 states and 3753 transitions. [2018-11-10 05:25:36,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 3753 transitions. [2018-11-10 05:25:36,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 05:25:36,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:36,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:36,158 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:36,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:36,159 INFO L82 PathProgramCache]: Analyzing trace with hash 326955548, now seen corresponding path program 1 times [2018-11-10 05:25:36,160 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:36,160 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:36,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:36,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:36,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:36,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:36,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:25:36,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:25:36,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:25:36,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:36,470 INFO L87 Difference]: Start difference. First operand 2744 states and 3753 transitions. Second operand 4 states. [2018-11-10 05:25:36,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:36,610 INFO L93 Difference]: Finished difference Result 5442 states and 7477 transitions. [2018-11-10 05:25:36,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:25:36,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-10 05:25:36,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:36,619 INFO L225 Difference]: With dead ends: 5442 [2018-11-10 05:25:36,619 INFO L226 Difference]: Without dead ends: 2791 [2018-11-10 05:25:36,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:36,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2018-11-10 05:25:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 2760. [2018-11-10 05:25:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2018-11-10 05:25:36,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3786 transitions. [2018-11-10 05:25:36,679 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3786 transitions. Word has length 83 [2018-11-10 05:25:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:36,679 INFO L481 AbstractCegarLoop]: Abstraction has 2760 states and 3786 transitions. [2018-11-10 05:25:36,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:25:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3786 transitions. [2018-11-10 05:25:36,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 05:25:36,681 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:36,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:36,681 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:36,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash 709679603, now seen corresponding path program 1 times [2018-11-10 05:25:36,683 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:36,684 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:36,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:36,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:37,005 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:37,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:37,010 INFO L87 Difference]: Start difference. First operand 2760 states and 3786 transitions. Second operand 3 states. [2018-11-10 05:25:39,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:39,243 INFO L93 Difference]: Finished difference Result 5492 states and 7651 transitions. [2018-11-10 05:25:39,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:39,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-10 05:25:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:39,252 INFO L225 Difference]: With dead ends: 5492 [2018-11-10 05:25:39,252 INFO L226 Difference]: Without dead ends: 2829 [2018-11-10 05:25:39,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:39,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2829 states. [2018-11-10 05:25:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2829 to 2827. [2018-11-10 05:25:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2827 states. [2018-11-10 05:25:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 3871 transitions. [2018-11-10 05:25:39,310 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 3871 transitions. Word has length 80 [2018-11-10 05:25:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:39,310 INFO L481 AbstractCegarLoop]: Abstraction has 2827 states and 3871 transitions. [2018-11-10 05:25:39,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 3871 transitions. [2018-11-10 05:25:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 05:25:39,312 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:39,312 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:39,312 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:39,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash -638674446, now seen corresponding path program 1 times [2018-11-10 05:25:39,313 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:39,314 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:39,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:39,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:39,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:39,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:25:39,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:25:39,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:25:39,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:39,602 INFO L87 Difference]: Start difference. First operand 2827 states and 3871 transitions. Second operand 4 states. [2018-11-10 05:25:39,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:39,744 INFO L93 Difference]: Finished difference Result 3527 states and 4777 transitions. [2018-11-10 05:25:39,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:25:39,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-10 05:25:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:39,756 INFO L225 Difference]: With dead ends: 3527 [2018-11-10 05:25:39,757 INFO L226 Difference]: Without dead ends: 2874 [2018-11-10 05:25:39,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:25:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2018-11-10 05:25:39,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2840. [2018-11-10 05:25:39,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2840 states. [2018-11-10 05:25:39,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 3896 transitions. [2018-11-10 05:25:39,836 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 3896 transitions. Word has length 84 [2018-11-10 05:25:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:39,836 INFO L481 AbstractCegarLoop]: Abstraction has 2840 states and 3896 transitions. [2018-11-10 05:25:39,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:25:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 3896 transitions. [2018-11-10 05:25:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 05:25:39,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:39,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:39,838 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:39,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:39,838 INFO L82 PathProgramCache]: Analyzing trace with hash 703444816, now seen corresponding path program 1 times [2018-11-10 05:25:39,839 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:39,839 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:39,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:40,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:40,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:40,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:40,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:40,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:40,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:40,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:40,128 INFO L87 Difference]: Start difference. First operand 2840 states and 3896 transitions. Second operand 8 states. [2018-11-10 05:25:40,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:40,213 INFO L93 Difference]: Finished difference Result 2874 states and 3940 transitions. [2018-11-10 05:25:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:40,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-11-10 05:25:40,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:40,221 INFO L225 Difference]: With dead ends: 2874 [2018-11-10 05:25:40,221 INFO L226 Difference]: Without dead ends: 2839 [2018-11-10 05:25:40,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2018-11-10 05:25:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2836. [2018-11-10 05:25:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2018-11-10 05:25:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 3891 transitions. [2018-11-10 05:25:40,269 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 3891 transitions. Word has length 81 [2018-11-10 05:25:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:40,269 INFO L481 AbstractCegarLoop]: Abstraction has 2836 states and 3891 transitions. [2018-11-10 05:25:40,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 3891 transitions. [2018-11-10 05:25:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 05:25:40,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:40,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:40,271 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:40,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:40,271 INFO L82 PathProgramCache]: Analyzing trace with hash 706780583, now seen corresponding path program 1 times [2018-11-10 05:25:40,272 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:40,272 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:40,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:40,626 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:40,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:40,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:40,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:40,629 INFO L87 Difference]: Start difference. First operand 2836 states and 3891 transitions. Second operand 8 states. [2018-11-10 05:25:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:40,709 INFO L93 Difference]: Finished difference Result 2862 states and 3926 transitions. [2018-11-10 05:25:40,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:40,710 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-11-10 05:25:40,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:40,717 INFO L225 Difference]: With dead ends: 2862 [2018-11-10 05:25:40,717 INFO L226 Difference]: Without dead ends: 2833 [2018-11-10 05:25:40,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2018-11-10 05:25:40,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2830. [2018-11-10 05:25:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2830 states. [2018-11-10 05:25:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2830 states to 2830 states and 3883 transitions. [2018-11-10 05:25:40,764 INFO L78 Accepts]: Start accepts. Automaton has 2830 states and 3883 transitions. Word has length 82 [2018-11-10 05:25:40,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:40,764 INFO L481 AbstractCegarLoop]: Abstraction has 2830 states and 3883 transitions. [2018-11-10 05:25:40,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 2830 states and 3883 transitions. [2018-11-10 05:25:40,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 05:25:40,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:40,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:40,766 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:40,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:40,766 INFO L82 PathProgramCache]: Analyzing trace with hash 492494675, now seen corresponding path program 1 times [2018-11-10 05:25:40,767 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:40,767 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:40,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:40,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:40,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:41,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:41,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:41,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:41,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:41,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:41,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:41,043 INFO L87 Difference]: Start difference. First operand 2830 states and 3883 transitions. Second operand 8 states. [2018-11-10 05:25:41,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:41,130 INFO L93 Difference]: Finished difference Result 2856 states and 3918 transitions. [2018-11-10 05:25:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:41,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2018-11-10 05:25:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:41,138 INFO L225 Difference]: With dead ends: 2856 [2018-11-10 05:25:41,138 INFO L226 Difference]: Without dead ends: 2826 [2018-11-10 05:25:41,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2018-11-10 05:25:41,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2823. [2018-11-10 05:25:41,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2018-11-10 05:25:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 3874 transitions. [2018-11-10 05:25:41,183 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 3874 transitions. Word has length 83 [2018-11-10 05:25:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:41,183 INFO L481 AbstractCegarLoop]: Abstraction has 2823 states and 3874 transitions. [2018-11-10 05:25:41,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:41,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 3874 transitions. [2018-11-10 05:25:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 05:25:41,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:41,184 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:41,185 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:41,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:41,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1801467652, now seen corresponding path program 1 times [2018-11-10 05:25:41,187 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:41,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:41,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:41,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:41,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:41,466 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:41,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:41,469 INFO L87 Difference]: Start difference. First operand 2823 states and 3874 transitions. Second operand 8 states. [2018-11-10 05:25:41,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:41,553 INFO L93 Difference]: Finished difference Result 2848 states and 3908 transitions. [2018-11-10 05:25:41,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:41,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2018-11-10 05:25:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:41,561 INFO L225 Difference]: With dead ends: 2848 [2018-11-10 05:25:41,561 INFO L226 Difference]: Without dead ends: 2813 [2018-11-10 05:25:41,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2018-11-10 05:25:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 2810. [2018-11-10 05:25:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2018-11-10 05:25:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3859 transitions. [2018-11-10 05:25:41,604 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3859 transitions. Word has length 80 [2018-11-10 05:25:41,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:41,604 INFO L481 AbstractCegarLoop]: Abstraction has 2810 states and 3859 transitions. [2018-11-10 05:25:41,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3859 transitions. [2018-11-10 05:25:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 05:25:41,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:41,606 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:25:41,606 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:41,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:41,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1707436464, now seen corresponding path program 1 times [2018-11-10 05:25:41,608 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:41,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:41,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:41,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:25:41,923 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:41,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:41,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:41,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:41,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:41,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:41,926 INFO L87 Difference]: Start difference. First operand 2810 states and 3859 transitions. Second operand 3 states. [2018-11-10 05:25:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:42,088 INFO L93 Difference]: Finished difference Result 8227 states and 11556 transitions. [2018-11-10 05:25:42,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:42,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2018-11-10 05:25:42,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:42,106 INFO L225 Difference]: With dead ends: 8227 [2018-11-10 05:25:42,106 INFO L226 Difference]: Without dead ends: 5488 [2018-11-10 05:25:42,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2018-11-10 05:25:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5486. [2018-11-10 05:25:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5486 states. [2018-11-10 05:25:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5486 states to 5486 states and 7660 transitions. [2018-11-10 05:25:42,206 INFO L78 Accepts]: Start accepts. Automaton has 5486 states and 7660 transitions. Word has length 84 [2018-11-10 05:25:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:42,206 INFO L481 AbstractCegarLoop]: Abstraction has 5486 states and 7660 transitions. [2018-11-10 05:25:42,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:42,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5486 states and 7660 transitions. [2018-11-10 05:25:42,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 05:25:42,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:42,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:42,208 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:42,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:42,208 INFO L82 PathProgramCache]: Analyzing trace with hash -285336611, now seen corresponding path program 1 times [2018-11-10 05:25:42,209 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:42,209 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:42,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:42,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:42,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:42,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:42,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:42,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:42,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:42,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:42,473 INFO L87 Difference]: Start difference. First operand 5486 states and 7660 transitions. Second operand 3 states. [2018-11-10 05:25:42,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:42,725 INFO L93 Difference]: Finished difference Result 16103 states and 23582 transitions. [2018-11-10 05:25:42,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:42,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-10 05:25:42,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:42,760 INFO L225 Difference]: With dead ends: 16103 [2018-11-10 05:25:42,760 INFO L226 Difference]: Without dead ends: 10689 [2018-11-10 05:25:42,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10689 states. [2018-11-10 05:25:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10689 to 10681. [2018-11-10 05:25:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10681 states. [2018-11-10 05:25:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10681 states to 10681 states and 15449 transitions. [2018-11-10 05:25:43,084 INFO L78 Accepts]: Start accepts. Automaton has 10681 states and 15449 transitions. Word has length 85 [2018-11-10 05:25:43,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:43,084 INFO L481 AbstractCegarLoop]: Abstraction has 10681 states and 15449 transitions. [2018-11-10 05:25:43,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:43,084 INFO L276 IsEmpty]: Start isEmpty. Operand 10681 states and 15449 transitions. [2018-11-10 05:25:43,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 05:25:43,086 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:43,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:43,086 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:43,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2121871434, now seen corresponding path program 1 times [2018-11-10 05:25:43,088 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:43,088 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:43,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:43,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:43,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:43,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:43,369 INFO L87 Difference]: Start difference. First operand 10681 states and 15449 transitions. Second operand 8 states. [2018-11-10 05:25:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:43,544 INFO L93 Difference]: Finished difference Result 10714 states and 15504 transitions. [2018-11-10 05:25:43,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:43,545 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-11-10 05:25:43,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:43,577 INFO L225 Difference]: With dead ends: 10714 [2018-11-10 05:25:43,577 INFO L226 Difference]: Without dead ends: 10693 [2018-11-10 05:25:43,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10693 states. [2018-11-10 05:25:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10693 to 10690. [2018-11-10 05:25:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10690 states. [2018-11-10 05:25:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10690 states to 10690 states and 15473 transitions. [2018-11-10 05:25:43,828 INFO L78 Accepts]: Start accepts. Automaton has 10690 states and 15473 transitions. Word has length 84 [2018-11-10 05:25:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:43,828 INFO L481 AbstractCegarLoop]: Abstraction has 10690 states and 15473 transitions. [2018-11-10 05:25:43,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 10690 states and 15473 transitions. [2018-11-10 05:25:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 05:25:43,830 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:43,830 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:43,830 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:43,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:43,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1403036301, now seen corresponding path program 1 times [2018-11-10 05:25:43,832 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:43,832 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:43,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:44,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:44,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:44,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:44,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:44,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:44,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:44,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:44,123 INFO L87 Difference]: Start difference. First operand 10690 states and 15473 transitions. Second operand 8 states. [2018-11-10 05:25:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:44,337 INFO L93 Difference]: Finished difference Result 10759 states and 15577 transitions. [2018-11-10 05:25:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:44,337 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2018-11-10 05:25:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:44,360 INFO L225 Difference]: With dead ends: 10759 [2018-11-10 05:25:44,360 INFO L226 Difference]: Without dead ends: 10738 [2018-11-10 05:25:44,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10738 states. [2018-11-10 05:25:44,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10738 to 10717. [2018-11-10 05:25:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2018-11-10 05:25:44,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 15514 transitions. [2018-11-10 05:25:44,564 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 15514 transitions. Word has length 92 [2018-11-10 05:25:44,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:44,564 INFO L481 AbstractCegarLoop]: Abstraction has 10717 states and 15514 transitions. [2018-11-10 05:25:44,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:44,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 15514 transitions. [2018-11-10 05:25:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 05:25:44,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:44,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:44,567 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:44,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:44,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1279018426, now seen corresponding path program 1 times [2018-11-10 05:25:44,569 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:44,569 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:44,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:44,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:44,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:44,840 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:44,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:44,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:25:44,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:25:44,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:25:44,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:25:44,843 INFO L87 Difference]: Start difference. First operand 10717 states and 15514 transitions. Second operand 5 states. [2018-11-10 05:25:45,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:45,055 INFO L93 Difference]: Finished difference Result 11089 states and 15954 transitions. [2018-11-10 05:25:45,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:25:45,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-11-10 05:25:45,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:45,077 INFO L225 Difference]: With dead ends: 11089 [2018-11-10 05:25:45,077 INFO L226 Difference]: Without dead ends: 10819 [2018-11-10 05:25:45,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:25:45,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10819 states. [2018-11-10 05:25:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10819 to 10709. [2018-11-10 05:25:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10709 states. [2018-11-10 05:25:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 15492 transitions. [2018-11-10 05:25:45,357 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 15492 transitions. Word has length 93 [2018-11-10 05:25:45,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:45,357 INFO L481 AbstractCegarLoop]: Abstraction has 10709 states and 15492 transitions. [2018-11-10 05:25:45,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:25:45,357 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 15492 transitions. [2018-11-10 05:25:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 05:25:45,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:45,359 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:45,359 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash -5099032, now seen corresponding path program 1 times [2018-11-10 05:25:45,360 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:45,360 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:45,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:45,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:45,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:45,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:45,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:25:45,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:25:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:25:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:25:45,684 INFO L87 Difference]: Start difference. First operand 10709 states and 15492 transitions. Second operand 8 states. [2018-11-10 05:25:45,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:45,866 INFO L93 Difference]: Finished difference Result 10778 states and 15596 transitions. [2018-11-10 05:25:45,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:25:45,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-11-10 05:25:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:45,884 INFO L225 Difference]: With dead ends: 10778 [2018-11-10 05:25:45,884 INFO L226 Difference]: Without dead ends: 10757 [2018-11-10 05:25:45,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2018-11-10 05:25:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10733. [2018-11-10 05:25:46,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10733 states. [2018-11-10 05:25:46,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10733 states to 10733 states and 15528 transitions. [2018-11-10 05:25:46,087 INFO L78 Accepts]: Start accepts. Automaton has 10733 states and 15528 transitions. Word has length 94 [2018-11-10 05:25:46,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:46,087 INFO L481 AbstractCegarLoop]: Abstraction has 10733 states and 15528 transitions. [2018-11-10 05:25:46,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:25:46,087 INFO L276 IsEmpty]: Start isEmpty. Operand 10733 states and 15528 transitions. [2018-11-10 05:25:46,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 05:25:46,089 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:46,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:46,089 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:46,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:46,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1905364491, now seen corresponding path program 1 times [2018-11-10 05:25:46,090 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:46,090 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:46,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:46,391 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:46,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:46,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:25:46,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:25:46,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:25:46,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:25:46,394 INFO L87 Difference]: Start difference. First operand 10733 states and 15528 transitions. Second operand 5 states. [2018-11-10 05:25:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:46,590 INFO L93 Difference]: Finished difference Result 10957 states and 15831 transitions. [2018-11-10 05:25:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:25:46,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-10 05:25:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:46,608 INFO L225 Difference]: With dead ends: 10957 [2018-11-10 05:25:46,609 INFO L226 Difference]: Without dead ends: 10855 [2018-11-10 05:25:46,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:25:46,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10855 states. [2018-11-10 05:25:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10855 to 10730. [2018-11-10 05:25:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10730 states. [2018-11-10 05:25:46,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10730 states to 10730 states and 15516 transitions. [2018-11-10 05:25:46,833 INFO L78 Accepts]: Start accepts. Automaton has 10730 states and 15516 transitions. Word has length 96 [2018-11-10 05:25:46,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:46,833 INFO L481 AbstractCegarLoop]: Abstraction has 10730 states and 15516 transitions. [2018-11-10 05:25:46,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:25:46,833 INFO L276 IsEmpty]: Start isEmpty. Operand 10730 states and 15516 transitions. [2018-11-10 05:25:46,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 05:25:46,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:46,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:46,836 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:46,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:46,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1881249272, now seen corresponding path program 1 times [2018-11-10 05:25:46,838 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:46,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:47,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:25:47,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:47,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:47,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:25:47,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:25:47,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:25:47,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:25:47,205 INFO L87 Difference]: Start difference. First operand 10730 states and 15516 transitions. Second operand 12 states. [2018-11-10 05:26:05,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:05,856 INFO L93 Difference]: Finished difference Result 10806 states and 15616 transitions. [2018-11-10 05:26:05,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:26:05,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2018-11-10 05:26:05,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:05,874 INFO L225 Difference]: With dead ends: 10806 [2018-11-10 05:26:05,874 INFO L226 Difference]: Without dead ends: 10798 [2018-11-10 05:26:05,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:26:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10798 states. [2018-11-10 05:26:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10798 to 10788. [2018-11-10 05:26:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10788 states. [2018-11-10 05:26:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10788 states to 10788 states and 15597 transitions. [2018-11-10 05:26:06,061 INFO L78 Accepts]: Start accepts. Automaton has 10788 states and 15597 transitions. Word has length 93 [2018-11-10 05:26:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:06,061 INFO L481 AbstractCegarLoop]: Abstraction has 10788 states and 15597 transitions. [2018-11-10 05:26:06,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:26:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 10788 states and 15597 transitions. [2018-11-10 05:26:06,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 05:26:06,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:06,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:06,064 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:06,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:06,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2147282902, now seen corresponding path program 1 times [2018-11-10 05:26:06,065 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:06,065 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:06,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:06,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:06,349 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:06,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:06,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:26:06,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:26:06,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:26:06,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:26:06,352 INFO L87 Difference]: Start difference. First operand 10788 states and 15597 transitions. Second operand 4 states. [2018-11-10 05:26:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:08,806 INFO L93 Difference]: Finished difference Result 25196 states and 38227 transitions. [2018-11-10 05:26:08,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:26:08,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 05:26:08,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:08,834 INFO L225 Difference]: With dead ends: 25196 [2018-11-10 05:26:08,834 INFO L226 Difference]: Without dead ends: 14481 [2018-11-10 05:26:08,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:26:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14481 states. [2018-11-10 05:26:09,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14481 to 14399. [2018-11-10 05:26:09,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14399 states. [2018-11-10 05:26:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14399 states to 14399 states and 21131 transitions. [2018-11-10 05:26:09,124 INFO L78 Accepts]: Start accepts. Automaton has 14399 states and 21131 transitions. Word has length 93 [2018-11-10 05:26:09,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:09,124 INFO L481 AbstractCegarLoop]: Abstraction has 14399 states and 21131 transitions. [2018-11-10 05:26:09,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:26:09,124 INFO L276 IsEmpty]: Start isEmpty. Operand 14399 states and 21131 transitions. [2018-11-10 05:26:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 05:26:09,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:09,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:09,127 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:09,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -386373489, now seen corresponding path program 1 times [2018-11-10 05:26:09,128 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:09,128 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:09,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:09,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:09,381 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:09,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:09,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:26:09,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:26:09,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:26:09,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:26:09,384 INFO L87 Difference]: Start difference. First operand 14399 states and 21131 transitions. Second operand 5 states. [2018-11-10 05:26:09,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:09,665 INFO L93 Difference]: Finished difference Result 14530 states and 21314 transitions. [2018-11-10 05:26:09,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:26:09,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-11-10 05:26:09,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:09,690 INFO L225 Difference]: With dead ends: 14530 [2018-11-10 05:26:09,690 INFO L226 Difference]: Without dead ends: 14460 [2018-11-10 05:26:09,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:26:09,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14460 states. [2018-11-10 05:26:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14460 to 14419. [2018-11-10 05:26:09,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14419 states. [2018-11-10 05:26:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14419 states to 14419 states and 21167 transitions. [2018-11-10 05:26:10,026 INFO L78 Accepts]: Start accepts. Automaton has 14419 states and 21167 transitions. Word has length 99 [2018-11-10 05:26:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:10,026 INFO L481 AbstractCegarLoop]: Abstraction has 14419 states and 21167 transitions. [2018-11-10 05:26:10,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:26:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 14419 states and 21167 transitions. [2018-11-10 05:26:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 05:26:10,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:10,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:10,028 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:10,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:10,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1957628112, now seen corresponding path program 1 times [2018-11-10 05:26:10,029 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:10,029 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:10,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:10,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:10,468 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:10,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:10,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:26:10,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:26:10,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:26:10,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:26:10,471 INFO L87 Difference]: Start difference. First operand 14419 states and 21167 transitions. Second operand 12 states. [2018-11-10 05:26:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:29,368 INFO L93 Difference]: Finished difference Result 14542 states and 21404 transitions. [2018-11-10 05:26:29,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:26:29,369 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 101 [2018-11-10 05:26:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:29,394 INFO L225 Difference]: With dead ends: 14542 [2018-11-10 05:26:29,394 INFO L226 Difference]: Without dead ends: 14523 [2018-11-10 05:26:29,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:26:29,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14523 states. [2018-11-10 05:26:29,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14523 to 14485. [2018-11-10 05:26:29,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14485 states. [2018-11-10 05:26:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14485 states to 14485 states and 21315 transitions. [2018-11-10 05:26:29,656 INFO L78 Accepts]: Start accepts. Automaton has 14485 states and 21315 transitions. Word has length 101 [2018-11-10 05:26:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:29,656 INFO L481 AbstractCegarLoop]: Abstraction has 14485 states and 21315 transitions. [2018-11-10 05:26:29,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:26:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14485 states and 21315 transitions. [2018-11-10 05:26:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-10 05:26:29,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:29,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:29,658 INFO L424 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:29,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:29,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1634927091, now seen corresponding path program 1 times [2018-11-10 05:26:29,659 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:29,659 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:29,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:29,965 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:29,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:29,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:26:29,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:26:29,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:26:29,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:26:29,968 INFO L87 Difference]: Start difference. First operand 14485 states and 21315 transitions. Second operand 9 states. [2018-11-10 05:26:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:30,457 INFO L93 Difference]: Finished difference Result 29187 states and 44441 transitions. [2018-11-10 05:26:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:26:30,458 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2018-11-10 05:26:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:30,488 INFO L225 Difference]: With dead ends: 29187 [2018-11-10 05:26:30,488 INFO L226 Difference]: Without dead ends: 14761 [2018-11-10 05:26:30,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:26:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14761 states. [2018-11-10 05:26:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14761 to 14678. [2018-11-10 05:26:30,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14678 states. [2018-11-10 05:26:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14678 states to 14678 states and 21566 transitions. [2018-11-10 05:26:30,787 INFO L78 Accepts]: Start accepts. Automaton has 14678 states and 21566 transitions. Word has length 103 [2018-11-10 05:26:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:30,788 INFO L481 AbstractCegarLoop]: Abstraction has 14678 states and 21566 transitions. [2018-11-10 05:26:30,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:26:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 14678 states and 21566 transitions. [2018-11-10 05:26:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 05:26:30,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:30,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:30,790 INFO L424 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:30,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:30,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1024364666, now seen corresponding path program 1 times [2018-11-10 05:26:30,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:30,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:31,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:31,064 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:31,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:31,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:26:31,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:26:31,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:26:31,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:26:31,067 INFO L87 Difference]: Start difference. First operand 14678 states and 21566 transitions. Second operand 8 states. [2018-11-10 05:26:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:31,293 INFO L93 Difference]: Finished difference Result 14770 states and 21679 transitions. [2018-11-10 05:26:31,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:26:31,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-11-10 05:26:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:31,319 INFO L225 Difference]: With dead ends: 14770 [2018-11-10 05:26:31,319 INFO L226 Difference]: Without dead ends: 14749 [2018-11-10 05:26:31,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:26:31,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14749 states. [2018-11-10 05:26:31,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14749 to 14700. [2018-11-10 05:26:31,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14700 states. [2018-11-10 05:26:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14700 states to 14700 states and 21579 transitions. [2018-11-10 05:26:31,588 INFO L78 Accepts]: Start accepts. Automaton has 14700 states and 21579 transitions. Word has length 104 [2018-11-10 05:26:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:31,589 INFO L481 AbstractCegarLoop]: Abstraction has 14700 states and 21579 transitions. [2018-11-10 05:26:31,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:26:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14700 states and 21579 transitions. [2018-11-10 05:26:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-10 05:26:31,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:31,591 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:31,591 INFO L424 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:31,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash -488899851, now seen corresponding path program 1 times [2018-11-10 05:26:31,592 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:31,592 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:31,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:31,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:31,980 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:31,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:31,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:26:31,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:26:31,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:26:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:26:31,983 INFO L87 Difference]: Start difference. First operand 14700 states and 21579 transitions. Second operand 9 states. [2018-11-10 05:26:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:32,626 INFO L93 Difference]: Finished difference Result 29762 states and 45131 transitions. [2018-11-10 05:26:32,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:26:32,627 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 104 [2018-11-10 05:26:32,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:32,659 INFO L225 Difference]: With dead ends: 29762 [2018-11-10 05:26:32,659 INFO L226 Difference]: Without dead ends: 15120 [2018-11-10 05:26:32,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:26:32,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15120 states. [2018-11-10 05:26:32,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15120 to 14844. [2018-11-10 05:26:32,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14844 states. [2018-11-10 05:26:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14844 states to 14844 states and 21739 transitions. [2018-11-10 05:26:32,955 INFO L78 Accepts]: Start accepts. Automaton has 14844 states and 21739 transitions. Word has length 104 [2018-11-10 05:26:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:32,955 INFO L481 AbstractCegarLoop]: Abstraction has 14844 states and 21739 transitions. [2018-11-10 05:26:32,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:26:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 14844 states and 21739 transitions. [2018-11-10 05:26:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 05:26:32,956 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:32,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:32,956 INFO L424 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:32,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1394637760, now seen corresponding path program 1 times [2018-11-10 05:26:32,957 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:32,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:32,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:33,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:33,350 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:33,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:33,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:26:33,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:26:33,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:26:33,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:26:33,353 INFO L87 Difference]: Start difference. First operand 14844 states and 21739 transitions. Second operand 12 states. [2018-11-10 05:26:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:52,248 INFO L93 Difference]: Finished difference Result 14946 states and 21904 transitions. [2018-11-10 05:26:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:26:52,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 106 [2018-11-10 05:26:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:52,279 INFO L225 Difference]: With dead ends: 14946 [2018-11-10 05:26:52,279 INFO L226 Difference]: Without dead ends: 14927 [2018-11-10 05:26:52,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:26:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14927 states. [2018-11-10 05:26:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14927 to 14885. [2018-11-10 05:26:52,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14885 states. [2018-11-10 05:26:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14885 states to 14885 states and 21805 transitions. [2018-11-10 05:26:52,562 INFO L78 Accepts]: Start accepts. Automaton has 14885 states and 21805 transitions. Word has length 106 [2018-11-10 05:26:52,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:52,562 INFO L481 AbstractCegarLoop]: Abstraction has 14885 states and 21805 transitions. [2018-11-10 05:26:52,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:26:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 14885 states and 21805 transitions. [2018-11-10 05:26:52,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 05:26:52,563 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:52,563 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:52,564 INFO L424 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:52,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:52,564 INFO L82 PathProgramCache]: Analyzing trace with hash 894746261, now seen corresponding path program 1 times [2018-11-10 05:26:52,565 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:52,565 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:52,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:52,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:52,882 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:26:52,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:26:52,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:26:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:26:52,884 INFO L87 Difference]: Start difference. First operand 14885 states and 21805 transitions. Second operand 3 states. [2018-11-10 05:26:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:53,441 INFO L93 Difference]: Finished difference Result 33432 states and 51925 transitions. [2018-11-10 05:26:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:26:53,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-11-10 05:26:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:53,494 INFO L225 Difference]: With dead ends: 33432 [2018-11-10 05:26:53,494 INFO L226 Difference]: Without dead ends: 18620 [2018-11-10 05:26:53,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:26:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18620 states. [2018-11-10 05:26:53,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18620 to 18582. [2018-11-10 05:26:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18582 states. [2018-11-10 05:26:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18582 states to 18582 states and 28303 transitions. [2018-11-10 05:26:53,936 INFO L78 Accepts]: Start accepts. Automaton has 18582 states and 28303 transitions. Word has length 112 [2018-11-10 05:26:53,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:53,936 INFO L481 AbstractCegarLoop]: Abstraction has 18582 states and 28303 transitions. [2018-11-10 05:26:53,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:26:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 18582 states and 28303 transitions. [2018-11-10 05:26:53,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:26:53,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:53,938 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:53,939 INFO L424 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:53,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash -230555672, now seen corresponding path program 1 times [2018-11-10 05:26:53,940 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:53,940 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:53,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:54,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:54,284 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:54,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:54,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:26:54,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:26:54,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:26:54,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:26:54,286 INFO L87 Difference]: Start difference. First operand 18582 states and 28303 transitions. Second operand 9 states. [2018-11-10 05:26:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:26:54,904 INFO L93 Difference]: Finished difference Result 37458 states and 59331 transitions. [2018-11-10 05:26:54,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:26:54,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-11-10 05:26:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:26:54,949 INFO L225 Difference]: With dead ends: 37458 [2018-11-10 05:26:54,949 INFO L226 Difference]: Without dead ends: 18934 [2018-11-10 05:26:55,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:26:55,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18934 states. [2018-11-10 05:26:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18934 to 18514. [2018-11-10 05:26:55,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18514 states. [2018-11-10 05:26:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18514 states to 18514 states and 28243 transitions. [2018-11-10 05:26:55,503 INFO L78 Accepts]: Start accepts. Automaton has 18514 states and 28243 transitions. Word has length 115 [2018-11-10 05:26:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:26:55,504 INFO L481 AbstractCegarLoop]: Abstraction has 18514 states and 28243 transitions. [2018-11-10 05:26:55,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:26:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 18514 states and 28243 transitions. [2018-11-10 05:26:55,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-11-10 05:26:55,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:26:55,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:26:55,507 INFO L424 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:26:55,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:26:55,507 INFO L82 PathProgramCache]: Analyzing trace with hash 354995279, now seen corresponding path program 1 times [2018-11-10 05:26:55,508 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:26:55,508 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:26:55,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:26:55,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:26:55,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:26:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:26:55,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:26:55,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:26:55,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:26:55,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:26:55,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:26:55,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:26:55,902 INFO L87 Difference]: Start difference. First operand 18514 states and 28243 transitions. Second operand 12 states. [2018-11-10 05:27:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:14,841 INFO L93 Difference]: Finished difference Result 18640 states and 28399 transitions. [2018-11-10 05:27:14,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:27:14,842 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-11-10 05:27:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:14,875 INFO L225 Difference]: With dead ends: 18640 [2018-11-10 05:27:14,876 INFO L226 Difference]: Without dead ends: 18621 [2018-11-10 05:27:14,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:27:14,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18621 states. [2018-11-10 05:27:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18621 to 18493. [2018-11-10 05:27:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18493 states. [2018-11-10 05:27:15,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18493 states to 18493 states and 28102 transitions. [2018-11-10 05:27:15,283 INFO L78 Accepts]: Start accepts. Automaton has 18493 states and 28102 transitions. Word has length 113 [2018-11-10 05:27:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:15,283 INFO L481 AbstractCegarLoop]: Abstraction has 18493 states and 28102 transitions. [2018-11-10 05:27:15,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:27:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 18493 states and 28102 transitions. [2018-11-10 05:27:15,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 05:27:15,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:15,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:15,285 INFO L424 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:15,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:15,286 INFO L82 PathProgramCache]: Analyzing trace with hash -2077177828, now seen corresponding path program 1 times [2018-11-10 05:27:15,287 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:27:15,287 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:27:15,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:15,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:15,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:15,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:15,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:27:15,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:15,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:27:15,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:27:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:27:15,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:27:15,617 INFO L87 Difference]: Start difference. First operand 18493 states and 28102 transitions. Second operand 9 states. [2018-11-10 05:27:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:16,252 INFO L93 Difference]: Finished difference Result 37281 states and 58931 transitions. [2018-11-10 05:27:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:27:16,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 114 [2018-11-10 05:27:16,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:16,298 INFO L225 Difference]: With dead ends: 37281 [2018-11-10 05:27:16,298 INFO L226 Difference]: Without dead ends: 18845 [2018-11-10 05:27:16,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:27:16,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18845 states. [2018-11-10 05:27:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18845 to 18493. [2018-11-10 05:27:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18493 states. [2018-11-10 05:27:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18493 states to 18493 states and 28102 transitions. [2018-11-10 05:27:16,757 INFO L78 Accepts]: Start accepts. Automaton has 18493 states and 28102 transitions. Word has length 114 [2018-11-10 05:27:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:16,757 INFO L481 AbstractCegarLoop]: Abstraction has 18493 states and 28102 transitions. [2018-11-10 05:27:16,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:27:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18493 states and 28102 transitions. [2018-11-10 05:27:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 05:27:16,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:16,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:16,759 INFO L424 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:16,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:16,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1426285969, now seen corresponding path program 1 times [2018-11-10 05:27:16,760 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:27:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:27:16,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:17,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:17,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:27:17,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:17,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:27:17,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:27:17,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:27:17,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:27:17,102 INFO L87 Difference]: Start difference. First operand 18493 states and 28102 transitions. Second operand 9 states. [2018-11-10 05:27:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:17,809 INFO L93 Difference]: Finished difference Result 37281 states and 58931 transitions. [2018-11-10 05:27:17,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:27:17,810 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-11-10 05:27:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:17,852 INFO L225 Difference]: With dead ends: 37281 [2018-11-10 05:27:17,852 INFO L226 Difference]: Without dead ends: 18845 [2018-11-10 05:27:17,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:27:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18845 states. [2018-11-10 05:27:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18845 to 18493. [2018-11-10 05:27:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18493 states. [2018-11-10 05:27:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18493 states to 18493 states and 28102 transitions. [2018-11-10 05:27:18,307 INFO L78 Accepts]: Start accepts. Automaton has 18493 states and 28102 transitions. Word has length 115 [2018-11-10 05:27:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:18,307 INFO L481 AbstractCegarLoop]: Abstraction has 18493 states and 28102 transitions. [2018-11-10 05:27:18,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:27:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 18493 states and 28102 transitions. [2018-11-10 05:27:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 05:27:18,309 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:18,309 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:18,309 INFO L424 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:18,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1185599294, now seen corresponding path program 1 times [2018-11-10 05:27:18,310 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:27:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:27:18,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:18,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:27:18,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:27:18,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:18,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:27:18,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:27:18,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:27:18,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:18,610 INFO L87 Difference]: Start difference. First operand 18493 states and 28102 transitions. Second operand 3 states. [2018-11-10 05:27:21,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:21,158 INFO L93 Difference]: Finished difference Result 36946 states and 58410 transitions. [2018-11-10 05:27:21,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:27:21,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-11-10 05:27:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:21,206 INFO L225 Difference]: With dead ends: 36946 [2018-11-10 05:27:21,206 INFO L226 Difference]: Without dead ends: 18525 [2018-11-10 05:27:21,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:27:21,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18525 states. [2018-11-10 05:27:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18525 to 18525. [2018-11-10 05:27:21,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18525 states. [2018-11-10 05:27:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 28106 transitions. [2018-11-10 05:27:21,666 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 28106 transitions. Word has length 123 [2018-11-10 05:27:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:21,666 INFO L481 AbstractCegarLoop]: Abstraction has 18525 states and 28106 transitions. [2018-11-10 05:27:21,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:27:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 28106 transitions. [2018-11-10 05:27:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 05:27:21,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:21,668 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:21,668 INFO L424 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2133330313, now seen corresponding path program 1 times [2018-11-10 05:27:21,669 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:27:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:27:21,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:21,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:22,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:27:22,081 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:27:22,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:22,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 05:27:22,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:27:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:27:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:22,084 INFO L87 Difference]: Start difference. First operand 18525 states and 28106 transitions. Second operand 13 states. [2018-11-10 05:27:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:27:43,212 INFO L93 Difference]: Finished difference Result 18764 states and 28541 transitions. [2018-11-10 05:27:43,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:27:43,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 118 [2018-11-10 05:27:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:27:43,261 INFO L225 Difference]: With dead ends: 18764 [2018-11-10 05:27:43,261 INFO L226 Difference]: Without dead ends: 18745 [2018-11-10 05:27:43,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:27:43,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18745 states. [2018-11-10 05:27:43,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18745 to 18649. [2018-11-10 05:27:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18649 states. [2018-11-10 05:27:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18649 states to 18649 states and 28294 transitions. [2018-11-10 05:27:43,707 INFO L78 Accepts]: Start accepts. Automaton has 18649 states and 28294 transitions. Word has length 118 [2018-11-10 05:27:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:27:43,707 INFO L481 AbstractCegarLoop]: Abstraction has 18649 states and 28294 transitions. [2018-11-10 05:27:43,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:27:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 18649 states and 28294 transitions. [2018-11-10 05:27:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 05:27:43,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:27:43,709 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:27:43,709 INFO L424 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:27:43,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:27:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash 653249605, now seen corresponding path program 1 times [2018-11-10 05:27:43,710 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:27:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:27:43,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:27:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:27:44,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:27:44,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:27:44,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:27:44,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:27:44,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 05:27:44,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:27:44,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:27:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:27:44,223 INFO L87 Difference]: Start difference. First operand 18649 states and 28294 transitions. Second operand 13 states. [2018-11-10 05:28:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:05,351 INFO L93 Difference]: Finished difference Result 18888 states and 28729 transitions. [2018-11-10 05:28:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:28:05,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 118 [2018-11-10 05:28:05,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:05,398 INFO L225 Difference]: With dead ends: 18888 [2018-11-10 05:28:05,398 INFO L226 Difference]: Without dead ends: 18869 [2018-11-10 05:28:05,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:28:05,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18869 states. [2018-11-10 05:28:05,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18869 to 18661. [2018-11-10 05:28:05,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18661 states. [2018-11-10 05:28:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18661 states to 18661 states and 28306 transitions. [2018-11-10 05:28:05,803 INFO L78 Accepts]: Start accepts. Automaton has 18661 states and 28306 transitions. Word has length 118 [2018-11-10 05:28:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:05,804 INFO L481 AbstractCegarLoop]: Abstraction has 18661 states and 28306 transitions. [2018-11-10 05:28:05,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:28:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 18661 states and 28306 transitions. [2018-11-10 05:28:05,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 05:28:05,806 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:05,806 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:05,806 INFO L424 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:05,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:05,806 INFO L82 PathProgramCache]: Analyzing trace with hash 622107817, now seen corresponding path program 1 times [2018-11-10 05:28:05,808 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:05,808 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:05,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:06,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:28:06,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:06,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:06,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 05:28:06,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:28:06,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:28:06,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:28:06,208 INFO L87 Difference]: Start difference. First operand 18661 states and 28306 transitions. Second operand 13 states. [2018-11-10 05:28:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:27,323 INFO L93 Difference]: Finished difference Result 18900 states and 28741 transitions. [2018-11-10 05:28:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:28:27,324 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 119 [2018-11-10 05:28:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:27,359 INFO L225 Difference]: With dead ends: 18900 [2018-11-10 05:28:27,359 INFO L226 Difference]: Without dead ends: 18881 [2018-11-10 05:28:27,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:28:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18881 states. [2018-11-10 05:28:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18881 to 18673. [2018-11-10 05:28:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18673 states. [2018-11-10 05:28:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18673 states to 18673 states and 28318 transitions. [2018-11-10 05:28:27,769 INFO L78 Accepts]: Start accepts. Automaton has 18673 states and 28318 transitions. Word has length 119 [2018-11-10 05:28:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:27,769 INFO L481 AbstractCegarLoop]: Abstraction has 18673 states and 28318 transitions. [2018-11-10 05:28:27,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:28:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18673 states and 28318 transitions. [2018-11-10 05:28:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 05:28:27,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:27,772 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:27,772 INFO L424 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:27,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash -524665590, now seen corresponding path program 1 times [2018-11-10 05:28:27,773 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:27,773 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:27,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:28,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:28:28,141 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:28,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:28,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 05:28:28,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:28:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:28:28,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:28:28,144 INFO L87 Difference]: Start difference. First operand 18673 states and 28318 transitions. Second operand 11 states. [2018-11-10 05:28:28,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:28,815 INFO L93 Difference]: Finished difference Result 37701 states and 59483 transitions. [2018-11-10 05:28:28,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:28:28,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2018-11-10 05:28:28,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:28,864 INFO L225 Difference]: With dead ends: 37701 [2018-11-10 05:28:28,864 INFO L226 Difference]: Without dead ends: 19085 [2018-11-10 05:28:28,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:28:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19085 states. [2018-11-10 05:28:29,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19085 to 18733. [2018-11-10 05:28:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18733 states. [2018-11-10 05:28:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18733 states to 18733 states and 28438 transitions. [2018-11-10 05:28:29,447 INFO L78 Accepts]: Start accepts. Automaton has 18733 states and 28438 transitions. Word has length 125 [2018-11-10 05:28:29,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:29,447 INFO L481 AbstractCegarLoop]: Abstraction has 18733 states and 28438 transitions. [2018-11-10 05:28:29,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:28:29,447 INFO L276 IsEmpty]: Start isEmpty. Operand 18733 states and 28438 transitions. [2018-11-10 05:28:29,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 05:28:29,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:29,449 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:28:29,449 INFO L424 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:29,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:29,449 INFO L82 PathProgramCache]: Analyzing trace with hash 827249365, now seen corresponding path program 1 times [2018-11-10 05:28:29,450 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:29,450 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:29,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:29,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:28:29,744 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:29,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:29,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:29,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:29,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:29,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:29,751 INFO L87 Difference]: Start difference. First operand 18733 states and 28438 transitions. Second operand 3 states. [2018-11-10 05:28:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:30,266 INFO L93 Difference]: Finished difference Result 37614 states and 59996 transitions. [2018-11-10 05:28:30,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:30,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2018-11-10 05:28:30,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:30,314 INFO L225 Difference]: With dead ends: 37614 [2018-11-10 05:28:30,314 INFO L226 Difference]: Without dead ends: 18953 [2018-11-10 05:28:30,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:30,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18953 states. [2018-11-10 05:28:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18953 to 18753. [2018-11-10 05:28:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18753 states. [2018-11-10 05:28:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18753 states to 18753 states and 28458 transitions. [2018-11-10 05:28:30,810 INFO L78 Accepts]: Start accepts. Automaton has 18753 states and 28458 transitions. Word has length 127 [2018-11-10 05:28:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:30,810 INFO L481 AbstractCegarLoop]: Abstraction has 18753 states and 28458 transitions. [2018-11-10 05:28:30,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18753 states and 28458 transitions. [2018-11-10 05:28:30,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 05:28:30,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:30,812 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:28:30,812 INFO L424 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:30,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:30,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1864562555, now seen corresponding path program 1 times [2018-11-10 05:28:30,813 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:30,813 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:30,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:31,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:28:31,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:31,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:31,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:28:31,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:28:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:28:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:28:31,162 INFO L87 Difference]: Start difference. First operand 18753 states and 28458 transitions. Second operand 8 states. [2018-11-10 05:28:44,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:44,940 INFO L93 Difference]: Finished difference Result 38056 states and 59955 transitions. [2018-11-10 05:28:44,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:28:44,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 126 [2018-11-10 05:28:44,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:44,994 INFO L225 Difference]: With dead ends: 38056 [2018-11-10 05:28:44,994 INFO L226 Difference]: Without dead ends: 19374 [2018-11-10 05:28:45,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:28:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19374 states. [2018-11-10 05:28:45,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19374 to 19053. [2018-11-10 05:28:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19053 states. [2018-11-10 05:28:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19053 states to 19053 states and 28971 transitions. [2018-11-10 05:28:45,662 INFO L78 Accepts]: Start accepts. Automaton has 19053 states and 28971 transitions. Word has length 126 [2018-11-10 05:28:45,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:45,663 INFO L481 AbstractCegarLoop]: Abstraction has 19053 states and 28971 transitions. [2018-11-10 05:28:45,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:28:45,663 INFO L276 IsEmpty]: Start isEmpty. Operand 19053 states and 28971 transitions. [2018-11-10 05:28:45,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 05:28:45,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:45,665 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-10 05:28:45,665 INFO L424 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:45,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:45,666 INFO L82 PathProgramCache]: Analyzing trace with hash -11080219, now seen corresponding path program 1 times [2018-11-10 05:28:45,667 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:45,667 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:45,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:45,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:28:46,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:46,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:46,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:28:46,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:28:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:28:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:28:46,062 INFO L87 Difference]: Start difference. First operand 19053 states and 28971 transitions. Second operand 12 states. [2018-11-10 05:28:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:46,572 INFO L93 Difference]: Finished difference Result 19218 states and 29206 transitions. [2018-11-10 05:28:46,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:28:46,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2018-11-10 05:28:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:46,607 INFO L225 Difference]: With dead ends: 19218 [2018-11-10 05:28:46,607 INFO L226 Difference]: Without dead ends: 19197 [2018-11-10 05:28:46,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:28:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19197 states. [2018-11-10 05:28:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19197 to 19101. [2018-11-10 05:28:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19101 states. [2018-11-10 05:28:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19101 states to 19101 states and 29035 transitions. [2018-11-10 05:28:47,074 INFO L78 Accepts]: Start accepts. Automaton has 19101 states and 29035 transitions. Word has length 132 [2018-11-10 05:28:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:47,074 INFO L481 AbstractCegarLoop]: Abstraction has 19101 states and 29035 transitions. [2018-11-10 05:28:47,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:28:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 19101 states and 29035 transitions. [2018-11-10 05:28:47,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:28:47,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:47,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:47,076 INFO L424 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:47,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash -944669165, now seen corresponding path program 1 times [2018-11-10 05:28:47,077 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:47,077 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:47,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:47,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:47,406 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:47,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:47,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:47,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:47,409 INFO L87 Difference]: Start difference. First operand 19101 states and 29035 transitions. Second operand 3 states. [2018-11-10 05:28:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:47,898 INFO L93 Difference]: Finished difference Result 38302 states and 61174 transitions. [2018-11-10 05:28:47,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:47,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-11-10 05:28:47,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:47,951 INFO L225 Difference]: With dead ends: 38302 [2018-11-10 05:28:47,951 INFO L226 Difference]: Without dead ends: 19273 [2018-11-10 05:28:48,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2018-11-10 05:28:48,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 19125. [2018-11-10 05:28:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19125 states. [2018-11-10 05:28:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19125 states to 19125 states and 29075 transitions. [2018-11-10 05:28:48,641 INFO L78 Accepts]: Start accepts. Automaton has 19125 states and 29075 transitions. Word has length 135 [2018-11-10 05:28:48,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:48,641 INFO L481 AbstractCegarLoop]: Abstraction has 19125 states and 29075 transitions. [2018-11-10 05:28:48,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:48,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19125 states and 29075 transitions. [2018-11-10 05:28:48,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 05:28:48,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:48,643 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 05:28:48,644 INFO L424 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:48,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:48,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1512740286, now seen corresponding path program 1 times [2018-11-10 05:28:48,645 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:48,645 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:48,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:48,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:28:48,987 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:48,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:48,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:48,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:48,991 INFO L87 Difference]: Start difference. First operand 19125 states and 29075 transitions. Second operand 3 states. [2018-11-10 05:28:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:51,583 INFO L93 Difference]: Finished difference Result 38180 states and 59589 transitions. [2018-11-10 05:28:51,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:51,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 134 [2018-11-10 05:28:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:51,634 INFO L225 Difference]: With dead ends: 38180 [2018-11-10 05:28:51,634 INFO L226 Difference]: Without dead ends: 19127 [2018-11-10 05:28:51,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19127 states. [2018-11-10 05:28:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19127 to 19058. [2018-11-10 05:28:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19058 states. [2018-11-10 05:28:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19058 states to 19058 states and 27925 transitions. [2018-11-10 05:28:52,143 INFO L78 Accepts]: Start accepts. Automaton has 19058 states and 27925 transitions. Word has length 134 [2018-11-10 05:28:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:52,144 INFO L481 AbstractCegarLoop]: Abstraction has 19058 states and 27925 transitions. [2018-11-10 05:28:52,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 19058 states and 27925 transitions. [2018-11-10 05:28:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 05:28:52,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:52,146 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:52,147 INFO L424 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:52,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash 728469356, now seen corresponding path program 1 times [2018-11-10 05:28:52,148 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:52,148 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:52,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:52,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 05:28:52,482 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:52,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:52,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 05:28:52,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:28:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:28:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:28:52,485 INFO L87 Difference]: Start difference. First operand 19058 states and 27925 transitions. Second operand 9 states. [2018-11-10 05:28:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:52,906 INFO L93 Difference]: Finished difference Result 19308 states and 28340 transitions. [2018-11-10 05:28:52,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:28:52,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2018-11-10 05:28:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:52,941 INFO L225 Difference]: With dead ends: 19308 [2018-11-10 05:28:52,941 INFO L226 Difference]: Without dead ends: 19266 [2018-11-10 05:28:52,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:28:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19266 states. [2018-11-10 05:28:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19266 to 19203. [2018-11-10 05:28:53,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19203 states. [2018-11-10 05:28:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19203 states to 19203 states and 28157 transitions. [2018-11-10 05:28:53,398 INFO L78 Accepts]: Start accepts. Automaton has 19203 states and 28157 transitions. Word has length 138 [2018-11-10 05:28:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:53,398 INFO L481 AbstractCegarLoop]: Abstraction has 19203 states and 28157 transitions. [2018-11-10 05:28:53,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:28:53,399 INFO L276 IsEmpty]: Start isEmpty. Operand 19203 states and 28157 transitions. [2018-11-10 05:28:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:28:53,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:53,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:53,549 INFO L424 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:53,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:53,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1692929816, now seen corresponding path program 1 times [2018-11-10 05:28:53,551 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:53,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:53,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:53,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:53,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:53,850 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:53,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:53,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:53,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:53,853 INFO L87 Difference]: Start difference. First operand 19203 states and 28157 transitions. Second operand 3 states. [2018-11-10 05:28:54,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:54,344 INFO L93 Difference]: Finished difference Result 38506 states and 58582 transitions. [2018-11-10 05:28:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:54,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-11-10 05:28:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:54,399 INFO L225 Difference]: With dead ends: 38506 [2018-11-10 05:28:54,400 INFO L226 Difference]: Without dead ends: 19375 [2018-11-10 05:28:54,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19375 states. [2018-11-10 05:28:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19375 to 19203. [2018-11-10 05:28:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19203 states. [2018-11-10 05:28:54,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19203 states to 19203 states and 28157 transitions. [2018-11-10 05:28:54,919 INFO L78 Accepts]: Start accepts. Automaton has 19203 states and 28157 transitions. Word has length 135 [2018-11-10 05:28:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:54,919 INFO L481 AbstractCegarLoop]: Abstraction has 19203 states and 28157 transitions. [2018-11-10 05:28:54,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 19203 states and 28157 transitions. [2018-11-10 05:28:54,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:28:54,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:54,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:54,922 INFO L424 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:54,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:54,922 INFO L82 PathProgramCache]: Analyzing trace with hash 95445288, now seen corresponding path program 1 times [2018-11-10 05:28:54,923 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:54,923 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:54,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:55,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:28:55,236 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:55,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:55,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:28:55,238 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:28:55,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:28:55,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:55,239 INFO L87 Difference]: Start difference. First operand 19203 states and 28157 transitions. Second operand 3 states. [2018-11-10 05:28:57,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:57,809 INFO L93 Difference]: Finished difference Result 31941 states and 47994 transitions. [2018-11-10 05:28:57,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:28:57,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2018-11-10 05:28:57,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:57,864 INFO L225 Difference]: With dead ends: 31941 [2018-11-10 05:28:57,864 INFO L226 Difference]: Without dead ends: 22158 [2018-11-10 05:28:57,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:28:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22158 states. [2018-11-10 05:28:58,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22158 to 21953. [2018-11-10 05:28:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21953 states. [2018-11-10 05:28:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 32375 transitions. [2018-11-10 05:28:58,658 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 32375 transitions. Word has length 135 [2018-11-10 05:28:58,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:28:58,658 INFO L481 AbstractCegarLoop]: Abstraction has 21953 states and 32375 transitions. [2018-11-10 05:28:58,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:28:58,658 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 32375 transitions. [2018-11-10 05:28:58,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 05:28:58,660 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:28:58,661 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:28:58,661 INFO L424 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:28:58,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:28:58,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1038078298, now seen corresponding path program 1 times [2018-11-10 05:28:58,662 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:28:58,662 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:28:58,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:28:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:28:58,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:28:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:28:59,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:28:59,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:28:59,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 05:28:59,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:28:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:28:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:28:59,039 INFO L87 Difference]: Start difference. First operand 21953 states and 32375 transitions. Second operand 11 states. [2018-11-10 05:28:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:28:59,889 INFO L93 Difference]: Finished difference Result 44287 states and 67544 transitions. [2018-11-10 05:28:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:28:59,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 135 [2018-11-10 05:28:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:28:59,951 INFO L225 Difference]: With dead ends: 44287 [2018-11-10 05:28:59,951 INFO L226 Difference]: Without dead ends: 22391 [2018-11-10 05:29:00,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:29:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22391 states. [2018-11-10 05:29:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22391 to 22032. [2018-11-10 05:29:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22032 states. [2018-11-10 05:29:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22032 states to 22032 states and 32482 transitions. [2018-11-10 05:29:00,578 INFO L78 Accepts]: Start accepts. Automaton has 22032 states and 32482 transitions. Word has length 135 [2018-11-10 05:29:00,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:00,578 INFO L481 AbstractCegarLoop]: Abstraction has 22032 states and 32482 transitions. [2018-11-10 05:29:00,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:29:00,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22032 states and 32482 transitions. [2018-11-10 05:29:00,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 05:29:00,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:00,581 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-10 05:29:00,581 INFO L424 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:00,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:00,581 INFO L82 PathProgramCache]: Analyzing trace with hash -932237937, now seen corresponding path program 1 times [2018-11-10 05:29:00,582 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:00,582 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:00,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:00,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:00,893 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:29:00,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:00,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:00,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:29:00,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:29:00,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:29:00,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:29:00,896 INFO L87 Difference]: Start difference. First operand 22032 states and 32482 transitions. Second operand 4 states. [2018-11-10 05:29:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:06,010 INFO L93 Difference]: Finished difference Result 80144 states and 132601 transitions. [2018-11-10 05:29:06,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:29:06,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-11-10 05:29:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:06,205 INFO L225 Difference]: With dead ends: 80144 [2018-11-10 05:29:06,205 INFO L226 Difference]: Without dead ends: 58182 [2018-11-10 05:29:06,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:29:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58182 states. [2018-11-10 05:29:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58182 to 57994. [2018-11-10 05:29:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57994 states. [2018-11-10 05:29:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57994 states to 57994 states and 93116 transitions. [2018-11-10 05:29:08,424 INFO L78 Accepts]: Start accepts. Automaton has 57994 states and 93116 transitions. Word has length 137 [2018-11-10 05:29:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:08,424 INFO L481 AbstractCegarLoop]: Abstraction has 57994 states and 93116 transitions. [2018-11-10 05:29:08,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:29:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 57994 states and 93116 transitions. [2018-11-10 05:29:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-11-10 05:29:08,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:08,427 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-10 05:29:08,427 INFO L424 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:08,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash -873885526, now seen corresponding path program 1 times [2018-11-10 05:29:08,428 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:08,428 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:09,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:09,426 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 05:29:09,426 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:09,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:09,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:29:09,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:29:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:29:09,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:29:09,431 INFO L87 Difference]: Start difference. First operand 57994 states and 93116 transitions. Second operand 8 states. [2018-11-10 05:29:24,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:24,895 INFO L93 Difference]: Finished difference Result 115950 states and 186191 transitions. [2018-11-10 05:29:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:29:24,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2018-11-10 05:29:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:25,067 INFO L225 Difference]: With dead ends: 115950 [2018-11-10 05:29:25,068 INFO L226 Difference]: Without dead ends: 57994 [2018-11-10 05:29:25,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:29:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57994 states. [2018-11-10 05:29:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57994 to 57994. [2018-11-10 05:29:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57994 states. [2018-11-10 05:29:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57994 states to 57994 states and 93115 transitions. [2018-11-10 05:29:27,075 INFO L78 Accepts]: Start accepts. Automaton has 57994 states and 93115 transitions. Word has length 146 [2018-11-10 05:29:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:27,076 INFO L481 AbstractCegarLoop]: Abstraction has 57994 states and 93115 transitions. [2018-11-10 05:29:27,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:29:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 57994 states and 93115 transitions. [2018-11-10 05:29:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 05:29:27,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:27,078 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:27,078 INFO L424 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:27,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 608712723, now seen corresponding path program 1 times [2018-11-10 05:29:27,080 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:27,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:28,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:28,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 05:29:28,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 05:29:28,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:11, output treesize:1 [2018-11-10 05:29:28,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 05:29:28,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 05:29:28,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:29:28,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:5 [2018-11-10 05:29:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-10 05:29:28,165 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:28,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:28,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:28,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:28,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:28,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:28,561 INFO L87 Difference]: Start difference. First operand 57994 states and 93115 transitions. Second operand 5 states. [2018-11-10 05:29:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:46,387 INFO L93 Difference]: Finished difference Result 115964 states and 186205 transitions. [2018-11-10 05:29:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:29:46,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-10 05:29:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:46,605 INFO L225 Difference]: With dead ends: 115964 [2018-11-10 05:29:46,605 INFO L226 Difference]: Without dead ends: 58007 [2018-11-10 05:29:46,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:29:46,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58007 states. [2018-11-10 05:29:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58007 to 57996. [2018-11-10 05:29:48,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57996 states. [2018-11-10 05:29:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57996 states to 57996 states and 93117 transitions. [2018-11-10 05:29:49,053 INFO L78 Accepts]: Start accepts. Automaton has 57996 states and 93117 transitions. Word has length 160 [2018-11-10 05:29:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:49,053 INFO L481 AbstractCegarLoop]: Abstraction has 57996 states and 93117 transitions. [2018-11-10 05:29:49,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:49,053 INFO L276 IsEmpty]: Start isEmpty. Operand 57996 states and 93117 transitions. [2018-11-10 05:29:49,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-11-10 05:29:49,056 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:49,056 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:49,056 INFO L424 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:49,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:49,057 INFO L82 PathProgramCache]: Analyzing trace with hash -338325163, now seen corresponding path program 1 times [2018-11-10 05:29:49,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:49,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:51,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 05:29:51,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:51,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:51,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:51,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:51,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:51,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:51,280 INFO L87 Difference]: Start difference. First operand 57996 states and 93117 transitions. Second operand 5 states. [2018-11-10 05:29:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:51,919 INFO L93 Difference]: Finished difference Result 60663 states and 96662 transitions. [2018-11-10 05:29:51,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:29:51,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 160 [2018-11-10 05:29:51,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:51,928 INFO L225 Difference]: With dead ends: 60663 [2018-11-10 05:29:51,928 INFO L226 Difference]: Without dead ends: 2280 [2018-11-10 05:29:52,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:52,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2280 states. [2018-11-10 05:29:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2280 to 1838. [2018-11-10 05:29:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-11-10 05:29:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2214 transitions. [2018-11-10 05:29:52,116 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2214 transitions. Word has length 160 [2018-11-10 05:29:52,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:52,117 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 2214 transitions. [2018-11-10 05:29:52,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2214 transitions. [2018-11-10 05:29:52,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-10 05:29:52,118 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:52,119 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:52,119 INFO L424 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:52,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:52,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1954027735, now seen corresponding path program 1 times [2018-11-10 05:29:52,120 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:52,120 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:52,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:52,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:29:52,463 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:52,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:52,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:29:52,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:29:52,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:29:52,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:29:52,466 INFO L87 Difference]: Start difference. First operand 1838 states and 2214 transitions. Second operand 3 states. [2018-11-10 05:29:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:54,591 INFO L93 Difference]: Finished difference Result 1876 states and 2253 transitions. [2018-11-10 05:29:54,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:29:54,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2018-11-10 05:29:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:54,594 INFO L225 Difference]: With dead ends: 1876 [2018-11-10 05:29:54,594 INFO L226 Difference]: Without dead ends: 1621 [2018-11-10 05:29:54,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:29:54,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2018-11-10 05:29:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1621. [2018-11-10 05:29:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1621 states. [2018-11-10 05:29:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1621 states to 1621 states and 1962 transitions. [2018-11-10 05:29:54,636 INFO L78 Accepts]: Start accepts. Automaton has 1621 states and 1962 transitions. Word has length 162 [2018-11-10 05:29:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:54,636 INFO L481 AbstractCegarLoop]: Abstraction has 1621 states and 1962 transitions. [2018-11-10 05:29:54,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:29:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1621 states and 1962 transitions. [2018-11-10 05:29:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 05:29:54,637 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:54,637 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:54,638 INFO L424 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:54,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2038308254, now seen corresponding path program 1 times [2018-11-10 05:29:54,639 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:54,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:54,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:29:55,028 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:55,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:55,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 05:29:55,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 05:29:55,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 05:29:55,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:29:55,031 INFO L87 Difference]: Start difference. First operand 1621 states and 1962 transitions. Second operand 7 states. [2018-11-10 05:29:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:55,087 INFO L93 Difference]: Finished difference Result 2497 states and 3031 transitions. [2018-11-10 05:29:55,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:29:55,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 168 [2018-11-10 05:29:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:55,092 INFO L225 Difference]: With dead ends: 2497 [2018-11-10 05:29:55,092 INFO L226 Difference]: Without dead ends: 1609 [2018-11-10 05:29:55,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:29:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2018-11-10 05:29:55,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1609. [2018-11-10 05:29:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-10 05:29:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 1936 transitions. [2018-11-10 05:29:55,133 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 1936 transitions. Word has length 168 [2018-11-10 05:29:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:55,133 INFO L481 AbstractCegarLoop]: Abstraction has 1609 states and 1936 transitions. [2018-11-10 05:29:55,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 05:29:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 1936 transitions. [2018-11-10 05:29:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:29:55,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:55,135 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:55,135 INFO L424 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:55,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1873830084, now seen corresponding path program 1 times [2018-11-10 05:29:55,136 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:55,136 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:55,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:55,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:29:55,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:55,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:55,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:29:55,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:29:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:29:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:29:55,715 INFO L87 Difference]: Start difference. First operand 1609 states and 1936 transitions. Second operand 6 states. [2018-11-10 05:29:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:55,817 INFO L93 Difference]: Finished difference Result 2260 states and 2713 transitions. [2018-11-10 05:29:55,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:29:55,817 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2018-11-10 05:29:55,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:55,820 INFO L225 Difference]: With dead ends: 2260 [2018-11-10 05:29:55,821 INFO L226 Difference]: Without dead ends: 1630 [2018-11-10 05:29:55,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:29:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2018-11-10 05:29:55,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1602. [2018-11-10 05:29:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1602 states. [2018-11-10 05:29:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 1922 transitions. [2018-11-10 05:29:55,862 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 1922 transitions. Word has length 175 [2018-11-10 05:29:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:55,863 INFO L481 AbstractCegarLoop]: Abstraction has 1602 states and 1922 transitions. [2018-11-10 05:29:55,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:29:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 1922 transitions. [2018-11-10 05:29:55,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 05:29:55,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:55,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:55,864 INFO L424 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:55,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:55,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1915142211, now seen corresponding path program 1 times [2018-11-10 05:29:55,865 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:55,865 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:56,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:56,243 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:29:56,243 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:56,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:56,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:29:56,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:29:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:29:56,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:29:56,247 INFO L87 Difference]: Start difference. First operand 1602 states and 1922 transitions. Second operand 6 states. [2018-11-10 05:29:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:56,360 INFO L93 Difference]: Finished difference Result 2354 states and 2795 transitions. [2018-11-10 05:29:56,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:29:56,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2018-11-10 05:29:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:56,363 INFO L225 Difference]: With dead ends: 2354 [2018-11-10 05:29:56,363 INFO L226 Difference]: Without dead ends: 1559 [2018-11-10 05:29:56,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:29:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2018-11-10 05:29:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1533. [2018-11-10 05:29:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1533 states. [2018-11-10 05:29:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 1830 transitions. [2018-11-10 05:29:56,403 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 1830 transitions. Word has length 178 [2018-11-10 05:29:56,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:56,403 INFO L481 AbstractCegarLoop]: Abstraction has 1533 states and 1830 transitions. [2018-11-10 05:29:56,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:29:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 1830 transitions. [2018-11-10 05:29:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:29:56,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:56,405 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:56,405 INFO L424 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:56,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:56,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1378497431, now seen corresponding path program 1 times [2018-11-10 05:29:56,406 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:56,406 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:56,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:56,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:29:56,758 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:56,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:56,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:56,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:56,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:56,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:56,761 INFO L87 Difference]: Start difference. First operand 1533 states and 1830 transitions. Second operand 5 states. [2018-11-10 05:29:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:57,007 INFO L93 Difference]: Finished difference Result 1622 states and 1946 transitions. [2018-11-10 05:29:57,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:29:57,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 175 [2018-11-10 05:29:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:57,010 INFO L225 Difference]: With dead ends: 1622 [2018-11-10 05:29:57,010 INFO L226 Difference]: Without dead ends: 1577 [2018-11-10 05:29:57,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:29:57,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2018-11-10 05:29:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1535. [2018-11-10 05:29:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-10 05:29:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1832 transitions. [2018-11-10 05:29:57,053 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 1832 transitions. Word has length 175 [2018-11-10 05:29:57,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:57,053 INFO L481 AbstractCegarLoop]: Abstraction has 1535 states and 1832 transitions. [2018-11-10 05:29:57,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:57,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 1832 transitions. [2018-11-10 05:29:57,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 05:29:57,054 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:57,054 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:57,054 INFO L424 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:57,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:57,054 INFO L82 PathProgramCache]: Analyzing trace with hash 345870237, now seen corresponding path program 1 times [2018-11-10 05:29:57,055 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:57,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:57,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:29:57,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:57,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:57,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:57,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:57,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:57,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:57,410 INFO L87 Difference]: Start difference. First operand 1535 states and 1832 transitions. Second operand 5 states. [2018-11-10 05:29:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:57,501 INFO L93 Difference]: Finished difference Result 1619 states and 1934 transitions. [2018-11-10 05:29:57,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:29:57,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2018-11-10 05:29:57,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:57,504 INFO L225 Difference]: With dead ends: 1619 [2018-11-10 05:29:57,504 INFO L226 Difference]: Without dead ends: 1569 [2018-11-10 05:29:57,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:57,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2018-11-10 05:29:57,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1563. [2018-11-10 05:29:57,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1563 states. [2018-11-10 05:29:57,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1867 transitions. [2018-11-10 05:29:57,548 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1867 transitions. Word has length 177 [2018-11-10 05:29:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:57,548 INFO L481 AbstractCegarLoop]: Abstraction has 1563 states and 1867 transitions. [2018-11-10 05:29:57,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1867 transitions. [2018-11-10 05:29:57,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 05:29:57,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:57,549 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:57,549 INFO L424 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:57,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:57,550 INFO L82 PathProgramCache]: Analyzing trace with hash -427449794, now seen corresponding path program 1 times [2018-11-10 05:29:57,550 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:57,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:57,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:29:57,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:57,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:57,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:57,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:57,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:57,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:57,890 INFO L87 Difference]: Start difference. First operand 1563 states and 1867 transitions. Second operand 5 states. [2018-11-10 05:29:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:57,984 INFO L93 Difference]: Finished difference Result 1628 states and 1944 transitions. [2018-11-10 05:29:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:29:57,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2018-11-10 05:29:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:57,987 INFO L225 Difference]: With dead ends: 1628 [2018-11-10 05:29:57,987 INFO L226 Difference]: Without dead ends: 1578 [2018-11-10 05:29:57,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2018-11-10 05:29:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1544. [2018-11-10 05:29:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-10 05:29:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1842 transitions. [2018-11-10 05:29:58,029 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1842 transitions. Word has length 177 [2018-11-10 05:29:58,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:58,029 INFO L481 AbstractCegarLoop]: Abstraction has 1544 states and 1842 transitions. [2018-11-10 05:29:58,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1842 transitions. [2018-11-10 05:29:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 05:29:58,030 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:58,030 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:58,031 INFO L424 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:58,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:58,031 INFO L82 PathProgramCache]: Analyzing trace with hash 946207848, now seen corresponding path program 1 times [2018-11-10 05:29:58,032 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:58,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:58,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:29:58,373 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:58,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:58,376 INFO L87 Difference]: Start difference. First operand 1544 states and 1842 transitions. Second operand 5 states. [2018-11-10 05:29:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:29:58,446 INFO L93 Difference]: Finished difference Result 1633 states and 1936 transitions. [2018-11-10 05:29:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:29:58,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2018-11-10 05:29:58,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:29:58,448 INFO L225 Difference]: With dead ends: 1633 [2018-11-10 05:29:58,448 INFO L226 Difference]: Without dead ends: 1538 [2018-11-10 05:29:58,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2018-11-10 05:29:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1538. [2018-11-10 05:29:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-11-10 05:29:58,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1834 transitions. [2018-11-10 05:29:58,489 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1834 transitions. Word has length 179 [2018-11-10 05:29:58,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:29:58,489 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 1834 transitions. [2018-11-10 05:29:58,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:29:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1834 transitions. [2018-11-10 05:29:58,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 05:29:58,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:29:58,491 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:29:58,491 INFO L424 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:29:58,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:29:58,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1717648840, now seen corresponding path program 1 times [2018-11-10 05:29:58,492 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:29:58,492 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:29:58,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:29:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:29:58,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:29:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-10 05:29:58,853 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:29:58,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:29:58,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:29:58,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:29:58,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:29:58,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:29:58,857 INFO L87 Difference]: Start difference. First operand 1538 states and 1834 transitions. Second operand 5 states. [2018-11-10 05:30:15,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:15,705 INFO L93 Difference]: Finished difference Result 2139 states and 2526 transitions. [2018-11-10 05:30:15,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:30:15,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 185 [2018-11-10 05:30:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:15,708 INFO L225 Difference]: With dead ends: 2139 [2018-11-10 05:30:15,708 INFO L226 Difference]: Without dead ends: 1228 [2018-11-10 05:30:15,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:30:15,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-11-10 05:30:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1036. [2018-11-10 05:30:15,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2018-11-10 05:30:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1212 transitions. [2018-11-10 05:30:15,740 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1212 transitions. Word has length 185 [2018-11-10 05:30:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:15,741 INFO L481 AbstractCegarLoop]: Abstraction has 1036 states and 1212 transitions. [2018-11-10 05:30:15,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:30:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1212 transitions. [2018-11-10 05:30:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 05:30:15,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:15,742 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:15,742 INFO L424 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:15,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:15,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1632881074, now seen corresponding path program 1 times [2018-11-10 05:30:15,743 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:15,743 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:16,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:30:16,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:16,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:16,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 05:30:16,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:30:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:30:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:30:16,173 INFO L87 Difference]: Start difference. First operand 1036 states and 1212 transitions. Second operand 11 states. [2018-11-10 05:30:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:16,439 INFO L93 Difference]: Finished difference Result 1093 states and 1280 transitions. [2018-11-10 05:30:16,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:30:16,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2018-11-10 05:30:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:16,442 INFO L225 Difference]: With dead ends: 1093 [2018-11-10 05:30:16,442 INFO L226 Difference]: Without dead ends: 1035 [2018-11-10 05:30:16,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:30:16,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-11-10 05:30:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2018-11-10 05:30:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-11-10 05:30:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1210 transitions. [2018-11-10 05:30:16,486 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1210 transitions. Word has length 183 [2018-11-10 05:30:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:16,486 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1210 transitions. [2018-11-10 05:30:16,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:30:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1210 transitions. [2018-11-10 05:30:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 05:30:16,487 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:16,487 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:16,487 INFO L424 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:16,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:16,487 INFO L82 PathProgramCache]: Analyzing trace with hash -678818769, now seen corresponding path program 1 times [2018-11-10 05:30:16,489 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:16,489 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:16,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:16,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:30:16,906 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:16,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:16,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 05:30:16,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 05:30:16,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 05:30:16,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-10 05:30:16,911 INFO L87 Difference]: Start difference. First operand 1035 states and 1210 transitions. Second operand 11 states. [2018-11-10 05:30:17,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:17,178 INFO L93 Difference]: Finished difference Result 1064 states and 1243 transitions. [2018-11-10 05:30:17,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:30:17,178 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2018-11-10 05:30:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:17,180 INFO L225 Difference]: With dead ends: 1064 [2018-11-10 05:30:17,180 INFO L226 Difference]: Without dead ends: 955 [2018-11-10 05:30:17,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:30:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-10 05:30:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 955. [2018-11-10 05:30:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-10 05:30:17,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1120 transitions. [2018-11-10 05:30:17,210 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1120 transitions. Word has length 183 [2018-11-10 05:30:17,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:17,210 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1120 transitions. [2018-11-10 05:30:17,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 05:30:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1120 transitions. [2018-11-10 05:30:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:30:17,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:17,212 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:17,212 INFO L424 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:17,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1125180571, now seen corresponding path program 1 times [2018-11-10 05:30:17,213 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:17,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:17,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 05:30:17,711 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:17,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:17,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:17,715 INFO L87 Difference]: Start difference. First operand 955 states and 1120 transitions. Second operand 14 states. [2018-11-10 05:30:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:18,041 INFO L93 Difference]: Finished difference Result 1059 states and 1244 transitions. [2018-11-10 05:30:18,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:18,041 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-10 05:30:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:18,042 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 05:30:18,042 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 05:30:18,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:18,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 05:30:18,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 965. [2018-11-10 05:30:18,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-11-10 05:30:18,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1133 transitions. [2018-11-10 05:30:18,071 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1133 transitions. Word has length 188 [2018-11-10 05:30:18,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:18,071 INFO L481 AbstractCegarLoop]: Abstraction has 965 states and 1133 transitions. [2018-11-10 05:30:18,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:18,072 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1133 transitions. [2018-11-10 05:30:18,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 05:30:18,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:18,073 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:18,073 INFO L424 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:18,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:18,073 INFO L82 PathProgramCache]: Analyzing trace with hash -723244849, now seen corresponding path program 1 times [2018-11-10 05:30:18,074 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:18,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:18,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:18,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 05:30:18,743 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:18,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:18,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:18,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:18,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:18,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:18,747 INFO L87 Difference]: Start difference. First operand 965 states and 1133 transitions. Second operand 14 states. [2018-11-10 05:30:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:19,048 INFO L93 Difference]: Finished difference Result 1059 states and 1243 transitions. [2018-11-10 05:30:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:19,048 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 198 [2018-11-10 05:30:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:19,049 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 05:30:19,049 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 05:30:19,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 05:30:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 965. [2018-11-10 05:30:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-11-10 05:30:19,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1132 transitions. [2018-11-10 05:30:19,078 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1132 transitions. Word has length 198 [2018-11-10 05:30:19,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:19,079 INFO L481 AbstractCegarLoop]: Abstraction has 965 states and 1132 transitions. [2018-11-10 05:30:19,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1132 transitions. [2018-11-10 05:30:19,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 05:30:19,080 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:19,080 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:19,080 INFO L424 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:19,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:19,080 INFO L82 PathProgramCache]: Analyzing trace with hash 900191824, now seen corresponding path program 1 times [2018-11-10 05:30:19,081 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:19,081 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:19,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:19,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:19,558 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 05:30:19,558 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:19,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:19,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:19,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:19,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:19,562 INFO L87 Difference]: Start difference. First operand 965 states and 1132 transitions. Second operand 14 states. [2018-11-10 05:30:19,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:19,877 INFO L93 Difference]: Finished difference Result 1059 states and 1242 transitions. [2018-11-10 05:30:19,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:19,878 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 198 [2018-11-10 05:30:19,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:19,879 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 05:30:19,879 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 05:30:19,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:19,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 05:30:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 965. [2018-11-10 05:30:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2018-11-10 05:30:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1131 transitions. [2018-11-10 05:30:19,908 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1131 transitions. Word has length 198 [2018-11-10 05:30:19,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:19,908 INFO L481 AbstractCegarLoop]: Abstraction has 965 states and 1131 transitions. [2018-11-10 05:30:19,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1131 transitions. [2018-11-10 05:30:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 05:30:19,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:19,909 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:19,909 INFO L424 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:19,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 498256102, now seen corresponding path program 1 times [2018-11-10 05:30:19,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:19,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:19,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:20,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:20,370 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 05:30:20,370 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:20,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:20,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:20,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:20,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:20,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:20,373 INFO L87 Difference]: Start difference. First operand 965 states and 1131 transitions. Second operand 14 states. [2018-11-10 05:30:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:20,674 INFO L93 Difference]: Finished difference Result 1059 states and 1241 transitions. [2018-11-10 05:30:20,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:20,674 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 188 [2018-11-10 05:30:20,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:20,676 INFO L225 Difference]: With dead ends: 1059 [2018-11-10 05:30:20,676 INFO L226 Difference]: Without dead ends: 975 [2018-11-10 05:30:20,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2018-11-10 05:30:20,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 955. [2018-11-10 05:30:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-11-10 05:30:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1118 transitions. [2018-11-10 05:30:20,704 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1118 transitions. Word has length 188 [2018-11-10 05:30:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:20,705 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 1118 transitions. [2018-11-10 05:30:20,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1118 transitions. [2018-11-10 05:30:20,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 05:30:20,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:20,706 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:20,706 INFO L424 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:20,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1934525187, now seen corresponding path program 1 times [2018-11-10 05:30:20,707 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:20,707 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:20,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:21,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:30:21,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:21,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:21,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:21,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:21,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:21,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:21,179 INFO L87 Difference]: Start difference. First operand 955 states and 1118 transitions. Second operand 14 states. [2018-11-10 05:30:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:21,465 INFO L93 Difference]: Finished difference Result 1071 states and 1262 transitions. [2018-11-10 05:30:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:21,465 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 199 [2018-11-10 05:30:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:21,467 INFO L225 Difference]: With dead ends: 1071 [2018-11-10 05:30:21,467 INFO L226 Difference]: Without dead ends: 987 [2018-11-10 05:30:21,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-11-10 05:30:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 977. [2018-11-10 05:30:21,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-11-10 05:30:21,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1149 transitions. [2018-11-10 05:30:21,498 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1149 transitions. Word has length 199 [2018-11-10 05:30:21,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:21,498 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1149 transitions. [2018-11-10 05:30:21,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1149 transitions. [2018-11-10 05:30:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 05:30:21,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:21,500 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:21,500 INFO L424 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:21,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:21,500 INFO L82 PathProgramCache]: Analyzing trace with hash 226280371, now seen corresponding path program 1 times [2018-11-10 05:30:21,501 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:21,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:21,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:21,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:21,971 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:30:21,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:21,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:21,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:21,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:21,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:21,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:21,974 INFO L87 Difference]: Start difference. First operand 977 states and 1149 transitions. Second operand 14 states. [2018-11-10 05:30:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:22,252 INFO L93 Difference]: Finished difference Result 1071 states and 1261 transitions. [2018-11-10 05:30:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:22,252 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-10 05:30:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:22,254 INFO L225 Difference]: With dead ends: 1071 [2018-11-10 05:30:22,254 INFO L226 Difference]: Without dead ends: 987 [2018-11-10 05:30:22,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-11-10 05:30:22,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 974. [2018-11-10 05:30:22,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-11-10 05:30:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1145 transitions. [2018-11-10 05:30:22,292 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1145 transitions. Word has length 189 [2018-11-10 05:30:22,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:22,292 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 1145 transitions. [2018-11-10 05:30:22,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1145 transitions. [2018-11-10 05:30:22,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 05:30:22,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:22,293 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:22,293 INFO L424 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:22,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:22,294 INFO L82 PathProgramCache]: Analyzing trace with hash -297955484, now seen corresponding path program 1 times [2018-11-10 05:30:22,294 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:22,295 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:22,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:22,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:30:22,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:22,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:22,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:22,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:22,765 INFO L87 Difference]: Start difference. First operand 974 states and 1145 transitions. Second operand 14 states. [2018-11-10 05:30:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:23,043 INFO L93 Difference]: Finished difference Result 1067 states and 1256 transitions. [2018-11-10 05:30:23,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:23,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 199 [2018-11-10 05:30:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:23,045 INFO L225 Difference]: With dead ends: 1067 [2018-11-10 05:30:23,045 INFO L226 Difference]: Without dead ends: 968 [2018-11-10 05:30:23,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-11-10 05:30:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 958. [2018-11-10 05:30:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-10 05:30:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1126 transitions. [2018-11-10 05:30:23,075 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1126 transitions. Word has length 199 [2018-11-10 05:30:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:23,075 INFO L481 AbstractCegarLoop]: Abstraction has 958 states and 1126 transitions. [2018-11-10 05:30:23,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:23,075 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1126 transitions. [2018-11-10 05:30:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 05:30:23,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:23,076 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:23,076 INFO L424 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:23,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2006200300, now seen corresponding path program 1 times [2018-11-10 05:30:23,077 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:23,077 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:23,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:23,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:23,577 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-10 05:30:23,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:23,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:23,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:23,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:23,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:23,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:23,580 INFO L87 Difference]: Start difference. First operand 958 states and 1126 transitions. Second operand 14 states. [2018-11-10 05:30:23,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:23,841 INFO L93 Difference]: Finished difference Result 1031 states and 1206 transitions. [2018-11-10 05:30:23,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:23,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 189 [2018-11-10 05:30:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:23,843 INFO L225 Difference]: With dead ends: 1031 [2018-11-10 05:30:23,843 INFO L226 Difference]: Without dead ends: 858 [2018-11-10 05:30:23,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2018-11-10 05:30:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 826. [2018-11-10 05:30:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2018-11-10 05:30:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 948 transitions. [2018-11-10 05:30:23,869 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 948 transitions. Word has length 189 [2018-11-10 05:30:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:23,869 INFO L481 AbstractCegarLoop]: Abstraction has 826 states and 948 transitions. [2018-11-10 05:30:23,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 948 transitions. [2018-11-10 05:30:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-10 05:30:23,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:23,870 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:23,870 INFO L424 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:23,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -402891572, now seen corresponding path program 1 times [2018-11-10 05:30:23,871 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:23,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:23,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:24,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 05:30:24,274 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:24,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:24,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 05:30:24,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 05:30:24,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 05:30:24,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:30:24,277 INFO L87 Difference]: Start difference. First operand 826 states and 948 transitions. Second operand 6 states. [2018-11-10 05:30:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:24,357 INFO L93 Difference]: Finished difference Result 842 states and 964 transitions. [2018-11-10 05:30:24,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:30:24,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-11-10 05:30:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:24,359 INFO L225 Difference]: With dead ends: 842 [2018-11-10 05:30:24,359 INFO L226 Difference]: Without dead ends: 741 [2018-11-10 05:30:24,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 05:30:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2018-11-10 05:30:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 729. [2018-11-10 05:30:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-11-10 05:30:24,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 830 transitions. [2018-11-10 05:30:24,384 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 830 transitions. Word has length 209 [2018-11-10 05:30:24,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:24,384 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 830 transitions. [2018-11-10 05:30:24,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 05:30:24,385 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 830 transitions. [2018-11-10 05:30:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 05:30:24,385 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:24,386 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:24,386 INFO L424 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:24,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash 655023309, now seen corresponding path program 1 times [2018-11-10 05:30:24,387 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:24,387 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:24,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:30:24,860 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:24,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:24,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-10 05:30:24,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:30:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:30:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:30:24,863 INFO L87 Difference]: Start difference. First operand 729 states and 830 transitions. Second operand 13 states. [2018-11-10 05:30:45,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:45,813 INFO L93 Difference]: Finished difference Result 759 states and 864 transitions. [2018-11-10 05:30:45,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:30:45,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 198 [2018-11-10 05:30:45,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:45,815 INFO L225 Difference]: With dead ends: 759 [2018-11-10 05:30:45,815 INFO L226 Difference]: Without dead ends: 648 [2018-11-10 05:30:45,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-11-10 05:30:45,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2018-11-10 05:30:45,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-10 05:30:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 737 transitions. [2018-11-10 05:30:45,837 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 737 transitions. Word has length 198 [2018-11-10 05:30:45,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:45,837 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 737 transitions. [2018-11-10 05:30:45,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:30:45,837 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 737 transitions. [2018-11-10 05:30:45,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 05:30:45,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:45,838 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:45,838 INFO L424 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:45,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:45,839 INFO L82 PathProgramCache]: Analyzing trace with hash -700242690, now seen corresponding path program 1 times [2018-11-10 05:30:45,839 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:45,840 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:45,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:46,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:30:46,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:46,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:46,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:30:46,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:30:46,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:30:46,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:30:46,341 INFO L87 Difference]: Start difference. First operand 648 states and 737 transitions. Second operand 12 states. [2018-11-10 05:30:46,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:46,562 INFO L93 Difference]: Finished difference Result 798 states and 901 transitions. [2018-11-10 05:30:46,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:30:46,563 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 211 [2018-11-10 05:30:46,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:46,565 INFO L225 Difference]: With dead ends: 798 [2018-11-10 05:30:46,565 INFO L226 Difference]: Without dead ends: 666 [2018-11-10 05:30:46,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-11-10 05:30:46,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-11-10 05:30:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 654. [2018-11-10 05:30:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-10 05:30:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 744 transitions. [2018-11-10 05:30:46,589 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 744 transitions. Word has length 211 [2018-11-10 05:30:46,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:46,589 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 744 transitions. [2018-11-10 05:30:46,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:30:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 744 transitions. [2018-11-10 05:30:46,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-11-10 05:30:46,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:46,590 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:46,591 INFO L424 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:46,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1789513300, now seen corresponding path program 1 times [2018-11-10 05:30:46,592 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:46,592 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:46,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:47,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:47,288 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 05:30:47,288 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:47,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:47,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-10 05:30:47,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 05:30:47,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 05:30:47,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-10 05:30:47,292 INFO L87 Difference]: Start difference. First operand 654 states and 744 transitions. Second operand 12 states. [2018-11-10 05:30:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:47,514 INFO L93 Difference]: Finished difference Result 795 states and 895 transitions. [2018-11-10 05:30:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 05:30:47,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 212 [2018-11-10 05:30:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:47,517 INFO L225 Difference]: With dead ends: 795 [2018-11-10 05:30:47,518 INFO L226 Difference]: Without dead ends: 663 [2018-11-10 05:30:47,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:30:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-10 05:30:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 645. [2018-11-10 05:30:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-11-10 05:30:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 731 transitions. [2018-11-10 05:30:47,541 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 731 transitions. Word has length 212 [2018-11-10 05:30:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:47,541 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 731 transitions. [2018-11-10 05:30:47,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 05:30:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 731 transitions. [2018-11-10 05:30:47,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 05:30:47,542 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:47,542 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:47,542 INFO L424 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1945971497, now seen corresponding path program 1 times [2018-11-10 05:30:47,544 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:47,544 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:47,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:47,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 05:30:47,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:47,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:47,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:30:47,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:30:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:30:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:30:47,992 INFO L87 Difference]: Start difference. First operand 645 states and 731 transitions. Second operand 8 states. [2018-11-10 05:30:48,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:48,107 INFO L93 Difference]: Finished difference Result 763 states and 867 transitions. [2018-11-10 05:30:48,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:30:48,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 215 [2018-11-10 05:30:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:48,109 INFO L225 Difference]: With dead ends: 763 [2018-11-10 05:30:48,109 INFO L226 Difference]: Without dead ends: 657 [2018-11-10 05:30:48,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:30:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-10 05:30:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2018-11-10 05:30:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-11-10 05:30:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 739 transitions. [2018-11-10 05:30:48,132 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 739 transitions. Word has length 215 [2018-11-10 05:30:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:48,133 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 739 transitions. [2018-11-10 05:30:48,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:30:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 739 transitions. [2018-11-10 05:30:48,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-11-10 05:30:48,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:48,134 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:48,134 INFO L424 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:48,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:48,135 INFO L82 PathProgramCache]: Analyzing trace with hash 162263672, now seen corresponding path program 1 times [2018-11-10 05:30:48,136 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:48,136 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:48,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:48,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-10 05:30:48,607 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:48,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:48,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:30:48,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:30:48,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:30:48,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:30:48,611 INFO L87 Difference]: Start difference. First operand 653 states and 739 transitions. Second operand 8 states. [2018-11-10 05:30:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:48,700 INFO L93 Difference]: Finished difference Result 748 states and 842 transitions. [2018-11-10 05:30:48,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:30:48,700 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 215 [2018-11-10 05:30:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:48,701 INFO L225 Difference]: With dead ends: 748 [2018-11-10 05:30:48,702 INFO L226 Difference]: Without dead ends: 633 [2018-11-10 05:30:48,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:30:48,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-10 05:30:48,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 621. [2018-11-10 05:30:48,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-10 05:30:48,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 700 transitions. [2018-11-10 05:30:48,725 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 700 transitions. Word has length 215 [2018-11-10 05:30:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:48,725 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 700 transitions. [2018-11-10 05:30:48,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:30:48,725 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 700 transitions. [2018-11-10 05:30:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-11-10 05:30:48,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:48,726 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:48,726 INFO L424 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:48,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:48,727 INFO L82 PathProgramCache]: Analyzing trace with hash -872542382, now seen corresponding path program 1 times [2018-11-10 05:30:48,728 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:48,728 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:48,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:49,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-10 05:30:49,254 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:49,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:49,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:49,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:49,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:49,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:49,257 INFO L87 Difference]: Start difference. First operand 621 states and 700 transitions. Second operand 14 states. [2018-11-10 05:30:49,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:49,507 INFO L93 Difference]: Finished difference Result 807 states and 911 transitions. [2018-11-10 05:30:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:49,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 218 [2018-11-10 05:30:49,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:49,509 INFO L225 Difference]: With dead ends: 807 [2018-11-10 05:30:49,509 INFO L226 Difference]: Without dead ends: 618 [2018-11-10 05:30:49,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:49,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-11-10 05:30:49,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2018-11-10 05:30:49,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 05:30:49,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 696 transitions. [2018-11-10 05:30:49,532 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 696 transitions. Word has length 218 [2018-11-10 05:30:49,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:49,532 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 696 transitions. [2018-11-10 05:30:49,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 696 transitions. [2018-11-10 05:30:49,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 05:30:49,533 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:49,534 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:49,534 INFO L424 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 839098989, now seen corresponding path program 1 times [2018-11-10 05:30:49,535 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:49,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:49,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 05:30:49,929 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:49,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:49,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:30:49,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:30:49,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:30:49,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:30:49,932 INFO L87 Difference]: Start difference. First operand 618 states and 696 transitions. Second operand 8 states. [2018-11-10 05:30:50,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:50,020 INFO L93 Difference]: Finished difference Result 769 states and 862 transitions. [2018-11-10 05:30:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:30:50,021 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 219 [2018-11-10 05:30:50,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:50,022 INFO L225 Difference]: With dead ends: 769 [2018-11-10 05:30:50,022 INFO L226 Difference]: Without dead ends: 616 [2018-11-10 05:30:50,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:30:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2018-11-10 05:30:50,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2018-11-10 05:30:50,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 05:30:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 692 transitions. [2018-11-10 05:30:50,045 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 692 transitions. Word has length 219 [2018-11-10 05:30:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:50,045 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 692 transitions. [2018-11-10 05:30:50,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:30:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 692 transitions. [2018-11-10 05:30:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-11-10 05:30:50,046 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:50,046 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:50,046 INFO L424 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:50,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash 179342412, now seen corresponding path program 1 times [2018-11-10 05:30:50,048 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:50,048 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:50,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-10 05:30:50,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:50,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:50,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 05:30:50,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 05:30:50,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 05:30:50,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-10 05:30:50,455 INFO L87 Difference]: Start difference. First operand 616 states and 692 transitions. Second operand 8 states. [2018-11-10 05:30:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:50,534 INFO L93 Difference]: Finished difference Result 620 states and 695 transitions. [2018-11-10 05:30:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 05:30:50,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 219 [2018-11-10 05:30:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:50,535 INFO L225 Difference]: With dead ends: 620 [2018-11-10 05:30:50,535 INFO L226 Difference]: Without dead ends: 394 [2018-11-10 05:30:50,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:30:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-11-10 05:30:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-11-10 05:30:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-11-10 05:30:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 441 transitions. [2018-11-10 05:30:50,548 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 441 transitions. Word has length 219 [2018-11-10 05:30:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:50,548 INFO L481 AbstractCegarLoop]: Abstraction has 394 states and 441 transitions. [2018-11-10 05:30:50,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 05:30:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 441 transitions. [2018-11-10 05:30:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-11-10 05:30:50,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:50,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:50,549 INFO L424 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:50,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:50,550 INFO L82 PathProgramCache]: Analyzing trace with hash -593690427, now seen corresponding path program 1 times [2018-11-10 05:30:50,551 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:50,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:50,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-10 05:30:50,959 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:50,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-10 05:30:50,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 05:30:50,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 05:30:50,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-11-10 05:30:50,961 INFO L87 Difference]: Start difference. First operand 394 states and 441 transitions. Second operand 10 states. [2018-11-10 05:30:51,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:51,383 INFO L93 Difference]: Finished difference Result 716 states and 802 transitions. [2018-11-10 05:30:51,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 05:30:51,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 221 [2018-11-10 05:30:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:51,385 INFO L225 Difference]: With dead ends: 716 [2018-11-10 05:30:51,386 INFO L226 Difference]: Without dead ends: 614 [2018-11-10 05:30:51,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:51,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2018-11-10 05:30:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 363. [2018-11-10 05:30:51,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-11-10 05:30:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 398 transitions. [2018-11-10 05:30:51,401 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 398 transitions. Word has length 221 [2018-11-10 05:30:51,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:51,401 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 398 transitions. [2018-11-10 05:30:51,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 05:30:51,401 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 398 transitions. [2018-11-10 05:30:51,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-11-10 05:30:51,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:51,402 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:51,402 INFO L424 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:51,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:51,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2095896247, now seen corresponding path program 1 times [2018-11-10 05:30:51,403 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:51,403 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:51,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:51,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:30:51,997 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-10 05:30:52,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 05:30:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 05:30:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:30:52,000 INFO L87 Difference]: Start difference. First operand 363 states and 398 transitions. Second operand 18 states. [2018-11-10 05:30:52,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:52,463 INFO L93 Difference]: Finished difference Result 601 states and 680 transitions. [2018-11-10 05:30:52,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 05:30:52,463 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 249 [2018-11-10 05:30:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:52,465 INFO L225 Difference]: With dead ends: 601 [2018-11-10 05:30:52,465 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 05:30:52,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:30:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 05:30:52,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 385. [2018-11-10 05:30:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-11-10 05:30:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 424 transitions. [2018-11-10 05:30:52,480 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 424 transitions. Word has length 249 [2018-11-10 05:30:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:52,480 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 424 transitions. [2018-11-10 05:30:52,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 05:30:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 424 transitions. [2018-11-10 05:30:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-11-10 05:30:52,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:52,481 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:52,481 INFO L424 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:52,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:52,481 INFO L82 PathProgramCache]: Analyzing trace with hash 168313255, now seen corresponding path program 1 times [2018-11-10 05:30:52,483 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:52,483 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:52,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:52,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:53,100 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-10 05:30:53,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:53,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:53,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-11-10 05:30:53,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-10 05:30:53,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-10 05:30:53,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:30:53,103 INFO L87 Difference]: Start difference. First operand 385 states and 424 transitions. Second operand 18 states. [2018-11-10 05:30:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:53,473 INFO L93 Difference]: Finished difference Result 587 states and 653 transitions. [2018-11-10 05:30:53,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 05:30:53,474 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 250 [2018-11-10 05:30:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:53,475 INFO L225 Difference]: With dead ends: 587 [2018-11-10 05:30:53,475 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 05:30:53,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-11-10 05:30:53,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 05:30:53,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-10 05:30:53,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 05:30:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 418 transitions. [2018-11-10 05:30:53,490 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 418 transitions. Word has length 250 [2018-11-10 05:30:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:53,490 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 418 transitions. [2018-11-10 05:30:53,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-10 05:30:53,490 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 418 transitions. [2018-11-10 05:30:53,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 05:30:53,491 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:53,491 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:53,491 INFO L424 AbstractCegarLoop]: === Iteration 83 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:53,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1161883549, now seen corresponding path program 1 times [2018-11-10 05:30:53,492 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:53,493 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:53,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:53,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-10 05:30:54,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:54,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:54,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:30:54,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:30:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:30:54,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:30:54,049 INFO L87 Difference]: Start difference. First operand 382 states and 418 transitions. Second operand 14 states. [2018-11-10 05:30:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:56,333 INFO L93 Difference]: Finished difference Result 528 states and 576 transitions. [2018-11-10 05:30:56,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:30:56,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 259 [2018-11-10 05:30:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:56,335 INFO L225 Difference]: With dead ends: 528 [2018-11-10 05:30:56,335 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 05:30:56,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:30:56,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 05:30:56,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-10 05:30:56,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 05:30:56,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 417 transitions. [2018-11-10 05:30:56,350 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 417 transitions. Word has length 259 [2018-11-10 05:30:56,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:56,350 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 417 transitions. [2018-11-10 05:30:56,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:30:56,350 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 417 transitions. [2018-11-10 05:30:56,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-11-10 05:30:56,351 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:56,351 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:56,351 INFO L424 AbstractCegarLoop]: === Iteration 84 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:56,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:56,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1982077181, now seen corresponding path program 1 times [2018-11-10 05:30:56,352 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:56,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:56,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-10 05:30:56,811 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:56,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:30:56,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:30:56,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:30:56,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:30:56,815 INFO L87 Difference]: Start difference. First operand 382 states and 417 transitions. Second operand 5 states. [2018-11-10 05:30:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:56,849 INFO L93 Difference]: Finished difference Result 614 states and 672 transitions. [2018-11-10 05:30:56,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:30:56,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2018-11-10 05:30:56,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:56,852 INFO L225 Difference]: With dead ends: 614 [2018-11-10 05:30:56,852 INFO L226 Difference]: Without dead ends: 381 [2018-11-10 05:30:56,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:30:56,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-11-10 05:30:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2018-11-10 05:30:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-11-10 05:30:56,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 415 transitions. [2018-11-10 05:30:56,868 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 415 transitions. Word has length 259 [2018-11-10 05:30:56,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:56,869 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 415 transitions. [2018-11-10 05:30:56,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:30:56,869 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 415 transitions. [2018-11-10 05:30:56,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-11-10 05:30:56,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:56,870 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:56,870 INFO L424 AbstractCegarLoop]: === Iteration 85 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:56,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:56,870 INFO L82 PathProgramCache]: Analyzing trace with hash -970682931, now seen corresponding path program 1 times [2018-11-10 05:30:56,872 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:56,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:56,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:58,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:30:58,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:30:58,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:30:58,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 05:30:58,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 05:30:58,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 05:30:58,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 05:30:58,373 INFO L87 Difference]: Start difference. First operand 381 states and 415 transitions. Second operand 5 states. [2018-11-10 05:30:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:30:58,439 INFO L93 Difference]: Finished difference Result 657 states and 722 transitions. [2018-11-10 05:30:58,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 05:30:58,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 264 [2018-11-10 05:30:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:30:58,441 INFO L225 Difference]: With dead ends: 657 [2018-11-10 05:30:58,441 INFO L226 Difference]: Without dead ends: 382 [2018-11-10 05:30:58,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 05:30:58,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-11-10 05:30:58,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-11-10 05:30:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-11-10 05:30:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 416 transitions. [2018-11-10 05:30:58,462 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 416 transitions. Word has length 264 [2018-11-10 05:30:58,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:30:58,462 INFO L481 AbstractCegarLoop]: Abstraction has 382 states and 416 transitions. [2018-11-10 05:30:58,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 05:30:58,462 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 416 transitions. [2018-11-10 05:30:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-11-10 05:30:58,463 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:30:58,463 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:30:58,463 INFO L424 AbstractCegarLoop]: === Iteration 86 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:30:58,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:30:58,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1858739376, now seen corresponding path program 1 times [2018-11-10 05:30:58,465 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:30:58,465 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:30:58,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:30:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:30:59,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:30:59,812 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-10 05:30:59,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:31:00,201 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 05:31:00,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:31:00,206 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:31:00,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:01,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:01,342 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-10 05:31:01,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:31:01,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:31:01,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6, 6] total 19 [2018-11-10 05:31:01,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 05:31:01,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 05:31:01,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-11-10 05:31:01,371 INFO L87 Difference]: Start difference. First operand 382 states and 416 transitions. Second operand 19 states. [2018-11-10 05:31:01,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:31:01,868 INFO L93 Difference]: Finished difference Result 699 states and 773 transitions. [2018-11-10 05:31:01,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 05:31:01,868 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 265 [2018-11-10 05:31:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:31:01,870 INFO L225 Difference]: With dead ends: 699 [2018-11-10 05:31:01,870 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 05:31:01,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 798 GetRequests, 776 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:31:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 05:31:01,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2018-11-10 05:31:01,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-11-10 05:31:01,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 415 transitions. [2018-11-10 05:31:01,886 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 415 transitions. Word has length 265 [2018-11-10 05:31:01,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:31:01,886 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 415 transitions. [2018-11-10 05:31:01,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 05:31:01,886 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 415 transitions. [2018-11-10 05:31:01,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 05:31:01,887 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:31:01,887 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:31:01,887 INFO L424 AbstractCegarLoop]: === Iteration 87 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:31:01,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:31:01,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1491809727, now seen corresponding path program 1 times [2018-11-10 05:31:01,889 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:31:01,889 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:31:01,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:02,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-11-10 05:31:02,591 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:31:02,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:31:02,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:31:02,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:31:02,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:31:02,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:31:02,595 INFO L87 Difference]: Start difference. First operand 383 states and 415 transitions. Second operand 14 states. [2018-11-10 05:31:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:31:02,829 INFO L93 Difference]: Finished difference Result 434 states and 478 transitions. [2018-11-10 05:31:02,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:31:02,829 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 303 [2018-11-10 05:31:02,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:31:02,830 INFO L225 Difference]: With dead ends: 434 [2018-11-10 05:31:02,830 INFO L226 Difference]: Without dead ends: 364 [2018-11-10 05:31:02,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:31:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-11-10 05:31:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2018-11-10 05:31:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-11-10 05:31:02,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 388 transitions. [2018-11-10 05:31:02,845 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 388 transitions. Word has length 303 [2018-11-10 05:31:02,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:31:02,845 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 388 transitions. [2018-11-10 05:31:02,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:31:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 388 transitions. [2018-11-10 05:31:02,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-11-10 05:31:02,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:31:02,846 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:31:02,846 INFO L424 AbstractCegarLoop]: === Iteration 88 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:31:02,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:31:02,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1223143171, now seen corresponding path program 1 times [2018-11-10 05:31:02,848 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:31:02,848 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:31:02,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:04,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:04,418 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-10 05:31:04,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:31:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-11-10 05:31:04,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:31:04,862 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:31:04,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:05,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:05,878 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-11-10 05:31:05,878 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:31:05,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:31:05,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 7] total 13 [2018-11-10 05:31:05,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 05:31:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 05:31:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-10 05:31:05,910 INFO L87 Difference]: Start difference. First operand 364 states and 388 transitions. Second operand 13 states. [2018-11-10 05:31:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:31:06,247 INFO L93 Difference]: Finished difference Result 652 states and 707 transitions. [2018-11-10 05:31:06,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 05:31:06,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 309 [2018-11-10 05:31:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:31:06,249 INFO L225 Difference]: With dead ends: 652 [2018-11-10 05:31:06,250 INFO L226 Difference]: Without dead ends: 396 [2018-11-10 05:31:06,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 929 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-10 05:31:06,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-10 05:31:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 351. [2018-11-10 05:31:06,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-11-10 05:31:06,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 372 transitions. [2018-11-10 05:31:06,265 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 372 transitions. Word has length 309 [2018-11-10 05:31:06,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:31:06,265 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 372 transitions. [2018-11-10 05:31:06,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 05:31:06,265 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 372 transitions. [2018-11-10 05:31:06,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-10 05:31:06,266 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:31:06,266 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:31:06,266 INFO L424 AbstractCegarLoop]: === Iteration 89 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:31:06,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:31:06,266 INFO L82 PathProgramCache]: Analyzing trace with hash -858968851, now seen corresponding path program 1 times [2018-11-10 05:31:06,268 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:31:06,268 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:31:06,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:06,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:06,873 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:31:06,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:31:06,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:31:06,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:31:06,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:31:06,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:31:06,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:31:06,877 INFO L87 Difference]: Start difference. First operand 351 states and 372 transitions. Second operand 14 states. [2018-11-10 05:31:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:31:07,117 INFO L93 Difference]: Finished difference Result 528 states and 569 transitions. [2018-11-10 05:31:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 05:31:07,117 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-11-10 05:31:07,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:31:07,118 INFO L225 Difference]: With dead ends: 528 [2018-11-10 05:31:07,118 INFO L226 Difference]: Without dead ends: 350 [2018-11-10 05:31:07,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2018-11-10 05:31:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-11-10 05:31:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-11-10 05:31:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-11-10 05:31:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 370 transitions. [2018-11-10 05:31:07,134 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 370 transitions. Word has length 311 [2018-11-10 05:31:07,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:31:07,134 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 370 transitions. [2018-11-10 05:31:07,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:31:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 370 transitions. [2018-11-10 05:31:07,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-11-10 05:31:07,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:31:07,135 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:31:07,135 INFO L424 AbstractCegarLoop]: === Iteration 90 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:31:07,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:31:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1857760148, now seen corresponding path program 1 times [2018-11-10 05:31:07,137 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:31:07,137 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/cvc4nyu Starting monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:31:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:31:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:31:07,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:31:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 05:31:07,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:31:07,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:31:07,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-10 05:31:07,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 05:31:07,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 05:31:07,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-10 05:31:07,744 INFO L87 Difference]: Start difference. First operand 350 states and 370 transitions. Second operand 14 states. [2018-11-10 05:31:07,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:31:07,840 INFO L93 Difference]: Finished difference Result 357 states and 378 transitions. [2018-11-10 05:31:07,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 05:31:07,840 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 311 [2018-11-10 05:31:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:31:07,840 INFO L225 Difference]: With dead ends: 357 [2018-11-10 05:31:07,840 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 05:31:07,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-11-10 05:31:07,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 05:31:07,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 05:31:07,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 05:31:07,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 05:31:07,842 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 311 [2018-11-10 05:31:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:31:07,842 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 05:31:07,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 05:31:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 05:31:07,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 05:31:07,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 05:31:09,130 WARN L179 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-10 05:31:12,926 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-10 05:31:14,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:15,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,316 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-10 05:31:16,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:16,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,400 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:18,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:19,607 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-10 05:31:20,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:21,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:21,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:21,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:21,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:21,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 05:31:22,910 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2018-11-10 05:31:25,693 WARN L179 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2018-11-10 05:31:26,359 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 45 [2018-11-10 05:31:26,936 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2018-11-10 05:31:27,659 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-11-10 05:31:27,767 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-11-10 05:31:28,068 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:28,514 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-11-10 05:31:28,691 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-11-10 05:31:29,221 WARN L179 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-10 05:31:29,405 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:29,839 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-10 05:31:30,214 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-11-10 05:31:31,143 WARN L179 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 47 [2018-11-10 05:31:31,517 WARN L179 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2018-11-10 05:31:32,133 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2018-11-10 05:31:32,429 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2018-11-10 05:31:32,650 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-11-10 05:31:32,934 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 38 [2018-11-10 05:31:33,158 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-11-10 05:31:33,371 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-11-10 05:31:33,613 WARN L179 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 30 [2018-11-10 05:31:33,816 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-11-10 05:31:34,365 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-11-10 05:31:34,631 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:34,888 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-10 05:31:35,086 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-11-10 05:31:36,647 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-10 05:31:36,845 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2018-11-10 05:31:36,957 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:37,069 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:38,166 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2018-11-10 05:31:39,109 WARN L179 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 108 [2018-11-10 05:31:39,712 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-11-10 05:31:40,275 WARN L179 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 71 [2018-11-10 05:31:40,927 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2018-11-10 05:31:41,100 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 37 [2018-11-10 05:31:42,494 WARN L179 SmtUtils]: Spent 929.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2018-11-10 05:31:43,465 WARN L179 SmtUtils]: Spent 928.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2018-11-10 05:31:44,127 WARN L179 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 47 [2018-11-10 05:31:44,272 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 1 [2018-11-10 05:31:45,103 WARN L179 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2018-11-10 05:31:45,424 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-11-10 05:31:45,654 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-11-10 05:31:45,969 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-11-10 05:31:46,344 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2018-11-10 05:31:46,573 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2018-11-10 05:31:46,680 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2018-11-10 05:31:49,274 WARN L179 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 43 DAG size of output: 1 [2018-11-10 05:31:49,471 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 39 [2018-11-10 05:31:49,884 WARN L179 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-10 05:31:50,308 WARN L179 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 75 [2018-11-10 05:31:51,030 WARN L179 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 110 [2018-11-10 05:31:51,319 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 40 [2018-11-10 05:31:51,629 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-11-10 05:31:52,267 WARN L179 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-11-10 05:31:53,659 WARN L179 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 48 [2018-11-10 05:31:54,156 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2018-11-10 05:31:54,339 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:55,232 WARN L179 SmtUtils]: Spent 829.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 114 [2018-11-10 05:31:56,554 WARN L179 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 72 [2018-11-10 05:31:57,055 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-11-10 05:31:57,522 WARN L179 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2018-11-10 05:31:58,177 WARN L179 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 57 [2018-11-10 05:31:58,308 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-11-10 05:31:58,780 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2018-11-10 05:31:59,386 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-10 05:31:59,705 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-11-10 05:31:59,962 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-11-10 05:32:00,193 WARN L179 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2018-11-10 05:32:00,970 WARN L179 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 49 [2018-11-10 05:32:01,213 INFO L425 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 21513 21528) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L428 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 21513 21528) the Hoare annotation is: true [2018-11-10 05:32:01,214 INFO L428 ceAbstractionStarter]: At program point L21521(line 21521) the Hoare annotation is: true [2018-11-10 05:32:01,214 INFO L425 ceAbstractionStarter]: For program point L21521-1(line 21521) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L425 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 21513 21528) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L421 ceAbstractionStarter]: At program point L20825(line 20825) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,214 INFO L421 ceAbstractionStarter]: At program point L20788(lines 20787 20831) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,214 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 20605 20871) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L425 ceAbstractionStarter]: For program point L20784(lines 20784 20832) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L425 ceAbstractionStarter]: For program point L20846(lines 20846 20853) no Hoare annotation was computed. [2018-11-10 05:32:01,214 INFO L421 ceAbstractionStarter]: At program point L20846-2(lines 20846 20853) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20801-1(line 20801) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L421 ceAbstractionStarter]: At program point L20801(line 20801) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20735(lines 20735 20753) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20764(lines 20764 20835) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20735-2(lines 20735 20753) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20731-1(line 20731) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L421 ceAbstractionStarter]: At program point L20731(line 20731) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20707(lines 20707 20711) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L421 ceAbstractionStarter]: At program point L20785(lines 20781 20833) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20781(lines 20781 20833) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point $Ultimate##23(lines 20792 20829) no Hoare annotation was computed. [2018-11-10 05:32:01,215 INFO L425 ceAbstractionStarter]: For program point L20843-1(line 20843) no Hoare annotation was computed. [2018-11-10 05:32:01,216 INFO L425 ceAbstractionStarter]: For program point $Ultimate##22(lines 20792 20829) no Hoare annotation was computed. [2018-11-10 05:32:01,216 INFO L421 ceAbstractionStarter]: At program point L20843(line 20843) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,216 INFO L425 ceAbstractionStarter]: For program point L20691-1(lines 20691 20863) no Hoare annotation was computed. [2018-11-10 05:32:01,216 INFO L421 ceAbstractionStarter]: At program point L20864(lines 20690 20865) the Hoare annotation is: (let ((.cse1 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse2 (not (= (_ bv1 32) |old(~s~0)|))) (.cse3 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse9 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse0 (or .cse1 .cse2 .cse3 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse9)) (.cse5 (= FloppyProcessQueuedRequests_~__cil_tmp17~27 (_ bv0 32))) (.cse6 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse7 (= (_ bv0 32) ~pended~0)) (.cse8 (= |old(~s~0)| ~s~0))) (and (or .cse0 (not (= |old(~myStatus~0)| (_ bv0 32))) (= ~myStatus~0 (_ bv0 32))) (or .cse1 .cse2 .cse3 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse4 (and .cse5 .cse6 .cse7 .cse8 (= (_ bv0 32) ~compRegistered~0)) .cse9) (or .cse0 (and .cse5 .cse6 .cse7 (= (_ bv1 32) ~compRegistered~0) .cse8))))) [2018-11-10 05:32:01,216 INFO L421 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 20605 20871) the Hoare annotation is: (let ((.cse1 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse2 (not (= (_ bv1 32) |old(~s~0)|))) (.cse3 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse8 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse0 (or .cse1 .cse2 .cse3 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse8)) (.cse5 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv0 32) ~pended~0)) (.cse7 (= |old(~s~0)| ~s~0))) (and (or .cse0 (= ~myStatus~0 (_ bv0 32)) (not (= |old(~myStatus~0)| (_ bv0 32)))) (or .cse1 .cse2 .cse3 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse4 (and .cse5 .cse6 .cse7 (= (_ bv0 32) ~compRegistered~0)) .cse8) (or .cse0 (and .cse5 .cse6 (= (_ bv1 32) ~compRegistered~0) .cse7))))) [2018-11-10 05:32:01,216 INFO L421 ceAbstractionStarter]: At program point L20691-3(lines 20691 20863) the Hoare annotation is: (let ((.cse1 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse2 (not (= (_ bv1 32) |old(~s~0)|))) (.cse3 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse8 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse0 (or .cse1 .cse2 .cse3 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse8)) (.cse5 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv0 32) ~pended~0)) (.cse7 (= |old(~s~0)| ~s~0))) (and (or (= ~myStatus~0 (_ bv0 32)) .cse0 (not (= |old(~myStatus~0)| (_ bv0 32)))) (or .cse1 .cse2 .cse3 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse4 (and .cse5 .cse6 .cse7 (= (_ bv0 32) ~compRegistered~0)) .cse8) (or .cse0 (and .cse5 .cse6 (= (_ bv1 32) ~compRegistered~0) .cse7))))) [2018-11-10 05:32:01,216 INFO L425 ceAbstractionStarter]: For program point L20811-1(line 20811) no Hoare annotation was computed. [2018-11-10 05:32:01,216 INFO L421 ceAbstractionStarter]: At program point L20811(line 20811) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,216 INFO L425 ceAbstractionStarter]: For program point L20758(lines 20758 20840) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L421 ceAbstractionStarter]: At program point L20791(lines 20790 20830) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L20692(line 20692) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L421 ceAbstractionStarter]: At program point L20758-1(lines 20691 20863) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L20787(lines 20787 20831) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L421 ceAbstractionStarter]: At program point L20700(line 20700) the Hoare annotation is: (let ((.cse1 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse2 (not (= (_ bv1 32) |old(~s~0)|))) (.cse3 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse8 (not (= (_ bv0 32) |old(~pended~0)|)))) (let ((.cse0 (or .cse1 .cse2 .cse3 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse8)) (.cse5 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv0 32) ~pended~0)) (.cse7 (= |old(~s~0)| ~s~0))) (and (or (= ~myStatus~0 (_ bv0 32)) .cse0 (not (= |old(~myStatus~0)| (_ bv0 32)))) (or .cse1 .cse2 .cse3 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse4 (and .cse5 .cse6 .cse7 (= (_ bv0 32) ~compRegistered~0)) .cse8) (or .cse0 (and .cse5 .cse6 (= (_ bv1 32) ~compRegistered~0) .cse7))))) [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L20700-1(line 20700) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L20841(lines 20841 20859) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L421 ceAbstractionStarter]: At program point L20775(line 20775) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsFINAL(lines 20605 20871) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L20849-1(line 20849) no Hoare annotation was computed. [2018-11-10 05:32:01,217 INFO L421 ceAbstractionStarter]: At program point L20849(line 20849) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= |old(~compRegistered~0)| (_ bv0 32))) .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~compRegistered~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4))) [2018-11-10 05:32:01,217 INFO L425 ceAbstractionStarter]: For program point L7616-2(lines 7616 7628) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7616(lines 7616 7628) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7864(line 7864) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L421 ceAbstractionStarter]: At program point L7154loopEntry(lines 7154 7157) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7220(lines 7220 7930) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7633-1(line 7633) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7154-1(lines 7154 7157) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L421 ceAbstractionStarter]: At program point L7633(line 7633) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 .cse1 .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3)))) [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7336(lines 7336 7433) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L421 ceAbstractionStarter]: At program point L7881(lines 7240 7921) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7204-1(line 7204) no Hoare annotation was computed. [2018-11-10 05:32:01,218 INFO L421 ceAbstractionStarter]: At program point L7204(line 7204) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,218 INFO L425 ceAbstractionStarter]: For program point L7716(lines 7716 7719) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7749-1(lines 7745 7751) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7749(line 7749) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7254(lines 7254 7270) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7552(line 7552) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7453-1(lines 7453 7456) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7453loopEntry(lines 7453 7456) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7734(line 7734) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7734-1(line 7734) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7239(lines 7238 7924) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7173(line 7173) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7223(lines 7223 7929) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L425 ceAbstractionStarter]: For program point L7256-1(lines 7256 7259) no Hoare annotation was computed. [2018-11-10 05:32:01,219 INFO L421 ceAbstractionStarter]: At program point L7256loopEntry(lines 7256 7259) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7851(line 7851) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7653(line 7653) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 .cse1 .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3)))) [2018-11-10 05:32:01,220 INFO L425 ceAbstractionStarter]: For program point L7934(line 7934) no Hoare annotation was computed. [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7802(line 7802) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7158(lines 7153 7159) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7224(lines 7220 7930) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L425 ceAbstractionStarter]: For program point L7802-1(line 7802) no Hoare annotation was computed. [2018-11-10 05:32:01,220 INFO L425 ceAbstractionStarter]: For program point L7472(lines 7472 7478) no Hoare annotation was computed. [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7786(line 7786) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L421 ceAbstractionStarter]: At program point L7720(lines 7715 7721) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,220 INFO L425 ceAbstractionStarter]: For program point L7786-1(line 7786) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7555-1(lines 7550 7563) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7555(lines 7555 7562) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7836-1(lines 7836 7855) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7357-1(lines 7357 7368) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7836(lines 7836 7855) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7357(lines 7357 7368) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7192(lines 7192 7209) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7919-1(line 7919) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L421 ceAbstractionStarter]: At program point L7919(line 7919) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,221 INFO L421 ceAbstractionStarter]: At program point L7622(lines 7622 7623) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd FloppyPnp_~ntStatus~3 (_ bv4294967037 32)) (_ bv0 32)) (= ~myStatus~0 (_ bv0 32)) (= (_ bv6 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) ~compRegistered~0))) [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7622-1(lines 7622 7623) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L421 ceAbstractionStarter]: At program point L7457(lines 7443 7459) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 6728 7950) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7226(lines 7226 7928) no Hoare annotation was computed. [2018-11-10 05:32:01,221 INFO L425 ceAbstractionStarter]: For program point L7325-1(line 7325) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7325(line 7325) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,222 INFO L425 ceAbstractionStarter]: For program point L7887-1(lines 7883 7889) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7887(line 7887) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,222 INFO L425 ceAbstractionStarter]: For program point L7243(line 7243) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7557(line 7557) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7937-2(lines 7937 7944) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~s~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse5 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse6 (= (_ bv1 32) ~compRegistered~0)) (.cse3 (= (_ bv4 32) ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0))) (or (and .cse0 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse1) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (or (and .cse2 .cse3 .cse1) (and .cse2 .cse3 .cse4 .cse5 .cse6))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse0 .cse4 .cse6) (and .cse2 (not (bvsge FloppyPnp_~ntStatus~3 (_ bv0 32))) .cse0 .cse4 .cse6) (and (= (_ bv6 32) ~s~0) .cse2 .cse4 .cse5 .cse6) (and .cse3 (= (_ bv1 32) ~pended~0) .cse1))) [2018-11-10 05:32:01,222 INFO L425 ceAbstractionStarter]: For program point L7937(lines 7937 7944) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L425 ceAbstractionStarter]: For program point L7161(line 7161) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L425 ceAbstractionStarter]: For program point L7508-1(line 7508) no Hoare annotation was computed. [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7508(line 7508) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,222 INFO L421 ceAbstractionStarter]: At program point L7541-1(line 7541) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7541(line 7541) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,223 INFO L425 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 6728 7950) no Hoare annotation was computed. [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7822(line 7822) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,223 INFO L425 ceAbstractionStarter]: For program point L7277(lines 7277 7319) no Hoare annotation was computed. [2018-11-10 05:32:01,223 INFO L425 ceAbstractionStarter]: For program point L7822-1(line 7822) no Hoare annotation was computed. [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7806(line 7806) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,223 INFO L425 ceAbstractionStarter]: For program point L7806-1(line 7806) no Hoare annotation was computed. [2018-11-10 05:32:01,223 INFO L425 ceAbstractionStarter]: For program point L7542(line 7542) no Hoare annotation was computed. [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7641-1(line 7641) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 .cse1 .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3)))) [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7641(line 7641) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 .cse1 .cse2 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3)))) [2018-11-10 05:32:01,223 INFO L421 ceAbstractionStarter]: At program point L7922(lines 7240 7923) the Hoare annotation is: (let ((.cse0 (= (_ bv2 32) ~s~0)) (.cse5 (= (_ bv4 32) ~s~0)) (.cse1 (= (_ bv0 32) ~compRegistered~0)) (.cse2 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (_ bv0 32) ~pended~0)) (.cse4 (= (_ bv1 32) ~compRegistered~0))) (or (and .cse0 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse1) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse2 .cse3 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse0 .cse4) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) .cse2 .cse3 .cse5 .cse1) (and .cse2 (not (bvsge FloppyPnp_~ntStatus~3 (_ bv0 32))) .cse3 .cse0 .cse4) (and .cse5 (= (_ bv1 32) ~pended~0) .cse1) (and (= (_ bv6 32) ~s~0) .cse2 .cse3 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4))) [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7443(lines 7443 7459) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7476-1(lines 7472 7478) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L421 ceAbstractionStarter]: At program point L7476(line 7476) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7278(lines 7278 7284) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7642(line 7642) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7675(lines 7675 7681) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7229(lines 7229 7927) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point $Ultimate##26(lines 7240 7923) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point $Ultimate##25(lines 7240 7923) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7940-1(line 7940) no Hoare annotation was computed. [2018-11-10 05:32:01,224 INFO L421 ceAbstractionStarter]: At program point L7940(line 7940) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse5 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (= (_ bv1 32) ~compRegistered~0)) (.cse1 (= (_ bv2 32) ~s~0)) (.cse4 (= (_ bv4 32) ~s~0)) (.cse2 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse6 (= (_ bv0 32) ~compRegistered~0))) (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 (= (_ bv0 32) FloppyPnp_~ntStatus~3) .cse1 .cse2 .cse3) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (or (and .cse0 .cse4 .cse2 .cse5 .cse3) (and .cse0 .cse4 .cse2 .cse6))) (and .cse0 (not (bvsge FloppyPnp_~ntStatus~3 (_ bv0 32))) .cse1 .cse2 .cse3) (and (= (_ bv6 32) ~s~0) .cse0 .cse2 .cse5 .cse3) (and .cse1 .cse2 (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) .cse6) (and .cse4 (= (_ bv1 32) ~pended~0) .cse2 .cse6))) [2018-11-10 05:32:01,224 INFO L421 ceAbstractionStarter]: At program point L7230(lines 7226 7928) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,224 INFO L425 ceAbstractionStarter]: For program point L7841-1(line 7841) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L421 ceAbstractionStarter]: At program point L7841(line 7841) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,225 INFO L421 ceAbstractionStarter]: At program point L7164-1(lines 7164 7171) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7164(lines 7164 7171) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L421 ceAbstractionStarter]: At program point L7346(lines 7346 7347) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (_ bv1 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7445-1(lines 7445 7448) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L421 ceAbstractionStarter]: At program point L7445loopEntry(lines 7445 7448) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,225 INFO L421 ceAbstractionStarter]: At program point L7726(line 7726) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7346-1(lines 7346 7347) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7660(lines 7660 7663) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7726-1(line 7726) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7743-1(lines 7240 7921) no Hoare annotation was computed. [2018-11-10 05:32:01,225 INFO L425 ceAbstractionStarter]: For program point L7264-1(lines 7264 7267) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7743(line 7743) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7264loopEntry(lines 7264 7267) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7314(line 7314) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7380(lines 7380 7386) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7314-1(line 7314) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7364(line 7364) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (_ bv1 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7711-1(line 7711) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7711(line 7711) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7232(lines 7232 7926) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7282(line 7282) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7282-1(lines 7278 7284) no Hoare annotation was computed. [2018-11-10 05:32:01,226 INFO L421 ceAbstractionStarter]: At program point L7431(line 7431) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (_ bv3221225473 32) FloppyPnp_~ntStatus~3) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,226 INFO L425 ceAbstractionStarter]: For program point L7877(lines 7877 7880) no Hoare annotation was computed. [2018-11-10 05:32:01,227 INFO L425 ceAbstractionStarter]: For program point L7679-1(lines 7675 7681) no Hoare annotation was computed. [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7167(line 7167) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7679(line 7679) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7233(lines 7232 7926) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,227 INFO L425 ceAbstractionStarter]: For program point L7828-1(line 7828) no Hoare annotation was computed. [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7828(line 7828) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,227 INFO L425 ceAbstractionStarter]: For program point L7217(lines 7217 7931) no Hoare annotation was computed. [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7333-1(line 7333) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7812(line 7812) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,227 INFO L425 ceAbstractionStarter]: For program point L7845-1(line 7845) no Hoare annotation was computed. [2018-11-10 05:32:01,227 INFO L421 ceAbstractionStarter]: At program point L7333(line 7333) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7845(line 7845) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7614(line 7614) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= (_ bv1 32) ~compRegistered~0) (= |old(~s~0)| ~s~0))) [2018-11-10 05:32:01,228 INFO L425 ceAbstractionStarter]: For program point L7548-1(lines 7510 7655) no Hoare annotation was computed. [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7548(line 7548) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~myStatus~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L425 ceAbstractionStarter]: For program point L7614-1(line 7614) no Hoare annotation was computed. [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7862(line 7862) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L425 ceAbstractionStarter]: For program point L7416-1(line 7416) no Hoare annotation was computed. [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7416(line 7416) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~pended~0) (= (_ bv3 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7218(lines 7217 7931) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7862-1(line 7862) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,228 INFO L421 ceAbstractionStarter]: At program point L7664(lines 7659 7665) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7466(lines 7466 7655) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7334(line 7334) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7235(lines 7235 7925) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L421 ceAbstractionStarter]: At program point L7268(lines 7254 7270) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv0 32) FloppyPnp_~ntStatus~3) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7384-1(lines 7380 7386) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L421 ceAbstractionStarter]: At program point L7863(line 7863) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv4 32) ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,229 INFO L421 ceAbstractionStarter]: At program point L7384(line 7384) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7797-1(lines 7797 7816) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7797(lines 7797 7816) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L425 ceAbstractionStarter]: For program point L7946(line 7946) no Hoare annotation was computed. [2018-11-10 05:32:01,229 INFO L421 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 6728 7950) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,229 INFO L421 ceAbstractionStarter]: At program point L7236(lines 7235 7925) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,235 INFO L421 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: (let ((.cse0 (not (= (_ bv1 32) |old(~s~0)|)))) (and (or (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse0 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) (or .cse0 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) (= (_ bv1 32) ~s~0)))) [2018-11-10 05:32:01,235 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,235 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,235 INFO L421 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: (let ((.cse0 (not (= (_ bv1 32) |old(~s~0)|)))) (and (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse0 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (or .cse0 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|))))) [2018-11-10 05:32:01,236 INFO L425 ceAbstractionStarter]: For program point L-1-2(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,236 INFO L425 ceAbstractionStarter]: For program point L-1-4(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,236 INFO L421 ceAbstractionStarter]: At program point L-1-5(line -1) the Hoare annotation is: (let ((.cse0 (not (= (_ bv1 32) |old(~s~0)|)))) (and (or (and (= (_ bv0 32) ~pended~0) (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse0 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) (or .cse0 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|))))) [2018-11-10 05:32:01,236 INFO L425 ceAbstractionStarter]: For program point L-1-6(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,236 INFO L425 ceAbstractionStarter]: For program point L-1-8(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,236 INFO L421 ceAbstractionStarter]: At program point L-1-9(line -1) the Hoare annotation is: (let ((.cse0 (not (= (_ bv1 32) |old(~s~0)|)))) (and (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse0 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (or .cse0 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|))))) [2018-11-10 05:32:01,236 INFO L425 ceAbstractionStarter]: For program point L-1-10(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,239 INFO L425 ceAbstractionStarter]: For program point L-1-12(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,240 INFO L421 ceAbstractionStarter]: At program point L-1-13(line -1) the Hoare annotation is: (let ((.cse0 (not (= (_ bv1 32) |old(~s~0)|)))) (and (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse0 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (or .cse0 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|))))) [2018-11-10 05:32:01,240 INFO L425 ceAbstractionStarter]: For program point L-1-14(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,240 INFO L421 ceAbstractionStarter]: At program point L-1-16(line -1) the Hoare annotation is: (let ((.cse2 (not (= (_ bv1 32) |old(~s~0)|)))) (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) .cse2 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))))) (and (or (and .cse0 (= |#funAddr~FloppyPnp.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse1) (or .cse2 (not (= |#funAddr~FloppyCreateClose.offset| |##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0_#in~#fp.offset|)) .cse0) (or .cse1 (and (= (_ bv0 32) ~pended~0) (= (_ bv0 32) ~compRegistered~0)))))) [2018-11-10 05:32:01,240 INFO L425 ceAbstractionStarter]: For program point L-1-17(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,240 INFO L425 ceAbstractionStarter]: For program point L-1-18(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,240 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,240 INFO L421 ceAbstractionStarter]: At program point L21077(lines 21070 21142) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= (_ bv2 32) ~s~0)) (.cse2 (= (_ bv0 32) ~compRegistered~0)) (.cse8 (not (= (_ bv1 32) main_~__BLAST_NONDET~0)))) (let ((.cse6 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (= main_~status~4 ~lowerDriverReturn~0)) (.cse12 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (and (and .cse0 .cse1 .cse2) .cse8)) (.cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~compRegistered~0)) (.cse9 (= (_ bv4 32) ~s~0)) (.cse11 (= (_ bv1 32) ~pended~0)) (.cse5 (not (= (_ bv2 32) main_~__BLAST_NONDET~0)))) (or (not (= (_ bv0 32) |old(~s~0)|)) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741738 32)) (_ bv0 32)) .cse2) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse3) (and (= (_ bv6 32) ~s~0) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse3) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse9 .cse10 .cse4 .cse6 .cse5 .cse7 .cse8) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (and .cse11 (or (and .cse12 .cse1 .cse2 .cse8) (and .cse1 .cse4 .cse2 .cse8))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse3) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and .cse9 .cse0 .cse10 .cse2) (= (_ bv0 32) ~s~0) (and (= (_ bv3221225473 32) main_~status~4) .cse1 .cse2 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and (or (and .cse3 .cse4) (and .cse12 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse7 .cse8)) (not (bvsge main_~status~4 (_ bv0 32)))) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (and .cse9 .cse11 .cse5 .cse2 .cse8) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and .cse1 (= main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,250 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 20933 21146) no Hoare annotation was computed. [2018-11-10 05:32:01,250 INFO L421 ceAbstractionStarter]: At program point L21085(lines 21078 21141) the Hoare annotation is: (let ((.cse1 (= (_ bv2 32) ~s~0)) (.cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse6 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse7 (= (_ bv1 32) ~compRegistered~0)) (.cse0 (= (_ bv0 32) ~pended~0)) (.cse13 (= (_ bv4 32) ~s~0)) (.cse14 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))) (.cse5 (not (= (_ bv2 32) main_~__BLAST_NONDET~0))) (.cse2 (= (_ bv0 32) ~compRegistered~0)) (.cse8 (not (= (_ bv1 32) main_~__BLAST_NONDET~0)))) (let ((.cse11 (= (_ bv1 32) ~pended~0)) (.cse10 (or (and .cse0 .cse13 .cse14 .cse4 .cse6 .cse5 .cse7 .cse8) (and .cse13 .cse0 .cse14 .cse2 .cse8) (and .cse13 .cse14 .cse5 .cse2 .cse8))) (.cse9 (= main_~status~4 ~lowerDriverReturn~0)) (.cse3 (and (and .cse0 .cse1 .cse2) .cse8)) (.cse12 (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse14 .cse2 .cse8) (and .cse1 .cse14 .cse4 .cse2 .cse8) (and .cse0 .cse1 .cse14 .cse4 .cse5 .cse7 .cse8)))) (or (not (= (_ bv0 32) |old(~s~0)|)) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741738 32)) (_ bv0 32)) .cse2) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse3) (and (= (_ bv6 32) ~s~0) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse3) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (and .cse9 .cse10) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (and .cse11 .cse12) (and .cse11 .cse10) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse3) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and .cse13 .cse0 .cse9 .cse2) (= (_ bv0 32) ~s~0) (and (= (_ bv3221225473 32) main_~status~4) .cse1 .cse2 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (and .cse12 (not (bvsge main_~status~4 (_ bv0 32)))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and .cse1 (= main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,260 INFO L425 ceAbstractionStarter]: For program point L21094(lines 21094 21098) no Hoare annotation was computed. [2018-11-10 05:32:01,261 INFO L425 ceAbstractionStarter]: For program point L21003(lines 21003 21057) no Hoare annotation was computed. [2018-11-10 05:32:01,261 INFO L425 ceAbstractionStarter]: For program point L21111(lines 21111 21130) no Hoare annotation was computed. [2018-11-10 05:32:01,261 INFO L425 ceAbstractionStarter]: For program point L21012(lines 21012 21054) no Hoare annotation was computed. [2018-11-10 05:32:01,261 INFO L425 ceAbstractionStarter]: For program point L21045-1(line 21045) no Hoare annotation was computed. [2018-11-10 05:32:01,261 INFO L421 ceAbstractionStarter]: At program point L21045(line 21045) the Hoare annotation is: (or (and (= |#funAddr~FloppyPower.offset| main_~__cil_tmp19~30.offset) (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv2 32) main_~__BLAST_NONDET~0)) (not (= (_ bv3 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,261 INFO L421 ceAbstractionStarter]: At program point L21062(line 21062) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= (_ bv2 32) ~s~0)) (.cse2 (= (_ bv0 32) ~compRegistered~0)) (.cse8 (not (= (_ bv1 32) main_~__BLAST_NONDET~0)))) (let ((.cse5 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (= main_~status~4 ~lowerDriverReturn~0)) (.cse12 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (and (and .cse0 .cse1 .cse2) .cse8)) (.cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~compRegistered~0)) (.cse9 (= (_ bv4 32) ~s~0)) (.cse11 (= (_ bv1 32) ~pended~0)) (.cse6 (not (= (_ bv2 32) main_~__BLAST_NONDET~0)))) (or (not (= (_ bv0 32) |old(~s~0)|)) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741738 32)) (_ bv0 32)) .cse2) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse3) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (and (= (_ bv6 32) ~s~0) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse9 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (and .cse11 (or (and .cse12 .cse1 .cse2 .cse8) (and .cse1 .cse4 .cse2 .cse8))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse3) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and .cse9 .cse0 .cse10 .cse2) (and (= (_ bv3221225473 32) main_~status~4) .cse1 .cse2 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and (or (and .cse3 .cse4) (and .cse12 .cse3) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8)) (not (bvsge main_~status~4 (_ bv0 32)))) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (and .cse9 .cse11 .cse6 .cse2 .cse8) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and .cse1 (= main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,268 INFO L421 ceAbstractionStarter]: At program point L21103(lines 21092 21132) the Hoare annotation is: (let ((.cse4 (= (_ bv2 32) ~s~0)) (.cse3 (= (_ bv0 32) ~pended~0)) (.cse8 (= main_~status~4 ~lowerDriverReturn~0)) (.cse5 (= (_ bv0 32) ~compRegistered~0))) (let ((.cse12 (or (and .cse3 .cse4 .cse5) (and .cse3 .cse8 .cse5))) (.cse13 (not (= (_ bv1 32) main_~__BLAST_NONDET~0)))) (let ((.cse11 (= (_ bv4 32) ~s~0)) (.cse15 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse16 (not (= (_ bv2 32) main_~__BLAST_NONDET~0))) (.cse17 (= (_ bv1 32) ~compRegistered~0)) (.cse0 (not (= (_ bv6 32) ~s~0))) (.cse1 (and .cse12 .cse13)) (.cse14 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32)))) (let ((.cse7 (let ((.cse18 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and .cse18 .cse4 .cse14 .cse5 .cse13) (and .cse4 .cse14 .cse15 .cse5 .cse13) (and .cse0 .cse1 .cse14 .cse15) (and .cse3 .cse4 .cse14 .cse15 .cse16 .cse17 .cse13) (and .cse0 .cse18 .cse1 .cse14)))) (.cse6 (= (_ bv1 32) ~pended~0)) (.cse9 (or (and .cse3 .cse11 .cse14 .cse15 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) .cse16 .cse17 .cse13) (and .cse11 .cse3 .cse14 .cse5 .cse13) (and .cse11 .cse14 .cse16 .cse5 .cse13))) (.cse2 (= (_ bv3221225473 32) main_~status~4)) (.cse10 (= main_~status~4 (_ bv0 32)))) (or (not (= (_ bv0 32) |old(~s~0)|)) (and .cse0 .cse1 .cse2) (and .cse3 .cse4 (= (bvadd main_~status~4 (_ bv1073741738 32)) (_ bv0 32)) .cse5) (and .cse1 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and .cse6 .cse7) (and .cse1 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (and .cse8 .cse9) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (and (not (bvsge main_~status~4 (_ bv0 32))) .cse7) (and .cse1 (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32))) (and .cse6 .cse9) (and .cse0 .cse1 .cse10) (and .cse11 .cse12) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32))) (and .cse2 .cse4 .cse5 .cse13) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse0 .cse1) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32))) (not (= |old(~myStatus~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and .cse4 .cse10) (not (= (_ bv0 32) |old(~pended~0)|))))))) [2018-11-10 05:32:01,273 INFO L421 ceAbstractionStarter]: At program point L21004(lines 21003 21057) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,273 INFO L425 ceAbstractionStarter]: For program point L21079(lines 21079 21083) no Hoare annotation was computed. [2018-11-10 05:32:01,273 INFO L425 ceAbstractionStarter]: For program point L21112(lines 21112 21118) no Hoare annotation was computed. [2018-11-10 05:32:01,274 INFO L425 ceAbstractionStarter]: For program point L20980(lines 20980 20988) no Hoare annotation was computed. [2018-11-10 05:32:01,274 INFO L421 ceAbstractionStarter]: At program point L21013(lines 21012 21054) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv2 32) main_~__BLAST_NONDET~0)) (not (= (_ bv3 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,274 INFO L421 ceAbstractionStarter]: At program point L20980-2(lines 20980 20988) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,285 INFO L425 ceAbstractionStarter]: For program point L21021-1(line 21021) no Hoare annotation was computed. [2018-11-10 05:32:01,285 INFO L421 ceAbstractionStarter]: At program point L21021(line 21021) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and (= (_ bv1 32) ~s~0) (= main_~__cil_tmp15~27.offset |#funAddr~FloppyCreateClose.offset|)) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,285 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 21017 21052) no Hoare annotation was computed. [2018-11-10 05:32:01,285 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 20933 21146) no Hoare annotation was computed. [2018-11-10 05:32:01,285 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 21017 21052) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21071(lines 21071 21075) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 20933 21146) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (and (= ~myStatus~0 (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv0 32) ~s~0) (= (_ bv0 32) ~compRegistered~0)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21088(lines 21088 21139) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21088-1(lines 21070 21142) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L20965-1(line 20965) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L421 ceAbstractionStarter]: At program point L20965(line 20965) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (and (= ~myStatus~0 (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= main_~status~4 (_ bv0 32)) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv0 32) ~s~0) (= (_ bv0 32) ~compRegistered~0)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21122(lines 21122 21128) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21105(lines 21105 21109) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21006(lines 21006 21056) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L425 ceAbstractionStarter]: For program point L21039-1(line 21039) no Hoare annotation was computed. [2018-11-10 05:32:01,286 INFO L421 ceAbstractionStarter]: At program point L21039(line 21039) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= |#funAddr~FloppyPnp.offset| main_~__cil_tmp18~28.offset) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv2 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,293 INFO L425 ceAbstractionStarter]: For program point L20990(line 20990) no Hoare annotation was computed. [2018-11-10 05:32:01,293 INFO L421 ceAbstractionStarter]: At program point L21114(line 21114) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,293 INFO L421 ceAbstractionStarter]: At program point L21007(lines 21006 21056) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv3 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,293 INFO L428 ceAbstractionStarter]: At program point L21016(lines 21015 21053) the Hoare annotation is: true [2018-11-10 05:32:01,293 INFO L425 ceAbstractionStarter]: For program point L21000(lines 21000 21058) no Hoare annotation was computed. [2018-11-10 05:32:01,293 INFO L425 ceAbstractionStarter]: For program point L21033-1(line 21033) no Hoare annotation was computed. [2018-11-10 05:32:01,293 INFO L421 ceAbstractionStarter]: At program point L21033(line 21033) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= |#funAddr~FloppyDeviceControl.offset| main_~__cil_tmp17~28.offset) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv3 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,294 INFO L425 ceAbstractionStarter]: For program point L20967-1(lines 20960 21145) no Hoare annotation was computed. [2018-11-10 05:32:01,294 INFO L425 ceAbstractionStarter]: For program point L20967(lines 20967 21069) no Hoare annotation was computed. [2018-11-10 05:32:01,294 INFO L425 ceAbstractionStarter]: For program point L21091(lines 21091 21135) no Hoare annotation was computed. [2018-11-10 05:32:01,294 INFO L421 ceAbstractionStarter]: At program point L21124(line 21124) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,294 INFO L421 ceAbstractionStarter]: At program point L21001(lines 21000 21058) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,300 INFO L425 ceAbstractionStarter]: For program point L21092(lines 21092 21132) no Hoare annotation was computed. [2018-11-10 05:32:01,300 INFO L425 ceAbstractionStarter]: For program point L21009(lines 21009 21055) no Hoare annotation was computed. [2018-11-10 05:32:01,300 INFO L421 ceAbstractionStarter]: At program point L21010(lines 21009 21055) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (not (= (_ bv2 32) main_~__BLAST_NONDET~0)) (= (_ bv0 32) ~compRegistered~0) (not (= (_ bv1 32) main_~__BLAST_NONDET~0))) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,300 INFO L421 ceAbstractionStarter]: At program point L21051(lines 20967 21067) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) ~pended~0)) (.cse1 (= (_ bv2 32) ~s~0)) (.cse2 (= (_ bv0 32) ~compRegistered~0)) (.cse8 (not (= (_ bv1 32) main_~__BLAST_NONDET~0)))) (let ((.cse5 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse10 (= main_~status~4 ~lowerDriverReturn~0)) (.cse12 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse3 (and (and .cse0 .cse1 .cse2) .cse8)) (.cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~compRegistered~0)) (.cse9 (= (_ bv4 32) ~s~0)) (.cse11 (= (_ bv1 32) ~pended~0)) (.cse6 (not (= (_ bv2 32) main_~__BLAST_NONDET~0)))) (or (not (= (_ bv0 32) |old(~s~0)|)) (and .cse0 .cse1 (= (bvadd main_~status~4 (_ bv1073741738 32)) (_ bv0 32)) .cse2) (and (= (bvadd main_~status~4 (_ bv1073741789 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv2147483631 32)) (_ bv0 32)) .cse3) (and (= (bvadd main_~status~4 (_ bv1073741275 32)) (_ bv0 32)) .cse3) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (and (= (_ bv6 32) ~s~0) .cse0 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse9 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (and .cse11 (or (and .cse12 .cse1 .cse2 .cse8) (and .cse1 .cse4 .cse2 .cse8))) (and (= (bvadd main_~status~4 (_ bv1073741101 32)) (_ bv0 32)) .cse3) (and .cse3 (= (bvadd main_~status~4 (_ bv1073741536 32)) (_ bv0 32))) (and .cse9 .cse0 .cse10 .cse2) (and (= (_ bv3221225473 32) main_~status~4) .cse1 .cse2 .cse8) (and .cse3 (= (bvadd main_~status~4 (_ bv2147483643 32)) (_ bv0 32))) (and (or (and .cse3 .cse4) (and .cse12 .cse3) (and .cse0 .cse1 .cse4 .cse6 .cse7 .cse8)) (not (bvsge main_~status~4 (_ bv0 32)))) (= (_ bv1 32) ~s~0) (not (= |old(~myStatus~0)| (_ bv0 32))) (and .cse9 .cse11 .cse6 .cse2 .cse8) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and .cse1 (= main_~status~4 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,300 INFO L425 ceAbstractionStarter]: For program point L21093(lines 21093 21101) no Hoare annotation was computed. [2018-11-10 05:32:01,300 INFO L425 ceAbstractionStarter]: For program point L20994(lines 20994 20998) no Hoare annotation was computed. [2018-11-10 05:32:01,300 INFO L425 ceAbstractionStarter]: For program point L21027-1(line 21027) no Hoare annotation was computed. [2018-11-10 05:32:01,301 INFO L421 ceAbstractionStarter]: At program point L21027(line 21027) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= main_~__cil_tmp16~28.offset |#funAddr~FloppyCreateClose.offset|)) (not (= |old(~myStatus~0)| (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,308 INFO L428 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 21215 21226) the Hoare annotation is: true [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 21215 21226) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 21215 21226) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point L21656-1(lines 21648 21661) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L421 ceAbstractionStarter]: At program point L21656(line 21656) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,308 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 21648 21661) the Hoare annotation is: (or (= |old(~s~0)| ~s~0) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0)))) [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 21648 21661) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point RtlInitUnicodeStringFINAL(lines 22231 22238) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L428 ceAbstractionStarter]: At program point RtlInitUnicodeStringENTRY(lines 22231 22238) the Hoare annotation is: true [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point RtlInitUnicodeStringEXIT(lines 22231 22238) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L428 ceAbstractionStarter]: At program point PoStartNextPowerIrpENTRY(lines 22081 22087) the Hoare annotation is: true [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point PoStartNextPowerIrpFINAL(lines 22081 22087) no Hoare annotation was computed. [2018-11-10 05:32:01,308 INFO L425 ceAbstractionStarter]: For program point PoStartNextPowerIrpEXIT(lines 22081 22087) no Hoare annotation was computed. [2018-11-10 05:32:01,309 INFO L428 ceAbstractionStarter]: At program point L22102(lines 22101 22115) the Hoare annotation is: true [2018-11-10 05:32:01,309 INFO L428 ceAbstractionStarter]: At program point L22105(lines 22104 22114) the Hoare annotation is: true [2018-11-10 05:32:01,309 INFO L425 ceAbstractionStarter]: For program point L22101(lines 22101 22115) no Hoare annotation was computed. [2018-11-10 05:32:01,309 INFO L425 ceAbstractionStarter]: For program point L22112(lines 22095 22117) no Hoare annotation was computed. [2018-11-10 05:32:01,309 INFO L425 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 22095 22117) no Hoare annotation was computed. [2018-11-10 05:32:01,309 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 22106 22113) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L428 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 22095 22117) the Hoare annotation is: true [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 22106 22113) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L428 ceAbstractionStarter]: At program point ExFreePoolENTRY(lines 21190 21196) the Hoare annotation is: true [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point ExFreePoolFINAL(lines 21190 21196) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point ExFreePoolEXIT(lines 21190 21196) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point L8351-1(line 8351) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point L8541(lines 8541 8550) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L421 ceAbstractionStarter]: At program point L8351(line 8351) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,316 INFO L421 ceAbstractionStarter]: At program point L8475(lines 8353 8573) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (and .cse0 .cse1 .cse2 (= (_ bv3221225473 32) FloppyStartDevice_~ntStatus~4) .cse3) (and (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32))) .cse0 .cse1 .cse2 .cse3 (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point L8541-2(lines 8541 8550) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 7951 8586) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point L8459(lines 8459 8470) no Hoare annotation was computed. [2018-11-10 05:32:01,316 INFO L425 ceAbstractionStarter]: For program point L8203-1(lines 8203 8206) no Hoare annotation was computed. [2018-11-10 05:32:01,317 INFO L421 ceAbstractionStarter]: At program point L8203loopEntry(lines 8203 8206) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,317 INFO L421 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 7951 8586) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,324 INFO L425 ceAbstractionStarter]: For program point L8327-1(lines 8327 8328) no Hoare annotation was computed. [2018-11-10 05:32:01,324 INFO L421 ceAbstractionStarter]: At program point L8327(lines 8327 8328) the Hoare annotation is: (let ((.cse0 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (_ bv0 32) ~pended~0)) (.cse2 (= (bvadd FloppyStartDevice_~ntStatus~4 (_ bv4294967037 32)) (_ bv0 32))) (.cse3 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (= (_ bv1 32) ~compRegistered~0)) (.cse5 (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)))) (or (and (= (_ bv6 32) ~s~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= (_ bv1 32) ~s~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))))) [2018-11-10 05:32:01,325 INFO L425 ceAbstractionStarter]: For program point L8261-1(lines 8256 8269) no Hoare annotation was computed. [2018-11-10 05:32:01,325 INFO L425 ceAbstractionStarter]: For program point L8261(lines 8261 8268) no Hoare annotation was computed. [2018-11-10 05:32:01,325 INFO L425 ceAbstractionStarter]: For program point L8319-1(line 8319) no Hoare annotation was computed. [2018-11-10 05:32:01,325 INFO L421 ceAbstractionStarter]: At program point L8319(line 8319) the Hoare annotation is: (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,325 INFO L421 ceAbstractionStarter]: At program point L8567(line 8567) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,325 INFO L421 ceAbstractionStarter]: At program point L8567-1(line 8567) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,325 INFO L425 ceAbstractionStarter]: For program point L8369(lines 8369 8400) no Hoare annotation was computed. [2018-11-10 05:32:01,332 INFO L421 ceAbstractionStarter]: At program point L8559(line 8559) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,332 INFO L425 ceAbstractionStarter]: For program point L8559-1(line 8559) no Hoare annotation was computed. [2018-11-10 05:32:01,332 INFO L425 ceAbstractionStarter]: For program point L8353-1(lines 8353 8575) no Hoare annotation was computed. [2018-11-10 05:32:01,332 INFO L425 ceAbstractionStarter]: For program point L8353(lines 8353 8575) no Hoare annotation was computed. [2018-11-10 05:32:01,332 INFO L425 ceAbstractionStarter]: For program point L8411(lines 8411 8428) no Hoare annotation was computed. [2018-11-10 05:32:01,332 INFO L421 ceAbstractionStarter]: At program point L8221(lines 8216 8222) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,332 INFO L425 ceAbstractionStarter]: For program point L8436(lines 8436 8440) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8436-1(lines 8436 8440) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8411-2(lines 8411 8428) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L421 ceAbstractionStarter]: At program point L8461loopEntry(lines 8461 8464) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32)))) [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8461-1(lines 8461 8464) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L421 ceAbstractionStarter]: At program point L8263(line 8263) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8321-2(lines 8321 8333) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8321(lines 8321 8333) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L425 ceAbstractionStarter]: For program point L8379(lines 8379 8396) no Hoare annotation was computed. [2018-11-10 05:32:01,333 INFO L421 ceAbstractionStarter]: At program point L8214(lines 8185 8585) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,338 INFO L425 ceAbstractionStarter]: For program point L8371-1(line 8371) no Hoare annotation was computed. [2018-11-10 05:32:01,338 INFO L421 ceAbstractionStarter]: At program point L8371(line 8371) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)))) [2018-11-10 05:32:01,338 INFO L421 ceAbstractionStarter]: At program point L8404(lines 8364 8477) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,338 INFO L425 ceAbstractionStarter]: For program point L8256(lines 8256 8269) no Hoare annotation was computed. [2018-11-10 05:32:01,339 INFO L421 ceAbstractionStarter]: At program point L8207(lines 8185 8585) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,339 INFO L425 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 7951 8586) no Hoare annotation was computed. [2018-11-10 05:32:01,339 INFO L425 ceAbstractionStarter]: For program point L8364(lines 8364 8477) no Hoare annotation was computed. [2018-11-10 05:32:01,339 INFO L421 ceAbstractionStarter]: At program point L8546(line 8546) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,339 INFO L425 ceAbstractionStarter]: For program point L8488(lines 8488 8524) no Hoare annotation was computed. [2018-11-10 05:32:01,339 INFO L421 ceAbstractionStarter]: At program point L8455(lines 8455 8457) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0)) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)))) [2018-11-10 05:32:01,345 INFO L425 ceAbstractionStarter]: For program point L8455-1(lines 8455 8457) no Hoare annotation was computed. [2018-11-10 05:32:01,345 INFO L425 ceAbstractionStarter]: For program point L8488-2(lines 8488 8524) no Hoare annotation was computed. [2018-11-10 05:32:01,345 INFO L421 ceAbstractionStarter]: At program point L8538(lines 8538 8539) the Hoare annotation is: (or (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv1 32) ~compRegistered~0) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,345 INFO L425 ceAbstractionStarter]: For program point L8546-1(line 8546) no Hoare annotation was computed. [2018-11-10 05:32:01,346 INFO L421 ceAbstractionStarter]: At program point L8249-1(line 8249) the Hoare annotation is: (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,346 INFO L421 ceAbstractionStarter]: At program point L8249(line 8249) the Hoare annotation is: (or (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0)) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)))) [2018-11-10 05:32:01,346 INFO L425 ceAbstractionStarter]: For program point L8538-1(lines 8538 8539) no Hoare annotation was computed. [2018-11-10 05:32:01,346 INFO L421 ceAbstractionStarter]: At program point L8258(line 8258) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,346 INFO L425 ceAbstractionStarter]: For program point L8225-1(line 8225) no Hoare annotation was computed. [2018-11-10 05:32:01,346 INFO L421 ceAbstractionStarter]: At program point L8225(line 8225) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8250(line 8250) no Hoare annotation was computed. [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8217(lines 8217 8220) no Hoare annotation was computed. [2018-11-10 05:32:01,353 INFO L421 ceAbstractionStarter]: At program point L8432-3(lines 8432 8474) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0)) (.cse4 (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 (= (_ bv0 32) FloppyStartDevice_~InterfaceType~0) .cse4) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (or (and .cse0 .cse1 .cse2 .cse3 (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))) (and (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32))) .cse0 .cse1 .cse2 .cse3)) .cse4))) [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8432-1(lines 8432 8474) no Hoare annotation was computed. [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8210(lines 8210 8213) no Hoare annotation was computed. [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8433(line 8433) no Hoare annotation was computed. [2018-11-10 05:32:01,353 INFO L425 ceAbstractionStarter]: For program point L8582-1(line 8582) no Hoare annotation was computed. [2018-11-10 05:32:01,354 INFO L421 ceAbstractionStarter]: At program point L8582(line 8582) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv1 32) ~compRegistered~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv3221225473 32) FloppyStartDevice_~ntStatus~4) .cse3) (and (not (bvsge FloppyStartDevice_~ntStatus~4 (_ bv0 32))) .cse0 .cse1 .cse2 .cse3 (= (bvadd FloppyStartDevice_~__cil_tmp44~7 (_ bv4294967184 32)) (_ bv0 32))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and .cse0 .cse1 .cse2 (= (bvadd FloppyStartDevice_~ntStatus~4 (_ bv1073741670 32)) (_ bv0 32)) .cse3) (and (and .cse0 .cse1 .cse2 .cse3) (= FloppyStartDevice_~ntStatus~4 (_ bv0 32))))) [2018-11-10 05:32:01,354 INFO L428 ceAbstractionStarter]: At program point L21977(lines 21976 21990) the Hoare annotation is: true [2018-11-10 05:32:01,354 INFO L425 ceAbstractionStarter]: For program point L21976(lines 21976 21990) no Hoare annotation was computed. [2018-11-10 05:32:01,354 INFO L428 ceAbstractionStarter]: At program point L21980(lines 21979 21989) the Hoare annotation is: true [2018-11-10 05:32:01,354 INFO L425 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 21971 21992) no Hoare annotation was computed. [2018-11-10 05:32:01,354 INFO L425 ceAbstractionStarter]: For program point L21987(lines 21971 21992) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L428 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 21971 21992) the Hoare annotation is: true [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21981 21988) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21981 21988) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L428 ceAbstractionStarter]: At program point L21375(lines 21374 21394) the Hoare annotation is: true [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point L21371(lines 21371 21395) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L428 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 21359 21397) the Hoare annotation is: true [2018-11-10 05:32:01,362 INFO L428 ceAbstractionStarter]: At program point L21372(lines 21371 21395) the Hoare annotation is: true [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point L21380-1(line 21380) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 21359 21397) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L428 ceAbstractionStarter]: At program point L21380(line 21380) the Hoare annotation is: true [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point L21392(lines 21359 21397) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21376 21393) no Hoare annotation was computed. [2018-11-10 05:32:01,362 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21376 21393) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 21831 21838) the Hoare annotation is: true [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 21831 21838) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 21831 21838) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 20919 20932) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 20919 20932) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~compRegistered~0)| (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) (and (= (_ bv0 32) ~pended~0) (= |old(~s~0)| ~s~0) (= (_ bv0 32) ~compRegistered~0))) [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 20919 20932) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2800 3015) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L428 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2800 3015) the Hoare annotation is: true [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point L2957(lines 2957 2961) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L428 ceAbstractionStarter]: At program point L2891(lines 2886 2892) the Hoare annotation is: true [2018-11-10 05:32:01,363 INFO L425 ceAbstractionStarter]: For program point L2887-1(lines 2887 2890) no Hoare annotation was computed. [2018-11-10 05:32:01,363 INFO L428 ceAbstractionStarter]: At program point L2887loopEntry(lines 2887 2890) the Hoare annotation is: true [2018-11-10 05:32:01,368 INFO L421 ceAbstractionStarter]: At program point L2976(line 2976) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) ~s~0)) (not (= ~myStatus~0 (_ bv0 32))) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (bvadd |~#_SLAM_alloc_dummy~0.offset| |~#_SLAM_alloc_dummy~0.base|) DriverEntry_~__cil_tmp44~0) (= (_ bv0 32) DriverEntry_~__cil_tmp43~0)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,368 INFO L421 ceAbstractionStarter]: At program point L2974(line 2974) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv0 32) ~s~0)) (not (= ~myStatus~0 (_ bv0 32))) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (bvadd |~#_SLAM_alloc_dummy~0.offset| |~#_SLAM_alloc_dummy~0.base|) DriverEntry_~__cil_tmp44~0) (= (_ bv0 32) DriverEntry_~__cil_tmp43~0)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,368 INFO L425 ceAbstractionStarter]: For program point L2976-1(line 2976) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L2974-1(line 2974) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L3003(lines 3003 3011) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2800 3015) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L3003-2(lines 3003 3011) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L2985(lines 2985 2994) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L428 ceAbstractionStarter]: At program point L2950(line 2950) the Hoare annotation is: true [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L2985-2(lines 2985 2994) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L2950-1(line 2950) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,369 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceEXIT(lines 21641 21647) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L428 ceAbstractionStarter]: At program point IoSetHardErrorOrVerifyDeviceENTRY(lines 21641 21647) the Hoare annotation is: true [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point IoSetHardErrorOrVerifyDeviceFINAL(lines 21641 21647) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L425 ceAbstractionStarter]: For program point L19525-1(lines 19525 19564) no Hoare annotation was computed. [2018-11-10 05:32:01,369 INFO L428 ceAbstractionStarter]: At program point L19525-3(lines 19525 19564) the Hoare annotation is: true [2018-11-10 05:32:01,370 INFO L425 ceAbstractionStarter]: For program point L19682(lines 19682 19695) no Hoare annotation was computed. [2018-11-10 05:32:01,370 INFO L425 ceAbstractionStarter]: For program point L19661(lines 19661 19701) no Hoare annotation was computed. [2018-11-10 05:32:01,370 INFO L425 ceAbstractionStarter]: For program point L19608(lines 19608 19714) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point L19526(line 19526) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point L19621(lines 19621 19712) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point L19576(lines 19576 19718) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 19403 19721) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point L19634(lines 19634 19710) no Hoare annotation was computed. [2018-11-10 05:32:01,371 INFO L425 ceAbstractionStarter]: For program point L19646(lines 19646 19708) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19551(lines 19551 19555) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19675(lines 19675 19697) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19593(lines 19593 19716) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 19403 19721) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19668(lines 19668 19699) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19656(lines 19656 19705) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19689(lines 19689 19693) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19656-2(lines 19656 19705) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19536(lines 19536 19559) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L428 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 19403 19721) the Hoare annotation is: true [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19536-1(lines 19536 19559) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L428 ceAbstractionStarter]: At program point L19565(lines 19524 19566) the Hoare annotation is: true [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point IoDetachDeviceEXIT(lines 21489 21495) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point IoDetachDeviceFINAL(lines 21489 21495) no Hoare annotation was computed. [2018-11-10 05:32:01,372 INFO L428 ceAbstractionStarter]: At program point IoDetachDeviceENTRY(lines 21489 21495) the Hoare annotation is: true [2018-11-10 05:32:01,372 INFO L421 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 19926 20023) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,372 INFO L425 ceAbstractionStarter]: For program point L19970-1(lines 19970 19971) no Hoare annotation was computed. [2018-11-10 05:32:01,373 INFO L425 ceAbstractionStarter]: For program point L19977(lines 19977 19988) no Hoare annotation was computed. [2018-11-10 05:32:01,373 INFO L421 ceAbstractionStarter]: At program point L19983(lines 19978 19984) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,379 INFO L425 ceAbstractionStarter]: For program point L19979-1(lines 19979 19982) no Hoare annotation was computed. [2018-11-10 05:32:01,379 INFO L421 ceAbstractionStarter]: At program point L19979loopEntry(lines 19979 19982) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,379 INFO L425 ceAbstractionStarter]: For program point L19959-1(lines 19959 19962) no Hoare annotation was computed. [2018-11-10 05:32:01,379 INFO L421 ceAbstractionStarter]: At program point L19959loopEntry(lines 19959 19962) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,379 INFO L425 ceAbstractionStarter]: For program point L19967-1(line 19967) no Hoare annotation was computed. [2018-11-10 05:32:01,379 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 19926 20023) no Hoare annotation was computed. [2018-11-10 05:32:01,379 INFO L421 ceAbstractionStarter]: At program point L19967(line 19967) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,380 INFO L421 ceAbstractionStarter]: At program point L19963(lines 19958 19964) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,380 INFO L425 ceAbstractionStarter]: For program point L20007(lines 20007 20020) no Hoare annotation was computed. [2018-11-10 05:32:01,380 INFO L425 ceAbstractionStarter]: For program point L20005-1(line 20005) no Hoare annotation was computed. [2018-11-10 05:32:01,380 INFO L421 ceAbstractionStarter]: At program point L20005(line 20005) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,380 INFO L425 ceAbstractionStarter]: For program point L20007-2(lines 20007 20020) no Hoare annotation was computed. [2018-11-10 05:32:01,380 INFO L421 ceAbstractionStarter]: At program point L19970(lines 19970 19971) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 19926 20023) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point L20013-1(line 20013) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L421 ceAbstractionStarter]: At program point L20013(line 20013) the Hoare annotation is: (or (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) (and (= (_ bv259 32) FlFdcDeviceIo_~ntStatus~16) (= (_ bv6 32) ~s~0) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-10 05:32:01,381 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4521 4526) the Hoare annotation is: true [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point L4523(line 4523) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point L4522(lines 4522 4524) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4521 4526) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4523) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point L4522-2(lines 4521 4526) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L425 ceAbstractionStarter]: For program point L21471(lines 21471 21485) no Hoare annotation was computed. [2018-11-10 05:32:01,381 INFO L428 ceAbstractionStarter]: At program point L21472(lines 21471 21485) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L428 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 21467 21487) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L428 ceAbstractionStarter]: At program point L21475(lines 21474 21484) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 21467 21487) no Hoare annotation was computed. [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21476 21483) no Hoare annotation was computed. [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point L21482(lines 21467 21487) no Hoare annotation was computed. [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21476 21483) no Hoare annotation was computed. [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 21547 21580) no Hoare annotation was computed. [2018-11-10 05:32:01,382 INFO L428 ceAbstractionStarter]: At program point L21568(lines 21567 21577) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L428 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 21547 21580) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L428 ceAbstractionStarter]: At program point L21565(lines 21564 21578) the Hoare annotation is: true [2018-11-10 05:32:01,382 INFO L425 ceAbstractionStarter]: For program point L21564(lines 21564 21578) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point L21575(lines 21547 21580) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21569 21576) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21569 21576) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point MmResetDriverPagingFINAL(lines 21950 21956) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point MmResetDriverPagingEXIT(lines 21950 21956) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L428 ceAbstractionStarter]: At program point MmResetDriverPagingENTRY(lines 21950 21956) the Hoare annotation is: true [2018-11-10 05:32:01,386 INFO L428 ceAbstractionStarter]: At program point L21593(lines 21592 21606) the Hoare annotation is: true [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point L21592(lines 21592 21606) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 21585 21608) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L428 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 21585 21608) the Hoare annotation is: true [2018-11-10 05:32:01,386 INFO L428 ceAbstractionStarter]: At program point L21596(lines 21595 21605) the Hoare annotation is: true [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point L21603(lines 21585 21608) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21597 21604) no Hoare annotation was computed. [2018-11-10 05:32:01,386 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21597 21604) no Hoare annotation was computed. [2018-11-10 05:32:01,387 INFO L425 ceAbstractionStarter]: For program point L9185(lines 9185 9220) no Hoare annotation was computed. [2018-11-10 05:32:01,387 INFO L421 ceAbstractionStarter]: At program point L9152(line 9152) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,387 INFO L425 ceAbstractionStarter]: For program point L9119(lines 9119 9159) no Hoare annotation was computed. [2018-11-10 05:32:01,387 INFO L425 ceAbstractionStarter]: For program point L9152-1(line 9152) no Hoare annotation was computed. [2018-11-10 05:32:01,387 INFO L421 ceAbstractionStarter]: At program point L9235(lines 9230 9236) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,387 INFO L425 ceAbstractionStarter]: For program point L9202(lines 9202 9205) no Hoare annotation was computed. [2018-11-10 05:32:01,387 INFO L421 ceAbstractionStarter]: At program point L9252loopEntry(lines 9252 9255) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9252-1(lines 9252 9255) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L421 ceAbstractionStarter]: At program point L9128(lines 9119 9159) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,400 INFO L421 ceAbstractionStarter]: At program point L9087(line 9087) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9087-1(line 9087) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L421 ceAbstractionStarter]: At program point L9112(line 9112) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9112-1(line 9112) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L421 ceAbstractionStarter]: At program point L9096(line 9096) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9096-1(line 9096) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L421 ceAbstractionStarter]: At program point L9278(lines 9273 9279) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and .cse0 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= ~PagingReferenceCount~0 (_ bv0 32))))) [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9229(lines 9229 9262) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point L9229-1(lines 9063 9287) no Hoare annotation was computed. [2018-11-10 05:32:01,400 INFO L425 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 8976 9288) no Hoare annotation was computed. [2018-11-10 05:32:01,401 INFO L421 ceAbstractionStarter]: At program point L9213(lines 9208 9214) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,409 INFO L425 ceAbstractionStarter]: For program point L9238(line 9238) no Hoare annotation was computed. [2018-11-10 05:32:01,409 INFO L421 ceAbstractionStarter]: At program point L9065loopEntry(lines 9065 9068) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,409 INFO L425 ceAbstractionStarter]: For program point L9065-1(lines 9065 9068) no Hoare annotation was computed. [2018-11-10 05:32:01,409 INFO L425 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 8976 9288) no Hoare annotation was computed. [2018-11-10 05:32:01,409 INFO L421 ceAbstractionStarter]: At program point L9206(lines 9199 9216) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,409 INFO L421 ceAbstractionStarter]: At program point L9231loopEntry(lines 9231 9234) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,409 INFO L425 ceAbstractionStarter]: For program point L9231-1(lines 9231 9234) no Hoare annotation was computed. [2018-11-10 05:32:01,409 INFO L421 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 8976 9288) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,409 INFO L421 ceAbstractionStarter]: At program point L9256(lines 9251 9257) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,410 INFO L421 ceAbstractionStarter]: At program point L9223(lines 9168 9265) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,410 INFO L421 ceAbstractionStarter]: At program point L9100(line 9100) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= (_ bv2 32) ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9100-1(line 9100) no Hoare annotation was computed. [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9199(lines 9199 9218) no Hoare annotation was computed. [2018-11-10 05:32:01,416 INFO L421 ceAbstractionStarter]: At program point L9274loopEntry(lines 9274 9277) the Hoare annotation is: (let ((.cse0 (= (_ bv1 32) ~s~0))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and .cse0 (= ~PagingReferenceCount~0 (_ bv0 32))) (and .cse0 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9274-1(lines 9274 9277) no Hoare annotation was computed. [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9134-2(lines 9134 9138) no Hoare annotation was computed. [2018-11-10 05:32:01,416 INFO L421 ceAbstractionStarter]: At program point L9200(lines 9185 9220) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9134(lines 9134 9138) no Hoare annotation was computed. [2018-11-10 05:32:01,416 INFO L425 ceAbstractionStarter]: For program point L9267(lines 9267 9285) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L9209(lines 9209 9212) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L421 ceAbstractionStarter]: At program point L9069(lines 9064 9070) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L9259(line 9259) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L9168(lines 9168 9265) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L9127(lines 9127 9157) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L9094(lines 9094 9105) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point L21623(lines 21623 21637) no Hoare annotation was computed. [2018-11-10 05:32:01,417 INFO L428 ceAbstractionStarter]: At program point L21624(lines 21623 21637) the Hoare annotation is: true [2018-11-10 05:32:01,417 INFO L428 ceAbstractionStarter]: At program point L21627(lines 21626 21636) the Hoare annotation is: true [2018-11-10 05:32:01,417 INFO L425 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 21619 21639) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point L21634(lines 21619 21639) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L428 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 21619 21639) the Hoare annotation is: true [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 21628 21635) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 21628 21635) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point ObfDereferenceObjectFINAL(lines 21994 22000) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L428 ceAbstractionStarter]: At program point ObfDereferenceObjectENTRY(lines 21994 22000) the Hoare annotation is: true [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point ObfDereferenceObjectEXIT(lines 21994 22000) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point KeInitializeEventEXIT(lines 21795 21801) no Hoare annotation was computed. [2018-11-10 05:32:01,430 INFO L428 ceAbstractionStarter]: At program point KeInitializeEventENTRY(lines 21795 21801) the Hoare annotation is: true [2018-11-10 05:32:01,430 INFO L425 ceAbstractionStarter]: For program point KeInitializeEventFINAL(lines 21795 21801) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point L4929(lines 4924 4930) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0)) [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point L4925loopEntry(lines 4925 4928) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0)) [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point L4925-1(lines 4925 4928) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 4914 4946) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 4914 4946) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0)) [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point L4942(line 4942) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~s~0)|)) (= (_ bv1 32) ~s~0)) [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point L4942-1(line 4942) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 4914 4946) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point L22039(lines 22038 22053) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point L22035(lines 22035 22054) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 22003 22079) no Hoare annotation was computed. [2018-11-10 05:32:01,431 INFO L421 ceAbstractionStarter]: At program point L22023(line 22023) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point L22060(lines 22060 22075) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 22003 22079) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point L22069-2(lines 22056 22076) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point L22069(lines 22069 22074) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L421 ceAbstractionStarter]: At program point L22036(lines 22035 22054) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,442 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 22003 22079) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point L22061(lines 22061 22067) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L425 ceAbstractionStarter]: For program point L22016-1(line 22016) no Hoare annotation was computed. [2018-11-10 05:32:01,442 INFO L421 ceAbstractionStarter]: At program point L22016(line 22016) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point L22021(lines 22021 22027) no Hoare annotation was computed. [2018-11-10 05:32:01,443 INFO L421 ceAbstractionStarter]: At program point L22033(lines 22032 22055) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 22040 22052) no Hoare annotation was computed. [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 22040 22052) no Hoare annotation was computed. [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point L22013(lines 22013 22031) no Hoare annotation was computed. [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point L22013-1(lines 22012 22078) no Hoare annotation was computed. [2018-11-10 05:32:01,443 INFO L421 ceAbstractionStarter]: At program point L22051(lines 22012 22078) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv3 32) |old(~s~0)|)) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,443 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 21229 21239) no Hoare annotation was computed. [2018-11-10 05:32:01,449 INFO L428 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 21229 21239) the Hoare annotation is: true [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 21229 21239) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8863(lines 8858 8864) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 8598 8975) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8748(lines 8747 8930) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8971(line 8971) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv3 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8971-1(line 8971) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8806(line 8806) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8889(lines 8889 8904) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8716(lines 8711 8717) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8939(line 8939) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8939-1(lines 8935 8941) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L421 ceAbstractionStarter]: At program point L8840(line 8840) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8840-1(line 8840) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8766-2(lines 8766 8778) no Hoare annotation was computed. [2018-11-10 05:32:01,450 INFO L425 ceAbstractionStarter]: For program point L8799(lines 8799 8802) no Hoare annotation was computed. [2018-11-10 05:32:01,451 INFO L425 ceAbstractionStarter]: For program point L8766(lines 8766 8778) no Hoare annotation was computed. [2018-11-10 05:32:01,451 INFO L425 ceAbstractionStarter]: For program point L8915(lines 8915 8918) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point L8791(lines 8791 8822) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point L8758(lines 8758 8761) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point L8750(lines 8750 8929) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point $Ultimate##10(lines 8755 8927) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L421 ceAbstractionStarter]: At program point L8899(lines 8899 8900) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point L8899-1(lines 8899 8900) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 8755 8927) no Hoare annotation was computed. [2018-11-10 05:32:01,463 INFO L425 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 8598 8975) no Hoare annotation was computed. [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8850(lines 8845 8851) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8817(line 8817) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8784(line 8784) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,464 INFO L425 ceAbstractionStarter]: For program point L8817-1(line 8817) no Hoare annotation was computed. [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8751(lines 8750 8929) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,464 INFO L425 ceAbstractionStarter]: For program point L8784-1(line 8784) no Hoare annotation was computed. [2018-11-10 05:32:01,464 INFO L425 ceAbstractionStarter]: For program point L8933(lines 8708 8974) no Hoare annotation was computed. [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8859loopEntry(lines 8859 8862) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,464 INFO L425 ceAbstractionStarter]: For program point L8859-1(lines 8859 8862) no Hoare annotation was computed. [2018-11-10 05:32:01,464 INFO L421 ceAbstractionStarter]: At program point L8876(line 8876) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8876-1(line 8876) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8835(lines 8835 8912) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8835-1(lines 8755 8925) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8769(lines 8769 8774) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L421 ceAbstractionStarter]: At program point L8926(lines 8753 8928) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,471 INFO L421 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 8598 8975) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8844(lines 8844 8870) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L425 ceAbstractionStarter]: For program point L8844-2(lines 8844 8870) no Hoare annotation was computed. [2018-11-10 05:32:01,471 INFO L421 ceAbstractionStarter]: At program point L8803(lines 8798 8804) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,472 INFO L421 ceAbstractionStarter]: At program point L8712loopEntry(lines 8712 8715) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,472 INFO L425 ceAbstractionStarter]: For program point L8712-1(lines 8712 8715) no Hoare annotation was computed. [2018-11-10 05:32:01,472 INFO L421 ceAbstractionStarter]: At program point L8828(line 8828) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,472 INFO L425 ceAbstractionStarter]: For program point L8828-1(line 8828) no Hoare annotation was computed. [2018-11-10 05:32:01,472 INFO L421 ceAbstractionStarter]: At program point L8762(lines 8757 8763) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,472 INFO L421 ceAbstractionStarter]: At program point L8919(lines 8914 8920) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point L8886(lines 8886 8908) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L421 ceAbstractionStarter]: At program point L8796(line 8796) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,481 INFO L421 ceAbstractionStarter]: At program point L8796-1(lines 8796 8802) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point L8846-1(lines 8846 8849) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point L8747(lines 8747 8930) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L421 ceAbstractionStarter]: At program point L8846loopEntry(lines 8846 8849) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (= (_ bv1 32) ~s~0) (not (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point RtlFreeUnicodeStringFINAL(lines 22213 22219) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point RtlFreeUnicodeStringEXIT(lines 22213 22219) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L428 ceAbstractionStarter]: At program point RtlFreeUnicodeStringENTRY(lines 22213 22219) the Hoare annotation is: true [2018-11-10 05:32:01,481 INFO L428 ceAbstractionStarter]: At program point L8593(line 8593) the Hoare annotation is: true [2018-11-10 05:32:01,481 INFO L425 ceAbstractionStarter]: For program point L8593-1(line 8593) no Hoare annotation was computed. [2018-11-10 05:32:01,481 INFO L428 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 8587 8597) the Hoare annotation is: true [2018-11-10 05:32:01,482 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 8587 8597) no Hoare annotation was computed. [2018-11-10 05:32:01,482 INFO L425 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 8587 8597) no Hoare annotation was computed. [2018-11-10 05:32:01,482 INFO L425 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 21821 21828) no Hoare annotation was computed. [2018-11-10 05:32:01,482 INFO L428 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 21821 21828) the Hoare annotation is: true [2018-11-10 05:32:01,482 INFO L425 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 21821 21828) no Hoare annotation was computed. [2018-11-10 05:32:01,482 INFO L425 ceAbstractionStarter]: For program point L21849(lines 21849 21854) no Hoare annotation was computed. [2018-11-10 05:32:01,482 INFO L421 ceAbstractionStarter]: At program point L21874(lines 21873 21883) the Hoare annotation is: (let ((.cse2 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv0 32) ~pended~0))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse7 (= (_ bv1 32) ~s~0)) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)))) (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse8 .cse5 .cse7 .cse6) (or (or .cse0 (not (= (_ bv6 32) |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse0 .cse1 .cse7 .cse8 .cse5 (not (= (_ bv1 32) ~pended~0))))) [2018-11-10 05:32:01,491 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 21843 21886) no Hoare annotation was computed. [2018-11-10 05:32:01,491 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 21875 21882) no Hoare annotation was computed. [2018-11-10 05:32:01,491 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 21875 21882) no Hoare annotation was computed. [2018-11-10 05:32:01,491 INFO L425 ceAbstractionStarter]: For program point L21881(lines 21843 21886) no Hoare annotation was computed. [2018-11-10 05:32:01,492 INFO L425 ceAbstractionStarter]: For program point L21848(lines 21848 21869) no Hoare annotation was computed. [2018-11-10 05:32:01,492 INFO L421 ceAbstractionStarter]: At program point L21856(lines 21848 21869) the Hoare annotation is: (let ((.cse6 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv0 32) ~pended~0))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse4 (= (_ bv1 32) ~s~0)) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse2 .cse3 .cse4 .cse5) (or (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (or .cse0 .cse1 .cse6 .cse7 .cse8 .cse3 .cse5)) (or .cse0 (not (= (_ bv6 32) |old(~s~0)|)) .cse6 .cse7 .cse8 .cse3 .cse5) (or .cse0 .cse1 .cse4 .cse2 .cse3 (not (= (_ bv1 32) ~pended~0))))) [2018-11-10 05:32:01,492 INFO L421 ceAbstractionStarter]: At program point L21863(line 21863) the Hoare annotation is: (let ((.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse6 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse7 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (not (= (_ bv1 32) ~pended~0))) (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse5 .cse6 .cse7 .cse3 .cse4) (or .cse0 (not (= (_ bv6 32) |old(~s~0)|)) .cse5 .cse6 .cse7 .cse3 .cse4))) [2018-11-10 05:32:01,492 INFO L425 ceAbstractionStarter]: For program point L21861(lines 21861 21867) no Hoare annotation was computed. [2018-11-10 05:32:01,492 INFO L425 ceAbstractionStarter]: For program point L21861-1(lines 21847 21885) no Hoare annotation was computed. [2018-11-10 05:32:01,492 INFO L421 ceAbstractionStarter]: At program point L21871(lines 21870 21884) the Hoare annotation is: (let ((.cse2 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse3 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse4 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse6 (not (= (_ bv0 32) ~pended~0))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse7 (= (_ bv1 32) ~s~0)) (.cse8 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)))) (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse8 .cse5 .cse7 .cse6) (or (or .cse0 (not (= (_ bv6 32) |old(~s~0)|)) .cse2 .cse3 .cse4 .cse5 .cse6) .cse7) (or .cse0 .cse1 .cse7 .cse8 .cse5 (not (= (_ bv1 32) ~pended~0))))) [2018-11-10 05:32:01,513 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 21843 21886) the Hoare annotation is: (let ((.cse6 (and (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0))) (.cse7 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse8 (not (= (bvadd |old(~setEventCalled~0)| (_ bv4294967295 32)) (_ bv0 32)))) (.cse9 (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse5 (not (= (_ bv0 32) ~pended~0))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse4 (= (_ bv1 32) ~s~0)) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or .cse0 .cse1 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse2 .cse3 .cse4 .cse5) (or .cse6 (or .cse0 (not (= (_ bv6 32) |old(~s~0)|)) .cse7 .cse8 .cse9 .cse3 .cse5)) (or .cse6 (or .cse0 .cse1 .cse7 .cse8 .cse9 .cse3 .cse5)) (or .cse0 .cse1 .cse4 .cse2 .cse3 (not (= (_ bv1 32) ~pended~0))))) [2018-11-10 05:32:01,513 INFO L428 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 3016 3033) the Hoare annotation is: true [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 3016 3033) no Hoare annotation was computed. [2018-11-10 05:32:01,513 INFO L428 ceAbstractionStarter]: At program point L3029(line 3029) the Hoare annotation is: true [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 3016 3033) no Hoare annotation was computed. [2018-11-10 05:32:01,513 INFO L428 ceAbstractionStarter]: At program point L3025(lines 3020 3026) the Hoare annotation is: true [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point L3021-1(lines 3021 3024) no Hoare annotation was computed. [2018-11-10 05:32:01,513 INFO L428 ceAbstractionStarter]: At program point L3021loopEntry(lines 3021 3024) the Hoare annotation is: true [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point L21750(lines 21750 21756) no Hoare annotation was computed. [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point L21754-1(lines 21746 21759) no Hoare annotation was computed. [2018-11-10 05:32:01,513 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 21746 21759) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or (or .cse0 .cse1 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 (not (= (_ bv0 32) ~pended~0))) (= |old(~s~0)| ~s~0)) (or .cse0 .cse1 (= (_ bv1 32) ~s~0) (not (= ~compRegistered~0 (_ bv0 32))) .cse2))) [2018-11-10 05:32:01,513 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 21746 21759) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L421 ceAbstractionStarter]: At program point L21754(line 21754) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) |old(~s~0)|))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|))) (and (or .cse0 .cse1 (not (= ~compRegistered~0 (_ bv0 32))) .cse2) (or .cse0 .cse1 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 (not (= (_ bv0 32) ~pended~0))))) [2018-11-10 05:32:01,531 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,531 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L428 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,531 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L428 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 2106 2110) the Hoare annotation is: true [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 2106 2110) no Hoare annotation was computed. [2018-11-10 05:32:01,531 INFO L425 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 2106 2110) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0FINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0EXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L428 ceAbstractionStarter]: At program point ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0ENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point MmPageEntireDriverEXIT(lines 21942 21948) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L428 ceAbstractionStarter]: At program point MmPageEntireDriverENTRY(lines 21942 21948) the Hoare annotation is: true [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point MmPageEntireDriverFINAL(lines 21942 21948) no Hoare annotation was computed. [2018-11-10 05:32:01,532 INFO L428 ceAbstractionStarter]: At program point L22199(lines 22198 22208) the Hoare annotation is: true [2018-11-10 05:32:01,532 INFO L425 ceAbstractionStarter]: For program point L22195(lines 22195 22209) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L428 ceAbstractionStarter]: At program point L22196(lines 22195 22209) the Hoare annotation is: true [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point L22206(lines 22190 22211) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 22190 22211) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L428 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 22190 22211) the Hoare annotation is: true [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 22200 22207) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 22200 22207) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 21148 21154) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 21148 21154) no Hoare annotation was computed. [2018-11-10 05:32:01,553 INFO L428 ceAbstractionStarter]: At program point mallocENTRY(lines 21148 21154) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point ##fun~~PDRIVER_OBJECT~0~TO~VOIDFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point IoDeleteDeviceEXIT(lines 21459 21465) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point IoDeleteDeviceFINAL(lines 21459 21465) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point IoDeleteDeviceENTRY(lines 21459 21465) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point ExAcquireFastMutexEXIT(lines 21156 21162) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point ExAcquireFastMutexENTRY(lines 21156 21162) the Hoare annotation is: true [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point ExAcquireFastMutexFINAL(lines 21156 21162) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point L22261(lines 22244 22266) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L425 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 22244 22266) no Hoare annotation was computed. [2018-11-10 05:32:01,554 INFO L428 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 22244 22266) the Hoare annotation is: true [2018-11-10 05:32:01,555 INFO L428 ceAbstractionStarter]: At program point L22254(lines 22253 22263) the Hoare annotation is: true [2018-11-10 05:32:01,562 INFO L428 ceAbstractionStarter]: At program point L22251(lines 22250 22264) the Hoare annotation is: true [2018-11-10 05:32:01,562 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 22255 22262) no Hoare annotation was computed. [2018-11-10 05:32:01,562 INFO L425 ceAbstractionStarter]: For program point L22250(lines 22250 22264) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 22255 22262) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L421 ceAbstractionStarter]: At program point L4858(line 4858) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5)) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse5 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse4))) [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point L4858-1(lines 4744 4860) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L421 ceAbstractionStarter]: At program point L4817(line 4817) the Hoare annotation is: (let ((.cse9 (= (_ bv1 32) ~s~0))) (let ((.cse2 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse6 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse9)) (.cse3 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32)))) (.cse4 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse10 (= (_ bv0 32) ~pended~0)) (.cse7 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (and .cse9 .cse10 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))))) (or .cse0 .cse1 (and .cse8 .cse2) (and .cse6 .cse8) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse5 .cse7)) (or .cse0 .cse1 .cse3 .cse4 .cse5 (and .cse10 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse7)))) [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point L4817-1(line 4817) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point L4813(line 4813) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L421 ceAbstractionStarter]: At program point L4801(line 4801) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse5 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse6 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse7 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse8 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (let ((.cse3 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (or .cse0 .cse1 (and .cse2 .cse3 .cse4) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse5 .cse6 (and .cse3 .cse4 .cse7) .cse8)) (or .cse0 .cse1 (and .cse2 .cse4) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse5 .cse6 (and .cse4 .cse7) .cse8))) [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point L4801-1(line 4801) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 4527 4913) no Hoare annotation was computed. [2018-11-10 05:32:01,563 INFO L421 ceAbstractionStarter]: At program point L4760(line 4760) the Hoare annotation is: (let ((.cse6 (= (_ bv1 32) ~s~0))) (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse6)) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (and .cse6 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32))) (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0))) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 .cse5)))) [2018-11-10 05:32:01,579 INFO L421 ceAbstractionStarter]: At program point L4723(lines 4718 4724) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,579 INFO L425 ceAbstractionStarter]: For program point L4719(lines 4719 4722) no Hoare annotation was computed. [2018-11-10 05:32:01,579 INFO L425 ceAbstractionStarter]: For program point L4847(lines 4847 4851) no Hoare annotation was computed. [2018-11-10 05:32:01,580 INFO L421 ceAbstractionStarter]: At program point L4843(line 4843) the Hoare annotation is: (let ((.cse8 (= (_ bv1 32) ~s~0))) (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse8)) (.cse7 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse4 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse9 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse6 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (let ((.cse2 (and .cse8 .cse9 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32))) (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0)))) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 .cse3) .cse4 .cse5 .cse6 (and .cse7 .cse2))) (let ((.cse10 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (or .cse0 .cse1 (and .cse7 .cse10 .cse9) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse4 .cse5 (and .cse10 .cse9 .cse3) .cse6))))) [2018-11-10 05:32:01,580 INFO L425 ceAbstractionStarter]: For program point L4843-1(line 4843) no Hoare annotation was computed. [2018-11-10 05:32:01,580 INFO L421 ceAbstractionStarter]: At program point L4909(line 4909) the Hoare annotation is: (let ((.cse2 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32)))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse6 (= (_ bv1 32) ~pended~0)) (.cse3 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~PagingReferenceCount~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse3 .cse4 .cse5))) [2018-11-10 05:32:01,580 INFO L425 ceAbstractionStarter]: For program point L4909-1(line 4909) no Hoare annotation was computed. [2018-11-10 05:32:01,580 INFO L421 ceAbstractionStarter]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse8 (= (_ bv1 32) ~s~0))) (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse8)) (.cse7 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse4 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse9 (= (_ bv0 32) ~pended~0)) (.cse3 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse6 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (let ((.cse2 (and .cse8 .cse9 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32))) (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32)) (= (_ bv0 32) ~compRegistered~0)))) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse2 .cse3) .cse4 .cse5 .cse6 (and .cse7 .cse2))) (let ((.cse10 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (or .cse0 .cse1 (and .cse7 .cse10 .cse9) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse4 .cse5 (and .cse10 .cse9 .cse3) .cse6))))) [2018-11-10 05:32:01,598 INFO L425 ceAbstractionStarter]: For program point L4839-1(line 4839) no Hoare annotation was computed. [2018-11-10 05:32:01,598 INFO L421 ceAbstractionStarter]: At program point L4905(line 4905) the Hoare annotation is: (let ((.cse2 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32)))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse6 (= (_ bv1 32) ~pended~0)) (.cse3 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ~PagingReferenceCount~0 (_ bv0 32)) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse1 .cse6 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse3 .cse4 .cse5))) [2018-11-10 05:32:01,598 INFO L425 ceAbstractionStarter]: For program point L4744(lines 4744 4860) no Hoare annotation was computed. [2018-11-10 05:32:01,598 INFO L425 ceAbstractionStarter]: For program point L4905-1(line 4905) no Hoare annotation was computed. [2018-11-10 05:32:01,599 INFO L421 ceAbstractionStarter]: At program point L4835(lines 4835 4836) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse2 .cse3 .cse5))) [2018-11-10 05:32:01,599 INFO L425 ceAbstractionStarter]: For program point L4835-1(lines 4835 4836) no Hoare annotation was computed. [2018-11-10 05:32:01,599 INFO L421 ceAbstractionStarter]: At program point L4695(lines 4690 4696) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5)) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse5 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse4))) [2018-11-10 05:32:01,599 INFO L421 ceAbstractionStarter]: At program point L4790(lines 4790 4791) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 .cse5))) [2018-11-10 05:32:01,607 INFO L425 ceAbstractionStarter]: For program point L4691(lines 4691 4694) no Hoare annotation was computed. [2018-11-10 05:32:01,608 INFO L425 ceAbstractionStarter]: For program point L4757(lines 4757 4764) no Hoare annotation was computed. [2018-11-10 05:32:01,608 INFO L425 ceAbstractionStarter]: For program point L4790-1(lines 4790 4791) no Hoare annotation was computed. [2018-11-10 05:32:01,608 INFO L421 ceAbstractionStarter]: At program point L4757-1(lines 4757 4764) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 .cse5))) [2018-11-10 05:32:01,608 INFO L425 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 4527 4913) no Hoare annotation was computed. [2018-11-10 05:32:01,608 INFO L425 ceAbstractionStarter]: For program point L4683(lines 4683 4710) no Hoare annotation was computed. [2018-11-10 05:32:01,608 INFO L421 ceAbstractionStarter]: At program point L4716-1(lines 4716 4722) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,608 INFO L421 ceAbstractionStarter]: At program point L4716(line 4716) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,608 INFO L421 ceAbstractionStarter]: At program point L4807(line 4807) the Hoare annotation is: (let ((.cse8 (= (_ bv0 32) ~pended~0)) (.cse9 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))) (.cse10 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse7 (= (_ bv1 32) ~s~0))) (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse7)) (.cse2 (and .cse7 .cse8 .cse9 .cse10 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0))) (.cse3 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse4 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (and (= FlQueueIrpToThread_~status~0 (_ bv0 32)) .cse7 .cse8 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32))) .cse9 .cse10 (= (_ bv0 32) ~compRegistered~0))) (.cse6 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse3 .cse4 .cse5 .cse6)))) [2018-11-10 05:32:01,618 INFO L425 ceAbstractionStarter]: For program point L4807-1(line 4807) no Hoare annotation was computed. [2018-11-10 05:32:01,618 INFO L421 ceAbstractionStarter]: At program point L4675(line 4675) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,618 INFO L425 ceAbstractionStarter]: For program point L4675-1(line 4675) no Hoare annotation was computed. [2018-11-10 05:32:01,619 INFO L421 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 4527 4913) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,619 INFO L425 ceAbstractionStarter]: For program point L4766(line 4766) no Hoare annotation was computed. [2018-11-10 05:32:01,619 INFO L425 ceAbstractionStarter]: For program point L4795(lines 4795 4822) no Hoare annotation was computed. [2018-11-10 05:32:01,619 INFO L421 ceAbstractionStarter]: At program point L4890(line 4890) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 .cse4) (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4))) [2018-11-10 05:32:01,619 INFO L425 ceAbstractionStarter]: For program point L4886(lines 4886 4892) no Hoare annotation was computed. [2018-11-10 05:32:01,619 INFO L421 ceAbstractionStarter]: At program point L4729(line 4729) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,634 INFO L425 ceAbstractionStarter]: For program point L4890-1(lines 4886 4892) no Hoare annotation was computed. [2018-11-10 05:32:01,634 INFO L425 ceAbstractionStarter]: For program point L4729-1(line 4729) no Hoare annotation was computed. [2018-11-10 05:32:01,634 INFO L421 ceAbstractionStarter]: At program point L4754(line 4754) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (= (_ bv0 32) ~pended~0)) (.cse5 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse4) .cse5) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse4 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse5))) [2018-11-10 05:32:01,634 INFO L421 ceAbstractionStarter]: At program point L4688-1(lines 4688 4694) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5)) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse5 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse4))) [2018-11-10 05:32:01,634 INFO L425 ceAbstractionStarter]: For program point L4754-1(line 4754) no Hoare annotation was computed. [2018-11-10 05:32:01,634 INFO L421 ceAbstractionStarter]: At program point L4688(line 4688) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not (= (_ bv1 32) ~s~0))) (.cse2 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse5 (= (_ bv0 32) ~pended~0)) (.cse4 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse3 .cse4 (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5)) (or .cse0 .cse1 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) .cse2 .cse3 (and .cse5 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse4))) [2018-11-10 05:32:01,634 INFO L421 ceAbstractionStarter]: At program point L4804-2(lines 4804 4811) the Hoare annotation is: (let ((.cse9 (= (_ bv1 32) ~s~0))) (let ((.cse2 (= (_ bv3221225473 32) FlQueueIrpToThread_~status~0)) (.cse6 (= FlQueueIrpToThread_~status~0 (_ bv0 32))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse1 (not .cse9)) (.cse3 (not (= |old(~PagingReferenceCount~0)| (_ bv0 32)))) (.cse4 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse5 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse10 (= (_ bv0 32) ~pended~0)) (.cse7 (not (= (_ bv0 32) |old(~pended~0)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse8 (and .cse9 .cse10 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))))) (or .cse0 .cse1 (and .cse8 .cse2) (and .cse6 .cse8) (not (= (bvadd |old(~PagingReferenceCount~0)| (_ bv4294967295 32)) (_ bv0 32))) .cse4 .cse5 .cse7)) (or .cse0 .cse1 .cse3 .cse4 .cse5 (and .cse10 (= ~PagingReferenceCount~0 (_ bv0 32))) .cse7)))) [2018-11-10 05:32:01,652 INFO L425 ceAbstractionStarter]: For program point L4804(lines 4804 4811) no Hoare annotation was computed. [2018-11-10 05:32:01,652 INFO L421 ceAbstractionStarter]: At program point L21701(lines 21700 21715) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse3 (= (_ bv3 32) ~s~0)) (.cse6 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv3 32) |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse4) (or (and (= (_ bv5 32) ~s~0) (= (bvadd IofCallDriver_~__cil_tmp9~27 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse6 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse5))) (or .cse0 .cse3 .cse6 .cse1 .cse2 .cse4 .cse5))) [2018-11-10 05:32:01,652 INFO L421 ceAbstractionStarter]: At program point L21713(lines 21674 21742) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse3 (= (_ bv3 32) ~s~0)) (.cse9 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv3 32) |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse6 (= (_ bv5 32) ~s~0)) (.cse7 (= (bvadd IofCallDriver_~__cil_tmp9~27 (_ bv1073741802 32)) (_ bv0 32))) (.cse8 (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (and (or (and (= (_ bv3221225473 32) IofCallDriver_~returnVal2~0) .cse6) (and (= (_ bv0 32) IofCallDriver_~returnVal2~0) .cse6)) .cse7 .cse8) (and .cse6 .cse7 .cse8 (= (_ bv259 32) IofCallDriver_~returnVal2~0)) (or .cse0 .cse9 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse5)))) (or .cse0 .cse1 .cse2 .cse3 (not (= (_ bv1 32) ~pended~0)) .cse4) (or .cse0 .cse3 .cse9 .cse1 .cse2 .cse4 .cse5))) [2018-11-10 05:32:01,653 INFO L421 ceAbstractionStarter]: At program point L21685(line 21685) the Hoare annotation is: (let ((.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse3 (not (= (_ bv3 32) |old(~s~0)|))) (.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse3) (or .cse0 .cse5 .cse1 .cse2 .cse3 .cse4) (or (and (= (bvadd IofCallDriver_~__cil_tmp9~27 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(~s~0)| ~s~0)) (or .cse0 .cse5 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse4))))) [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point L21697(lines 21697 21716) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point L21722(lines 21722 21739) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 21664 21743) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse3 (= (_ bv3 32) ~s~0)) (.cse6 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv3 32) |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse4) (or (= |old(~s~0)| ~s~0) (or .cse0 .cse6 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse5))) (or .cse0 .cse3 .cse6 .cse1 .cse2 .cse4 .cse5))) [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point L21731(lines 21731 21738) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L421 ceAbstractionStarter]: At program point L21698(lines 21697 21716) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse3 (= (_ bv3 32) ~s~0)) (.cse6 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv3 32) |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse4) (or (and (= (_ bv5 32) ~s~0) (= (bvadd IofCallDriver_~__cil_tmp9~27 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse6 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse5))) (or .cse0 .cse3 .cse6 .cse1 .cse2 .cse4 .cse5))) [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 21664 21743) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 21664 21743) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point L21723(lines 21723 21729) no Hoare annotation was computed. [2018-11-10 05:32:01,668 INFO L425 ceAbstractionStarter]: For program point L21736-1(lines 21718 21740) no Hoare annotation was computed. [2018-11-10 05:32:01,669 INFO L421 ceAbstractionStarter]: At program point L21736(line 21736) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse3 (not (= (_ bv3 32) |old(~s~0)|))) (.cse4 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse5 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse4)) (or .cse0 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse3) (or .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2018-11-10 05:32:01,682 INFO L421 ceAbstractionStarter]: At program point L21678(line 21678) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse5 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse3 (not (= (_ bv3 32) |old(~s~0)|))) (.cse4 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4) (or .cse0 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse3) (or (= |old(~s~0)| ~s~0) (or .cse0 .cse5 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse4))) (or .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2018-11-10 05:32:01,682 INFO L425 ceAbstractionStarter]: For program point L21678-1(line 21678) no Hoare annotation was computed. [2018-11-10 05:32:01,682 INFO L425 ceAbstractionStarter]: For program point $Ultimate##12(lines 21702 21714) no Hoare annotation was computed. [2018-11-10 05:32:01,682 INFO L425 ceAbstractionStarter]: For program point $Ultimate##11(lines 21702 21714) no Hoare annotation was computed. [2018-11-10 05:32:01,683 INFO L425 ceAbstractionStarter]: For program point L21683(lines 21683 21689) no Hoare annotation was computed. [2018-11-10 05:32:01,683 INFO L421 ceAbstractionStarter]: At program point L21695(lines 21694 21717) the Hoare annotation is: (let ((.cse0 (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|))) (.cse3 (= (_ bv3 32) ~s~0)) (.cse6 (not (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) (.cse1 (not (= ~compRegistered~0 (_ bv0 32)))) (.cse2 (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|)) (.cse4 (not (= (_ bv3 32) |old(~s~0)|))) (.cse5 (not (= (_ bv0 32) ~pended~0)))) (and (or .cse0 (not (= ~PagingReferenceCount~0 (_ bv0 32))) .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse0 .cse3 .cse1 .cse2 (not (= (_ bv1 32) ~pended~0)) .cse4) (or (and (= (_ bv5 32) ~s~0) (= (bvadd IofCallDriver_~__cil_tmp9~27 (_ bv1073741802 32)) (_ bv0 32)) (= (bvadd ~setEventCalled~0 (_ bv4294967295 32)) (_ bv0 32))) (or .cse0 .cse6 (or (not (= (_ bv1 32) |old(~s~0)|)) (not (= (bvadd ~compRegistered~0 (_ bv4294967295 32)) (_ bv0 32))) .cse2 .cse5))) (or .cse0 .cse3 .cse6 .cse1 .cse2 .cse4 .cse5))) [2018-11-10 05:32:01,683 INFO L425 ceAbstractionStarter]: For program point L21675(lines 21675 21693) no Hoare annotation was computed. [2018-11-10 05:32:01,683 INFO L425 ceAbstractionStarter]: For program point L21675-1(lines 21674 21742) no Hoare annotation was computed. [2018-11-10 05:32:01,683 INFO L425 ceAbstractionStarter]: For program point L5948-1(line 5948) no Hoare annotation was computed. [2018-11-10 05:32:01,683 INFO L421 ceAbstractionStarter]: At program point L5948(line 5948) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,683 INFO L425 ceAbstractionStarter]: For program point L5684(lines 5684 6667) no Hoare annotation was computed. [2018-11-10 05:32:01,698 INFO L421 ceAbstractionStarter]: At program point L6576(lines 6571 6577) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,698 INFO L421 ceAbstractionStarter]: At program point L6444(line 6444) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,698 INFO L421 ceAbstractionStarter]: At program point L6246loopEntry(lines 6246 6249) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (_ bv0 32) ~pended~0))) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))) (and .cse0 .cse1 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32))))) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,698 INFO L425 ceAbstractionStarter]: For program point L6312(lines 6312 6317) no Hoare annotation was computed. [2018-11-10 05:32:01,698 INFO L425 ceAbstractionStarter]: For program point L6180-1(lines 6180 6267) no Hoare annotation was computed. [2018-11-10 05:32:01,698 INFO L425 ceAbstractionStarter]: For program point L6246-1(lines 6246 6249) no Hoare annotation was computed. [2018-11-10 05:32:01,699 INFO L421 ceAbstractionStarter]: At program point L6081(lines 6076 6082) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,699 INFO L421 ceAbstractionStarter]: At program point L6180-3(lines 6180 6267) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (_ bv0 32) ~pended~0))) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))) (and .cse0 .cse1 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32))))) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,699 INFO L421 ceAbstractionStarter]: At program point L5685(lines 5684 6667) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,699 INFO L425 ceAbstractionStarter]: For program point L6181(line 6181) no Hoare annotation was computed. [2018-11-10 05:32:01,712 INFO L425 ceAbstractionStarter]: For program point L5950(lines 5950 5962) no Hoare annotation was computed. [2018-11-10 05:32:01,712 INFO L421 ceAbstractionStarter]: At program point L6710(line 6710) the Hoare annotation is: (let ((.cse3 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse0 (= (_ bv1 32) ~s~0)) (.cse5 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (_ bv0 32) ~pended~0))) (let ((.cse2 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32))) (.cse4 (and (let ((.cse6 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32)))) (.cse7 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))) (.cse8 (= (_ bv0 32) ~compRegistered~0))) (or (and .cse0 .cse1 .cse6 .cse7 .cse3 .cse8) (and .cse0 .cse5 .cse1 .cse6 .cse7 .cse8))) (= FloppyDeviceControl_~__cil_tmp488~0 (_ bv0 32))))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741789 32)) (_ bv0 32))) (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) .cse1) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32)))) (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741101 32)) (_ bv0 32)))) .cse3) (and .cse4 .cse2) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse4) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~pended~0) (or (and .cse0 .cse5) (and .cse0 .cse3)))))) [2018-11-10 05:32:01,712 INFO L425 ceAbstractionStarter]: For program point L5687(lines 5687 6666) no Hoare annotation was computed. [2018-11-10 05:32:01,712 INFO L425 ceAbstractionStarter]: For program point L6678(lines 6678 6717) no Hoare annotation was computed. [2018-11-10 05:32:01,713 INFO L421 ceAbstractionStarter]: At program point L6678-1(lines 6678 6717) the Hoare annotation is: (let ((.cse2 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse0 (= (_ bv1 32) ~s~0)) (.cse4 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse1 (= (_ bv0 32) ~pended~0))) (let ((.cse3 (let ((.cse5 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32)))) (.cse6 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))) (.cse7 (= (_ bv0 32) ~compRegistered~0))) (or (and .cse0 .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse4 .cse1 .cse5 .cse6 .cse7))))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741789 32)) (_ bv0 32))) (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) .cse1) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32)))) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741101 32)) (_ bv0 32)))) .cse2) (and (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~pended~0) (or (and .cse0 .cse4) (and .cse0 .cse2))) (and (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse3)))) [2018-11-10 05:32:01,713 INFO L421 ceAbstractionStarter]: At program point L6414(line 6414) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,727 INFO L421 ceAbstractionStarter]: At program point L6513(line 6513) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,728 INFO L425 ceAbstractionStarter]: For program point L6018(lines 6018 6047) no Hoare annotation was computed. [2018-11-10 05:32:01,728 INFO L425 ceAbstractionStarter]: For program point L6084(line 6084) no Hoare annotation was computed. [2018-11-10 05:32:01,728 INFO L425 ceAbstractionStarter]: For program point L5952-1(lines 5952 5955) no Hoare annotation was computed. [2018-11-10 05:32:01,728 INFO L425 ceAbstractionStarter]: For program point L5985(lines 5985 5990) no Hoare annotation was computed. [2018-11-10 05:32:01,728 INFO L421 ceAbstractionStarter]: At program point L5952loopEntry(lines 5952 5955) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,728 INFO L425 ceAbstractionStarter]: For program point L6679(lines 6679 6707) no Hoare annotation was computed. [2018-11-10 05:32:01,728 INFO L421 ceAbstractionStarter]: At program point L5688(lines 5687 6666) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,728 INFO L421 ceAbstractionStarter]: At program point L6613(lines 5717 6656) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,728 INFO L421 ceAbstractionStarter]: At program point L6250(lines 6245 6251) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (let ((.cse0 (= (_ bv1 32) ~s~0)) (.cse1 (= (_ bv0 32) ~pended~0))) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32))) (and .cse0 .cse1 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32))))) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,728 INFO L421 ceAbstractionStarter]: At program point L6349-1(line 6349) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,736 INFO L421 ceAbstractionStarter]: At program point L6349(line 6349) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,736 INFO L421 ceAbstractionStarter]: At program point L5557(line 5557) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,736 INFO L425 ceAbstractionStarter]: For program point L5557-1(line 5557) no Hoare annotation was computed. [2018-11-10 05:32:01,736 INFO L425 ceAbstractionStarter]: For program point L6350(line 6350) no Hoare annotation was computed. [2018-11-10 05:32:01,736 INFO L421 ceAbstractionStarter]: At program point L6053(lines 5693 6664) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,736 INFO L425 ceAbstractionStarter]: For program point L5690(lines 5690 6665) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6186(lines 6186 6190) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6285(lines 6285 6555) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6153-2(lines 6153 6171) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6153(lines 6153 6171) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6186-1(lines 6186 6190) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L5823(lines 5823 5840) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L425 ceAbstractionStarter]: For program point L6682(lines 6682 6706) no Hoare annotation was computed. [2018-11-10 05:32:01,737 INFO L421 ceAbstractionStarter]: At program point L5890(line 5890) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,737 INFO L421 ceAbstractionStarter]: At program point L5956(lines 5951 5957) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L421 ceAbstractionStarter]: At program point L5890-1(line 5890) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L421 ceAbstractionStarter]: At program point L6650(line 6650) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv3 32) ~s~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L6584(lines 6584 6596) no Hoare annotation was computed. [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L6650-1(line 6650) no Hoare annotation was computed. [2018-11-10 05:32:01,746 INFO L421 ceAbstractionStarter]: At program point L6287loopEntry(lines 6287 6290) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L6287-1(lines 6287 6290) no Hoare annotation was computed. [2018-11-10 05:32:01,746 INFO L421 ceAbstractionStarter]: At program point L6155loopEntry(lines 6155 6158) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L6155-1(lines 6155 6158) no Hoare annotation was computed. [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L5891(line 5891) no Hoare annotation was computed. [2018-11-10 05:32:01,746 INFO L421 ceAbstractionStarter]: At program point L6618(line 6618) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,746 INFO L425 ceAbstractionStarter]: For program point L5693(lines 5693 6664) no Hoare annotation was computed. [2018-11-10 05:32:01,747 INFO L425 ceAbstractionStarter]: For program point L6618-1(lines 6614 6620) no Hoare annotation was computed. [2018-11-10 05:32:01,747 INFO L421 ceAbstractionStarter]: At program point L6586loopEntry(lines 6586 6589) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,766 INFO L425 ceAbstractionStarter]: For program point L6685(lines 6685 6705) no Hoare annotation was computed. [2018-11-10 05:32:01,766 INFO L425 ceAbstractionStarter]: For program point L6586-1(lines 6586 6589) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 4947 6727) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L425 ceAbstractionStarter]: For program point L5728-1(lines 5728 5731) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L5728loopEntry(lines 5728 5731) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,767 INFO L425 ceAbstractionStarter]: For program point L6455(lines 6455 6464) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L425 ceAbstractionStarter]: For program point L6323-1(lines 6323 6324) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L6323(lines 6323 6324) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,767 INFO L425 ceAbstractionStarter]: For program point L6389-1(lines 6389 6391) no Hoare annotation was computed. [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L6389(lines 6389 6391) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L5795(line 5795) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L5795-1(line 5795) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,767 INFO L421 ceAbstractionStarter]: At program point L6654(lines 5533 6726) the Hoare annotation is: (let ((.cse1 (= (_ bv0 32) ~pended~0)) (.cse7 (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32))) (.cse0 (= (_ bv1 32) ~s~0)) (.cse2 (= ~PagingReferenceCount~0 (_ bv0 32)))) (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741789 32)) (_ bv0 32))) (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) .cse1) (or (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741811 32)) (_ bv0 32))) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv2147483643 32)) (_ bv0 32)))) (and .cse0 .cse1 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741101 32)) (_ bv0 32)))) .cse2) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (let ((.cse3 (let ((.cse4 (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32)))) (.cse5 (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32))) (.cse6 (= (_ bv0 32) ~compRegistered~0))) (or (and .cse0 .cse1 .cse4 .cse5 .cse2 .cse6) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6))))) (or (and (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3) (and (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse3))) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~pended~0) (or (and .cse0 .cse7) (and .cse0 .cse2))))) [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5630(lines 5630 5672) no Hoare annotation was computed. [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5696(lines 5696 6663) no Hoare annotation was computed. [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5564-2(lines 5564 5591) no Hoare annotation was computed. [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5564(lines 5564 5591) no Hoare annotation was computed. [2018-11-10 05:32:01,790 INFO L421 ceAbstractionStarter]: At program point L6291(lines 6286 6292) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,790 INFO L421 ceAbstractionStarter]: At program point L6159(lines 6154 6160) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,790 INFO L421 ceAbstractionStarter]: At program point L6093(lines 5708 6659) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5862(lines 5862 5872) no Hoare annotation was computed. [2018-11-10 05:32:01,790 INFO L425 ceAbstractionStarter]: For program point L5928(lines 5928 5940) no Hoare annotation was computed. [2018-11-10 05:32:01,791 INFO L425 ceAbstractionStarter]: For program point L5796(line 5796) no Hoare annotation was computed. [2018-11-10 05:32:01,791 INFO L425 ceAbstractionStarter]: For program point L5631(lines 5631 5637) no Hoare annotation was computed. [2018-11-10 05:32:01,801 INFO L421 ceAbstractionStarter]: At program point L5598(line 5598) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,802 INFO L425 ceAbstractionStarter]: For program point L6688(lines 6688 6704) no Hoare annotation was computed. [2018-11-10 05:32:01,802 INFO L425 ceAbstractionStarter]: For program point L6523-1(line 6523) no Hoare annotation was computed. [2018-11-10 05:32:01,802 INFO L421 ceAbstractionStarter]: At program point L6523(line 6523) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (let ((.cse0 (let ((.cse5 (bvsge FloppyDeviceControl_~ntStatus~2 (_ bv0 32)))) (or (and (= (bvadd FloppyDeviceControl_~__cil_tmp384~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5) (and (= FloppyDeviceControl_~__cil_tmp384~0 (_ bv0 32)) (not .cse5))))) (.cse1 (= (_ bv1 32) ~s~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse4 (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|))) (or (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3 .cse4))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,802 INFO L425 ceAbstractionStarter]: For program point L5598-1(line 5598) no Hoare annotation was computed. [2018-11-10 05:32:01,802 INFO L421 ceAbstractionStarter]: At program point L6061(lines 5696 6663) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,802 INFO L425 ceAbstractionStarter]: For program point L6028(lines 6028 6045) no Hoare annotation was computed. [2018-11-10 05:32:01,802 INFO L421 ceAbstractionStarter]: At program point L6590(lines 6585 6591) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,802 INFO L421 ceAbstractionStarter]: At program point L6557(lines 5714 6657) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,802 INFO L425 ceAbstractionStarter]: For program point L6425(lines 6425 6468) no Hoare annotation was computed. [2018-11-10 05:32:01,802 INFO L421 ceAbstractionStarter]: At program point L5930loopEntry(lines 5930 5933) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,811 INFO L425 ceAbstractionStarter]: For program point L5930-1(lines 5930 5933) no Hoare annotation was computed. [2018-11-10 05:32:01,811 INFO L425 ceAbstractionStarter]: For program point L5699(lines 5699 6662) no Hoare annotation was computed. [2018-11-10 05:32:01,812 INFO L421 ceAbstractionStarter]: At program point L5732(lines 5727 5733) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,812 INFO L421 ceAbstractionStarter]: At program point L6459(line 6459) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,812 INFO L425 ceAbstractionStarter]: For program point L6525-1(line 6525) no Hoare annotation was computed. [2018-11-10 05:32:01,812 INFO L421 ceAbstractionStarter]: At program point L6525(line 6525) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (let ((.cse0 (let ((.cse5 (bvsge FloppyDeviceControl_~ntStatus~2 (_ bv0 32)))) (or (and (= (bvadd FloppyDeviceControl_~__cil_tmp384~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5) (and (= FloppyDeviceControl_~__cil_tmp384~0 (_ bv0 32)) (not .cse5))))) (.cse1 (= (_ bv1 32) ~s~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse4 (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|))) (or (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3 .cse4))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,812 INFO L425 ceAbstractionStarter]: For program point L6327(lines 6327 6332) no Hoare annotation was computed. [2018-11-10 05:32:01,812 INFO L421 ceAbstractionStarter]: At program point L5667(line 5667) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv3 32) ~s~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,812 INFO L425 ceAbstractionStarter]: For program point L5667-1(line 5667) no Hoare annotation was computed. [2018-11-10 05:32:01,812 INFO L425 ceAbstractionStarter]: For program point L6691(lines 6691 6703) no Hoare annotation was computed. [2018-11-10 05:32:01,812 INFO L421 ceAbstractionStarter]: At program point L5535loopEntry(lines 5535 5538) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,820 INFO L425 ceAbstractionStarter]: For program point L5535-1(lines 5535 5538) no Hoare annotation was computed. [2018-11-10 05:32:01,820 INFO L425 ceAbstractionStarter]: For program point L6130(lines 6130 6142) no Hoare annotation was computed. [2018-11-10 05:32:01,820 INFO L425 ceAbstractionStarter]: For program point L5767(lines 5767 5777) no Hoare annotation was computed. [2018-11-10 05:32:01,820 INFO L425 ceAbstractionStarter]: For program point L5833(lines 5833 5838) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L421 ceAbstractionStarter]: At program point L5635(line 5635) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L5635-1(lines 5631 5637) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L6395(lines 6395 6403) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L5702(lines 5702 6661) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L421 ceAbstractionStarter]: At program point L6429(line 6429) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741275 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L6132-1(lines 6132 6135) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L421 ceAbstractionStarter]: At program point L6132loopEntry(lines 6132 6135) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,821 INFO L421 ceAbstractionStarter]: At program point L5934(lines 5929 5935) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L6694(lines 6694 6702) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L425 ceAbstractionStarter]: For program point L6100-1(lines 6100 6103) no Hoare annotation was computed. [2018-11-10 05:32:01,821 INFO L421 ceAbstractionStarter]: At program point L6100loopEntry(lines 6100 6103) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,829 INFO L425 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 4947 6727) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L421 ceAbstractionStarter]: At program point L5539(lines 5534 5540) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L5605(lines 5605 5622) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L421 ceAbstractionStarter]: At program point L6398(line 6398) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (and (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= FloppyDeviceControl_~__cil_tmp384~0 (_ bv0 32)) (= ~PagingReferenceCount~0 (_ bv0 32)) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (= |old(~s~0)| ~s~0)) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L6299(lines 6299 6304) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L5705(lines 5705 6660) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L421 ceAbstractionStarter]: At program point L6069(lines 5699 6662) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,830 INFO L421 ceAbstractionStarter]: At program point L5706(lines 5705 6660) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L6697-2(lines 6678 6715) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L6697(lines 6697 6701) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L425 ceAbstractionStarter]: For program point L6367-1(line 6367) no Hoare annotation was computed. [2018-11-10 05:32:01,830 INFO L421 ceAbstractionStarter]: At program point L6367(line 6367) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,840 INFO L421 ceAbstractionStarter]: At program point L6136(lines 6131 6137) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,841 INFO L425 ceAbstractionStarter]: For program point L5740(lines 5740 5745) no Hoare annotation was computed. [2018-11-10 05:32:01,841 INFO L425 ceAbstractionStarter]: For program point L6599-1(lines 6599 6602) no Hoare annotation was computed. [2018-11-10 05:32:01,841 INFO L421 ceAbstractionStarter]: At program point L6599loopEntry(lines 6599 6602) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,841 INFO L421 ceAbstractionStarter]: At program point L6533-1(line 6533) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (let ((.cse0 (let ((.cse5 (bvsge FloppyDeviceControl_~ntStatus~2 (_ bv0 32)))) (or (and (= (bvadd FloppyDeviceControl_~__cil_tmp384~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5) (and (= FloppyDeviceControl_~__cil_tmp384~0 (_ bv0 32)) (not .cse5))))) (.cse1 (= (_ bv1 32) ~s~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse4 (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|))) (or (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3 .cse4))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,841 INFO L421 ceAbstractionStarter]: At program point L6533(line 6533) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (let ((.cse0 (let ((.cse5 (bvsge FloppyDeviceControl_~ntStatus~2 (_ bv0 32)))) (or (and (= (bvadd FloppyDeviceControl_~__cil_tmp384~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5) (and (= FloppyDeviceControl_~__cil_tmp384~0 (_ bv0 32)) (not .cse5))))) (.cse1 (= (_ bv1 32) ~s~0)) (.cse2 (= (_ bv0 32) ~pended~0)) (.cse3 (= ~PagingReferenceCount~0 (_ bv0 32))) (.cse4 (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|))) (or (and .cse0 (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741823 32)) (_ bv0 32)) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 (= FloppyDeviceControl_~ntStatus~2 (_ bv0 32)) .cse3 .cse4))) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,841 INFO L425 ceAbstractionStarter]: For program point L6038(lines 6038 6043) no Hoare annotation was computed. [2018-11-10 05:32:01,841 INFO L421 ceAbstractionStarter]: At program point L6104(lines 6099 6105) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L5708(lines 5708 6659) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L6534(line 6534) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point $Ultimate##43(lines 5719 6655) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point $Ultimate##42(lines 5719 6655) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L5576(lines 5576 5587) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L6336-1(line 6336) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L421 ceAbstractionStarter]: At program point L6336(line 6336) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0) (= FloppyDeviceControl_~valueName~0.base |~#_SLAM_alloc_dummy~0.base|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,848 INFO L421 ceAbstractionStarter]: At program point L5578(line 5578) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L5578-1(line 5578) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L5711(lines 5711 6658) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L6570(lines 6570 6611) no Hoare annotation was computed. [2018-11-10 05:32:01,848 INFO L421 ceAbstractionStarter]: At program point L6603(lines 6598 6604) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,848 INFO L425 ceAbstractionStarter]: For program point L6504(lines 6504 6518) no Hoare annotation was computed. [2018-11-10 05:32:01,849 INFO L425 ceAbstractionStarter]: For program point L5976(lines 5976 6051) no Hoare annotation was computed. [2018-11-10 05:32:01,849 INFO L425 ceAbstractionStarter]: For program point L5811(lines 5811 5814) no Hoare annotation was computed. [2018-11-10 05:32:01,849 INFO L425 ceAbstractionStarter]: For program point L6670(lines 6670 6724) no Hoare annotation was computed. [2018-11-10 05:32:01,849 INFO L421 ceAbstractionStarter]: At program point L5712(lines 5711 6658) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,852 INFO L421 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 4947 6727) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,852 INFO L425 ceAbstractionStarter]: For program point L6572-1(lines 6572 6575) no Hoare annotation was computed. [2018-11-10 05:32:01,852 INFO L421 ceAbstractionStarter]: At program point L6572loopEntry(lines 6572 6575) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,852 INFO L425 ceAbstractionStarter]: For program point L6440(lines 6440 6466) no Hoare annotation was computed. [2018-11-10 05:32:01,852 INFO L421 ceAbstractionStarter]: At program point L6077loopEntry(lines 6077 6080) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,852 INFO L425 ceAbstractionStarter]: For program point L6077-1(lines 6077 6080) no Hoare annotation was computed. [2018-11-10 05:32:01,852 INFO L421 ceAbstractionStarter]: At program point L5912(lines 5690 6665) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (and (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= |old(~s~0)| ~s~0)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,852 INFO L425 ceAbstractionStarter]: For program point L5714(lines 5714 6657) no Hoare annotation was computed. [2018-11-10 05:32:01,852 INFO L425 ceAbstractionStarter]: For program point L6606(line 6606) no Hoare annotation was computed. [2018-11-10 05:32:01,852 INFO L421 ceAbstractionStarter]: At program point L5582(line 5582) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= (_ bv2 32) ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (bvadd FloppyDeviceControl_~ntStatus~2 (_ bv1073741536 32)) (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-10 05:32:01,853 INFO L425 ceAbstractionStarter]: For program point L5681(lines 5681 6668) no Hoare annotation was computed. [2018-11-10 05:32:01,853 INFO L425 ceAbstractionStarter]: For program point L5582-1(line 5582) no Hoare annotation was computed. [2018-11-10 05:32:01,853 INFO L421 ceAbstractionStarter]: At program point L5682(lines 5681 6668) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,860 INFO L421 ceAbstractionStarter]: At program point L5815(lines 5810 5816) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,861 INFO L421 ceAbstractionStarter]: At program point L5617(line 5617) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point L5617-1(line 5617) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point L6410(lines 6410 6470) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point ExReleaseFastMutexFINAL(lines 21164 21170) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L428 ceAbstractionStarter]: At program point ExReleaseFastMutexENTRY(lines 21164 21170) the Hoare annotation is: true [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point ExReleaseFastMutexEXIT(lines 21164 21170) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~s~0)| ~s~0) [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point L11(lines 11 12) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 9 14) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L428 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 9 14) the Hoare annotation is: true [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 9 14) no Hoare annotation was computed. [2018-11-10 05:32:01,861 INFO L421 ceAbstractionStarter]: At program point L20342(line 20342) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,861 INFO L425 ceAbstractionStarter]: For program point L20342-1(line 20342) no Hoare annotation was computed. [2018-11-10 05:32:01,862 INFO L421 ceAbstractionStarter]: At program point L20466(line 20466) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-10 05:32:01,870 INFO L425 ceAbstractionStarter]: For program point L20383(lines 20383 20414) no Hoare annotation was computed. [2018-11-10 05:32:01,870 INFO L425 ceAbstractionStarter]: For program point L20379-1(line 20379) no Hoare annotation was computed. [2018-11-10 05:32:01,870 INFO L421 ceAbstractionStarter]: At program point L20379(line 20379) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,870 INFO L425 ceAbstractionStarter]: For program point L20400(lines 20400 20407) no Hoare annotation was computed. [2018-11-10 05:32:01,870 INFO L425 ceAbstractionStarter]: For program point L20466-1(line 20466) no Hoare annotation was computed. [2018-11-10 05:32:01,870 INFO L421 ceAbstractionStarter]: At program point L20400-2(lines 20400 20407) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= (_ bv2 32) ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,870 INFO L421 ceAbstractionStarter]: At program point L20396(line 20396) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,870 INFO L425 ceAbstractionStarter]: For program point L20363-1(line 20363) no Hoare annotation was computed. [2018-11-10 05:32:01,871 INFO L421 ceAbstractionStarter]: At program point L20363(line 20363) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,871 INFO L421 ceAbstractionStarter]: At program point L20396-1(line 20396) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0) (= (_ bv2 32) ~s~0))) [2018-11-10 05:32:01,871 INFO L425 ceAbstractionStarter]: For program point L20409(line 20409) no Hoare annotation was computed. [2018-11-10 05:32:01,871 INFO L421 ceAbstractionStarter]: At program point L20417(lines 20370 20470) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,881 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 20268 20475) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20451-1(lines 20447 20453) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L421 ceAbstractionStarter]: At program point L20451(line 20451) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20397(line 20397) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20447(lines 20447 20453) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L421 ceAbstractionStarter]: At program point L20348(line 20348) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 20268 20475) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L421 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 20268 20475) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv1 32) ~s~0) (= (_ bv0 32) ~pended~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,882 INFO L421 ceAbstractionStarter]: At program point L20345-1(lines 20345 20352) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (not (= (_ bv0 32) |old(~pended~0)|)) (and (= (_ bv1 32) ~s~0) (= (bvadd ~PagingReferenceCount~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) ~pended~0))) [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20345(lines 20345 20352) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20370(lines 20370 20470) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L425 ceAbstractionStarter]: For program point L20403-1(line 20403) no Hoare annotation was computed. [2018-11-10 05:32:01,882 INFO L421 ceAbstractionStarter]: At program point L20403(line 20403) the Hoare annotation is: (or (not (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.offset|)) (not (= (_ bv1 32) |old(~s~0)|)) (not (= |old(~PagingReferenceCount~0)| (_ bv0 32))) (not (= ~compRegistered~0 (_ bv0 32))) (= (_ bv0 32) |~#_SLAM_alloc_dummy~0.base|) (and (= (_ bv0 32) ~pended~0) (= (_ bv2 32) ~s~0) (= ~PagingReferenceCount~0 (_ bv0 32))) (not (= (_ bv0 32) |old(~pended~0)|))) [2018-11-10 05:32:01,883 INFO L425 ceAbstractionStarter]: For program point L20354(line 20354) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point L20370-1(lines 20370 20470) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 21174 21188) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 21174 21188) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 21174 21188) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point L21183(line 21183) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point L21183-1(line 21183) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point L4352(lines 4351 4375) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point L4346(lines 4345 4377) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point L4348(lines 4348 4376) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point L4342(lines 4342 4378) no Hoare annotation was computed. [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point L4373(lines 4353 4374) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L428 ceAbstractionStarter]: At program point L4340(lines 4339 4379) the Hoare annotation is: true [2018-11-10 05:32:01,889 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 4177 4520) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point L4336(lines 4336 4380) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 4353 4374) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point $Ultimate##13(lines 4353 4374) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L428 ceAbstractionStarter]: At program point L4349(lines 4348 4376) the Hoare annotation is: true [2018-11-10 05:32:01,890 INFO L428 ceAbstractionStarter]: At program point L4343(lines 4342 4378) the Hoare annotation is: true [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point L4345(lines 4345 4377) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point L4339(lines 4339 4379) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L428 ceAbstractionStarter]: At program point L4337(lines 4336 4380) the Hoare annotation is: true [2018-11-10 05:32:01,890 INFO L428 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 4177 4520) the Hoare annotation is: true [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point L4323(lines 4323 4327) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 4177 4520) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,890 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~myStatus~0 (_ bv0 32)) (= (_ bv0 32) ~pended~0) (not (= |~#_SLAM_alloc_dummy~0.base| (_ bv0 32))) (= |~#_SLAM_alloc_dummy~0.offset| (_ bv0 32)) (= ~PagingReferenceCount~0 (_ bv0 32)) (= (_ bv0 32) ~s~0) (= (_ bv0 32) ~compRegistered~0)) [2018-11-10 05:32:01,890 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 05:32:01,901 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 05:32:01,901 INFO L428 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 22268 22288) the Hoare annotation is: true [2018-11-10 05:32:01,901 INFO L428 ceAbstractionStarter]: At program point L22273(lines 22272 22286) the Hoare annotation is: true [2018-11-10 05:32:01,901 INFO L425 ceAbstractionStarter]: For program point L22272(lines 22272 22286) no Hoare annotation was computed. [2018-11-10 05:32:01,901 INFO L425 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 22268 22288) no Hoare annotation was computed. [2018-11-10 05:32:01,901 INFO L428 ceAbstractionStarter]: At program point L22276(lines 22275 22285) the Hoare annotation is: true [2018-11-10 05:32:01,902 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 22277 22284) no Hoare annotation was computed. [2018-11-10 05:32:01,902 INFO L425 ceAbstractionStarter]: For program point L22283(lines 22268 22288) no Hoare annotation was computed. [2018-11-10 05:32:01,902 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 22277 22284) no Hoare annotation was computed. [2018-11-10 05:32:02,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:32:02 BoogieIcfgContainer [2018-11-10 05:32:02,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:32:02,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:32:02,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:32:02,017 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:32:02,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:25:28" (3/4) ... [2018-11-10 05:32:02,023 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~TO~~NTSTATUS~0 [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlInitUnicodeString [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoStartNextPowerIrp [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExFreePool [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-10 05:32:02,031 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetHardErrorOrVerifyDevice [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDetachDevice [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure MmResetDriverPaging [2018-11-10 05:32:02,032 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ObfDereferenceObject [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeInitializeEvent [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlFreeUnicodeString [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-10 05:32:02,033 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~X~~PUNICODE_STRING~0~TO~~NTSTATUS~0 [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDEVICE_OBJECT~0~X~~PIRP~0~X~~PVOID~0~TO~~NTSTATUS~0 [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure MmPageEntireDriver [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure malloc [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~~PDRIVER_OBJECT~0~TO~VOID [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteDevice [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAcquireFastMutex [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-10 05:32:02,034 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExReleaseFastMutex [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-10 05:32:02,035 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-10 05:32:02,137 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2685 nodes and edges [2018-11-10 05:32:02,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1441 nodes and edges [2018-11-10 05:32:02,156 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 909 nodes and edges [2018-11-10 05:32:02,163 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-11-10 05:32:02,167 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 05:32:02,206 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || (((((((0bv32 == pended && 4bv32 == s) && status == lowerDriverReturn) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || (((2bv32 == s && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || 0bv32 == s) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (((((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && PagingReferenceCount == 0bv32) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((((0bv32 == pended && 2bv32 == s) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || ((((4bv32 == s && 1bv32 == pended) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || (status == lowerDriverReturn && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (1bv32 == pended && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || 0bv32 == s) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || (((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(0bv32 == \old(s)) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && 3221225473bv32 == status)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (1bv32 == pended && ((((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32)) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32)))) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || (status == lowerDriverReturn && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || !(0bv32 == _SLAM_alloc_dummy)) || (!~bvsge32(status, 0bv32) && ((((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32)) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32)))) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483631bv32) == 0bv32)) || (1bv32 == pended && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && status == 0bv32)) || (4bv32 == s && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741275bv32) == 0bv32)) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((~bvadd16(status, 1073741789bv32) == 0bv32 && !(6bv32 == s)) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741101bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || (1bv32 == s && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended))) && (((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || 1bv32 == s)) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || (1bv32 == s && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended))) && (((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || 1bv32 == s)) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) [2018-11-10 05:32:02,207 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((2bv32 == s && 3221225473bv32 == ntStatus) && 0bv32 == compRegistered) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && 2bv32 == s) && 1bv32 == compRegistered)) || ((((lowerDriverReturn == ntStatus && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 4bv32 == s) && 0bv32 == compRegistered)) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && !~bvsge32(ntStatus, 0bv32)) && 0bv32 == pended) && 2bv32 == s) && 1bv32 == compRegistered)) || ((4bv32 == s && 1bv32 == pended) && 0bv32 == compRegistered)) || ((((6bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && ((((((3221225473bv32 == returnVal2 && 5bv32 == s) || (0bv32 == returnVal2 && 5bv32 == s)) && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((myStatus == 0bv32 || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || !(\old(myStatus) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || !(0bv32 == \old(pended)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 1bv32 == compRegistered) && \old(s) == s)) [2018-11-10 05:32:02,208 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || !(\old(myStatus) == 0bv32)) || myStatus == 0bv32) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((((__cil_tmp17 == 0bv32 && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || !(0bv32 == \old(pended)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((__cil_tmp17 == 0bv32 && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && \old(s) == s)) [2018-11-10 05:32:02,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,209 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(3bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || !(0bv32 == _SLAM_alloc_dummy)) || !(0bv32 == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) || !(0bv32 == \old(pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || !(0bv32 == _SLAM_alloc_dummy)) || !(0bv32 == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) || !(0bv32 == \old(pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,210 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || (((((((0bv32 == pended && 4bv32 == s) && status == lowerDriverReturn) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || (((2bv32 == s && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (((((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && PagingReferenceCount == 0bv32) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((((0bv32 == pended && 2bv32 == s) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || ((((4bv32 == s && 1bv32 == pended) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,211 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || ((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && !(3bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended)) && ((~bvadd16(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s) || (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(s)) || 1bv32 == s [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741789bv32) == 0bv32) || ((1bv32 == s && ~bvadd16(ntStatus, 1073741275bv32) == 0bv32) && 0bv32 == pended)) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741811bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32)) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741101bv32) == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (ntStatus == 0bv32 && ((((((1bv32 == s && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered))) || (~bvadd16(ntStatus, 1073741823bv32) == 0bv32 && ((((((1bv32 == s && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered)))) || !(0bv32 == \old(pended))) || (1bv32 == pended && ((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) || (1bv32 == s && PagingReferenceCount == 0bv32))) [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(s)) || 1bv32 == s [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,212 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,213 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,213 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,213 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,214 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (1bv32 == s && PagingReferenceCount == 0bv32)) || (1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) [2018-11-10 05:32:02,215 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || (1bv32 == s && PagingReferenceCount == 0bv32) [2018-11-10 05:32:02,215 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) [2018-11-10 05:32:02,217 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,217 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,217 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,217 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,218 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,219 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && 0bv32 == InterfaceType) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ntStatus == 0bv32) || ((((!~bvsge32(ntStatus, 0bv32) && 1bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered)) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ntStatus == 0bv32) || ((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 3221225473bv32 == ntStatus) && 1bv32 == compRegistered)) || (((((!~bvsge32(ntStatus, 0bv32) && 1bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32)) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,234 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s [2018-11-10 05:32:02,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,273 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s [2018-11-10 05:32:02,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,274 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) [2018-11-10 05:32:02,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) [2018-11-10 05:32:02,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,291 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,292 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,294 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,295 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) [2018-11-10 05:32:02,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,296 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) && ntStatus == 0bv32) [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,297 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,298 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,299 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,301 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,302 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,302 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,303 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32) && PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,303 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32) && PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,304 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,304 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,304 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,306 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) [2018-11-10 05:32:02,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,307 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,309 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,310 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((0bv32 == pended && 0bv32 == ntStatus) && PagingReferenceCount == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,310 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((0bv32 == pended && 0bv32 == ntStatus) && PagingReferenceCount == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) [2018-11-10 05:32:02,311 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:02,311 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) [2018-11-10 05:32:03,852 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9289d588-2567-4dd2-9515-275dccb64078/bin-2019/utaipan/witness.graphml [2018-11-10 05:32:03,852 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:32:03,853 INFO L168 Benchmark]: Toolchain (without parser) took 437777.29 ms. Allocated memory was 1.0 GB in the beginning and 5.3 GB in the end (delta: 4.3 GB). Free memory was 926.3 MB in the beginning and 2.8 GB in the end (delta: -1.9 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,853 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:32:03,854 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3279.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 926.3 MB in the beginning and 987.5 MB in the end (delta: -61.2 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 260.98 ms. Allocated memory is still 1.3 GB. Free memory was 987.5 MB in the beginning and 929.5 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,854 INFO L168 Benchmark]: Boogie Preprocessor took 308.53 ms. Allocated memory is still 1.3 GB. Free memory was 929.5 MB in the beginning and 866.4 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,854 INFO L168 Benchmark]: RCFGBuilder took 38209.02 ms. Allocated memory was 1.3 GB in the beginning and 3.5 GB in the end (delta: 2.1 GB). Free memory was 866.4 MB in the beginning and 3.1 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,854 INFO L168 Benchmark]: TraceAbstraction took 393880.25 ms. Allocated memory was 3.5 GB in the beginning and 5.4 GB in the end (delta: 1.9 GB). Free memory was 3.1 GB in the beginning and 2.5 GB in the end (delta: 615.0 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,855 INFO L168 Benchmark]: Witness Printer took 1835.60 ms. Allocated memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: -20.4 MB). Free memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: -301.0 MB). Peak memory consumption was 983.6 MB. Max. memory is 11.5 GB. [2018-11-10 05:32:03,856 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 3279.15 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 926.3 MB in the beginning and 987.5 MB in the end (delta: -61.2 MB). Peak memory consumption was 302.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 260.98 ms. Allocated memory is still 1.3 GB. Free memory was 987.5 MB in the beginning and 929.5 MB in the end (delta: 57.9 MB). Peak memory consumption was 57.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 308.53 ms. Allocated memory is still 1.3 GB. Free memory was 929.5 MB in the beginning and 866.4 MB in the end (delta: 63.2 MB). Peak memory consumption was 63.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 38209.02 ms. Allocated memory was 1.3 GB in the beginning and 3.5 GB in the end (delta: 2.1 GB). Free memory was 866.4 MB in the beginning and 3.1 GB in the end (delta: -2.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. * TraceAbstraction took 393880.25 ms. Allocated memory was 3.5 GB in the beginning and 5.4 GB in the end (delta: 1.9 GB). Free memory was 3.1 GB in the beginning and 2.5 GB in the end (delta: 615.0 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 1835.60 ms. Allocated memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: -20.4 MB). Free memory was 2.5 GB in the beginning and 2.8 GB in the end (delta: -301.0 MB). Peak memory consumption was 983.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4523]: 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: 6571]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5693]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21700]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) - InvariantResult [Line: 4690]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) - InvariantResult [Line: 4351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8216]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 6287]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8858]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 9065]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7153]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((0bv32 == pended && 0bv32 == ntStatus) && PagingReferenceCount == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 6155]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32) && PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7220]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 6585]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6100]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22250]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9185]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5714]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7254]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 21003]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6246]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22253]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21592]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8846]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 5711]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 4718]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) || !(0bv32 == \old(pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) - InvariantResult [Line: 2887]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22275]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6131]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21092]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0bv32 == \old(s)) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && 3221225473bv32 == status)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (1bv32 == pended && ((((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32)) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32)))) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || (status == lowerDriverReturn && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || !(0bv32 == _SLAM_alloc_dummy)) || (!~bvsge32(status, 0bv32) && ((((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32)) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((!(6bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && _SLAM_alloc_dummy == 0bv32)))) || (((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483631bv32) == 0bv32)) || (1bv32 == pended && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && status == 0bv32)) || (4bv32 == s && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741275bv32) == 0bv32)) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((~bvadd16(status, 1073741789bv32) == 0bv32 && !(6bv32 == s)) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET))) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || ((!(6bv32 == s) && (((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) || ((0bv32 == pended && status == lowerDriverReturn) && 0bv32 == compRegistered)) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741101bv32) == 0bv32)) || !(\old(myStatus) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8753]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 6076]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6180]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22272]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4348]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9199]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21000]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8798]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 8353]: Loop Invariant Derived loop invariant: ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ntStatus == 0bv32) || ((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 3221225473bv32 == ntStatus) && 1bv32 == compRegistered)) || (((((!~bvsge32(ntStatus, 0bv32) && 1bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32)) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 20790]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) - InvariantResult [Line: 5681]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 3021]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22101]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21595]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8747]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 21976]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21567]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21006]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(3bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || !(0bv32 == _SLAM_alloc_dummy)) || !(0bv32 == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5534]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21979]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20967]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || (((((((0bv32 == pended && 4bv32 == s) && status == lowerDriverReturn) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || (((2bv32 == s && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (((((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && PagingReferenceCount == 0bv32) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((((0bv32 == pended && 2bv32 == s) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || ((((4bv32 == s && 1bv32 == pended) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 4924]: Loop Invariant Derived loop invariant: !(1bv32 == \old(s)) || 1bv32 == s - InvariantResult [Line: 7445]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 5684]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5952]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8845]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 7232]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) - InvariantResult [Line: 5533]: Loop Invariant Derived loop invariant: (((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741789bv32) == 0bv32) || ((1bv32 == s && ~bvadd16(ntStatus, 1073741275bv32) == 0bv32) && 0bv32 == pended)) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741811bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32)) || ((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 1073741101bv32) == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (ntStatus == 0bv32 && ((((((1bv32 == s && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered))) || (~bvadd16(ntStatus, 1073741823bv32) == 0bv32 && ((((((1bv32 == s && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && !(_SLAM_alloc_dummy == 0bv32)) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered)))) || !(0bv32 == \old(pended))) || (1bv32 == pended && ((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) || (1bv32 == s && PagingReferenceCount == 0bv32))) - InvariantResult [Line: 9231]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22012]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) - InvariantResult [Line: 5930]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 20691]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) - InvariantResult [Line: 21564]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8461]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) && ntStatus == 0bv32) - InvariantResult [Line: 8750]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 8757]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 9168]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21848]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended)) && ((~bvadd16(setEventCalled, 4294967295bv32) == 0bv32 && \old(s) == s) || (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) - InvariantResult [Line: 9251]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6599]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5727]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7715]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 7453]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 22104]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9273]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || (1bv32 == s && PagingReferenceCount == 0bv32) - InvariantResult [Line: 5687]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7226]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9064]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 4688]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) - InvariantResult [Line: 5717]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8712]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 21009]: Loop Invariant Derived loop invariant: (((((((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || !(0bv32 == _SLAM_alloc_dummy)) || !(0bv32 == \old(s))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6286]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 19959]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s - InvariantResult [Line: 21674]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && ((((((3221225473bv32 == returnVal2 && 5bv32 == s) || (0bv32 == returnVal2 && 5bv32 == s)) && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 259bv32 == returnVal2)) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) - InvariantResult [Line: 19525]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21015]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19958]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s - InvariantResult [Line: 7240]: Loop Invariant Derived loop invariant: (((((((2bv32 == s && 3221225473bv32 == ntStatus) && 0bv32 == compRegistered) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && 2bv32 == s) && 1bv32 == compRegistered)) || ((((lowerDriverReturn == ntStatus && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 4bv32 == s) && 0bv32 == compRegistered)) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && !~bvsge32(ntStatus, 0bv32)) && 0bv32 == pended) && 2bv32 == s) && 1bv32 == compRegistered)) || ((4bv32 == s && 1bv32 == pended) && 0bv32 == compRegistered)) || ((((6bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) - InvariantResult [Line: 21371]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6154]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || (((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32) && PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7154]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((0bv32 == pended && 0bv32 == ntStatus) && PagingReferenceCount == 0bv32) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 5708]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 6099]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 20691]: Loop Invariant Derived loop invariant: (((myStatus == 0bv32 || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || !(\old(myStatus) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || !(0bv32 == \old(pended)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 1bv32 == compRegistered) && \old(s) == s)) - InvariantResult [Line: 21623]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20781]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) - InvariantResult [Line: 7264]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 8185]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 5810]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8203]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 21471]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6572]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8364]: Loop Invariant Derived loop invariant: ((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8859]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 6245]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((((1bv32 == s && 0bv32 == pended) && ~bvadd16(ntStatus, 2147483643bv32) == 0bv32) || ((1bv32 == s && 0bv32 == pended) && ntStatus == 0bv32)) && PagingReferenceCount == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21012]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(s))) || ((((((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && !(3bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(myStatus) == 0bv32)) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 4336]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22195]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20370]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) - InvariantResult [Line: 8914]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 7238]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) - InvariantResult [Line: 4925]: Loop Invariant Derived loop invariant: !(1bv32 == \old(s)) || 1bv32 == s - InvariantResult [Line: 22035]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) - InvariantResult [Line: 21474]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6586]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 4716]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended)) || !(0bv32 == \old(pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || (0bv32 == pended && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended))) - InvariantResult [Line: 21078]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || (status == lowerDriverReturn && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (1bv32 == pended && (((((((((0bv32 == pended && 4bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((4bv32 == s && 0bv32 == pended) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((4bv32 == s && _SLAM_alloc_dummy == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || 0bv32 == s) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || (((((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || ((((2bv32 == s && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((0bv32 == pended && 2bv32 == s) && _SLAM_alloc_dummy == 0bv32) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 19979]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s - InvariantResult [Line: 6132]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22198]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20787]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) - InvariantResult [Line: 7235]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 6077]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 22038]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) - InvariantResult [Line: 22032]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended) - InvariantResult [Line: 4342]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19978]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || \old(s) == s - InvariantResult [Line: 9208]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7659]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) - InvariantResult [Line: 5951]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7217]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 9230]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5690]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5929]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21870]: Loop Invariant Derived loop invariant: (((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || (1bv32 == s && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended))) && (((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || 1bv32 == s)) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) - InvariantResult [Line: 6598]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 5699]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4345]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5535]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 21070]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(0bv32 == \old(s)) || (((0bv32 == pended && 2bv32 == s) && ~bvadd16(status, 1073741738bv32) == 0bv32) && 0bv32 == compRegistered)) || (~bvadd16(status, 1073741789bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((((6bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 2147483631bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (~bvadd16(status, 1073741275bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741811bv32) == 0bv32)) || (((((((0bv32 == pended && 4bv32 == s) && status == lowerDriverReturn) && PagingReferenceCount == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || !(0bv32 == _SLAM_alloc_dummy)) || (1bv32 == pended && ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) || (((2bv32 == s && PagingReferenceCount == 0bv32) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))))) || (~bvadd16(status, 1073741101bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 1073741536bv32) == 0bv32)) || (((4bv32 == s && 0bv32 == pended) && status == lowerDriverReturn) && 0bv32 == compRegistered)) || 0bv32 == s) || (((3221225473bv32 == status && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || ((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && ~bvadd16(status, 2147483643bv32) == 0bv32)) || (((((((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET)) && PagingReferenceCount == 0bv32) || (~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && ((0bv32 == pended && 2bv32 == s) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || (((((0bv32 == pended && 2bv32 == s) && PagingReferenceCount == 0bv32) && !(2bv32 == __BLAST_NONDET)) && 1bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) && !~bvsge32(status, 0bv32))) || 1bv32 == s) || !(\old(myStatus) == 0bv32)) || ((((4bv32 == s && 1bv32 == pended) && !(2bv32 == __BLAST_NONDET)) && 0bv32 == compRegistered) && !(1bv32 == __BLAST_NONDET))) || 0bv32 == _SLAM_alloc_dummy) || (2bv32 == s && status == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8432]: Loop Invariant Derived loop invariant: ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && 0bv32 == InterfaceType) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) || ((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && ntStatus == 0bv32) || ((((!~bvsge32(ntStatus, 0bv32) && 1bv32 == s) && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered)) && ~bvadd16(__cil_tmp44, 4294967184bv32) == 0bv32) - InvariantResult [Line: 2886]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20690]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || !(\old(myStatus) == 0bv32)) || myStatus == 0bv32) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((((__cil_tmp17 == 0bv32 && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered)) || !(0bv32 == \old(pended)))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(compRegistered), 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((__cil_tmp17 == 0bv32 && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 1bv32 == compRegistered) && \old(s) == s)) - InvariantResult [Line: 21374]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9119]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 8185]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(\old(PagingReferenceCount), 4294967295bv32) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 8711]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 4353]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5696]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || ((0bv32 == pended && PagingReferenceCount == 0bv32) && \old(s) == s)) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7240]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (((1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) && 0bv32 == pended) && 0bv32 == compRegistered) - InvariantResult [Line: 21697]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) - InvariantResult [Line: 21694]: Loop Invariant Derived loop invariant: ((((((((!(0bv32 == _SLAM_alloc_dummy) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(3bv32 == \old(s))) || !(0bv32 == pended)) && (((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) || !(3bv32 == \old(s)))) && (((5bv32 == s && ~bvadd16(__cil_tmp9, 1073741802bv32) == 0bv32) && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32) || (!(0bv32 == _SLAM_alloc_dummy) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || ((!(1bv32 == \old(s)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended))) && ((((((!(0bv32 == _SLAM_alloc_dummy) || 3bv32 == s) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(3bv32 == \old(s))) || !(0bv32 == pended)) - InvariantResult [Line: 5728]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 7443]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 4339]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21873]: Loop Invariant Derived loop invariant: (((((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || (1bv32 == s && ~bvadd16(setEventCalled, 4294967295bv32) == 0bv32)) && ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended))) && (((((((!(0bv32 == _SLAM_alloc_dummy) || !(6bv32 == \old(s))) || !(~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32)) || !(~bvadd16(\old(setEventCalled), 4294967295bv32) == 0bv32)) || !(~bvadd16(compRegistered, 4294967295bv32) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == pended)) || 1bv32 == s)) && (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || 1bv32 == s) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(1bv32 == pended)) - InvariantResult [Line: 7256]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(\old(compRegistered) == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || ((((~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32 && 0bv32 == pended) && 0bv32 == ntStatus) && \old(s) == s) && 0bv32 == compRegistered) - InvariantResult [Line: 21626]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9274]: Loop Invariant Derived loop invariant: ((((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || !(0bv32 == \old(pended))) || (1bv32 == s && PagingReferenceCount == 0bv32)) || (1bv32 == s && ~bvadd16(PagingReferenceCount, 4294967295bv32) == 0bv32) - InvariantResult [Line: 8796]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(PagingReferenceCount == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || 1bv32 == s) || !(0bv32 == pended) - InvariantResult [Line: 5705]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - InvariantResult [Line: 19524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3020]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9252]: Loop Invariant Derived loop invariant: (((((!(0bv32 == _SLAM_alloc_dummy) || !(1bv32 == \old(s))) || !(\old(PagingReferenceCount) == 0bv32)) || !(compRegistered == 0bv32)) || 0bv32 == _SLAM_alloc_dummy) || ((1bv32 == s && 0bv32 == pended) && PagingReferenceCount == 0bv32)) || !(0bv32 == \old(pended)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 64 procedures, 1028 locations, 1 error locations. SAFE Result, 393.7s OverallTime, 90 OverallIterations, 7 TraceHistogramMax, 272.7s AutomataDifference, 0.0s DeadEndRemovalTime, 53.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 98682 SDtfs, 17324 SDslu, 502345 SDs, 0 SdLazy, 16646 SolverSat, 693 SolverUnsat, 108 SolverUnknown, 0 SolverNotchecked, 244.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14983 GetRequests, 14240 SyntacticMatches, 10 SemanticMatches, 733 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57996occurred in iteration=50, 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: 20.7s AutomataMinimizationTime, 90 MinimizatonAttempts, 6271 StatesRemovedByMinimization, 70 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 420 LocationsWithAnnotation, 383392 PreInvPairs, 384175 NumberOfFragments, 18388 HoareAnnotationTreeSize, 383392 FomulaSimplifications, 269017 FormulaSimplificationTreeSizeReduction, 16.3s HoareSimplificationTime, 420 FomulaSimplificationsInter, 60996 FormulaSimplificationTreeSizeReductionInter, 35.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 7.9s SsaConstructionTime, 21.2s SatisfiabilityAnalysisTime, 12.3s InterpolantComputationTime, 14344 NumberOfCodeBlocks, 14344 NumberOfCodeBlocksAsserted, 92 NumberOfCheckSat, 14824 ConstructedInterpolants, 0 QuantifiedInterpolants, 3691771 SizeOfPredicates, 314 NumberOfNonLiveVariables, 100648 ConjunctsInSsa, 793 ConjunctsInUnsatCore, 94 InterpolantComputations, 90 PerfectInterpolantSequences, 2152/2160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...