./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/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 564a601a6273fd55bda5923edf4b35a694c899ec .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 23:51:18,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 23:51:18,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 23:51:18,290 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 23:51:18,291 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 23:51:18,291 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 23:51:18,293 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 23:51:18,295 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 23:51:18,296 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 23:51:18,297 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 23:51:18,298 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 23:51:18,299 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 23:51:18,299 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 23:51:18,300 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 23:51:18,302 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 23:51:18,303 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 23:51:18,303 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 23:51:18,305 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 23:51:18,307 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 23:51:18,308 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 23:51:18,310 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 23:51:18,311 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 23:51:18,313 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 23:51:18,314 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 23:51:18,314 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 23:51:18,315 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 23:51:18,316 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 23:51:18,316 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 23:51:18,318 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 23:51:18,319 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 23:51:18,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 23:51:18,320 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 23:51:18,320 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 23:51:18,320 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 23:51:18,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 23:51:18,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 23:51:18,323 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 23:51:18,336 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 23:51:18,337 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 23:51:18,338 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 23:51:18,338 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 23:51:18,338 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 23:51:18,338 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 23:51:18,338 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 23:51:18,339 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 23:51:18,339 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 23:51:18,339 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 23:51:18,339 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 23:51:18,340 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 23:51:18,340 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 23:51:18,340 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 23:51:18,340 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 23:51:18,340 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 23:51:18,341 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 23:51:18,341 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 23:51:18,341 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 23:51:18,343 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 23:51:18,343 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 23:51:18,343 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 23:51:18,343 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 23:51:18,344 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 23:51:18,344 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 23:51:18,344 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 23:51:18,344 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 23:51:18,344 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 23:51:18,345 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 23:51:18,346 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_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/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 -> 564a601a6273fd55bda5923edf4b35a694c899ec [2018-10-26 23:51:18,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 23:51:18,389 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 23:51:18,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 23:51:18,394 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 23:51:18,394 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 23:51:18,395 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 23:51:18,449 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/data/37ccad9a0/a6848bbf00754d8e9f8cb4f49e740610/FLAGd8129183e [2018-10-26 23:51:18,915 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 23:51:18,916 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 23:51:18,927 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/data/37ccad9a0/a6848bbf00754d8e9f8cb4f49e740610/FLAGd8129183e [2018-10-26 23:51:18,941 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/data/37ccad9a0/a6848bbf00754d8e9f8cb4f49e740610 [2018-10-26 23:51:18,944 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 23:51:18,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 23:51:18,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 23:51:18,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 23:51:18,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 23:51:18,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:51:18" (1/1) ... [2018-10-26 23:51:18,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544a334a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:18, skipping insertion in model container [2018-10-26 23:51:18,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 11:51:18" (1/1) ... [2018-10-26 23:51:18,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 23:51:19,013 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 23:51:19,333 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:51:19,345 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 23:51:19,474 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 23:51:19,500 INFO L193 MainTranslator]: Completed translation [2018-10-26 23:51:19,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19 WrapperNode [2018-10-26 23:51:19,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 23:51:19,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 23:51:19,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 23:51:19,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 23:51:19,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 23:51:19,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 23:51:19,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 23:51:19,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 23:51:19,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,714 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... [2018-10-26 23:51:19,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 23:51:19,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 23:51:19,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 23:51:19,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 23:51:19,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/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-10-26 23:51:19,823 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-10-26 23:51:19,829 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-10-26 23:51:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 23:51:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 23:51:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2018-10-26 23:51:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2018-10-26 23:51:19,830 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-10-26 23:51:19,830 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-10-26 23:51:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-10-26 23:51:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-10-26 23:51:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2018-10-26 23:51:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2018-10-26 23:51:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-10-26 23:51:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-10-26 23:51:19,831 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-10-26 23:51:19,831 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-10-26 23:51:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-10-26 23:51:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-10-26 23:51:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-10-26 23:51:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-10-26 23:51:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-10-26 23:51:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-10-26 23:51:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2018-10-26 23:51:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2018-10-26 23:51:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2018-10-26 23:51:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2018-10-26 23:51:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2018-10-26 23:51:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2018-10-26 23:51:19,837 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2018-10-26 23:51:19,837 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2018-10-26 23:51:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2018-10-26 23:51:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2018-10-26 23:51:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-10-26 23:51:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-10-26 23:51:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2018-10-26 23:51:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2018-10-26 23:51:19,838 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2018-10-26 23:51:19,838 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2018-10-26 23:51:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2018-10-26 23:51:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2018-10-26 23:51:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2018-10-26 23:51:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2018-10-26 23:51:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-10-26 23:51:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-10-26 23:51:19,839 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2018-10-26 23:51:19,839 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2018-10-26 23:51:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2018-10-26 23:51:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2018-10-26 23:51:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 23:51:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 23:51:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 23:51:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 23:51:19,840 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2018-10-26 23:51:19,840 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2018-10-26 23:51:20,244 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:20,252 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:20,622 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:20,622 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:20,802 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:20,803 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:20,863 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:20,863 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:21,596 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:21,597 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:21,889 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 23:51:21,889 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 23:51:22,024 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 23:51:22,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:51:22 BoogieIcfgContainer [2018-10-26 23:51:22,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 23:51:22,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 23:51:22,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 23:51:22,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 23:51:22,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 11:51:18" (1/3) ... [2018-10-26 23:51:22,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb309bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:51:22, skipping insertion in model container [2018-10-26 23:51:22,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 11:51:19" (2/3) ... [2018-10-26 23:51:22,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cb309bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 11:51:22, skipping insertion in model container [2018-10-26 23:51:22,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:51:22" (3/3) ... [2018-10-26 23:51:22,034 INFO L112 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-10-26 23:51:22,045 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 23:51:22,056 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 23:51:22,072 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 23:51:22,106 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 23:51:22,106 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 23:51:22,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 23:51:22,106 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 23:51:22,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 23:51:22,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 23:51:22,107 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 23:51:22,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 23:51:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states. [2018-10-26 23:51:22,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 23:51:22,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:22,137 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] [2018-10-26 23:51:22,139 INFO L424 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 429432288, now seen corresponding path program 1 times [2018-10-26 23:51:22,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:22,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:22,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:22,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:22,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:22,393 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:22,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:22,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:22,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:22,415 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 3 states. [2018-10-26 23:51:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:22,663 INFO L93 Difference]: Finished difference Result 538 states and 781 transitions. [2018-10-26 23:51:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:22,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 23:51:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:22,679 INFO L225 Difference]: With dead ends: 538 [2018-10-26 23:51:22,679 INFO L226 Difference]: Without dead ends: 288 [2018-10-26 23:51:22,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-26 23:51:22,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-10-26 23:51:22,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-26 23:51:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 384 transitions. [2018-10-26 23:51:22,758 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 384 transitions. Word has length 20 [2018-10-26 23:51:22,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:22,759 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 384 transitions. [2018-10-26 23:51:22,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 384 transitions. [2018-10-26 23:51:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 23:51:22,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:22,761 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] [2018-10-26 23:51:22,761 INFO L424 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:22,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:22,761 INFO L82 PathProgramCache]: Analyzing trace with hash 486707221, now seen corresponding path program 1 times [2018-10-26 23:51:22,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:22,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:22,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:22,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:22,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:22,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:22,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:22,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:22,973 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:22,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:22,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:22,975 INFO L87 Difference]: Start difference. First operand 288 states and 384 transitions. Second operand 3 states. [2018-10-26 23:51:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:23,579 INFO L93 Difference]: Finished difference Result 638 states and 883 transitions. [2018-10-26 23:51:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:23,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 23:51:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:23,589 INFO L225 Difference]: With dead ends: 638 [2018-10-26 23:51:23,592 INFO L226 Difference]: Without dead ends: 455 [2018-10-26 23:51:23,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-26 23:51:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 435. [2018-10-26 23:51:23,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-26 23:51:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 598 transitions. [2018-10-26 23:51:23,683 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 598 transitions. Word has length 25 [2018-10-26 23:51:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:23,686 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 598 transitions. [2018-10-26 23:51:23,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 598 transitions. [2018-10-26 23:51:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 23:51:23,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:23,688 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] [2018-10-26 23:51:23,688 INFO L424 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:23,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 833919549, now seen corresponding path program 1 times [2018-10-26 23:51:23,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:23,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:23,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:23,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:23,694 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:23,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:23,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:23,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:23,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:23,899 INFO L87 Difference]: Start difference. First operand 435 states and 598 transitions. Second operand 3 states. [2018-10-26 23:51:24,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:24,029 INFO L93 Difference]: Finished difference Result 964 states and 1384 transitions. [2018-10-26 23:51:24,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:24,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 23:51:24,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:24,036 INFO L225 Difference]: With dead ends: 964 [2018-10-26 23:51:24,036 INFO L226 Difference]: Without dead ends: 647 [2018-10-26 23:51:24,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-26 23:51:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-10-26 23:51:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 607. [2018-10-26 23:51:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-26 23:51:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 868 transitions. [2018-10-26 23:51:24,088 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 868 transitions. Word has length 31 [2018-10-26 23:51:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:24,089 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 868 transitions. [2018-10-26 23:51:24,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 868 transitions. [2018-10-26 23:51:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-26 23:51:24,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:24,091 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] [2018-10-26 23:51:24,092 INFO L424 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:24,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash -240377495, now seen corresponding path program 1 times [2018-10-26 23:51:24,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:24,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:24,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:24,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:24,094 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:24,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:24,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:24,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:24,208 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:24,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:24,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:24,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:24,211 INFO L87 Difference]: Start difference. First operand 607 states and 868 transitions. Second operand 3 states. [2018-10-26 23:51:24,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:24,574 INFO L93 Difference]: Finished difference Result 622 states and 888 transitions. [2018-10-26 23:51:24,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:24,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-26 23:51:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:24,584 INFO L225 Difference]: With dead ends: 622 [2018-10-26 23:51:24,584 INFO L226 Difference]: Without dead ends: 618 [2018-10-26 23:51:24,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-10-26 23:51:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-26 23:51:24,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 617. [2018-10-26 23:51:24,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-10-26 23:51:24,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 881 transitions. [2018-10-26 23:51:24,628 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 881 transitions. Word has length 36 [2018-10-26 23:51:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:24,629 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 881 transitions. [2018-10-26 23:51:24,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 881 transitions. [2018-10-26 23:51:24,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 23:51:24,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:24,631 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] [2018-10-26 23:51:24,632 INFO L424 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:24,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:24,632 INFO L82 PathProgramCache]: Analyzing trace with hash -503394420, now seen corresponding path program 1 times [2018-10-26 23:51:24,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:24,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:24,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:24,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:24,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:24,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:24,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:24,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:24,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:24,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:24,739 INFO L87 Difference]: Start difference. First operand 617 states and 881 transitions. Second operand 3 states. [2018-10-26 23:51:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:25,080 INFO L93 Difference]: Finished difference Result 1073 states and 1584 transitions. [2018-10-26 23:51:25,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:25,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-26 23:51:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:25,087 INFO L225 Difference]: With dead ends: 1073 [2018-10-26 23:51:25,087 INFO L226 Difference]: Without dead ends: 1054 [2018-10-26 23:51:25,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2018-10-26 23:51:25,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1024. [2018-10-26 23:51:25,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-26 23:51:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1525 transitions. [2018-10-26 23:51:25,173 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1525 transitions. Word has length 39 [2018-10-26 23:51:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:25,175 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1525 transitions. [2018-10-26 23:51:25,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1525 transitions. [2018-10-26 23:51:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-26 23:51:25,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:25,177 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] [2018-10-26 23:51:25,177 INFO L424 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:25,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash -517739329, now seen corresponding path program 1 times [2018-10-26 23:51:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:25,178 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:25,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:25,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:25,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:25,276 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:25,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:25,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:25,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:25,277 INFO L87 Difference]: Start difference. First operand 1024 states and 1525 transitions. Second operand 3 states. [2018-10-26 23:51:25,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:25,571 INFO L93 Difference]: Finished difference Result 1051 states and 1555 transitions. [2018-10-26 23:51:25,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:25,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-10-26 23:51:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:25,580 INFO L225 Difference]: With dead ends: 1051 [2018-10-26 23:51:25,580 INFO L226 Difference]: Without dead ends: 1046 [2018-10-26 23:51:25,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:25,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2018-10-26 23:51:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 1044. [2018-10-26 23:51:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2018-10-26 23:51:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1547 transitions. [2018-10-26 23:51:25,649 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1547 transitions. Word has length 39 [2018-10-26 23:51:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:25,649 INFO L481 AbstractCegarLoop]: Abstraction has 1044 states and 1547 transitions. [2018-10-26 23:51:25,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1547 transitions. [2018-10-26 23:51:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-26 23:51:25,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:25,654 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] [2018-10-26 23:51:25,654 INFO L424 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:25,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:25,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1582675753, now seen corresponding path program 1 times [2018-10-26 23:51:25,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:25,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:25,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:25,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:25,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:25,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:25,924 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:25,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:25,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:25,925 INFO L87 Difference]: Start difference. First operand 1044 states and 1547 transitions. Second operand 5 states. [2018-10-26 23:51:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:26,178 INFO L93 Difference]: Finished difference Result 1059 states and 1565 transitions. [2018-10-26 23:51:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:26,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-10-26 23:51:26,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:26,188 INFO L225 Difference]: With dead ends: 1059 [2018-10-26 23:51:26,188 INFO L226 Difference]: Without dead ends: 1037 [2018-10-26 23:51:26,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:26,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-26 23:51:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2018-10-26 23:51:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-10-26 23:51:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1538 transitions. [2018-10-26 23:51:26,245 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1538 transitions. Word has length 40 [2018-10-26 23:51:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:26,246 INFO L481 AbstractCegarLoop]: Abstraction has 1037 states and 1538 transitions. [2018-10-26 23:51:26,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1538 transitions. [2018-10-26 23:51:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:51:26,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:26,247 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] [2018-10-26 23:51:26,247 INFO L424 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:26,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash 707123715, now seen corresponding path program 1 times [2018-10-26 23:51:26,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:26,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:26,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:26,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:26,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:26,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:26,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:26,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:26,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:26,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:26,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:26,353 INFO L87 Difference]: Start difference. First operand 1037 states and 1538 transitions. Second operand 3 states. [2018-10-26 23:51:26,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:26,430 INFO L93 Difference]: Finished difference Result 1449 states and 2196 transitions. [2018-10-26 23:51:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:26,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-10-26 23:51:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:26,435 INFO L225 Difference]: With dead ends: 1449 [2018-10-26 23:51:26,435 INFO L226 Difference]: Without dead ends: 579 [2018-10-26 23:51:26,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-26 23:51:26,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2018-10-26 23:51:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-26 23:51:26,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 824 transitions. [2018-10-26 23:51:26,476 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 824 transitions. Word has length 45 [2018-10-26 23:51:26,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:26,476 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 824 transitions. [2018-10-26 23:51:26,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 824 transitions. [2018-10-26 23:51:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-26 23:51:26,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:26,479 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-10-26 23:51:26,479 INFO L424 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:26,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1198649472, now seen corresponding path program 1 times [2018-10-26 23:51:26,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:26,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:26,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:26,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:26,481 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:26,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:26,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:26,703 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:26,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:26,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:26,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:26,704 INFO L87 Difference]: Start difference. First operand 579 states and 824 transitions. Second operand 5 states. [2018-10-26 23:51:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:29,580 INFO L93 Difference]: Finished difference Result 587 states and 830 transitions. [2018-10-26 23:51:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:29,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-26 23:51:29,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:29,585 INFO L225 Difference]: With dead ends: 587 [2018-10-26 23:51:29,585 INFO L226 Difference]: Without dead ends: 581 [2018-10-26 23:51:29,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-10-26 23:51:29,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-10-26 23:51:29,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-26 23:51:29,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 823 transitions. [2018-10-26 23:51:29,622 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 823 transitions. Word has length 44 [2018-10-26 23:51:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:29,622 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 823 transitions. [2018-10-26 23:51:29,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 823 transitions. [2018-10-26 23:51:29,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-26 23:51:29,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:29,623 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] [2018-10-26 23:51:29,624 INFO L424 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:29,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:29,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1909267444, now seen corresponding path program 1 times [2018-10-26 23:51:29,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:29,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:29,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:29,625 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:29,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:29,783 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:29,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:29,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:29,784 INFO L87 Difference]: Start difference. First operand 579 states and 823 transitions. Second operand 5 states. [2018-10-26 23:51:30,148 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2018-10-26 23:51:30,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:30,833 INFO L93 Difference]: Finished difference Result 587 states and 829 transitions. [2018-10-26 23:51:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:30,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-10-26 23:51:30,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:30,841 INFO L225 Difference]: With dead ends: 587 [2018-10-26 23:51:30,841 INFO L226 Difference]: Without dead ends: 581 [2018-10-26 23:51:30,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:30,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-10-26 23:51:30,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2018-10-26 23:51:30,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-26 23:51:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 822 transitions. [2018-10-26 23:51:30,877 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 822 transitions. Word has length 45 [2018-10-26 23:51:30,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:30,878 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 822 transitions. [2018-10-26 23:51:30,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 822 transitions. [2018-10-26 23:51:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 23:51:30,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:30,880 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] [2018-10-26 23:51:30,881 INFO L424 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:30,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash -887211863, now seen corresponding path program 1 times [2018-10-26 23:51:30,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:30,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:30,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:30,885 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:31,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:31,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:31,294 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:31,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:31,295 INFO L87 Difference]: Start difference. First operand 579 states and 822 transitions. Second operand 6 states. [2018-10-26 23:51:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:31,800 INFO L93 Difference]: Finished difference Result 602 states and 847 transitions. [2018-10-26 23:51:31,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:51:31,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-26 23:51:31,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:31,805 INFO L225 Difference]: With dead ends: 602 [2018-10-26 23:51:31,806 INFO L226 Difference]: Without dead ends: 577 [2018-10-26 23:51:31,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:31,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-26 23:51:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2018-10-26 23:51:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2018-10-26 23:51:31,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 817 transitions. [2018-10-26 23:51:31,847 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 817 transitions. Word has length 46 [2018-10-26 23:51:31,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:31,847 INFO L481 AbstractCegarLoop]: Abstraction has 577 states and 817 transitions. [2018-10-26 23:51:31,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:31,848 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 817 transitions. [2018-10-26 23:51:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-26 23:51:31,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:31,848 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] [2018-10-26 23:51:31,849 INFO L424 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:31,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash -394845831, now seen corresponding path program 1 times [2018-10-26 23:51:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:31,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:31,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:31,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:31,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:31,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:31,951 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:31,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:31,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:31,952 INFO L87 Difference]: Start difference. First operand 577 states and 817 transitions. Second operand 3 states. [2018-10-26 23:51:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:32,123 INFO L93 Difference]: Finished difference Result 811 states and 1202 transitions. [2018-10-26 23:51:32,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:32,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-10-26 23:51:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:32,128 INFO L225 Difference]: With dead ends: 811 [2018-10-26 23:51:32,128 INFO L226 Difference]: Without dead ends: 803 [2018-10-26 23:51:32,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-10-26 23:51:32,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 646. [2018-10-26 23:51:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2018-10-26 23:51:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 920 transitions. [2018-10-26 23:51:32,171 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 920 transitions. Word has length 46 [2018-10-26 23:51:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:32,172 INFO L481 AbstractCegarLoop]: Abstraction has 646 states and 920 transitions. [2018-10-26 23:51:32,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 920 transitions. [2018-10-26 23:51:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 23:51:32,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:32,173 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] [2018-10-26 23:51:32,173 INFO L424 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:32,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:32,176 INFO L82 PathProgramCache]: Analyzing trace with hash 800744817, now seen corresponding path program 1 times [2018-10-26 23:51:32,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:32,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:32,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:32,177 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:32,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:32,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:51:32,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:32,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:51:32,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:51:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:51:32,300 INFO L87 Difference]: Start difference. First operand 646 states and 920 transitions. Second operand 4 states. [2018-10-26 23:51:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:32,593 INFO L93 Difference]: Finished difference Result 720 states and 993 transitions. [2018-10-26 23:51:32,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:51:32,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-26 23:51:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:32,595 INFO L225 Difference]: With dead ends: 720 [2018-10-26 23:51:32,595 INFO L226 Difference]: Without dead ends: 453 [2018-10-26 23:51:32,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:51:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-10-26 23:51:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 432. [2018-10-26 23:51:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-26 23:51:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 564 transitions. [2018-10-26 23:51:32,622 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 564 transitions. Word has length 49 [2018-10-26 23:51:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:32,623 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 564 transitions. [2018-10-26 23:51:32,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:51:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 564 transitions. [2018-10-26 23:51:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 23:51:32,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:32,624 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] [2018-10-26 23:51:32,625 INFO L424 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:32,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:32,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1097683725, now seen corresponding path program 1 times [2018-10-26 23:51:32,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:32,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:32,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:32,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:32,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:32,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:32,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:51:32,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:32,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:51:32,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:51:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:32,823 INFO L87 Difference]: Start difference. First operand 432 states and 564 transitions. Second operand 8 states. [2018-10-26 23:51:33,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:33,019 INFO L93 Difference]: Finished difference Result 448 states and 583 transitions. [2018-10-26 23:51:33,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:51:33,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-10-26 23:51:33,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:33,022 INFO L225 Difference]: With dead ends: 448 [2018-10-26 23:51:33,022 INFO L226 Difference]: Without dead ends: 444 [2018-10-26 23:51:33,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:51:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-26 23:51:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2018-10-26 23:51:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-26 23:51:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 575 transitions. [2018-10-26 23:51:33,049 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 575 transitions. Word has length 47 [2018-10-26 23:51:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:33,050 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 575 transitions. [2018-10-26 23:51:33,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:51:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 575 transitions. [2018-10-26 23:51:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-26 23:51:33,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:33,051 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] [2018-10-26 23:51:33,052 INFO L424 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:33,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1097406895, now seen corresponding path program 1 times [2018-10-26 23:51:33,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:33,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:33,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:33,053 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:33,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:33,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:51:33,367 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:33,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:51:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:51:33,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:33,368 INFO L87 Difference]: Start difference. First operand 440 states and 575 transitions. Second operand 8 states. [2018-10-26 23:51:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:33,976 INFO L93 Difference]: Finished difference Result 761 states and 1041 transitions. [2018-10-26 23:51:33,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:51:33,977 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-10-26 23:51:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:33,981 INFO L225 Difference]: With dead ends: 761 [2018-10-26 23:51:33,983 INFO L226 Difference]: Without dead ends: 463 [2018-10-26 23:51:33,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:51:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-10-26 23:51:34,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 450. [2018-10-26 23:51:34,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-26 23:51:34,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 590 transitions. [2018-10-26 23:51:34,045 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 590 transitions. Word has length 47 [2018-10-26 23:51:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:34,045 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 590 transitions. [2018-10-26 23:51:34,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:51:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 590 transitions. [2018-10-26 23:51:34,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-26 23:51:34,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:34,050 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] [2018-10-26 23:51:34,050 INFO L424 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:34,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:34,050 INFO L82 PathProgramCache]: Analyzing trace with hash -601026871, now seen corresponding path program 1 times [2018-10-26 23:51:34,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:34,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:34,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:34,051 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:34,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:34,248 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:34,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:34,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:34,248 INFO L87 Difference]: Start difference. First operand 450 states and 590 transitions. Second operand 5 states. [2018-10-26 23:51:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:34,973 INFO L93 Difference]: Finished difference Result 581 states and 795 transitions. [2018-10-26 23:51:34,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:34,973 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-26 23:51:34,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:34,976 INFO L225 Difference]: With dead ends: 581 [2018-10-26 23:51:34,976 INFO L226 Difference]: Without dead ends: 562 [2018-10-26 23:51:34,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-26 23:51:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 435. [2018-10-26 23:51:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-26 23:51:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 569 transitions. [2018-10-26 23:51:35,008 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 569 transitions. Word has length 48 [2018-10-26 23:51:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:35,009 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 569 transitions. [2018-10-26 23:51:35,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 569 transitions. [2018-10-26 23:51:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 23:51:35,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:35,012 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] [2018-10-26 23:51:35,012 INFO L424 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:35,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1969665150, now seen corresponding path program 1 times [2018-10-26 23:51:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:35,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:35,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,014 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:35,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:51:35,418 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:35,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:51:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:51:35,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:35,419 INFO L87 Difference]: Start difference. First operand 435 states and 569 transitions. Second operand 8 states. [2018-10-26 23:51:35,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:35,579 INFO L93 Difference]: Finished difference Result 449 states and 585 transitions. [2018-10-26 23:51:35,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:51:35,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-26 23:51:35,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:35,582 INFO L225 Difference]: With dead ends: 449 [2018-10-26 23:51:35,582 INFO L226 Difference]: Without dead ends: 418 [2018-10-26 23:51:35,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:51:35,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-26 23:51:35,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-10-26 23:51:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-26 23:51:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 548 transitions. [2018-10-26 23:51:35,610 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 548 transitions. Word has length 49 [2018-10-26 23:51:35,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:35,610 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 548 transitions. [2018-10-26 23:51:35,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:51:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 548 transitions. [2018-10-26 23:51:35,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-26 23:51:35,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:35,611 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] [2018-10-26 23:51:35,611 INFO L424 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:35,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:35,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1552038818, now seen corresponding path program 1 times [2018-10-26 23:51:35,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:35,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:35,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,613 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:35,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:35,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:51:35,818 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:35,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:51:35,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:51:35,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:35,819 INFO L87 Difference]: Start difference. First operand 418 states and 548 transitions. Second operand 8 states. [2018-10-26 23:51:35,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:35,937 INFO L93 Difference]: Finished difference Result 448 states and 586 transitions. [2018-10-26 23:51:35,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:51:35,945 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-10-26 23:51:35,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:35,948 INFO L225 Difference]: With dead ends: 448 [2018-10-26 23:51:35,948 INFO L226 Difference]: Without dead ends: 427 [2018-10-26 23:51:35,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:51:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-26 23:51:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 419. [2018-10-26 23:51:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-26 23:51:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 551 transitions. [2018-10-26 23:51:35,975 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 551 transitions. Word has length 50 [2018-10-26 23:51:35,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:35,976 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 551 transitions. [2018-10-26 23:51:35,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:51:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 551 transitions. [2018-10-26 23:51:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:51:35,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:35,977 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] [2018-10-26 23:51:35,980 INFO L424 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:35,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1495835496, now seen corresponding path program 1 times [2018-10-26 23:51:35,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:35,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:35,983 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:36,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:36,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:36,360 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:36,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:36,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:36,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:36,360 INFO L87 Difference]: Start difference. First operand 419 states and 551 transitions. Second operand 6 states. [2018-10-26 23:51:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:36,723 INFO L93 Difference]: Finished difference Result 434 states and 567 transitions. [2018-10-26 23:51:36,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:36,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-10-26 23:51:36,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:36,727 INFO L225 Difference]: With dead ends: 434 [2018-10-26 23:51:36,727 INFO L226 Difference]: Without dead ends: 400 [2018-10-26 23:51:36,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:36,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-26 23:51:36,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-10-26 23:51:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-26 23:51:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 530 transitions. [2018-10-26 23:51:36,753 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 530 transitions. Word has length 51 [2018-10-26 23:51:36,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:36,753 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 530 transitions. [2018-10-26 23:51:36,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:36,753 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 530 transitions. [2018-10-26 23:51:36,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:51:36,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:36,754 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] [2018-10-26 23:51:36,754 INFO L424 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:36,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash -569080061, now seen corresponding path program 1 times [2018-10-26 23:51:36,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:36,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:36,755 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:36,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:36,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 23:51:36,920 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:36,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 23:51:36,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 23:51:36,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 23:51:36,920 INFO L87 Difference]: Start difference. First operand 400 states and 530 transitions. Second operand 4 states. [2018-10-26 23:51:37,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:37,261 INFO L93 Difference]: Finished difference Result 436 states and 570 transitions. [2018-10-26 23:51:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 23:51:37,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-10-26 23:51:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:37,263 INFO L225 Difference]: With dead ends: 436 [2018-10-26 23:51:37,264 INFO L226 Difference]: Without dead ends: 410 [2018-10-26 23:51:37,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-26 23:51:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-10-26 23:51:37,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-26 23:51:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-10-26 23:51:37,290 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 51 [2018-10-26 23:51:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:37,290 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-10-26 23:51:37,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 23:51:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-10-26 23:51:37,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:51:37,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:37,291 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] [2018-10-26 23:51:37,291 INFO L424 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:37,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:37,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1731742529, now seen corresponding path program 1 times [2018-10-26 23:51:37,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:37,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:37,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:37,292 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:37,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:37,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:51:37,635 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:37,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:51:37,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:51:37,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:37,635 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 7 states. [2018-10-26 23:51:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:38,848 INFO L93 Difference]: Finished difference Result 565 states and 794 transitions. [2018-10-26 23:51:38,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-26 23:51:38,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2018-10-26 23:51:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:38,851 INFO L225 Difference]: With dead ends: 565 [2018-10-26 23:51:38,851 INFO L226 Difference]: Without dead ends: 511 [2018-10-26 23:51:38,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:51:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-26 23:51:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 503. [2018-10-26 23:51:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-26 23:51:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 717 transitions. [2018-10-26 23:51:38,888 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 717 transitions. Word has length 51 [2018-10-26 23:51:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:38,888 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 717 transitions. [2018-10-26 23:51:38,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:51:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 717 transitions. [2018-10-26 23:51:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-26 23:51:38,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:38,892 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] [2018-10-26 23:51:38,893 INFO L424 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:38,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1878435331, now seen corresponding path program 1 times [2018-10-26 23:51:38,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:38,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:38,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:38,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:38,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:38,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:38,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:38,976 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:38,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:38,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:38,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:38,977 INFO L87 Difference]: Start difference. First operand 503 states and 717 transitions. Second operand 3 states. [2018-10-26 23:51:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:39,316 INFO L93 Difference]: Finished difference Result 673 states and 1007 transitions. [2018-10-26 23:51:39,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:39,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-10-26 23:51:39,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:39,321 INFO L225 Difference]: With dead ends: 673 [2018-10-26 23:51:39,322 INFO L226 Difference]: Without dead ends: 659 [2018-10-26 23:51:39,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-26 23:51:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 575. [2018-10-26 23:51:39,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-10-26 23:51:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 846 transitions. [2018-10-26 23:51:39,370 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 846 transitions. Word has length 51 [2018-10-26 23:51:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:39,370 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 846 transitions. [2018-10-26 23:51:39,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 846 transitions. [2018-10-26 23:51:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-26 23:51:39,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:39,371 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] [2018-10-26 23:51:39,372 INFO L424 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:39,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:39,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1445321115, now seen corresponding path program 1 times [2018-10-26 23:51:39,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:39,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:39,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:39,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:39,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:39,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:39,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 23:51:39,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:39,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 23:51:39,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 23:51:39,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:39,698 INFO L87 Difference]: Start difference. First operand 575 states and 846 transitions. Second operand 8 states. [2018-10-26 23:51:39,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:39,931 INFO L93 Difference]: Finished difference Result 598 states and 870 transitions. [2018-10-26 23:51:39,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 23:51:39,932 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 52 [2018-10-26 23:51:39,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:39,934 INFO L225 Difference]: With dead ends: 598 [2018-10-26 23:51:39,934 INFO L226 Difference]: Without dead ends: 574 [2018-10-26 23:51:39,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-26 23:51:39,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2018-10-26 23:51:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2018-10-26 23:51:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-10-26 23:51:39,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 844 transitions. [2018-10-26 23:51:39,980 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 844 transitions. Word has length 52 [2018-10-26 23:51:39,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:39,980 INFO L481 AbstractCegarLoop]: Abstraction has 574 states and 844 transitions. [2018-10-26 23:51:39,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 23:51:39,980 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 844 transitions. [2018-10-26 23:51:39,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-26 23:51:39,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:39,984 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] [2018-10-26 23:51:39,984 INFO L424 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:39,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:39,984 INFO L82 PathProgramCache]: Analyzing trace with hash -794377358, now seen corresponding path program 1 times [2018-10-26 23:51:39,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:39,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:39,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:39,985 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:40,133 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:40,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:40,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:40,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:40,134 INFO L87 Difference]: Start difference. First operand 574 states and 844 transitions. Second operand 5 states. [2018-10-26 23:51:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:40,603 INFO L93 Difference]: Finished difference Result 660 states and 989 transitions. [2018-10-26 23:51:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:40,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-10-26 23:51:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:40,607 INFO L225 Difference]: With dead ends: 660 [2018-10-26 23:51:40,607 INFO L226 Difference]: Without dead ends: 624 [2018-10-26 23:51:40,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-26 23:51:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 542. [2018-10-26 23:51:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-26 23:51:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 807 transitions. [2018-10-26 23:51:40,675 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 807 transitions. Word has length 53 [2018-10-26 23:51:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:40,676 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 807 transitions. [2018-10-26 23:51:40,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 807 transitions. [2018-10-26 23:51:40,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-26 23:51:40,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:40,677 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:51:40,677 INFO L424 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:40,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:40,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2111623733, now seen corresponding path program 1 times [2018-10-26 23:51:40,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:40,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:40,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:40,678 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:40,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:40,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:40,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:40,776 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:40,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:40,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:40,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:40,777 INFO L87 Difference]: Start difference. First operand 542 states and 807 transitions. Second operand 3 states. [2018-10-26 23:51:40,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:40,832 INFO L93 Difference]: Finished difference Result 955 states and 1465 transitions. [2018-10-26 23:51:40,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:40,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-10-26 23:51:40,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:40,840 INFO L225 Difference]: With dead ends: 955 [2018-10-26 23:51:40,841 INFO L226 Difference]: Without dead ends: 527 [2018-10-26 23:51:40,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-26 23:51:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-10-26 23:51:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-10-26 23:51:40,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 773 transitions. [2018-10-26 23:51:40,883 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 773 transitions. Word has length 58 [2018-10-26 23:51:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:40,883 INFO L481 AbstractCegarLoop]: Abstraction has 527 states and 773 transitions. [2018-10-26 23:51:40,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:40,884 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 773 transitions. [2018-10-26 23:51:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-26 23:51:40,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:40,884 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] [2018-10-26 23:51:40,885 INFO L424 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:40,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:40,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2098360695, now seen corresponding path program 1 times [2018-10-26 23:51:40,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:40,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:40,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:40,890 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:41,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:41,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-26 23:51:41,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:41,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-26 23:51:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-26 23:51:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:51:41,099 INFO L87 Difference]: Start difference. First operand 527 states and 773 transitions. Second operand 10 states. [2018-10-26 23:51:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:41,401 INFO L93 Difference]: Finished difference Result 529 states and 774 transitions. [2018-10-26 23:51:41,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-26 23:51:41,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-10-26 23:51:41,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:41,404 INFO L225 Difference]: With dead ends: 529 [2018-10-26 23:51:41,404 INFO L226 Difference]: Without dead ends: 466 [2018-10-26 23:51:41,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-26 23:51:41,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-10-26 23:51:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2018-10-26 23:51:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-10-26 23:51:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 705 transitions. [2018-10-26 23:51:41,437 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 705 transitions. Word has length 56 [2018-10-26 23:51:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:41,437 INFO L481 AbstractCegarLoop]: Abstraction has 466 states and 705 transitions. [2018-10-26 23:51:41,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-26 23:51:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 705 transitions. [2018-10-26 23:51:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-26 23:51:41,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:41,440 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] [2018-10-26 23:51:41,440 INFO L424 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:41,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:41,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1618550020, now seen corresponding path program 1 times [2018-10-26 23:51:41,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:41,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:41,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:41,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:41,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:41,554 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:41,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:41,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:41,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:41,555 INFO L87 Difference]: Start difference. First operand 466 states and 705 transitions. Second operand 6 states. [2018-10-26 23:51:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:41,602 INFO L93 Difference]: Finished difference Result 918 states and 1435 transitions. [2018-10-26 23:51:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:41,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-10-26 23:51:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:41,605 INFO L225 Difference]: With dead ends: 918 [2018-10-26 23:51:41,605 INFO L226 Difference]: Without dead ends: 491 [2018-10-26 23:51:41,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-10-26 23:51:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 477. [2018-10-26 23:51:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-10-26 23:51:41,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 744 transitions. [2018-10-26 23:51:41,645 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 744 transitions. Word has length 62 [2018-10-26 23:51:41,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:41,646 INFO L481 AbstractCegarLoop]: Abstraction has 477 states and 744 transitions. [2018-10-26 23:51:41,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 744 transitions. [2018-10-26 23:51:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 23:51:41,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:41,647 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] [2018-10-26 23:51:41,647 INFO L424 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:41,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:41,647 INFO L82 PathProgramCache]: Analyzing trace with hash -653889226, now seen corresponding path program 1 times [2018-10-26 23:51:41,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:41,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,648 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:41,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:41,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:41,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:41,732 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:41,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:41,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:41,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:41,733 INFO L87 Difference]: Start difference. First operand 477 states and 744 transitions. Second operand 3 states. [2018-10-26 23:51:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:41,859 INFO L93 Difference]: Finished difference Result 730 states and 1191 transitions. [2018-10-26 23:51:41,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:41,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-10-26 23:51:41,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:41,865 INFO L225 Difference]: With dead ends: 730 [2018-10-26 23:51:41,865 INFO L226 Difference]: Without dead ends: 727 [2018-10-26 23:51:41,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2018-10-26 23:51:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 483. [2018-10-26 23:51:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-26 23:51:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 753 transitions. [2018-10-26 23:51:41,915 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 753 transitions. Word has length 63 [2018-10-26 23:51:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:41,916 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 753 transitions. [2018-10-26 23:51:41,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 753 transitions. [2018-10-26 23:51:41,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 23:51:41,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:41,919 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] [2018-10-26 23:51:41,919 INFO L424 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:41,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:41,920 INFO L82 PathProgramCache]: Analyzing trace with hash 966405863, now seen corresponding path program 1 times [2018-10-26 23:51:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:41,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:41,921 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:42,294 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-10-26 23:51:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:42,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:42,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:42,298 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:42,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:42,299 INFO L87 Difference]: Start difference. First operand 483 states and 753 transitions. Second operand 5 states. [2018-10-26 23:51:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:42,847 INFO L93 Difference]: Finished difference Result 1315 states and 2222 transitions. [2018-10-26 23:51:42,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:42,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2018-10-26 23:51:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:42,852 INFO L225 Difference]: With dead ends: 1315 [2018-10-26 23:51:42,852 INFO L226 Difference]: Without dead ends: 877 [2018-10-26 23:51:42,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:42,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-10-26 23:51:42,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 558. [2018-10-26 23:51:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-10-26 23:51:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 886 transitions. [2018-10-26 23:51:42,929 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 886 transitions. Word has length 64 [2018-10-26 23:51:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:42,931 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 886 transitions. [2018-10-26 23:51:42,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 886 transitions. [2018-10-26 23:51:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 23:51:42,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:42,933 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] [2018-10-26 23:51:42,933 INFO L424 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:42,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:42,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1938989314, now seen corresponding path program 1 times [2018-10-26 23:51:42,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:42,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:42,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:42,934 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:43,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:43,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:43,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:43,533 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:43,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:43,534 INFO L87 Difference]: Start difference. First operand 558 states and 886 transitions. Second operand 6 states. [2018-10-26 23:51:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:43,688 INFO L93 Difference]: Finished difference Result 873 states and 1384 transitions. [2018-10-26 23:51:43,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:43,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-26 23:51:43,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:43,700 INFO L225 Difference]: With dead ends: 873 [2018-10-26 23:51:43,700 INFO L226 Difference]: Without dead ends: 370 [2018-10-26 23:51:43,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-26 23:51:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 340. [2018-10-26 23:51:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-26 23:51:43,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 487 transitions. [2018-10-26 23:51:43,739 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 487 transitions. Word has length 65 [2018-10-26 23:51:43,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:43,740 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 487 transitions. [2018-10-26 23:51:43,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 487 transitions. [2018-10-26 23:51:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-26 23:51:43,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:43,741 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] [2018-10-26 23:51:43,741 INFO L424 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:43,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 629278779, now seen corresponding path program 1 times [2018-10-26 23:51:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:43,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:43,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:43,747 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:44,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:44,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:44,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:44,026 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:44,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:44,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:44,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:44,027 INFO L87 Difference]: Start difference. First operand 340 states and 487 transitions. Second operand 5 states. [2018-10-26 23:51:45,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:45,260 INFO L93 Difference]: Finished difference Result 604 states and 875 transitions. [2018-10-26 23:51:45,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-26 23:51:45,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-10-26 23:51:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:45,263 INFO L225 Difference]: With dead ends: 604 [2018-10-26 23:51:45,263 INFO L226 Difference]: Without dead ends: 307 [2018-10-26 23:51:45,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:45,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-26 23:51:45,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-10-26 23:51:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-26 23:51:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 420 transitions. [2018-10-26 23:51:45,294 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 420 transitions. Word has length 69 [2018-10-26 23:51:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:45,294 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 420 transitions. [2018-10-26 23:51:45,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 420 transitions. [2018-10-26 23:51:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 23:51:45,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:45,298 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] [2018-10-26 23:51:45,298 INFO L424 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:45,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:45,298 INFO L82 PathProgramCache]: Analyzing trace with hash -892852933, now seen corresponding path program 1 times [2018-10-26 23:51:45,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:45,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:45,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:45,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:45,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:45,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 23:51:45,405 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:45,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 23:51:45,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 23:51:45,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:45,406 INFO L87 Difference]: Start difference. First operand 307 states and 420 transitions. Second operand 3 states. [2018-10-26 23:51:45,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:45,541 INFO L93 Difference]: Finished difference Result 580 states and 820 transitions. [2018-10-26 23:51:45,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 23:51:45,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-10-26 23:51:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:45,544 INFO L225 Difference]: With dead ends: 580 [2018-10-26 23:51:45,544 INFO L226 Difference]: Without dead ends: 313 [2018-10-26 23:51:45,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 23:51:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-26 23:51:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2018-10-26 23:51:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-26 23:51:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 423 transitions. [2018-10-26 23:51:45,579 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 423 transitions. Word has length 70 [2018-10-26 23:51:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:45,579 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 423 transitions. [2018-10-26 23:51:45,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 23:51:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 423 transitions. [2018-10-26 23:51:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-26 23:51:45,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:45,580 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] [2018-10-26 23:51:45,581 INFO L424 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:45,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1240019923, now seen corresponding path program 1 times [2018-10-26 23:51:45,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:45,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:45,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:45,589 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:45,937 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 4 [2018-10-26 23:51:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 23:51:46,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:46,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 23:51:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 23:51:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:46,145 INFO L87 Difference]: Start difference. First operand 310 states and 423 transitions. Second operand 7 states. [2018-10-26 23:51:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:46,806 INFO L93 Difference]: Finished difference Result 629 states and 886 transitions. [2018-10-26 23:51:46,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:51:46,807 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-10-26 23:51:46,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:46,808 INFO L225 Difference]: With dead ends: 629 [2018-10-26 23:51:46,809 INFO L226 Difference]: Without dead ends: 381 [2018-10-26 23:51:46,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-26 23:51:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2018-10-26 23:51:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 307. [2018-10-26 23:51:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-26 23:51:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 416 transitions. [2018-10-26 23:51:46,847 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 416 transitions. Word has length 71 [2018-10-26 23:51:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:46,847 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 416 transitions. [2018-10-26 23:51:46,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 23:51:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 416 transitions. [2018-10-26 23:51:46,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-26 23:51:46,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:46,848 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] [2018-10-26 23:51:46,849 INFO L424 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:46,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:46,849 INFO L82 PathProgramCache]: Analyzing trace with hash -180378245, now seen corresponding path program 1 times [2018-10-26 23:51:46,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:46,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:46,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:46,850 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:47,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:47,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:47,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:47,033 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:47,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:47,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:47,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:47,034 INFO L87 Difference]: Start difference. First operand 307 states and 416 transitions. Second operand 5 states. [2018-10-26 23:51:47,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:47,596 INFO L93 Difference]: Finished difference Result 671 states and 934 transitions. [2018-10-26 23:51:47,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:47,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-10-26 23:51:47,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:47,599 INFO L225 Difference]: With dead ends: 671 [2018-10-26 23:51:47,599 INFO L226 Difference]: Without dead ends: 407 [2018-10-26 23:51:47,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-26 23:51:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-26 23:51:47,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 366. [2018-10-26 23:51:47,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-26 23:51:47,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 500 transitions. [2018-10-26 23:51:47,643 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 500 transitions. Word has length 70 [2018-10-26 23:51:47,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:47,644 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 500 transitions. [2018-10-26 23:51:47,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:47,644 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 500 transitions. [2018-10-26 23:51:47,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-26 23:51:47,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:47,645 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] [2018-10-26 23:51:47,649 INFO L424 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:47,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash 95902912, now seen corresponding path program 1 times [2018-10-26 23:51:47,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:47,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:47,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:47,651 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:48,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:48,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:48,108 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:48,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:48,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:48,109 INFO L87 Difference]: Start difference. First operand 366 states and 500 transitions. Second operand 6 states. [2018-10-26 23:51:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:48,379 INFO L93 Difference]: Finished difference Result 676 states and 947 transitions. [2018-10-26 23:51:48,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:48,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-10-26 23:51:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:48,384 INFO L225 Difference]: With dead ends: 676 [2018-10-26 23:51:48,384 INFO L226 Difference]: Without dead ends: 369 [2018-10-26 23:51:48,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-26 23:51:48,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-10-26 23:51:48,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-26 23:51:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 498 transitions. [2018-10-26 23:51:48,421 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 498 transitions. Word has length 72 [2018-10-26 23:51:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:48,421 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 498 transitions. [2018-10-26 23:51:48,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 498 transitions. [2018-10-26 23:51:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 23:51:48,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:48,422 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-10-26 23:51:48,423 INFO L424 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:48,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1894921490, now seen corresponding path program 1 times [2018-10-26 23:51:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:48,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:48,424 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:48,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:48,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:51:48,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:48,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:51:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:51:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:51:48,687 INFO L87 Difference]: Start difference. First operand 366 states and 498 transitions. Second operand 6 states. [2018-10-26 23:51:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:48,961 INFO L93 Difference]: Finished difference Result 642 states and 882 transitions. [2018-10-26 23:51:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 23:51:48,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2018-10-26 23:51:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:48,963 INFO L225 Difference]: With dead ends: 642 [2018-10-26 23:51:48,963 INFO L226 Difference]: Without dead ends: 337 [2018-10-26 23:51:48,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-26 23:51:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 329. [2018-10-26 23:51:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-26 23:51:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 434 transitions. [2018-10-26 23:51:48,988 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 434 transitions. Word has length 83 [2018-10-26 23:51:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:48,988 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 434 transitions. [2018-10-26 23:51:48,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:51:48,989 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 434 transitions. [2018-10-26 23:51:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 23:51:48,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:48,990 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-10-26 23:51:48,990 INFO L424 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:48,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:48,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1391891238, now seen corresponding path program 1 times [2018-10-26 23:51:48,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:48,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:48,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:48,991 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:49,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:49,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 23:51:49,529 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:49,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 23:51:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 23:51:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:51:49,530 INFO L87 Difference]: Start difference. First operand 329 states and 434 transitions. Second operand 15 states. [2018-10-26 23:51:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:49,652 INFO L93 Difference]: Finished difference Result 357 states and 465 transitions. [2018-10-26 23:51:49,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 23:51:49,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 92 [2018-10-26 23:51:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:49,655 INFO L225 Difference]: With dead ends: 357 [2018-10-26 23:51:49,655 INFO L226 Difference]: Without dead ends: 332 [2018-10-26 23:51:49,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:51:49,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-26 23:51:49,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-10-26 23:51:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-26 23:51:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 437 transitions. [2018-10-26 23:51:49,687 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 437 transitions. Word has length 92 [2018-10-26 23:51:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:49,687 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 437 transitions. [2018-10-26 23:51:49,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 23:51:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 437 transitions. [2018-10-26 23:51:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 23:51:49,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:49,689 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-10-26 23:51:49,693 INFO L424 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:49,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:49,694 INFO L82 PathProgramCache]: Analyzing trace with hash -855019982, now seen corresponding path program 1 times [2018-10-26 23:51:49,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:49,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:49,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:49,695 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:49,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:49,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 23:51:49,935 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:49,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 23:51:49,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 23:51:49,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 23:51:49,936 INFO L87 Difference]: Start difference. First operand 332 states and 437 transitions. Second operand 5 states. [2018-10-26 23:51:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:51,311 INFO L93 Difference]: Finished difference Result 726 states and 938 transitions. [2018-10-26 23:51:51,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:51:51,312 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2018-10-26 23:51:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:51,314 INFO L225 Difference]: With dead ends: 726 [2018-10-26 23:51:51,314 INFO L226 Difference]: Without dead ends: 458 [2018-10-26 23:51:51,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:51:51,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-26 23:51:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 421. [2018-10-26 23:51:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-26 23:51:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 532 transitions. [2018-10-26 23:51:51,352 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 532 transitions. Word has length 103 [2018-10-26 23:51:51,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:51,352 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 532 transitions. [2018-10-26 23:51:51,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 23:51:51,353 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 532 transitions. [2018-10-26 23:51:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 23:51:51,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:51,354 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-10-26 23:51:51,354 INFO L424 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:51,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2130346317, now seen corresponding path program 1 times [2018-10-26 23:51:51,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:51,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:51,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:51,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:51,356 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:51,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 23:51:51,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:51,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:51:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:51:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:51:51,595 INFO L87 Difference]: Start difference. First operand 421 states and 532 transitions. Second operand 14 states. [2018-10-26 23:51:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:53,248 INFO L93 Difference]: Finished difference Result 816 states and 1035 transitions. [2018-10-26 23:51:53,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 23:51:53,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-10-26 23:51:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:53,252 INFO L225 Difference]: With dead ends: 816 [2018-10-26 23:51:53,252 INFO L226 Difference]: Without dead ends: 774 [2018-10-26 23:51:53,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 23:51:53,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2018-10-26 23:51:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 521. [2018-10-26 23:51:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-26 23:51:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 639 transitions. [2018-10-26 23:51:53,320 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 639 transitions. Word has length 103 [2018-10-26 23:51:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:53,320 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 639 transitions. [2018-10-26 23:51:53,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:51:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 639 transitions. [2018-10-26 23:51:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-26 23:51:53,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:53,322 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-10-26 23:51:53,322 INFO L424 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:53,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:53,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2136120689, now seen corresponding path program 1 times [2018-10-26 23:51:53,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:53,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:53,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:53,324 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:53,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:53,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:53,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 23:51:53,731 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:53,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:51:53,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:51:53,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:51:53,732 INFO L87 Difference]: Start difference. First operand 521 states and 639 transitions. Second operand 14 states. [2018-10-26 23:51:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:55,484 INFO L93 Difference]: Finished difference Result 797 states and 1012 transitions. [2018-10-26 23:51:55,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 23:51:55,485 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-10-26 23:51:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:55,488 INFO L225 Difference]: With dead ends: 797 [2018-10-26 23:51:55,488 INFO L226 Difference]: Without dead ends: 755 [2018-10-26 23:51:55,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2018-10-26 23:51:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-10-26 23:51:55,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 388. [2018-10-26 23:51:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-10-26 23:51:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 490 transitions. [2018-10-26 23:51:55,547 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 490 transitions. Word has length 103 [2018-10-26 23:51:55,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:55,547 INFO L481 AbstractCegarLoop]: Abstraction has 388 states and 490 transitions. [2018-10-26 23:51:55,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:51:55,548 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 490 transitions. [2018-10-26 23:51:55,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 23:51:55,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:55,553 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] [2018-10-26 23:51:55,553 INFO L424 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:55,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:55,553 INFO L82 PathProgramCache]: Analyzing trace with hash -789414125, now seen corresponding path program 1 times [2018-10-26 23:51:55,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:55,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:55,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:55,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:55,554 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:56,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:56,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-26 23:51:56,084 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:56,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-26 23:51:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-26 23:51:56,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-26 23:51:56,085 INFO L87 Difference]: Start difference. First operand 388 states and 490 transitions. Second operand 15 states. [2018-10-26 23:51:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:56,227 INFO L93 Difference]: Finished difference Result 423 states and 534 transitions. [2018-10-26 23:51:56,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-26 23:51:56,236 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2018-10-26 23:51:56,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:56,238 INFO L225 Difference]: With dead ends: 423 [2018-10-26 23:51:56,238 INFO L226 Difference]: Without dead ends: 396 [2018-10-26 23:51:56,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-10-26 23:51:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-26 23:51:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-10-26 23:51:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-26 23:51:56,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 500 transitions. [2018-10-26 23:51:56,273 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 500 transitions. Word has length 108 [2018-10-26 23:51:56,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:56,273 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 500 transitions. [2018-10-26 23:51:56,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-26 23:51:56,273 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 500 transitions. [2018-10-26 23:51:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:51:56,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:56,275 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] [2018-10-26 23:51:56,276 INFO L424 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:56,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1142573443, now seen corresponding path program 1 times [2018-10-26 23:51:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:56,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:56,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:56,277 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:56,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:56,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:56,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 23:51:56,517 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:56,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:51:56,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:51:56,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:51:56,518 INFO L87 Difference]: Start difference. First operand 396 states and 500 transitions. Second operand 14 states. [2018-10-26 23:51:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:51:57,844 INFO L93 Difference]: Finished difference Result 781 states and 987 transitions. [2018-10-26 23:51:57,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-26 23:51:57,845 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-10-26 23:51:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:51:57,848 INFO L225 Difference]: With dead ends: 781 [2018-10-26 23:51:57,848 INFO L226 Difference]: Without dead ends: 719 [2018-10-26 23:51:57,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-10-26 23:51:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-26 23:51:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 670. [2018-10-26 23:51:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-26 23:51:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 828 transitions. [2018-10-26 23:51:57,939 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 828 transitions. Word has length 120 [2018-10-26 23:51:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:51:57,939 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 828 transitions. [2018-10-26 23:51:57,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:51:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 828 transitions. [2018-10-26 23:51:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 23:51:57,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:51:57,946 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] [2018-10-26 23:51:57,946 INFO L424 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:51:57,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:51:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2113809279, now seen corresponding path program 1 times [2018-10-26 23:51:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:51:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:57,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:51:57,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:51:57,947 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:51:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:51:58,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 23:51:58,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:51:58,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-26 23:51:58,503 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:51:58,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 23:51:58,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 23:51:58,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-26 23:51:58,504 INFO L87 Difference]: Start difference. First operand 670 states and 828 transitions. Second operand 14 states. [2018-10-26 23:52:00,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:52:00,089 INFO L93 Difference]: Finished difference Result 681 states and 837 transitions. [2018-10-26 23:52:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 23:52:00,089 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2018-10-26 23:52:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:52:00,091 INFO L225 Difference]: With dead ends: 681 [2018-10-26 23:52:00,092 INFO L226 Difference]: Without dead ends: 617 [2018-10-26 23:52:00,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-10-26 23:52:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-26 23:52:00,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 275. [2018-10-26 23:52:00,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-26 23:52:00,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 327 transitions. [2018-10-26 23:52:00,123 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 327 transitions. Word has length 120 [2018-10-26 23:52:00,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:52:00,124 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 327 transitions. [2018-10-26 23:52:00,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 23:52:00,124 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 327 transitions. [2018-10-26 23:52:00,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-26 23:52:00,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:52:00,125 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:52:00,125 INFO L424 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:52:00,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:52:00,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1948082986, now seen corresponding path program 1 times [2018-10-26 23:52:00,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:52:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:52:00,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:52:00,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:52:00,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:52:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:52:00,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-10-26 23:52:00,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:52:00,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:52:00,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:52:00,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:52:00,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:52:00,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:52:00,228 INFO L87 Difference]: Start difference. First operand 275 states and 327 transitions. Second operand 6 states. [2018-10-26 23:52:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:52:00,275 INFO L93 Difference]: Finished difference Result 468 states and 581 transitions. [2018-10-26 23:52:00,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:52:00,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-26 23:52:00,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:52:00,278 INFO L225 Difference]: With dead ends: 468 [2018-10-26 23:52:00,278 INFO L226 Difference]: Without dead ends: 322 [2018-10-26 23:52:00,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:52:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-26 23:52:00,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 269. [2018-10-26 23:52:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-26 23:52:00,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 314 transitions. [2018-10-26 23:52:00,306 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 314 transitions. Word has length 121 [2018-10-26 23:52:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:52:00,306 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 314 transitions. [2018-10-26 23:52:00,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:52:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 314 transitions. [2018-10-26 23:52:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 23:52:00,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:52:00,308 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:52:00,308 INFO L424 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:52:00,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:52:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash 835839869, now seen corresponding path program 1 times [2018-10-26 23:52:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:52:00,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:52:00,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:52:00,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:52:00,313 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:52:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:52:00,466 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:52:00,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 23:52:00,467 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 23:52:00,467 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 164 with the following transitions: [2018-10-26 23:52:00,469 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [17], [22], [27], [30], [161], [162], [165], [170], [296], [301], [305], [308], [313], [316], [317], [318], [319], [320], [333], [335], [338], [342], [348], [354], [356], [358], [365], [367], [368], [369], [371], [375], [377], [384], [388], [392], [394], [398], [400], [407], [409], [434], [438], [484], [528], [543], [545], [546], [547], [550], [553], [555], [561], [564], [572], [575], [577], [582], [585], [589], [597], [600], [603], [605], [616], [617], [662], [665], [687], [688], [696], [697], [698], [699], [704], [736], [742], [743], [744], [745], [746], [747], [748], [754], [755], [758], [759], [760], [761], [764], [765], [766], [767], [794], [795], [796], [797], [800], [801], [806], [812], [813], [814] [2018-10-26 23:52:00,522 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 23:52:00,522 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 23:52:04,154 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 23:52:21,151 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-26 23:52:21,152 INFO L272 AbstractInterpreter]: Visited 88 different actions 202 times. Merged at 17 different actions 32 times. Never widened. Found 3 fixpoints after 1 different actions. Largest state had 98 variables. [2018-10-26 23:52:21,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:52:21,165 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-26 23:52:30,365 INFO L227 lantSequenceWeakener]: Weakened 110 states. On average, predicates are now at 85.14% of their original sizes. [2018-10-26 23:52:30,366 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-26 23:52:54,310 INFO L415 sIntCurrentIteration]: We unified 162 AI predicates to 162 [2018-10-26 23:52:54,310 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-26 23:52:54,311 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 23:52:54,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [73] imperfect sequences [6] total 77 [2018-10-26 23:52:54,311 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:52:54,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-26 23:52:54,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-26 23:52:54,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4997, Unknown=0, NotChecked=0, Total=5256 [2018-10-26 23:52:54,314 INFO L87 Difference]: Start difference. First operand 269 states and 314 transitions. Second operand 73 states. [2018-10-26 23:56:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:56:18,450 INFO L93 Difference]: Finished difference Result 519 states and 645 transitions. [2018-10-26 23:56:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-26 23:56:18,450 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 163 [2018-10-26 23:56:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:56:18,452 INFO L225 Difference]: With dead ends: 519 [2018-10-26 23:56:18,452 INFO L226 Difference]: Without dead ends: 365 [2018-10-26 23:56:18,456 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 250 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6412 ImplicationChecksByTransitivity, 72.4s TimeCoverageRelationStatistics Valid=1353, Invalid=24407, Unknown=0, NotChecked=0, Total=25760 [2018-10-26 23:56:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-26 23:56:18,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 281. [2018-10-26 23:56:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-26 23:56:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 328 transitions. [2018-10-26 23:56:18,646 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 328 transitions. Word has length 163 [2018-10-26 23:56:18,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:56:18,647 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 328 transitions. [2018-10-26 23:56:18,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-26 23:56:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 328 transitions. [2018-10-26 23:56:18,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-26 23:56:18,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:56:18,648 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:56:18,649 INFO L424 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:56:18,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:56:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1924226115, now seen corresponding path program 1 times [2018-10-26 23:56:18,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:56:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:18,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:56:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:18,657 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:56:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:56:18,978 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 23:56:18,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:56:18,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:56:18,979 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:56:18,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:56:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:56:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:56:18,980 INFO L87 Difference]: Start difference. First operand 281 states and 328 transitions. Second operand 6 states. [2018-10-26 23:56:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:56:19,221 INFO L93 Difference]: Finished difference Result 439 states and 520 transitions. [2018-10-26 23:56:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:56:19,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2018-10-26 23:56:19,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:56:19,223 INFO L225 Difference]: With dead ends: 439 [2018-10-26 23:56:19,223 INFO L226 Difference]: Without dead ends: 307 [2018-10-26 23:56:19,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:56:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-26 23:56:19,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 274. [2018-10-26 23:56:19,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 23:56:19,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 313 transitions. [2018-10-26 23:56:19,350 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 313 transitions. Word has length 164 [2018-10-26 23:56:19,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:56:19,350 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 313 transitions. [2018-10-26 23:56:19,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:56:19,350 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 313 transitions. [2018-10-26 23:56:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 23:56:19,351 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:56:19,352 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:56:19,352 INFO L424 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:56:19,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:56:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -31780552, now seen corresponding path program 1 times [2018-10-26 23:56:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:56:19,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:56:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:19,353 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:56:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:56:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-10-26 23:56:19,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:56:19,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:56:19,490 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:56:19,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:56:19,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:56:19,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:56:19,491 INFO L87 Difference]: Start difference. First operand 274 states and 313 transitions. Second operand 6 states. [2018-10-26 23:56:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:56:19,676 INFO L93 Difference]: Finished difference Result 330 states and 376 transitions. [2018-10-26 23:56:19,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:56:19,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2018-10-26 23:56:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:56:19,677 INFO L225 Difference]: With dead ends: 330 [2018-10-26 23:56:19,677 INFO L226 Difference]: Without dead ends: 259 [2018-10-26 23:56:19,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:56:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-26 23:56:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2018-10-26 23:56:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-26 23:56:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 277 transitions. [2018-10-26 23:56:19,781 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 277 transitions. Word has length 204 [2018-10-26 23:56:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:56:19,781 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 277 transitions. [2018-10-26 23:56:19,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:56:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 277 transitions. [2018-10-26 23:56:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-26 23:56:19,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 23:56:19,783 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 23:56:19,783 INFO L424 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 23:56:19,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 23:56:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1944923862, now seen corresponding path program 1 times [2018-10-26 23:56:19,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 23:56:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:19,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 23:56:19,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 23:56:19,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 23:56:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 23:56:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2018-10-26 23:56:20,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 23:56:20,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 23:56:20,103 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 23:56:20,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 23:56:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 23:56:20,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 23:56:20,104 INFO L87 Difference]: Start difference. First operand 245 states and 277 transitions. Second operand 6 states. [2018-10-26 23:56:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 23:56:20,233 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2018-10-26 23:56:20,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 23:56:20,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 207 [2018-10-26 23:56:20,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 23:56:20,234 INFO L225 Difference]: With dead ends: 245 [2018-10-26 23:56:20,235 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 23:56:20,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 23:56:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 23:56:20,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 23:56:20,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 23:56:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 23:56:20,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2018-10-26 23:56:20,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 23:56:20,236 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 23:56:20,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 23:56:20,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 23:56:20,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 23:56:20,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 23:56:20,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:20,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:20,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:21,741 WARN L179 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 924 DAG size of output: 905 [2018-10-26 23:56:23,239 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 943 DAG size of output: 931 [2018-10-26 23:56:23,258 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,393 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 322 [2018-10-26 23:56:23,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,533 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 322 [2018-10-26 23:56:23,539 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,542 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,662 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,674 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 346 DAG size of output: 322 [2018-10-26 23:56:23,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:23,735 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,936 WARN L179 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 969 DAG size of output: 943 [2018-10-26 23:56:24,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,944 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:24,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,039 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,202 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 335 [2018-10-26 23:56:25,318 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 433 DAG size of output: 431 [2018-10-26 23:56:25,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,934 WARN L179 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 398 [2018-10-26 23:56:25,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:25,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:26,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:26,078 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:27,425 WARN L179 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 926 DAG size of output: 909 [2018-10-26 23:56:27,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:27,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:27,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:28,532 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 942 DAG size of output: 920 [2018-10-26 23:56:28,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:28,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:28,659 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:29,545 WARN L179 SmtUtils]: Spent 915.00 ms on a formula simplification. DAG size of input: 938 DAG size of output: 916 [2018-10-26 23:56:29,710 WARN L179 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 565 DAG size of output: 557 [2018-10-26 23:56:29,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:29,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:30,576 WARN L179 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 934 DAG size of output: 917 [2018-10-26 23:56:30,673 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:30,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:30,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:30,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,085 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 1098 DAG size of output: 1082 [2018-10-26 23:56:32,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:32,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,232 WARN L179 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 969 DAG size of output: 943 [2018-10-26 23:56:33,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:33,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,350 WARN L179 SmtUtils]: Spent 906.00 ms on a formula simplification. DAG size of input: 949 DAG size of output: 937 [2018-10-26 23:56:34,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,404 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,445 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:34,954 WARN L179 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 878 DAG size of output: 860 [2018-10-26 23:56:35,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,602 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,779 WARN L179 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 854 DAG size of output: 839 [2018-10-26 23:56:35,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:35,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:36,619 WARN L179 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 930 DAG size of output: 913 [2018-10-26 23:56:36,633 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:36,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:36,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:37,478 WARN L179 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 946 DAG size of output: 924 [2018-10-26 23:56:37,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:37,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:37,707 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 604 DAG size of output: 590 [2018-10-26 23:56:37,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:37,719 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:37,934 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 604 DAG size of output: 590 [2018-10-26 23:56:37,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,050 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 570 DAG size of output: 563 [2018-10-26 23:56:38,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,273 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 604 DAG size of output: 590 [2018-10-26 23:56:38,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,501 WARN L179 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 604 DAG size of output: 590 [2018-10-26 23:56:38,513 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,533 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,643 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,720 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,765 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,939 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:38,942 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,194 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 515 DAG size of output: 503 [2018-10-26 23:56:39,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,382 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 515 DAG size of output: 503 [2018-10-26 23:56:39,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,668 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 515 DAG size of output: 503 [2018-10-26 23:56:39,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:39,859 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 515 DAG size of output: 503 [2018-10-26 23:56:40,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,083 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,111 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,268 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,541 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 365 [2018-10-26 23:56:40,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,657 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 365 [2018-10-26 23:56:40,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,784 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 376 DAG size of output: 365 [2018-10-26 23:56:40,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:40,901 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 365 [2018-10-26 23:56:40,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,219 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 378 DAG size of output: 365 [2018-10-26 23:56:41,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,235 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,412 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 489 DAG size of output: 477 [2018-10-26 23:56:41,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,657 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 487 DAG size of output: 475 [2018-10-26 23:56:41,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,962 WARN L179 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 453 DAG size of output: 436 [2018-10-26 23:56:41,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:41,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,077 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 416 [2018-10-26 23:56:42,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:42,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-26 23:56:50,966 WARN L179 SmtUtils]: Spent 8.47 s on a formula simplification. DAG size of input: 1161 DAG size of output: 143 [2018-10-26 23:56:51,481 WARN L179 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 373 DAG size of output: 85 [2018-10-26 23:57:03,433 WARN L179 SmtUtils]: Spent 11.95 s on a formula simplification. DAG size of input: 1192 DAG size of output: 163 [2018-10-26 23:57:08,475 WARN L179 SmtUtils]: Spent 4.93 s on a formula simplification. DAG size of input: 1612 DAG size of output: 88 [2018-10-26 23:57:08,977 WARN L179 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 433 DAG size of output: 104 [2018-10-26 23:57:10,001 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 552 DAG size of output: 112 [2018-10-26 23:57:10,124 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2018-10-26 23:57:10,818 WARN L179 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 594 DAG size of output: 1 [2018-10-26 23:57:10,935 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 58 [2018-10-26 23:57:12,331 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 753 DAG size of output: 147 [2018-10-26 23:57:13,418 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 501 DAG size of output: 81 [2018-10-26 23:57:15,000 WARN L179 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 716 DAG size of output: 1 [2018-10-26 23:57:15,750 WARN L179 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 375 DAG size of output: 70 [2018-10-26 23:57:16,357 WARN L179 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 438 DAG size of output: 107 [2018-10-26 23:57:24,681 WARN L179 SmtUtils]: Spent 8.27 s on a formula simplification. DAG size of input: 1169 DAG size of output: 145 [2018-10-26 23:57:33,811 WARN L179 SmtUtils]: Spent 9.13 s on a formula simplification. DAG size of input: 1176 DAG size of output: 145 [2018-10-26 23:57:35,264 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 690 DAG size of output: 123 [2018-10-26 23:57:44,000 WARN L179 SmtUtils]: Spent 8.73 s on a formula simplification. DAG size of input: 1172 DAG size of output: 145 [2018-10-26 23:57:44,115 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 412 DAG size of output: 58 [2018-10-26 23:57:46,763 WARN L179 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 878 DAG size of output: 166 [2018-10-26 23:57:55,250 WARN L179 SmtUtils]: Spent 8.48 s on a formula simplification. DAG size of input: 1177 DAG size of output: 145 [2018-10-26 23:57:56,351 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 552 DAG size of output: 114 [2018-10-26 23:57:57,060 WARN L179 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 387 DAG size of output: 126 [2018-10-26 23:57:59,102 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 533 DAG size of output: 107 [2018-10-26 23:58:02,620 WARN L179 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 674 DAG size of output: 143 [2018-10-26 23:58:03,847 WARN L179 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 463 DAG size of output: 79 [2018-10-26 23:58:18,084 WARN L179 SmtUtils]: Spent 14.21 s on a formula simplification. DAG size of input: 1341 DAG size of output: 172 [2018-10-26 23:58:19,508 WARN L179 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 543 DAG size of output: 142 [2018-10-26 23:58:24,442 WARN L179 SmtUtils]: Spent 4.92 s on a formula simplification. DAG size of input: 1612 DAG size of output: 88 [2018-10-26 23:58:25,217 WARN L179 SmtUtils]: Spent 726.00 ms on a formula simplification. DAG size of input: 443 DAG size of output: 86 [2018-10-26 23:58:26,499 WARN L179 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 642 DAG size of output: 1 [2018-10-26 23:58:39,326 WARN L179 SmtUtils]: Spent 12.81 s on a formula simplification. DAG size of input: 1198 DAG size of output: 163 [2018-10-26 23:58:44,813 WARN L179 SmtUtils]: Spent 5.48 s on a formula simplification. DAG size of input: 1526 DAG size of output: 76 [2018-10-26 23:58:46,332 WARN L179 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 513 DAG size of output: 91 [2018-10-26 23:58:55,097 WARN L179 SmtUtils]: Spent 8.59 s on a formula simplification. DAG size of input: 1097 DAG size of output: 138 [2018-10-26 23:58:55,478 WARN L179 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 550 DAG size of output: 70 [2018-10-26 23:58:55,803 WARN L179 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 106 [2018-10-26 23:58:56,753 WARN L179 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 91 [2018-10-26 23:58:56,989 WARN L179 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 103 [2018-10-26 23:58:57,538 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 423 DAG size of output: 102 [2018-10-26 23:59:06,828 WARN L179 SmtUtils]: Spent 9.28 s on a formula simplification. DAG size of input: 1173 DAG size of output: 145 [2018-10-26 23:59:17,033 WARN L179 SmtUtils]: Spent 10.20 s on a formula simplification. DAG size of input: 1180 DAG size of output: 145 [2018-10-26 23:59:25,281 WARN L179 SmtUtils]: Spent 8.24 s on a formula simplification. DAG size of input: 915 DAG size of output: 150 [2018-10-26 23:59:26,283 WARN L179 SmtUtils]: Spent 939.00 ms on a formula simplification. DAG size of input: 408 DAG size of output: 85 [2018-10-26 23:59:30,137 WARN L179 SmtUtils]: Spent 3.81 s on a formula simplification. DAG size of input: 661 DAG size of output: 120 [2018-10-26 23:59:31,416 WARN L179 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 540 DAG size of output: 88 [2018-10-26 23:59:37,686 WARN L179 SmtUtils]: Spent 6.26 s on a formula simplification. DAG size of input: 828 DAG size of output: 132 [2018-10-26 23:59:39,270 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 513 DAG size of output: 91 [2018-10-26 23:59:39,831 WARN L179 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 327 DAG size of output: 80 [2018-10-26 23:59:40,107 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-10-26 23:59:40,344 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 105 [2018-10-26 23:59:40,599 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 85 [2018-10-26 23:59:40,724 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 1 [2018-10-26 23:59:44,051 WARN L179 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 679 DAG size of output: 143 [2018-10-26 23:59:44,339 WARN L179 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 105 [2018-10-26 23:59:44,585 WARN L179 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 103 [2018-10-26 23:59:50,788 WARN L179 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 797 DAG size of output: 159 [2018-10-26 23:59:50,995 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 74 [2018-10-26 23:59:54,239 WARN L179 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 796 DAG size of output: 119 [2018-10-26 23:59:56,494 WARN L179 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 533 DAG size of output: 107 [2018-10-26 23:59:56,699 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 101 [2018-10-26 23:59:57,238 WARN L179 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 433 DAG size of output: 107 [2018-10-26 23:59:59,875 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 794 DAG size of output: 118 [2018-10-27 00:00:01,412 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 690 DAG size of output: 127 [2018-10-27 00:00:06,417 WARN L179 SmtUtils]: Spent 4.97 s on a formula simplification. DAG size of input: 753 DAG size of output: 113 [2018-10-27 00:00:09,986 WARN L179 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 679 DAG size of output: 143 [2018-10-27 00:00:10,087 INFO L425 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 59 80) no Hoare annotation was computed. [2018-10-27 00:00:10,088 INFO L421 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 59 80) the Hoare annotation is: (let ((.cse0 (* 2 ~pirp~0))) (or (not (= ~myStatus~0 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 ~routine~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~DC~0 ~s~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,088 INFO L425 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 59 80) no Hoare annotation was computed. [2018-10-27 00:00:10,088 INFO L428 ceAbstractionStarter]: At program point L729(lines 728 761) the Hoare annotation is: true [2018-10-27 00:00:10,088 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 646 832) no Hoare annotation was computed. [2018-10-27 00:00:10,088 INFO L421 ceAbstractionStarter]: At program point L820(line 820) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,089 INFO L421 ceAbstractionStarter]: At program point L787(lines 780 828) the Hoare annotation is: (let ((.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse5 (* 2 |old(~pirp~0)|)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (< (+ .cse5 4294967296) 0) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse6 .cse7) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse8 .cse4 .cse6 .cse7) (< 4294967294 .cse5) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse8 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,089 INFO L425 ceAbstractionStarter]: For program point L721(lines 721 762) no Hoare annotation was computed. [2018-10-27 00:00:10,089 INFO L425 ceAbstractionStarter]: For program point L812(lines 812 816) no Hoare annotation was computed. [2018-10-27 00:00:10,089 INFO L421 ceAbstractionStarter]: At program point L779(lines 772 829) the Hoare annotation is: (let ((.cse6 (= main_~status~6 ~lowerDriverReturn~0)) (.cse7 (<= ~compRegistered~0 0)) (.cse5 (* 2 |old(~pirp~0)|)) (.cse8 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse0 (= ~DC~0 ~s~0)) (.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (< (+ .cse5 4294967296) 0) (and .cse1 .cse2 .cse3 .cse4 (= ~IPC~0 ~s~0) .cse6 .cse7) (and .cse1 .cse2 .cse3 (= ~SKIP2~0 ~s~0) .cse8 .cse4 .cse6 .cse7) (< 4294967294 .cse5) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse0 .cse4) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse8 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0) (and .cse0 .cse1 .cse2 .cse3 .cse4)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,090 INFO L421 ceAbstractionStarter]: At program point L680(line 680) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (let ((.cse1 (* 2 main_~devobj~0)) (.cse3 (* 2 main_~status~6)) (.cse4 (* 2 main_~irp_choice~0)) (.cse2 (* 2 ~pirp~0))) (and (= 0 ~compRegistered~0) (<= .cse1 4294967294) (<= .cse2 4294967294) (= ~DC~0 ~s~0) (= ~routine~0 0) (= ~s~0 ~MPR3~0) (<= 0 (+ .cse1 4294967296)) (= ~s~0 ~NP~0) (<= 0 (+ .cse3 4294967296)) (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1)) (= ~s~0 ~UNLOADED~0) (= |old(~myStatus~0)| ~myStatus~0) (= 0 ~customIrp~0) (<= .cse3 4294967294) (<= 0 (+ .cse4 4294967296)) (<= .cse4 4294967294) (= ~SKIP2~0 ~s~0) (= ~IPC~0 ~s~0) (<= 0 (+ .cse2 4294967296)) (= ~MPR1~0 ~s~0))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L680-1(lines 677 831) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L738(line 738) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L697(lines 682 771) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L788(lines 772 829) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L421 ceAbstractionStarter]: At program point L722(lines 721 762) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (<= (+ ~SKIP1~0 2) ~MPR1~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 809) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 765) no Hoare annotation was computed. [2018-10-27 00:00:10,090 INFO L425 ceAbstractionStarter]: For program point L789(lines 789 826) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 730 760) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L421 ceAbstractionStarter]: At program point L814(line 814) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point L781(lines 781 785) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 646 832) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point L748(line 748) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point $Ultimate##19(lines 730 760) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point L682(lines 677 831) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L425 ceAbstractionStarter]: For program point L773(lines 773 777) no Hoare annotation was computed. [2018-10-27 00:00:10,091 INFO L421 ceAbstractionStarter]: At program point L707(lines 706 765) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (not (= ~pended~0 1))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,092 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 646 832) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (let ((.cse1 (* 2 ~pirp~0))) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (<= .cse1 4294967294) (= ~DC~0 ~s~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~s~0 ~NP~0) (= ~SKIP2~0 ~s~0) (= |old(~s~0)| ~s~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (<= 0 (+ .cse1 4294967296)) (= ~MPR1~0 ~s~0) (not (= ~pended~0 1)))) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,092 INFO L425 ceAbstractionStarter]: For program point L790(lines 790 825) no Hoare annotation was computed. [2018-10-27 00:00:10,092 INFO L425 ceAbstractionStarter]: For program point L716(lines 716 763) no Hoare annotation was computed. [2018-10-27 00:00:10,092 INFO L421 ceAbstractionStarter]: At program point L807(line 807) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,092 INFO L425 ceAbstractionStarter]: For program point L733(line 733) no Hoare annotation was computed. [2018-10-27 00:00:10,092 INFO L425 ceAbstractionStarter]: For program point L791(lines 791 801) no Hoare annotation was computed. [2018-10-27 00:00:10,092 INFO L425 ceAbstractionStarter]: For program point L692(lines 692 695) no Hoare annotation was computed. [2018-10-27 00:00:10,093 INFO L421 ceAbstractionStarter]: At program point L692-2(lines 692 695) the Hoare annotation is: (let ((.cse7 (* 2 |old(~pirp~0)|))) (or (and (let ((.cse0 (<= (+ ~DC~0 5) ~IPC~0)) (.cse1 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse2 (= ~routine~0 0)) (.cse3 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (not (= ~pended~0 1))) (.cse6 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse0 .cse1 .cse2 .cse3 (<= (+ ~myStatus~0 1073741637) 0) .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 (= 0 ~myStatus~0) .cse4 .cse5 .cse6))) (<= ~pirp~0 (+ ~s~0 2147483646)) (<= (+ main_~irp_choice~0 ~NP~0) 2147483648) (<= ~MPR3~0 (+ ~s~0 5)) (<= 0 (* 2 ~compRegistered~0)) (<= (+ ~compRegistered~0 6) ~MPR3~0) (<= 0 (+ ~s~0 ~pirp~0 2147483647)) (<= 0 (+ main_~irp_choice~0 ~MPR3~0 2147483642)) (<= 0 (+ main_~devobj~0 ~MPR1~0 2147483643)) (<= 6 (+ ~NP~0 ~MPR1~0)) (<= (+ ~s~0 ~NP~0) 2) (<= (+ ~MPR3~0 ~MPR1~0) 11) (<= (+ main_~status~6 ~MPR1~0) 2147483652) (<= (+ main_~devobj~0 ~NP~0) 2147483648) (<= 1 (+ main_~status~6 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse7 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,093 INFO L421 ceAbstractionStarter]: At program point L717(lines 716 763) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (let ((.cse8 (* 2 main_~irp_choice~0))) (and (let ((.cse1 (<= (+ ~DC~0 5) ~IPC~0)) (.cse2 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (= |old(~customIrp~0)| ~customIrp~0)) (.cse6 (not (= ~pended~0 1))) (.cse7 (<= (+ ~MPR3~0 1) ~IPC~0))) (or (and .cse1 .cse2 .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7))) (<= 5 (+ ~compRegistered~0 ~MPR1~0)) (<= (+ ~MPR1~0 1) ~MPR3~0) (<= .cse8 4294967294) (<= (* 2 ~compRegistered~0) 0) (<= (* 2 main_~devobj~0) 4294967294) (<= ~pirp~0 (+ ~NP~0 2147483646)) (= ~s~0 1) (<= ~MPR1~0 (+ main_~tmp_ndt_1~0 2147483653)) (<= 0 (+ .cse8 4294967296)) (<= ~NP~0 (+ ~pirp~0 2147483649)) (<= main_~tmp_ndt_3~0 (+ ~compRegistered~0 2147483647)) (<= main_~tmp_ndt_2~0 (+ ~MPR1~0 2147483642)) (<= 0 (+ main_~devobj~0 ~MPR1~0 2147483643)) (<= 1 (+ ~s~0 main_~status~6)) (<= main_~tmp_ndt_1~0 (+ ~s~0 2147483646)) (<= 0 (+ main_~tmp_ndt_2~0 ~NP~0 2147483647)) (<= 6 (+ ~NP~0 ~MPR1~0)) (<= (+ ~s~0 ~NP~0) 2) (<= (+ ~MPR3~0 ~MPR1~0) 11) (<= (+ main_~status~6 ~compRegistered~0) 2147483647) (<= 0 (+ ~s~0 main_~tmp_ndt_3~0 2147483647)))) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,096 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 798) no Hoare annotation was computed. [2018-10-27 00:00:10,097 INFO L421 ceAbstractionStarter]: At program point L759(lines 682 771) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= main_~status~6 ~lowerDriverReturn~0)) (.cse8 (<= ~compRegistered~0 0)) (.cse6 (* 2 |old(~pirp~0)|)) (.cse1 (= ~DC~0 ~s~0)) (.cse5 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (< (+ .cse6 4294967296) 0) (and .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse7 .cse8) (and .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse0 .cse5 .cse7 .cse8) (< 4294967294 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,097 INFO L425 ceAbstractionStarter]: For program point L726(lines 726 761) no Hoare annotation was computed. [2018-10-27 00:00:10,097 INFO L425 ceAbstractionStarter]: For program point L743(line 743) no Hoare annotation was computed. [2018-10-27 00:00:10,097 INFO L421 ceAbstractionStarter]: At program point L768(line 768) the Hoare annotation is: (let ((.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse0 (<= (+ ~SKIP1~0 2) ~MPR1~0)) (.cse7 (= main_~status~6 ~lowerDriverReturn~0)) (.cse8 (<= ~compRegistered~0 0)) (.cse6 (* 2 |old(~pirp~0)|)) (.cse1 (= ~DC~0 ~s~0)) (.cse5 (not (= ~pended~0 1)))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= ~NP~0 1) .cse0 (and .cse1 .cse2 .cse3 .cse4 .cse5) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (< (+ .cse6 4294967296) 0) (and .cse2 .cse3 .cse4 .cse5 (= ~IPC~0 ~s~0) .cse7 .cse8) (and .cse2 .cse3 .cse4 (= ~SKIP2~0 ~s~0) .cse0 .cse5 .cse7 .cse8) (< 4294967294 .cse6) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (= 0 main_~status~6) .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,097 INFO L421 ceAbstractionStarter]: At program point L727(lines 726 761) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,097 INFO L425 ceAbstractionStarter]: For program point L818(lines 818 822) no Hoare annotation was computed. [2018-10-27 00:00:10,097 INFO L425 ceAbstractionStarter]: For program point L711(lines 711 764) no Hoare annotation was computed. [2018-10-27 00:00:10,098 INFO L421 ceAbstractionStarter]: At program point L794(line 794) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,098 INFO L425 ceAbstractionStarter]: For program point L753(line 753) no Hoare annotation was computed. [2018-10-27 00:00:10,098 INFO L425 ceAbstractionStarter]: For program point L811(lines 811 823) no Hoare annotation was computed. [2018-10-27 00:00:10,098 INFO L421 ceAbstractionStarter]: At program point L712(lines 711 764) the Hoare annotation is: (let ((.cse0 (* 2 |old(~pirp~0)|))) (or (and (<= (+ ~DC~0 5) ~IPC~0) (= ~routine~0 0) (= ~s~0 ~NP~0) (= 0 ~compRegistered~0) (<= (+ ~DC~0 2) ~SKIP2~0) (not (= ~pended~0 1))) (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (< 4294967294 .cse0) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< (+ .cse0 4294967296) 0) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)))) [2018-10-27 00:00:10,098 INFO L421 ceAbstractionStarter]: At program point L803(lines 790 825) the Hoare annotation is: (let ((.cse1 (= ~DC~0 ~s~0)) (.cse2 (<= (+ ~DC~0 5) ~IPC~0)) (.cse3 (= ~routine~0 0)) (.cse4 (<= (+ ~DC~0 2) ~SKIP2~0)) (.cse5 (not (= ~pended~0 1)))) (let ((.cse7 (* 2 |old(~pirp~0)|)) (.cse8 (= 0 main_~status~6)) (.cse0 (or (and .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (= main_~status~6 ~lowerDriverReturn~0) (<= ~compRegistered~0 0)))) (.cse6 (<= (+ ~SKIP1~0 2) ~MPR1~0))) (or (not (= |old(~myStatus~0)| 0)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and (<= ~IPC~0 ~s~0) .cse0) (and .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ main_~status~6 1073741789) 0)) (and (and (<= 1 ~NP~0) (<= (+ ~NP~0 5) ~MPR3~0) .cse0 (<= ~NP~0 1) .cse6 (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~MPR3~0 1) ~IPC~0)) (not (= 259 main_~status~6))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= 0 |old(~routine~0)|)) (not (= |old(~compRegistered~0)| 0)) (< (+ .cse7 4294967296) 0) (and .cse8 .cse0) (< 4294967294 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and .cse8 .cse1 .cse5) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse0 .cse6 (<= ~SKIP2~0 ~s~0)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-10-27 00:00:10,098 INFO L428 ceAbstractionStarter]: At program point DiskPerfSyncFilterWithTargetENTRY(lines 81 94) the Hoare annotation is: true [2018-10-27 00:00:10,098 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetFINAL(lines 81 94) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L425 ceAbstractionStarter]: For program point DiskPerfSyncFilterWithTargetEXIT(lines 81 94) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L425 ceAbstractionStarter]: For program point L866-1(lines 858 871) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L421 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 858 871) the Hoare annotation is: (or (and (<= ~compRegistered~0 ~s~0) (<= (* 2 ~s~0) 2)) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< |old(~s~0)| ~compRegistered~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0))) (< (+ ~MPR1~0 1) ~MPR3~0)) [2018-10-27 00:00:10,099 INFO L425 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 858 871) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L421 ceAbstractionStarter]: At program point L866(line 866) the Hoare annotation is: (or (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< |old(~s~0)| ~compRegistered~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~setEventCalled~0 1) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 1 ~NP~0) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)))) (and (or (not (= ~myStatus~0 0)) .cse0) (or (< 0 (+ ~myStatus~0 1073741637)) .cse0))) (< (+ ~MPR1~0 1) ~MPR3~0)) [2018-10-27 00:00:10,099 INFO L421 ceAbstractionStarter]: At program point L1055(lines 1054 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,099 INFO L425 ceAbstractionStarter]: For program point L1047(lines 1047 1070) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L425 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 1015 1099) no Hoare annotation was computed. [2018-10-27 00:00:10,099 INFO L421 ceAbstractionStarter]: At program point L1027(line 1027) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point L1027-1(line 1027) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 1015 1099) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point L1052(lines 1052 1069) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L421 ceAbstractionStarter]: At program point L1048(lines 1047 1070) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,100 INFO L421 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 1015 1099) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,100 INFO L421 ceAbstractionStarter]: At program point L1040(line 1040) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,100 INFO L421 ceAbstractionStarter]: At program point L1032(line 1032) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point L1032-1(line 1032) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point L1024(lines 1024 1044) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L425 ceAbstractionStarter]: For program point L1024-1(lines 1024 1044) no Hoare annotation was computed. [2018-10-27 00:00:10,100 INFO L421 ceAbstractionStarter]: At program point L1053(lines 1052 1069) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point L1078(lines 1078 1084) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point $Ultimate##18(lines 1056 1068) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point $Ultimate##17(lines 1056 1068) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point L1025(lines 1025 1035) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point L1087(lines 1087 1094) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point L1075(lines 1075 1095) no Hoare annotation was computed. [2018-10-27 00:00:10,101 INFO L425 ceAbstractionStarter]: For program point L1038(lines 1038 1042) no Hoare annotation was computed. [2018-10-27 00:00:10,117 INFO L421 ceAbstractionStarter]: At program point L1067(lines 1023 1098) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,117 INFO L425 ceAbstractionStarter]: For program point L1030(lines 1030 1034) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point L1030-2(lines 1025 1035) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L421 ceAbstractionStarter]: At program point L1092(line 1092) the Hoare annotation is: (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point L1092-1(lines 1071 1096) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerFINAL(lines 211 235) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L421 ceAbstractionStarter]: At program point L224(line 224) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point L224-1(lines 220 226) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 226) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L421 ceAbstractionStarter]: At program point DiskPerfDispatchPowerENTRY(lines 211 235) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-10-27 00:00:10,118 INFO L421 ceAbstractionStarter]: At program point L231(line 231) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point L231-1(line 231) no Hoare annotation was computed. [2018-10-27 00:00:10,118 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPowerEXIT(lines 211 235) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L421 ceAbstractionStarter]: At program point L993(line 993) the Hoare annotation is: (let ((.cse4 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse13 (< ~compRegistered~0 1)) (.cse9 (not (= 0 ~routine~0))) (.cse5 (= 1 ~pended~0)) (.cse14 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~MPR1~0 (+ ~NP~0 4))) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (< 1 ~NP~0)) (.cse15 (< 1 |old(~setEventCalled~0)|))) (let ((.cse0 (or .cse4 .cse10 .cse11 (< ~NP~0 1) (or .cse13 (or .cse9 .cse5 .cse14)) .cse12 .cse6 (not (= |old(~s~0)| ~MPR3~0)) .cse7 .cse8 .cse15)) (.cse2 (< 0 (+ ~myStatus~0 1073741637))) (.cse1 (not (= ~myStatus~0 0))) (.cse3 (or .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse12 .cse13 .cse14 (< |old(~s~0)| 1) .cse15))) (and (or .cse0 .cse1) (or .cse2 .cse3) (or .cse0 .cse2) (or .cse1 .cse3)))) [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point L991(lines 991 995) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point L991-1(lines 978 997) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 973 1014) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point L979(lines 979 984) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point $Ultimate##16(lines 1004 1011) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 1004 1011) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1012) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 973 1014) no Hoare annotation was computed. [2018-10-27 00:00:10,119 INFO L421 ceAbstractionStarter]: At program point L986(lines 978 997) the Hoare annotation is: (let ((.cse5 (< ~MPR3~0 (+ ~NP~0 5))) (.cse10 (= 1 ~pended~0)) (.cse13 (< ~MPR1~0 (+ ~NP~0 4))) (.cse14 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse15 (< 1 ~NP~0)) (.cse9 (not (= 0 ~routine~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (< |old(~setEventCalled~0)| 1)) (.cse12 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse8 (< ~compRegistered~0 1)) (.cse11 (< ~IPC~0 (+ ~DC~0 5))) (.cse16 (< 1 |old(~setEventCalled~0)|))) (let ((.cse2 (or .cse5 .cse10 .cse13 .cse14 .cse15 .cse9 (not (= |old(~s~0)| ~NP~0)) .cse6 .cse7 .cse12 .cse8 .cse11 (< |old(~s~0)| 1) .cse16)) (.cse0 (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse3 (not (= ~myStatus~0 0))) (.cse4 (or .cse5 .cse6 .cse7 (< ~NP~0 1) (or .cse8 (or .cse9 .cse10 .cse11)) .cse12 .cse13 (not (= |old(~s~0)| ~MPR3~0)) .cse14 .cse15 .cse16)) (.cse1 (< 0 (+ ~myStatus~0 1073741637)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse2 .cse0) (or .cse4 .cse3) (or .cse4 .cse1)))) [2018-10-27 00:00:10,119 INFO L425 ceAbstractionStarter]: For program point L978(lines 978 997) no Hoare annotation was computed. [2018-10-27 00:00:10,120 INFO L421 ceAbstractionStarter]: At program point L1003(lines 1002 1012) the Hoare annotation is: (let ((.cse7 (= ~NP~0 ~s~0)) (.cse22 (+ ~DC~0 5)) (.cse27 (+ ~MPR3~0 1)) (.cse23 (+ ~SKIP1~0 2)) (.cse26 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 4)) (.cse25 (+ ~NP~0 5))) (let ((.cse9 (< ~MPR3~0 .cse25)) (.cse14 (= 1 ~pended~0)) (.cse17 (< ~MPR1~0 .cse24)) (.cse18 (< ~SKIP2~0 .cse26)) (.cse19 (< 1 ~NP~0)) (.cse13 (not (= 0 ~routine~0))) (.cse10 (< ~MPR1~0 .cse23)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse16 (< ~IPC~0 .cse27)) (.cse12 (< ~compRegistered~0 1)) (.cse15 (< ~IPC~0 .cse22)) (.cse20 (< 1 |old(~setEventCalled~0)|)) (.cse21 (and (<= .cse22 ~IPC~0) (<= .cse23 ~MPR1~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= .cse24 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) (= ~routine~0 0) (<= .cse25 ~MPR3~0) (<= .cse26 ~SKIP2~0) .cse7 (<= ~s~0 1) (not (= ~pended~0 1)) (<= .cse27 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse21 .cse8)) (.cse3 (and (= |old(~customIrp~0)| 1) .cse21 (= 0 ~customIrp~0))) (.cse2 (or .cse9 .cse14 .cse17 .cse18 .cse19 .cse13 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse16 .cse12 .cse15 (< |old(~s~0)| 1) .cse20)) (.cse1 (not (= ~myStatus~0 0))) (.cse6 (or .cse9 .cse10 .cse11 (< ~NP~0 1) (or .cse12 (or .cse13 .cse14 .cse15)) .cse16 .cse17 (not (= |old(~s~0)| ~MPR3~0)) .cse18 .cse19 .cse20)) (.cse4 (< 0 (+ ~myStatus~0 1073741637))) (.cse5 (and .cse7 .cse8))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse3 .cse2) (or .cse5 .cse6 .cse1) (or .cse6 .cse4 .cse5))))) [2018-10-27 00:00:10,120 INFO L421 ceAbstractionStarter]: At program point L1001(lines 1000 1012) the Hoare annotation is: (let ((.cse7 (= ~NP~0 ~s~0)) (.cse22 (+ ~DC~0 5)) (.cse27 (+ ~MPR3~0 1)) (.cse23 (+ ~SKIP1~0 2)) (.cse26 (+ ~DC~0 2)) (.cse24 (+ ~NP~0 4)) (.cse25 (+ ~NP~0 5))) (let ((.cse9 (< ~MPR3~0 .cse25)) (.cse14 (= 1 ~pended~0)) (.cse17 (< ~MPR1~0 .cse24)) (.cse18 (< ~SKIP2~0 .cse26)) (.cse19 (< 1 ~NP~0)) (.cse13 (not (= 0 ~routine~0))) (.cse10 (< ~MPR1~0 .cse23)) (.cse11 (< |old(~setEventCalled~0)| 1)) (.cse16 (< ~IPC~0 .cse27)) (.cse12 (< ~compRegistered~0 1)) (.cse15 (< ~IPC~0 .cse22)) (.cse20 (< 1 |old(~setEventCalled~0)|)) (.cse21 (and (<= .cse22 ~IPC~0) (<= .cse23 ~MPR1~0) (<= 1 ~compRegistered~0) (<= 1 ~s~0) (<= .cse24 ~MPR1~0) (not (= ~MPR3~0 |old(~s~0)|)) (= ~routine~0 0) (<= .cse25 ~MPR3~0) (<= .cse26 ~SKIP2~0) .cse7 (<= ~s~0 1) (not (= ~pended~0 1)) (<= .cse27 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse8 (= |old(~customIrp~0)| ~customIrp~0))) (let ((.cse0 (and .cse21 .cse8)) (.cse3 (and (= |old(~customIrp~0)| 1) .cse21 (= 0 ~customIrp~0))) (.cse2 (or .cse9 .cse14 .cse17 .cse18 .cse19 .cse13 (not (= |old(~s~0)| ~NP~0)) .cse10 .cse11 .cse16 .cse12 .cse15 (< |old(~s~0)| 1) .cse20)) (.cse1 (not (= ~myStatus~0 0))) (.cse6 (or .cse9 .cse10 .cse11 (< ~NP~0 1) (or .cse12 (or .cse13 .cse14 .cse15)) .cse16 .cse17 (not (= |old(~s~0)| ~MPR3~0)) .cse18 .cse19 .cse20)) (.cse4 (< 0 (+ ~myStatus~0 1073741637))) (.cse5 (and .cse7 .cse8))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse0 .cse4 .cse3 .cse2) (or .cse5 .cse6 .cse1) (or .cse6 .cse4 .cse5))))) [2018-10-27 00:00:10,120 INFO L421 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 973 1014) the Hoare annotation is: (let ((.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (<= 1 ~setEventCalled~0)) (.cse8 (<= ~setEventCalled~0 1)) (.cse9 (< ~MPR3~0 (+ ~NP~0 5))) (.cse15 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse16 (< |old(~setEventCalled~0)| 1)) (.cse18 (< ~compRegistered~0 1)) (.cse14 (not (= 0 ~routine~0))) (.cse10 (= 1 ~pended~0)) (.cse19 (< ~IPC~0 (+ ~DC~0 5))) (.cse17 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~MPR1~0 (+ ~NP~0 4))) (.cse12 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse13 (< 1 ~NP~0)) (.cse20 (< 1 |old(~setEventCalled~0)|))) (let ((.cse2 (not (= ~myStatus~0 0))) (.cse1 (or .cse9 .cse15 .cse16 (< ~NP~0 1) (or .cse18 (or .cse14 .cse10 .cse19)) .cse17 .cse11 (not (= |old(~s~0)| ~MPR3~0)) .cse12 .cse13 .cse20)) (.cse0 (and (= ~s~0 ~MPR3~0) .cse6 .cse7 .cse8)) (.cse5 (< 0 (+ ~myStatus~0 1073741637))) (.cse3 (or .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (not (= |old(~s~0)| ~NP~0)) .cse15 .cse16 .cse17 .cse18 .cse19 (< |old(~s~0)| 1) .cse20)) (.cse4 (and (= ~NP~0 ~s~0) .cse6 .cse7 .cse8))) (and (or .cse0 .cse1 .cse2) (or .cse2 .cse3 .cse4) (or .cse1 .cse5 .cse0) (or .cse5 .cse3 .cse4)))) [2018-10-27 00:00:10,120 INFO L421 ceAbstractionStarter]: At program point L959(line 959) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (not (= |old(~s~0)| ~NP~0)) .cse0 (not (= ~compRegistered~0 0))) (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)))) [2018-10-27 00:00:10,121 INFO L425 ceAbstractionStarter]: For program point L959-1(lines 951 964) no Hoare annotation was computed. [2018-10-27 00:00:10,121 INFO L425 ceAbstractionStarter]: For program point L955(lines 955 961) no Hoare annotation was computed. [2018-10-27 00:00:10,121 INFO L421 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 951 964) the Hoare annotation is: (let ((.cse0 (= 1 ~pended~0))) (and (or (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) .cse0 (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< |old(~s~0)| 1)) (= ~NP~0 ~s~0)) (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) .cse0 (not (= ~compRegistered~0 0))))) [2018-10-27 00:00:10,121 INFO L425 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 951 964) no Hoare annotation was computed. [2018-10-27 00:00:10,122 INFO L421 ceAbstractionStarter]: At program point L846(lines 845 855) the Hoare annotation is: (or (and (<= ~compRegistered~0 (+ IoBuildDeviceIoControlRequest_~tmp_ndt_7~0 2147483649)) (<= IoBuildDeviceIoControlRequest_~tmp_ndt_7~0 (+ ~MPR3~0 2147483641)) (<= (+ ~compRegistered~0 IoBuildDeviceIoControlRequest_~malloc_ret~0) 2147483648) (<= 0 (+ ~MPR3~0 IoBuildDeviceIoControlRequest_~malloc_ret~0 2147483642))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< ~s~0 ~compRegistered~0) (< (+ ~s~0 4) ~MPR1~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 ~s~0) (< 1 ~NP~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~MPR1~0 1) ~MPR3~0)) [2018-10-27 00:00:10,122 INFO L421 ceAbstractionStarter]: At program point L844(lines 843 855) the Hoare annotation is: (or (and (<= ~compRegistered~0 (+ IoBuildDeviceIoControlRequest_~tmp_ndt_7~0 2147483649)) (<= IoBuildDeviceIoControlRequest_~tmp_ndt_7~0 (+ ~MPR3~0 2147483641)) (<= (+ ~compRegistered~0 IoBuildDeviceIoControlRequest_~malloc_ret~0) 2147483648) (<= 0 (+ ~MPR3~0 IoBuildDeviceIoControlRequest_~malloc_ret~0 2147483642))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< ~s~0 ~compRegistered~0) (< (+ ~s~0 4) ~MPR1~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 ~s~0) (< 1 ~NP~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~MPR1~0 1) ~MPR3~0)) [2018-10-27 00:00:10,122 INFO L425 ceAbstractionStarter]: For program point L843(lines 843 855) no Hoare annotation was computed. [2018-10-27 00:00:10,122 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 833 857) no Hoare annotation was computed. [2018-10-27 00:00:10,122 INFO L425 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestFINAL(lines 833 857) no Hoare annotation was computed. [2018-10-27 00:00:10,122 INFO L425 ceAbstractionStarter]: For program point $Ultimate##4(lines 847 854) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L421 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 833 857) the Hoare annotation is: (or (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< ~s~0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (< (+ ~s~0 4) ~MPR1~0) (let ((.cse0 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 ~s~0) (< 1 ~NP~0)))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~MPR1~0 1) ~MPR3~0)) [2018-10-27 00:00:10,123 INFO L425 ceAbstractionStarter]: For program point $Ultimate##3(lines 847 854) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L428 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 965 972) the Hoare annotation is: true [2018-10-27 00:00:10,123 INFO L425 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 965 972) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L425 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 965 972) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L425 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 632 645) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L421 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 632 645) the Hoare annotation is: (or (and (and (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (<= 6 (+ ~s~0 ~MPR1~0)) (<= (* 2 ~s~0) 2)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse3 (< 1 ~NP~0)) (.cse4 (not (= 0 ~routine~0))) (.cse5 (not (= |old(~s~0)| ~NP~0))) (.cse6 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse7 (not (= |old(~compRegistered~0)| 0))) (.cse8 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse9 (< ~IPC~0 (+ ~DC~0 5))) (.cse10 (< |old(~s~0)| 1)) (.cse11 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11))) (< (+ ~MPR1~0 1) ~MPR3~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,123 INFO L425 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 632 645) no Hoare annotation was computed. [2018-10-27 00:00:10,123 INFO L421 ceAbstractionStarter]: At program point DiskPerfSendToNextDriverENTRY(lines 186 210) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and (= |old(~s~0)| ~s~0) (not (= ~pended~0 1)))) [2018-10-27 00:00:10,124 INFO L421 ceAbstractionStarter]: At program point L206(line 206) the Hoare annotation is: (or (and (= ~s~0 ~SKIP1~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point L206-1(line 206) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverEXIT(lines 186 210) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L421 ceAbstractionStarter]: At program point L199(line 199) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point DiskPerfSendToNextDriverFINAL(lines 186 210) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point L199-1(lines 195 201) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point L195(lines 195 201) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L421 ceAbstractionStarter]: At program point L161(line 161) the Hoare annotation is: (or (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (and (<= 1 ~compRegistered~0) (not (= 259 DiskPerfStartDevice_~status~1)) (= ~routine~0 0) (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (< (+ ~NP~0 |old(~s~0)|) 2) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~NP~0 |DiskPerfStartDevice_#in~Irp| 2147483647) 0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~MPR1~0 2147483642) |DiskPerfStartDevice_#in~DeviceObject|) (< (+ |DiskPerfStartDevice_#in~DeviceObject| ~MPR3~0 2147483642) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfStartDevice_#in~Irp|)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point L161-1(line 161) no Hoare annotation was computed. [2018-10-27 00:00:10,124 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-10-27 00:00:10,125 INFO L421 ceAbstractionStarter]: At program point L157(line 157) the Hoare annotation is: (or (and (let ((.cse0 (<= 1 ~compRegistered~0)) (.cse1 (= ~routine~0 0)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (= |old(~customIrp~0)| ~customIrp~0)) (.cse4 (not (= ~pended~0 1))) (.cse5 (= |old(~myStatus~0)| ~myStatus~0))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5 (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1)) (and (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse5 (not (= 259 DiskPerfStartDevice_~status~1))))) (<= ~compRegistered~0 ~s~0)) (let ((.cse6 (= 1 |old(~pended~0)|)) (.cse7 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse8 (not (= 0 |old(~routine~0)|))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) (< (+ ~NP~0 |old(~s~0)|) 2) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~NP~0 |DiskPerfStartDevice_#in~Irp| 2147483647) 0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~MPR1~0 2147483642) |DiskPerfStartDevice_#in~DeviceObject|) (< (+ |DiskPerfStartDevice_#in~DeviceObject| ~MPR3~0 2147483642) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfStartDevice_#in~Irp|)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,125 INFO L421 ceAbstractionStarter]: At program point L156(line 156) the Hoare annotation is: (or (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (let ((.cse7 (+ ~NP~0 2147483646))) (and (= |old(~myStatus~0)| ~myStatus~0) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= ~s~0 1) (<= ~compRegistered~0 (+ DiskPerfStartDevice_~DeviceObject 2147483648)) (<= (+ ~s~0 DiskPerfStartDevice_~DeviceObject) 2147483648) (<= 0 (+ (* 2 DiskPerfStartDevice_~Irp) 4294967296)) (<= DiskPerfStartDevice_~deviceExtension__TargetDeviceObject~0 .cse7) (<= ~MPR1~0 (+ DiskPerfStartDevice_~deviceExtension__TargetDeviceObject~0 2147483653)) (<= DiskPerfStartDevice_~Irp .cse7))) (< (+ ~NP~0 |old(~s~0)|) 2) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~NP~0 |DiskPerfStartDevice_#in~Irp| 2147483647) 0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~MPR1~0 2147483642) |DiskPerfStartDevice_#in~DeviceObject|) (< (+ |DiskPerfStartDevice_#in~DeviceObject| ~MPR3~0 2147483642) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfStartDevice_#in~Irp|)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,125 INFO L421 ceAbstractionStarter]: At program point L157-1(line 157) the Hoare annotation is: (or (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (and (let ((.cse7 (<= 1 ~compRegistered~0)) (.cse8 (= ~routine~0 0)) (.cse9 (= ~NP~0 ~s~0)) (.cse10 (= |old(~customIrp~0)| ~customIrp~0)) (.cse11 (not (= ~pended~0 1))) (.cse12 (= |old(~myStatus~0)| ~myStatus~0))) (or (and (and (and .cse7 .cse8 .cse9 .cse10 .cse11) .cse12) (= |old(~myStatus~0)| DiskPerfStartDevice_~status~1)) (and (and .cse7 .cse8 .cse9 .cse10 .cse11 (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse12 (not (= 259 DiskPerfStartDevice_~status~1))))) (<= ~compRegistered~0 ~s~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~NP~0 |DiskPerfStartDevice_#in~Irp| 2147483647) 0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~MPR1~0 2147483642) |DiskPerfStartDevice_#in~DeviceObject|) (< (+ |DiskPerfStartDevice_#in~DeviceObject| ~MPR3~0 2147483642) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfStartDevice_#in~Irp|)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,126 INFO L421 ceAbstractionStarter]: At program point DiskPerfStartDeviceENTRY(lines 146 165) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (and (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (<= 0 (* 2 ~compRegistered~0)) (<= (+ ~compRegistered~0 6) ~MPR3~0) (<= 2 (+ ~s~0 ~NP~0)) (<= (* 2 ~s~0) 2)) (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~NP~0 |DiskPerfStartDevice_#in~Irp| 2147483647) 0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~MPR1~0 2147483642) |DiskPerfStartDevice_#in~DeviceObject|) (< (+ |DiskPerfStartDevice_#in~DeviceObject| ~MPR3~0 2147483642) 0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfStartDevice_#in~Irp|)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0)) [2018-10-27 00:00:10,126 INFO L425 ceAbstractionStarter]: For program point L156-1(line 156) no Hoare annotation was computed. [2018-10-27 00:00:10,126 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceFINAL(lines 146 165) no Hoare annotation was computed. [2018-10-27 00:00:10,126 INFO L425 ceAbstractionStarter]: For program point DiskPerfStartDeviceEXIT(lines 146 165) no Hoare annotation was computed. [2018-10-27 00:00:10,126 INFO L425 ceAbstractionStarter]: For program point L256(lines 256 269) no Hoare annotation was computed. [2018-10-27 00:00:10,126 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousEXIT(lines 236 287) no Hoare annotation was computed. [2018-10-27 00:00:10,126 INFO L421 ceAbstractionStarter]: At program point L263(line 263) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-10-27 00:00:10,129 INFO L425 ceAbstractionStarter]: For program point L261(lines 261 268) no Hoare annotation was computed. [2018-10-27 00:00:10,129 INFO L425 ceAbstractionStarter]: For program point L261-1(lines 256 269) no Hoare annotation was computed. [2018-10-27 00:00:10,130 INFO L421 ceAbstractionStarter]: At program point L280(line 280) the Hoare annotation is: (let ((.cse17 (<= 1 ~compRegistered~0)) (.cse18 (= ~routine~0 0)) (.cse19 (= |old(~customIrp~0)| ~customIrp~0)) (.cse20 (= 259 DiskPerfForwardIrpSynchronous_~__cil_tmp15~0)) (.cse21 (not (= ~pended~0 1))) (.cse22 (<= 1 ~setEventCalled~0)) (.cse23 (<= ~setEventCalled~0 1))) (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse13 (and .cse17 .cse18 (= ~s~0 ~MPR3~0) .cse19 .cse20 .cse21 .cse22 .cse23)) (.cse3 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse10 (not (= |old(~compRegistered~0)| 0))) (.cse6 (and .cse17 (not (= 259 DiskPerfForwardIrpSynchronous_~status~3)) .cse18 (= ~NP~0 ~s~0) .cse19 .cse20 .cse21 .cse22 .cse23)) (.cse14 (< |old(~s~0)| 1)) (.cse1 (not (= ~myStatus~0 0))) (.cse16 (< 0 (+ ~myStatus~0 1073741637))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse7 (not (= 0 |old(~routine~0)|))) (.cse9 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse11 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse12 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (or .cse0 .cse16 .cse2 .cse13 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse6 .cse12 .cse14 .cse15) (or (and (or .cse1 .cse2 .cse4 .cse7 .cse9 .cse11 .cse12 .cse15) (or .cse16 .cse2 .cse4 .cse7 .cse9 .cse11 .cse12 .cse15)) (< (+ ~NP~0 |old(~s~0)|) 2) (and (<= DiskPerfForwardIrpSynchronous_~__cil_tmp15~0 DiskPerfForwardIrpSynchronous_~status~3) (<= (+ DiskPerfForwardIrpSynchronous_~status~3 ~MPR1~0) 264) (= ~compRegistered~0 1)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |DiskPerfForwardIrpSynchronous_#in~DeviceObject| |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfForwardIrpSynchronous_#in~Irp| 2147483649) |old(~s~0)|) (< (+ |old(~s~0)| 4) ~MPR1~0) (and (<= ~MPR1~0 (+ DiskPerfForwardIrpSynchronous_~Irp 2147483653)) (<= DiskPerfForwardIrpSynchronous_~event~0 (+ ~s~0 2147483646)) (<= (+ ~compRegistered~0 4) ~MPR1~0) (<= DiskPerfForwardIrpSynchronous_~Irp (+ ~MPR3~0 2147483641)) (<= 0 (+ DiskPerfForwardIrpSynchronous_~Irp__Tail__Overlay__CurrentStackLocation~3 ~compRegistered~0 2147483647)) (<= (* 2 DiskPerfForwardIrpSynchronous_~deviceExtension__TargetDeviceObject~3) 4294967294) (<= ~routine~0 (+ DiskPerfForwardIrpSynchronous_~deviceExtension__TargetDeviceObject~3 2147483648)) (<= ~MPR3~0 (+ DiskPerfForwardIrpSynchronous_~event~0 2147483654)) (<= (+ DiskPerfForwardIrpSynchronous_~Irp__Tail__Overlay__CurrentStackLocation~3 ~MPR3~0) 2147483653) (<= (* 2 ~s~0) 2)) (< 2147483653 (+ |DiskPerfForwardIrpSynchronous_#in~DeviceObject| ~MPR3~0)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfForwardIrpSynchronous_#in~Irp|)))))) [2018-10-27 00:00:10,130 INFO L425 ceAbstractionStarter]: For program point L280-1(line 280) no Hoare annotation was computed. [2018-10-27 00:00:10,130 INFO L425 ceAbstractionStarter]: For program point L278(lines 278 283) no Hoare annotation was computed. [2018-10-27 00:00:10,130 INFO L425 ceAbstractionStarter]: For program point L278-2(lines 278 283) no Hoare annotation was computed. [2018-10-27 00:00:10,130 INFO L421 ceAbstractionStarter]: At program point L274(line 274) the Hoare annotation is: (let ((.cse8 (< 0 (+ ~myStatus~0 1073741637))) (.cse10 (< ~MPR3~0 (+ ~NP~0 5))) (.cse0 (not (= ~myStatus~0 0))) (.cse1 (= 1 |old(~pended~0)|)) (.cse11 (< ~MPR1~0 (+ ~NP~0 4))) (.cse9 (and (<= 1 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse2 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse12 (< 1 ~NP~0)) (.cse3 (not (= 0 |old(~routine~0)|))) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse4 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (not (= |old(~compRegistered~0)| 0))) (.cse5 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse6 (< ~IPC~0 (+ ~DC~0 5))) (.cse15 (< |old(~s~0)| 1)) (.cse7 (not (= |old(~customIrp~0)| 0)))) (and (or (and (<= ~MPR1~0 (+ DiskPerfForwardIrpSynchronous_~Irp 2147483653)) (<= DiskPerfForwardIrpSynchronous_~event~0 (+ ~s~0 2147483646)) (<= (+ ~compRegistered~0 4) ~MPR1~0) (<= DiskPerfForwardIrpSynchronous_~Irp (+ ~MPR3~0 2147483641)) (<= 0 (+ DiskPerfForwardIrpSynchronous_~Irp__Tail__Overlay__CurrentStackLocation~3 ~compRegistered~0 2147483647)) (<= (* 2 DiskPerfForwardIrpSynchronous_~deviceExtension__TargetDeviceObject~3) 4294967294) (<= ~routine~0 (+ DiskPerfForwardIrpSynchronous_~deviceExtension__TargetDeviceObject~3 2147483648)) (<= ~MPR3~0 (+ DiskPerfForwardIrpSynchronous_~event~0 2147483654)) (<= (+ DiskPerfForwardIrpSynchronous_~Irp__Tail__Overlay__CurrentStackLocation~3 ~MPR3~0) 2147483653)) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse8 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7)) (< (+ ~NP~0 |old(~s~0)|) 2) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |DiskPerfForwardIrpSynchronous_#in~DeviceObject| |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfForwardIrpSynchronous_#in~Irp| 2147483649) |old(~s~0)|) (< (+ |old(~s~0)| 4) ~MPR1~0) (< 2147483653 (+ |DiskPerfForwardIrpSynchronous_#in~DeviceObject| ~MPR3~0)) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483653 (+ ~MPR3~0 |DiskPerfForwardIrpSynchronous_#in~Irp|))) (or .cse9 .cse10 .cse8 .cse1 .cse11 .cse2 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse6 .cse15 .cse7) (or .cse10 .cse0 .cse1 .cse11 .cse9 .cse2 .cse12 .cse3 .cse13 .cse4 .cse14 .cse5 .cse6 .cse15 .cse7))) [2018-10-27 00:00:10,130 INFO L421 ceAbstractionStarter]: At program point DiskPerfForwardIrpSynchronousENTRY(lines 236 287) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< 1 ~NP~0)) (.cse6 (not (= 0 |old(~routine~0)|))) (.cse7 (not (= |old(~s~0)| ~NP~0))) (.cse8 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse9 (not (= |old(~compRegistered~0)| 0))) (.cse10 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse11 (< ~IPC~0 (+ ~DC~0 5))) (.cse12 (< |old(~s~0)| 1)) (.cse13 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse3 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13))) [2018-10-27 00:00:10,130 INFO L425 ceAbstractionStarter]: For program point L274-1(line 274) no Hoare annotation was computed. [2018-10-27 00:00:10,130 INFO L425 ceAbstractionStarter]: For program point DiskPerfForwardIrpSynchronousFINAL(lines 236 287) no Hoare annotation was computed. [2018-10-27 00:00:10,131 INFO L421 ceAbstractionStarter]: At program point L258(line 258) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse10 (< ~IPC~0 (+ ~DC~0 5))) (.cse11 (< |old(~s~0)| 1)) (.cse12 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= ~myStatus~0 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (or .cse0 (< 0 (+ ~myStatus~0 1073741637)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) [2018-10-27 00:00:10,131 INFO L425 ceAbstractionStarter]: For program point L514-1(line 514) no Hoare annotation was computed. [2018-10-27 00:00:10,131 INFO L425 ceAbstractionStarter]: For program point L556(lines 556 558) no Hoare annotation was computed. [2018-10-27 00:00:10,131 INFO L421 ceAbstractionStarter]: At program point L606(line 606) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= 1 ~setEventCalled~0)) (.cse2 (<= ~setEventCalled~0 1))) (or (and (= ~NP~0 ~s~0) .cse0 .cse1 .cse2) (and (= ~s~0 ~MPR3~0) .cse0 .cse1 .cse2) (let ((.cse4 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse3 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse3) (or (not (= ~myStatus~0 0)) .cse3))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse4) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse4 1))))) [2018-10-27 00:00:10,131 INFO L425 ceAbstractionStarter]: For program point L606-1(line 606) no Hoare annotation was computed. [2018-10-27 00:00:10,131 INFO L421 ceAbstractionStarter]: At program point L507(lines 507 508) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (and (= ~s~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))))) [2018-10-27 00:00:10,131 INFO L425 ceAbstractionStarter]: For program point L507-1(lines 507 508) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 620) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L425 ceAbstractionStarter]: For program point L574(lines 574 579) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L421 ceAbstractionStarter]: At program point L541(line 541) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (not (= ~pended~0 1)) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2))) [2018-10-27 00:00:10,132 INFO L425 ceAbstractionStarter]: For program point L541-1(line 541) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 568) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L425 ceAbstractionStarter]: For program point L525(lines 500 630) no Hoare annotation was computed. [2018-10-27 00:00:10,132 INFO L421 ceAbstractionStarter]: At program point L616(lines 612 621) the Hoare annotation is: (or (and (= ~NP~0 ~s~0) (not (= ~pended~0 1))) (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1)))) [2018-10-27 00:00:10,133 INFO L421 ceAbstractionStarter]: At program point L600(line 600) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (not (= ~pended~0 1)) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2))) [2018-10-27 00:00:10,133 INFO L425 ceAbstractionStarter]: For program point L600-1(line 600) no Hoare annotation was computed. [2018-10-27 00:00:10,133 INFO L421 ceAbstractionStarter]: At program point L534(lines 534 535) the Hoare annotation is: (or (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (not (= ~pended~0 1)) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2)) (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1)))) [2018-10-27 00:00:10,133 INFO L425 ceAbstractionStarter]: For program point L534-1(lines 534 535) no Hoare annotation was computed. [2018-10-27 00:00:10,134 INFO L421 ceAbstractionStarter]: At program point L592(lines 592 594) the Hoare annotation is: (or (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (not (= ~pended~0 1)) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2)) (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1)))) [2018-10-27 00:00:10,135 INFO L425 ceAbstractionStarter]: For program point L625-1(lines 625 627) no Hoare annotation was computed. [2018-10-27 00:00:10,135 INFO L425 ceAbstractionStarter]: For program point L592-1(lines 592 594) no Hoare annotation was computed. [2018-10-27 00:00:10,135 INFO L425 ceAbstractionStarter]: For program point L518(lines 518 523) no Hoare annotation was computed. [2018-10-27 00:00:10,135 INFO L425 ceAbstractionStarter]: For program point L518-2(lines 500 630) no Hoare annotation was computed. [2018-10-27 00:00:10,135 INFO L421 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (and (= 259 DiskPerfRegisterDevice_~__cil_tmp32~0) (and (and (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= DiskPerfRegisterDevice_~irp~0 0)) (let ((.cse12 (+ ~NP~0 2147483646))) (let ((.cse0 (<= ~MPR3~0 (+ DiskPerfRegisterDevice_~ioStatus~0 2147483654))) (.cse1 (<= DiskPerfRegisterDevice_~__cil_tmp22~0 (+ ~MPR1~0 2953339))) (.cse2 (<= DiskPerfRegisterDevice_~output~0 .cse12)) (.cse3 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~event~1 2147483648))) (.cse4 (<= DiskPerfRegisterDevice_~sizeof__number~0 (+ ~compRegistered~0 2147483646))) (.cse5 (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653)) (.cse6 (<= 0 (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse7 (<= 0 (+ DiskPerfRegisterDevice_~output~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse8 (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643))) (.cse9 (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652)) (.cse10 (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648)) (.cse11 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)))) (or (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) .cse0 .cse1 .cse2 (= ~s~0 1) .cse3 (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) .cse4 .cse5 .cse6 .cse7 .cse8 (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) .cse9 .cse10 .cse11 (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (and (= ~s~0 6) (<= DiskPerfRegisterDevice_~event~1 .cse12) .cse0 .cse1 .cse2 .cse3 (<= (+ ~s~0 2953338) DiskPerfRegisterDevice_~__cil_tmp22~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= DiskPerfRegisterDevice_~__cil_tmp22~0 (+ DiskPerfRegisterDevice_~sizeof__number~0 2150436992)) .cse9 .cse10 (<= (+ ~s~0 DiskPerfRegisterDevice_~number~0) 2147483653) .cse11)))) (<= ~MPR1~0 (+ DiskPerfRegisterDevice_~irp~0 2147483653)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647))) (let ((.cse14 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse13 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse13) (or (not (= ~myStatus~0 0)) .cse13))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse14) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse14 1)))) [2018-10-27 00:00:10,142 INFO L425 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-10-27 00:00:10,143 INFO L425 ceAbstractionStarter]: For program point L510(lines 510 512) no Hoare annotation was computed. [2018-10-27 00:00:10,143 INFO L421 ceAbstractionStarter]: At program point DiskPerfRegisterDeviceENTRY(lines 460 631) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1)))) [2018-10-27 00:00:10,143 INFO L425 ceAbstractionStarter]: For program point L527(lines 527 529) no Hoare annotation was computed. [2018-10-27 00:00:10,143 INFO L421 ceAbstractionStarter]: At program point L520(line 520) the Hoare annotation is: (let ((.cse0 (not (= DiskPerfRegisterDevice_~irp~0 0))) (.cse1 (= 259 DiskPerfRegisterDevice_~__cil_tmp23~0)) (.cse2 (let ((.cse21 (+ ~NP~0 2147483646))) (let ((.cse9 (<= ~MPR3~0 (+ DiskPerfRegisterDevice_~ioStatus~0 2147483654))) (.cse10 (<= DiskPerfRegisterDevice_~output~0 .cse21)) (.cse11 (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350)) (.cse12 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~event~1 2147483648))) (.cse13 (<= DiskPerfRegisterDevice_~sizeof__number~0 (+ ~compRegistered~0 2147483646))) (.cse14 (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653)) (.cse15 (<= 0 (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse16 (<= 0 (+ DiskPerfRegisterDevice_~output~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse17 (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643))) (.cse18 (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652)) (.cse19 (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648)) (.cse20 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)))) (or (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) .cse9 .cse10 (= ~s~0 1) .cse11 .cse12 (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) .cse13 .cse14 .cse15 .cse16 .cse17 (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) .cse18 .cse19 .cse20 (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (and (= ~s~0 6) (<= DiskPerfRegisterDevice_~event~1 .cse21) .cse9 .cse10 .cse11 .cse12 (<= (+ ~s~0 2953338) DiskPerfRegisterDevice_~__cil_tmp22~0) .cse13 .cse14 .cse15 .cse16 .cse17 (<= DiskPerfRegisterDevice_~__cil_tmp22~0 (+ DiskPerfRegisterDevice_~sizeof__number~0 2150436992)) .cse18 .cse19 (<= (+ ~s~0 DiskPerfRegisterDevice_~number~0) 2147483653) .cse20))))) (.cse3 (not (= ~pended~0 1))) (.cse4 (<= 1 ~setEventCalled~0)) (.cse5 (<= ~setEventCalled~0 1)) (.cse6 (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647))) (or (and .cse0 .cse1 .cse2 (and (= ~NP~0 ~s~0) .cse3 .cse4 .cse5) (<= ~MPR1~0 (+ DiskPerfRegisterDevice_~irp~0 2147483653)) .cse6) (and (<= DiskPerfRegisterDevice_~__cil_tmp23~0 DiskPerfRegisterDevice_~status~5) .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) .cse6 (<= (+ ~s~0 DiskPerfRegisterDevice_~status~5) 265)) (let ((.cse8 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse7 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse7) (or (not (= ~myStatus~0 0)) .cse7))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse8) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse8 1))))) [2018-10-27 00:00:10,152 INFO L425 ceAbstractionStarter]: For program point L520-1(line 520) no Hoare annotation was computed. [2018-10-27 00:00:10,152 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 550) no Hoare annotation was computed. [2018-10-27 00:00:10,152 INFO L425 ceAbstractionStarter]: For program point L545-2(lines 545 550) no Hoare annotation was computed. [2018-10-27 00:00:10,152 INFO L421 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (not (= ~pended~0 1)) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2))) [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 539) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 581) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L554-1(lines 525 623) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 609) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 525 623) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceEXIT(lines 460 631) no Hoare annotation was computed. [2018-10-27 00:00:10,158 INFO L425 ceAbstractionStarter]: For program point L596(lines 596 598) no Hoare annotation was computed. [2018-10-27 00:00:10,159 INFO L421 ceAbstractionStarter]: At program point L563(lines 563 564) the Hoare annotation is: (or (and (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (not (= ~pended~0 1)) (<= 2 (+ ~s~0 ~NP~0)) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647) (<= (* 2 ~s~0) 2)) (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1)))) [2018-10-27 00:00:10,161 INFO L425 ceAbstractionStarter]: For program point L563-1(lines 563 564) no Hoare annotation was computed. [2018-10-27 00:00:10,161 INFO L425 ceAbstractionStarter]: For program point DiskPerfRegisterDeviceFINAL(lines 460 631) no Hoare annotation was computed. [2018-10-27 00:00:10,161 INFO L421 ceAbstractionStarter]: At program point L547(line 547) the Hoare annotation is: (or (and (= 259 DiskPerfRegisterDevice_~__cil_tmp27~0) (and (and (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (not (= DiskPerfRegisterDevice_~irp~0 0)) (let ((.cse12 (+ ~NP~0 2147483646))) (let ((.cse0 (<= ~MPR3~0 (+ DiskPerfRegisterDevice_~ioStatus~0 2147483654))) (.cse1 (<= DiskPerfRegisterDevice_~output~0 .cse12)) (.cse2 (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350)) (.cse3 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~event~1 2147483648))) (.cse4 (<= DiskPerfRegisterDevice_~sizeof__number~0 (+ ~compRegistered~0 2147483646))) (.cse5 (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653)) (.cse6 (<= 0 (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse7 (<= 0 (+ DiskPerfRegisterDevice_~output~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304))) (.cse8 (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643))) (.cse9 (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652)) (.cse10 (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648)) (.cse11 (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)))) (or (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) .cse0 .cse1 (= ~s~0 1) .cse2 .cse3 (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) .cse4 .cse5 .cse6 .cse7 .cse8 (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) .cse9 .cse10 .cse11 (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (and (= ~s~0 6) (<= DiskPerfRegisterDevice_~event~1 .cse12) .cse0 .cse1 .cse2 .cse3 (<= (+ ~s~0 2953338) DiskPerfRegisterDevice_~__cil_tmp22~0) .cse4 .cse5 .cse6 .cse7 .cse8 (<= DiskPerfRegisterDevice_~__cil_tmp22~0 (+ DiskPerfRegisterDevice_~sizeof__number~0 2150436992)) .cse9 .cse10 (<= (+ ~s~0 DiskPerfRegisterDevice_~number~0) 2147483653) .cse11)))) (<= ~MPR1~0 (+ DiskPerfRegisterDevice_~irp~0 2147483653)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647))) (let ((.cse14 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse13 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse13) (or (not (= ~myStatus~0 0)) .cse13))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse14) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse14 1)))) [2018-10-27 00:00:10,166 INFO L421 ceAbstractionStarter]: At program point L514(line 514) the Hoare annotation is: (or (let ((.cse1 (+ ~routine~0 |old(~s~0)|))) (or (let ((.cse0 (or (or (or (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 |old(~pended~0)|) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (not (= |old(~customIrp~0)| 0))))) (and (or (< 0 (+ ~myStatus~0 1073741637)) .cse0) (or (not (= ~myStatus~0 0)) .cse0))) (< (+ ~pirp~0 ~MPR1~0 2147483643) 0) (< ~NP~0 ~compRegistered~0) (< 2147483652 (+ ~pirp~0 ~MPR1~0)) (< 6 (+ |old(~s~0)| ~MPR1~0)) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ ~compRegistered~0 5) ~MPR3~0) (< 1 .cse1) (< 2 (* 2 ~NP~0)) (< (+ |old(~s~0)| 4) ~MPR1~0) (< .cse1 1))) (and (and (= ~s~0 |old(~s~0)|) (not (= ~pended~0 1))) (not (= DiskPerfRegisterDevice_~irp~0 0)) (and (<= 2953345 (+ ~compRegistered~0 DiskPerfRegisterDevice_~__cil_tmp22~0)) (<= 0 (+ DiskPerfRegisterDevice_~ioStatus~0 DiskPerfRegisterDevice_~__cil_tmp22~0 2144530304)) (<= (+ DiskPerfRegisterDevice_~output~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2953350) (<= 0 (+ DiskPerfRegisterDevice_~event~1 ~MPR1~0 2147483643)) (<= (+ DiskPerfRegisterDevice_~number~0 DiskPerfRegisterDevice_~__cil_tmp22~0) 2150436991) (<= (+ DiskPerfRegisterDevice_~sizeof__number~0 ~MPR1~0) 2147483652) (<= (+ ~MPR3~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0) 2147483653) (<= 0 (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~MPR1~0 2147483643)) (<= DiskPerfRegisterDevice_~event~1 (+ ~s~0 2147483646)) (<= (+ DiskPerfRegisterDevice_~ioStatus~0 ~MPR1~0) 2147483652) (<= (+ DiskPerfRegisterDevice_~deviceExtension__TargetDeviceObject~6 ~compRegistered~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~number~0 2147483648)) (<= 0 (+ ~routine~0 DiskPerfRegisterDevice_~sizeof__MOUNTDEV_NAME~0 2147483648)) (<= 0 (+ DiskPerfRegisterDevice_~output~0 ~s~0 2147483647)) (<= 0 (+ ~s~0 DiskPerfRegisterDevice_~sizeof__number~0 2147483647))) (<= 0 (+ DiskPerfRegisterDevice_~irp~0 ~MPR1~0 2147483643)) (<= (+ ~routine~0 DiskPerfRegisterDevice_~irp~0) 2147483647))) [2018-10-27 00:00:10,172 INFO L425 ceAbstractionStarter]: For program point L547-1(line 547) no Hoare annotation was computed. [2018-10-27 00:00:10,172 INFO L421 ceAbstractionStarter]: At program point L411(lines 402 412) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,172 INFO L425 ceAbstractionStarter]: For program point L403-1(lines 403 410) no Hoare annotation was computed. [2018-10-27 00:00:10,173 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlFINAL(lines 353 434) no Hoare annotation was computed. [2018-10-27 00:00:10,173 INFO L421 ceAbstractionStarter]: At program point L403-3(lines 403 410) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,173 INFO L421 ceAbstractionStarter]: At program point L428(line 428) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,173 INFO L425 ceAbstractionStarter]: For program point L428-1(line 428) no Hoare annotation was computed. [2018-10-27 00:00:10,173 INFO L425 ceAbstractionStarter]: For program point L387(lines 387 417) no Hoare annotation was computed. [2018-10-27 00:00:10,173 INFO L425 ceAbstractionStarter]: For program point L387-2(lines 387 417) no Hoare annotation was computed. [2018-10-27 00:00:10,173 INFO L421 ceAbstractionStarter]: At program point DiskPerfDeviceControlENTRY(lines 353 434) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,180 INFO L425 ceAbstractionStarter]: For program point L404(lines 403 410) no Hoare annotation was computed. [2018-10-27 00:00:10,180 INFO L425 ceAbstractionStarter]: For program point DiskPerfDeviceControlEXIT(lines 353 434) no Hoare annotation was computed. [2018-10-27 00:00:10,180 INFO L421 ceAbstractionStarter]: At program point L396(line 396) the Hoare annotation is: (or (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,180 INFO L425 ceAbstractionStarter]: For program point L396-1(line 396) no Hoare annotation was computed. [2018-10-27 00:00:10,180 INFO L425 ceAbstractionStarter]: For program point L392(lines 392 399) no Hoare annotation was computed. [2018-10-27 00:00:10,180 INFO L421 ceAbstractionStarter]: At program point L421(line 421) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0)) (.cse1 (not (= ~pended~0 1)))) (or (and .cse0 (= 0 DiskPerfDeviceControl_~status~4) .cse1) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5)) (and .cse0 (<= (+ DiskPerfDeviceControl_~status~4 1073741789) 0) .cse1))) [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point L421-1(line 421) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point L386(lines 386 431) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L428 ceAbstractionStarter]: At program point errorFnENTRY(lines 51 58) the Hoare annotation is: true [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point errorFnFINAL(lines 51 58) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point errorFnEXIT(lines 51 58) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 55) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point L178-1(line 178) no Hoare annotation was computed. [2018-10-27 00:00:10,181 INFO L421 ceAbstractionStarter]: At program point DiskPerfRemoveDeviceENTRY(lines 166 185) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~routine~0 0)) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= ~pended~0 1))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (< 1 ~NP~0)) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~IPC~0 (+ ~DC~0 5))) (.cse16 (< |old(~s~0)| 1)) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 (and .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-10-27 00:00:10,181 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceFINAL(lines 166 185) no Hoare annotation was computed. [2018-10-27 00:00:10,182 INFO L425 ceAbstractionStarter]: For program point DiskPerfRemoveDeviceEXIT(lines 166 185) no Hoare annotation was computed. [2018-10-27 00:00:10,183 INFO L421 ceAbstractionStarter]: At program point L181(line 181) the Hoare annotation is: (let ((.cse12 (<= 1 ~compRegistered~0)) (.cse13 (= ~routine~0 0)) (.cse14 (= ~NP~0 ~s~0)) (.cse16 (not (= ~pended~0 1))) (.cse24 (+ ~MPR3~0 1)) (.cse20 (+ ~SKIP1~0 2)) (.cse23 (+ ~DC~0 2)) (.cse21 (+ ~NP~0 4)) (.cse22 (+ ~NP~0 5))) (let ((.cse0 (< ~MPR3~0 .cse22)) (.cse11 (= |old(~myStatus~0)| DiskPerfRemoveDevice_~status~2)) (.cse15 (= |old(~customIrp~0)| ~customIrp~0)) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 .cse21)) (.cse3 (< ~SKIP2~0 .cse23)) (.cse4 (< 1 ~NP~0)) (.cse5 (not (= 0 |old(~routine~0)|))) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse7 (< ~MPR1~0 .cse20)) (.cse8 (not (= |old(~compRegistered~0)| 0))) (.cse9 (< ~IPC~0 .cse24)) (.cse10 (and (<= .cse20 ~MPR1~0) .cse12 (not (= 259 DiskPerfRemoveDevice_~status~2)) (<= 1 ~s~0) (<= .cse21 ~MPR1~0) (<= .cse22 ~MPR3~0) .cse13 (<= .cse23 ~SKIP2~0) .cse14 (<= ~s~0 1) .cse16 (<= .cse24 ~IPC~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse17 (< ~IPC~0 (+ ~DC~0 5))) (.cse18 (< |old(~s~0)| 1)) (.cse19 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (and .cse11 .cse12 .cse13 (= 0 ~myStatus~0) .cse14 .cse15 .cse16) .cse17 .cse18 .cse19) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse11 (= |old(~myStatus~0)| ~myStatus~0) .cse12 .cse13 .cse14 .cse15 .cse16) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse17 .cse18 .cse19)))) [2018-10-27 00:00:10,183 INFO L425 ceAbstractionStarter]: For program point L181-1(line 181) no Hoare annotation was computed. [2018-10-27 00:00:10,183 INFO L421 ceAbstractionStarter]: At program point L178(line 178) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse3 (= 0 ~compRegistered~0)) (.cse4 (= ~routine~0 0)) (.cse5 (= ~NP~0 ~s~0)) (.cse6 (= |old(~customIrp~0)| ~customIrp~0)) (.cse7 (not (= ~pended~0 1))) (.cse1 (= 1 |old(~pended~0)|)) (.cse2 (< ~MPR1~0 (+ ~NP~0 4))) (.cse8 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse9 (< 1 ~NP~0)) (.cse10 (not (= 0 |old(~routine~0)|))) (.cse11 (not (= |old(~s~0)| ~NP~0))) (.cse12 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse13 (not (= |old(~compRegistered~0)| 0))) (.cse14 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse15 (< ~IPC~0 (+ ~DC~0 5))) (.cse16 (< |old(~s~0)| 1)) (.cse17 (not (= |old(~customIrp~0)| 0)))) (and (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 .cse2 (and .cse3 .cse4 (= 0 ~myStatus~0) .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) (or .cse0 (< 0 (+ |old(~myStatus~0)| 1073741637)) (and .cse3 (= |old(~myStatus~0)| ~myStatus~0) .cse4 .cse5 .cse6 .cse7) .cse1 .cse2 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) [2018-10-27 00:00:10,184 INFO L421 ceAbstractionStarter]: At program point DiskPerfCreateENTRY(lines 288 298) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-10-27 00:00:10,184 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateFINAL(lines 288 298) no Hoare annotation was computed. [2018-10-27 00:00:10,184 INFO L421 ceAbstractionStarter]: At program point L294(line 294) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (= ~s~0 ~NP~0) (= 1 ~pended~0) (not (= ~compRegistered~0 0))) [2018-10-27 00:00:10,184 INFO L425 ceAbstractionStarter]: For program point DiskPerfCreateEXIT(lines 288 298) no Hoare annotation was computed. [2018-10-27 00:00:10,184 INFO L425 ceAbstractionStarter]: For program point L294-1(line 294) no Hoare annotation was computed. [2018-10-27 00:00:10,184 INFO L428 ceAbstractionStarter]: At program point DiskPerfUnloadENTRY(lines 453 459) the Hoare annotation is: true [2018-10-27 00:00:10,184 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadEXIT(lines 453 459) no Hoare annotation was computed. [2018-10-27 00:00:10,188 INFO L425 ceAbstractionStarter]: For program point DiskPerfUnloadFINAL(lines 453 459) no Hoare annotation was computed. [2018-10-27 00:00:10,188 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionEXIT(lines 135 145) no Hoare annotation was computed. [2018-10-27 00:00:10,189 INFO L421 ceAbstractionStarter]: At program point L141(line 141) the Hoare annotation is: (let ((.cse0 (and (<= (+ DiskPerfIrpCompletion_~Event~0 ~NP~0) 2147483648) (<= 0 (+ ~routine~0 DiskPerfIrpCompletion_~Event~0 2147483648)))) (.cse4 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse5 (< 2147483648 (+ ~s~0 |DiskPerfIrpCompletion_#in~Context|))) (.cse6 (< (+ |DiskPerfIrpCompletion_#in~DeviceObject| ~compRegistered~0 2147483647) 0)) (.cse7 (< 2147483648 (+ ~s~0 |DiskPerfIrpCompletion_#in~DeviceObject|))) (.cse8 (< (+ ~routine~0 2147483647) |DiskPerfIrpCompletion_#in~Irp|)) (.cse9 (< ~NP~0 ~compRegistered~0)) (.cse10 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse11 (< (+ |DiskPerfIrpCompletion_#in~Context| ~MPR3~0 2147483642) 0)) (.cse12 (< (+ |DiskPerfIrpCompletion_#in~Irp| 2147483648) ~routine~0)) (.cse13 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse3 (not (= ~myStatus~0 0))) (.cse2 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or (not (= 0 ~routine~0)) (< ~MPR1~0 (+ ~SKIP1~0 2)) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse1 (< 0 (+ ~myStatus~0 1073741637))) (.cse14 (< (+ ~s~0 4) ~MPR1~0))) (and (or (= |DiskPerfIrpCompletion_#in~Irp| 0) .cse0 (and (or .cse1 .cse2) (or .cse3 .cse2)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (or .cse0 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse15 (not (= ~customIrp~0 0)))) (and (or .cse2 .cse3 .cse15) (or .cse2 .cse1 .cse15))) .cse14))) [2018-10-27 00:00:10,189 INFO L425 ceAbstractionStarter]: For program point L141-1(line 141) no Hoare annotation was computed. [2018-10-27 00:00:10,189 INFO L428 ceAbstractionStarter]: At program point DiskPerfIrpCompletionENTRY(lines 135 145) the Hoare annotation is: true [2018-10-27 00:00:10,189 INFO L425 ceAbstractionStarter]: For program point DiskPerfIrpCompletionFINAL(lines 135 145) no Hoare annotation was computed. [2018-10-27 00:00:10,189 INFO L421 ceAbstractionStarter]: At program point L894(line 894) the Hoare annotation is: (let ((.cse25 (not (= 0 ~routine~0))) (.cse26 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse27 (= 1 |old(~pended~0)|)) (.cse29 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse30 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (and (not (= ~pended~0 1)) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1))) (.cse1 (<= (+ ~NP~0 IofCallDriver_~DeviceObject) 2147483648)) (.cse2 (<= 0 (+ ~MPR3~0 IofCallDriver_~DeviceObject 2147483642))) (.cse3 (= ~s~0 1)) (.cse4 (<= ~MPR3~0 (+ IofCallDriver_~compRetStatus~0 1073741808))) (.cse5 (<= (+ IofCallDriver_~compRetStatus~0 1073741803) ~NP~0)) (.cse6 (<= ~MPR1~0 (+ IofCallDriver_~__cil_tmp7~0 1073741807))) (.cse7 (<= (+ IofCallDriver_~__cil_tmp7~0 1073741802) ~routine~0)) (.cse8 (<= (+ IofCallDriver_~Irp ~MPR1~0) 2147483652)) (.cse9 (<= 0 (+ IofCallDriver_~lcontext~0 ~NP~0 2147483647))) (.cse10 (<= (+ IofCallDriver_~lcontext~0 ~compRegistered~0) 2147483648)) (.cse11 (<= ~routine~0 (+ IofCallDriver_~Irp 2147483648))) (.cse22 (< 0 (+ ~myStatus~0 1073741637))) (.cse20 (not (= ~myStatus~0 0))) (.cse19 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse25 .cse26 .cse27 (< ~compRegistered~0 1) .cse29 .cse30) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse12 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse13 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse14 (< ~NP~0 ~compRegistered~0)) (.cse15 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse16 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse17 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse18 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse23 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse24 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse28 (not (= ~compRegistered~0 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (let ((.cse21 (not (= ~customIrp~0 0)))) (and (or .cse19 .cse20 .cse21) (or .cse19 .cse22 .cse21))) .cse23 .cse24) (or (= |IofCallDriver_#in~Irp| 0) (and (not (= IofCallDriver_~Irp 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and (or .cse22 .cse19) (or .cse20 .cse19)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse23 .cse24) (or .cse25 .cse26 .cse27 .cse28 (not (= ~SKIP1~0 |old(~s~0)|)) .cse29 .cse30) (or .cse25 (not (= |old(~s~0)| ~NP~0)) .cse27 .cse28 .cse29 .cse30)))) [2018-10-27 00:00:10,192 INFO L421 ceAbstractionStarter]: At program point L907(lines 906 923) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse27 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse29 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse28 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse12 (<= (+ IofCallDriver_~tmp_ndt_8~0 ~MPR1~0) 2147483652)) (.cse6 (<= .cse28 0)) (.cse7 (<= .cse29 0)) (.cse8 (<= 0 .cse29)) (.cse9 (<= 0 .cse28)) (.cse10 (<= 1 ~setEventCalled~0)) (.cse11 (<= ~setEventCalled~0 1)) (.cse13 (<= 0 (+ ~s~0 IofCallDriver_~tmp_ndt_8~0 2147483643))) (.cse17 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse18 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse19 (< ~NP~0 ~compRegistered~0)) (.cse20 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse21 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse22 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse23 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse16 (not (= ~myStatus~0 0))) (.cse15 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse27 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse24 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse25 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (and (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11) (<= ~s~0 (+ ~routine~0 5)) .cse12 (<= 6 (+ ~s~0 ~compRegistered~0)) .cse13) (= |IofCallDriver_#in~Irp| 0) (and (or .cse14 .cse15) (or .cse16 .cse15)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or (and .cse12 (and .cse6 .cse7 .cse8 (= ~MPR1~0 ~s~0) .cse9 .cse0 .cse10 .cse11) .cse13) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (let ((.cse26 (not (= ~customIrp~0 0)))) (and (or .cse15 .cse16 .cse26) (or .cse15 .cse14 .cse26))) .cse24 .cse25) (or .cse1 .cse27 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-10-27 00:00:10,198 INFO L421 ceAbstractionStarter]: At program point L887(line 887) the Hoare annotation is: (let ((.cse12 (not (= 0 ~routine~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (= 1 |old(~pended~0)|)) (.cse16 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse17 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse15 (not (= ~compRegistered~0 0))) (.cse3 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse4 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse5 (< ~NP~0 ~compRegistered~0)) (.cse6 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse7 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse8 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse9 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse2 (not (= ~myStatus~0 0))) (.cse1 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse12 .cse13 .cse14 (< ~compRegistered~0 1) .cse16 .cse17) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse10 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse11 (< (+ |old(~s~0)| 4) ~MPR1~0))) (and (or (= |IofCallDriver_#in~Irp| 0) (and (or .cse0 .cse1) (or .cse2 .cse1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse15 (not (= ~SKIP1~0 |old(~s~0)|)) .cse16 .cse17) (or .cse12 (not (= |old(~s~0)| ~NP~0)) .cse14 .cse15 .cse16 .cse17) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse18 (not (= ~customIrp~0 0)))) (and (or .cse1 .cse2 .cse18) (or .cse1 .cse0 .cse18))) .cse10 .cse11)))) [2018-10-27 00:00:10,198 INFO L425 ceAbstractionStarter]: For program point L887-1(line 887) no Hoare annotation was computed. [2018-10-27 00:00:10,199 INFO L421 ceAbstractionStarter]: At program point L883(line 883) the Hoare annotation is: (let ((.cse21 (not (= 0 ~routine~0))) (.cse22 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse23 (= 1 |old(~pended~0)|)) (.cse25 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse26 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (<= (+ ~NP~0 IofCallDriver_~DeviceObject) 2147483648)) (.cse2 (<= 0 (+ ~MPR3~0 IofCallDriver_~DeviceObject 2147483642))) (.cse3 (= ~s~0 1)) (.cse4 (<= (+ IofCallDriver_~Irp ~MPR1~0) 2147483652)) (.cse5 (<= 0 (+ IofCallDriver_~lcontext~0 ~NP~0 2147483647))) (.cse6 (<= (+ IofCallDriver_~lcontext~0 ~compRegistered~0) 2147483648)) (.cse7 (<= ~routine~0 (+ IofCallDriver_~Irp 2147483648))) (.cse18 (< 0 (+ ~myStatus~0 1073741637))) (.cse16 (not (= ~myStatus~0 0))) (.cse15 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse21 .cse22 .cse23 (< ~compRegistered~0 1) .cse25 .cse26) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse8 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse9 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse10 (< ~NP~0 ~compRegistered~0)) (.cse11 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse12 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse13 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse14 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse19 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse20 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse24 (not (= ~compRegistered~0 0)))) (and (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 (let ((.cse17 (not (= ~customIrp~0 0)))) (and (or .cse15 .cse16 .cse17) (or .cse15 .cse18 .cse17))) .cse19 .cse20) (or (= |IofCallDriver_#in~Irp| 0) (and (not (= IofCallDriver_~Irp 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (or .cse18 .cse15) (or .cse16 .cse15)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse19 .cse20) (or .cse21 .cse22 .cse23 .cse24 (not (= ~SKIP1~0 |old(~s~0)|)) .cse25 .cse26) (or .cse21 (not (= |old(~s~0)| ~NP~0)) .cse23 .cse24 .cse25 .cse26)))) [2018-10-27 00:00:10,204 INFO L421 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 872 950) the Hoare annotation is: (let ((.cse0 (not (= ~pended~0 1))) (.cse1 (not (= 0 ~routine~0))) (.cse20 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse17 (< 0 (+ ~myStatus~0 1073741637))) (.cse15 (not (= ~myStatus~0 0))) (.cse14 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse20 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse7 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse6 (and .cse0 (<= 2 (+ ~s~0 ~NP~0)) (<= (* 2 ~s~0) 2))) (.cse8 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse9 (< ~NP~0 ~compRegistered~0)) (.cse10 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse11 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse12 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse13 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse18 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse19 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (let ((.cse16 (not (= ~customIrp~0 0)))) (and (or .cse14 .cse15 .cse16) (or .cse14 .cse17 .cse16))) .cse18 .cse19) (or (= |IofCallDriver_#in~Irp| 0) (and (or .cse17 .cse14) (or .cse15 .cse14)) .cse7 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse18 .cse19) (or .cse1 .cse20 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-10-27 00:00:10,204 INFO L425 ceAbstractionStarter]: For program point L883-1(line 883) no Hoare annotation was computed. [2018-10-27 00:00:10,204 INFO L425 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 872 950) no Hoare annotation was computed. [2018-10-27 00:00:10,204 INFO L425 ceAbstractionStarter]: For program point L929(lines 929 946) no Hoare annotation was computed. [2018-10-27 00:00:10,210 INFO L425 ceAbstractionStarter]: For program point L892(lines 892 896) no Hoare annotation was computed. [2018-10-27 00:00:10,211 INFO L421 ceAbstractionStarter]: At program point L921(lines 879 949) the Hoare annotation is: (let ((.cse14 (not (= 0 ~routine~0))) (.cse35 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse15 (= 1 |old(~pended~0)|)) (.cse17 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse18 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse34 (< 0 (+ ~myStatus~0 1073741637))) (.cse32 (not (= ~myStatus~0 0))) (.cse31 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse14 .cse35 .cse15 (< ~compRegistered~0 1) .cse17 .cse18) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse37 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse36 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse8 (<= (+ IofCallDriver_~tmp_ndt_8~0 ~MPR1~0) 2147483652)) (.cse9 (<= 0 (+ ~s~0 IofCallDriver_~tmp_ndt_8~0 2147483643))) (.cse16 (not (= ~compRegistered~0 0))) (.cse0 (= |IofCallDriver_#in~Irp| 0)) (.cse24 (= IofCallDriver_~returnVal2~0 259)) (.cse28 (<= ~s~0 (+ ~routine~0 5))) (.cse29 (<= 6 (+ ~s~0 ~compRegistered~0))) (.cse27 (= 0 IofCallDriver_~returnVal2~0)) (.cse19 (<= .cse36 0)) (.cse20 (<= .cse37 0)) (.cse30 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (.cse21 (<= 0 .cse37)) (.cse22 (= ~MPR1~0 ~s~0)) (.cse23 (<= 0 .cse36)) (.cse13 (not (= ~pended~0 1))) (.cse25 (<= 1 ~setEventCalled~0)) (.cse26 (<= ~setEventCalled~0 1)) (.cse1 (and (or .cse34 .cse31) (or .cse32 .cse31))) (.cse2 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse3 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse4 (< ~NP~0 ~compRegistered~0)) (.cse5 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse6 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse7 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse10 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse11 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse12 (< (+ |old(~s~0)| 4) ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and .cse8 .cse9) .cse10 .cse11 .cse12) (or (and (= ~s~0 ~NP~0) .cse13) .cse14 (not (= |old(~s~0)| ~NP~0)) .cse15 .cse16 .cse17 .cse18) (or (and .cse8 (and .cse19 .cse20 .cse21 .cse22 .cse23 .cse13 .cse24 .cse25 .cse26) .cse9) (and (and .cse19 .cse20 .cse21 .cse27 .cse23 .cse13 .cse25 .cse26) .cse28 .cse8 .cse29 .cse9) (and (and .cse19 .cse20 .cse30 .cse21 .cse23 .cse13 .cse25 .cse26) .cse28 .cse8 .cse29 .cse9) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 (let ((.cse33 (not (= ~customIrp~0 0)))) (and (or .cse31 .cse32 .cse33) (or .cse31 .cse34 .cse33))) .cse11 .cse12) (or .cse14 .cse35 .cse15 (and (= ~s~0 ~SKIP1~0) .cse13) .cse16 (not (= ~SKIP1~0 |old(~s~0)|)) .cse17 .cse18) (or .cse0 (and (and .cse19 .cse20 .cse21 .cse23 .cse13 .cse24 .cse25 .cse26) .cse28 .cse29) (or (and .cse19 .cse20 .cse21 .cse22 .cse27 .cse23 .cse13 .cse25 .cse26) (and .cse19 .cse20 .cse30 .cse21 .cse22 .cse23 .cse13 .cse25 .cse26)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse12))))) [2018-10-27 00:00:10,211 INFO L425 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 872 950) no Hoare annotation was computed. [2018-10-27 00:00:10,211 INFO L425 ceAbstractionStarter]: For program point L880(lines 880 898) no Hoare annotation was computed. [2018-10-27 00:00:10,211 INFO L425 ceAbstractionStarter]: For program point L880-1(lines 880 898) no Hoare annotation was computed. [2018-10-27 00:00:10,211 INFO L425 ceAbstractionStarter]: For program point $Ultimate##15(lines 910 922) no Hoare annotation was computed. [2018-10-27 00:00:10,211 INFO L421 ceAbstractionStarter]: At program point L909(lines 908 923) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse27 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse29 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse28 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse12 (<= (+ IofCallDriver_~tmp_ndt_8~0 ~MPR1~0) 2147483652)) (.cse6 (<= .cse28 0)) (.cse7 (<= .cse29 0)) (.cse8 (<= 0 .cse29)) (.cse9 (<= 0 .cse28)) (.cse10 (<= 1 ~setEventCalled~0)) (.cse11 (<= ~setEventCalled~0 1)) (.cse13 (<= 0 (+ ~s~0 IofCallDriver_~tmp_ndt_8~0 2147483643))) (.cse17 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse18 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse19 (< ~NP~0 ~compRegistered~0)) (.cse20 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse21 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse22 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse23 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse16 (not (= ~myStatus~0 0))) (.cse15 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse27 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse24 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse25 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (and (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11) (<= ~s~0 (+ ~routine~0 5)) .cse12 (<= 6 (+ ~s~0 ~compRegistered~0)) .cse13) (= |IofCallDriver_#in~Irp| 0) (and (or .cse14 .cse15) (or .cse16 .cse15)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or (and .cse12 (and .cse6 .cse7 .cse8 (= ~MPR1~0 ~s~0) .cse9 .cse0 .cse10 .cse11) .cse13) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (let ((.cse26 (not (= ~customIrp~0 0)))) (and (or .cse15 .cse16 .cse26) (or .cse15 .cse14 .cse26))) .cse24 .cse25) (or .cse1 .cse27 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-10-27 00:00:10,213 INFO L425 ceAbstractionStarter]: For program point L938(lines 938 945) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L425 ceAbstractionStarter]: For program point L901(lines 901 924) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L425 ceAbstractionStarter]: For program point $Ultimate##14(lines 910 922) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L425 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 889) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L425 ceAbstractionStarter]: For program point L881-2(lines 881 889) no Hoare annotation was computed. [2018-10-27 00:00:10,214 INFO L421 ceAbstractionStarter]: At program point L943(line 943) the Hoare annotation is: (let ((.cse12 (not (= 0 ~routine~0))) (.cse13 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse14 (= 1 |old(~pended~0)|)) (.cse16 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse17 (< ~IPC~0 (+ ~DC~0 5)))) (let ((.cse15 (not (= ~compRegistered~0 0))) (.cse3 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse4 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse5 (< ~NP~0 ~compRegistered~0)) (.cse6 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse7 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse8 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse9 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse2 (not (= ~myStatus~0 0))) (.cse1 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse12 .cse13 .cse14 (< ~compRegistered~0 1) .cse16 .cse17) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse0 (< 0 (+ ~myStatus~0 1073741637))) (.cse10 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse11 (< (+ |old(~s~0)| 4) ~MPR1~0))) (and (or (= |IofCallDriver_#in~Irp| 0) (and (or .cse0 .cse1) (or .cse2 .cse1)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse12 .cse13 .cse14 .cse15 (not (= ~SKIP1~0 |old(~s~0)|)) .cse16 .cse17) (or .cse12 (not (= |old(~s~0)| ~NP~0)) .cse14 .cse15 .cse16 .cse17) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (let ((.cse18 (not (= ~customIrp~0 0)))) (and (or .cse1 .cse2 .cse18) (or .cse1 .cse0 .cse18))) .cse10 .cse11)))) [2018-10-27 00:00:10,216 INFO L425 ceAbstractionStarter]: For program point L943-1(lines 925 947) no Hoare annotation was computed. [2018-10-27 00:00:10,216 INFO L425 ceAbstractionStarter]: For program point L906(lines 906 923) no Hoare annotation was computed. [2018-10-27 00:00:10,217 INFO L421 ceAbstractionStarter]: At program point L902(lines 901 924) the Hoare annotation is: (let ((.cse1 (not (= 0 ~routine~0))) (.cse27 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse2 (= 1 |old(~pended~0)|)) (.cse4 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse29 (+ IofCallDriver_~compRetStatus~0 1073741802)) (.cse28 (+ IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse12 (<= (+ IofCallDriver_~tmp_ndt_8~0 ~MPR1~0) 2147483652)) (.cse6 (<= .cse28 0)) (.cse7 (<= .cse29 0)) (.cse8 (<= 0 .cse29)) (.cse9 (<= 0 .cse28)) (.cse10 (<= 1 ~setEventCalled~0)) (.cse11 (<= ~setEventCalled~0 1)) (.cse13 (<= 0 (+ ~s~0 IofCallDriver_~tmp_ndt_8~0 2147483643))) (.cse17 (< (+ ~pirp~0 2147483654) ~MPR3~0)) (.cse18 (< (+ |IofCallDriver_#in~Irp| 2147483654) ~MPR3~0)) (.cse19 (< ~NP~0 ~compRegistered~0)) (.cse20 (< 2147483652 (+ ~pirp~0 ~MPR1~0))) (.cse21 (< (+ ~MPR1~0 2147483642) |IofCallDriver_#in~Irp|)) (.cse22 (< (+ |IofCallDriver_#in~DeviceObject| 2147483654) ~MPR3~0)) (.cse23 (< (+ ~compRegistered~0 5) ~MPR3~0)) (.cse16 (not (= ~myStatus~0 0))) (.cse15 (or (< ~MPR3~0 (+ ~NP~0 5)) (or (or .cse1 .cse27 .cse2 (< ~compRegistered~0 1) .cse4 .cse5) (< ~IPC~0 (+ ~MPR3~0 1))) (< ~NP~0 1) (< 1 |old(~s~0)|) (< ~MPR1~0 (+ ~NP~0 4)))) (.cse14 (< 0 (+ ~myStatus~0 1073741637))) (.cse24 (< 2147483648 (+ |IofCallDriver_#in~DeviceObject| |old(~s~0)|))) (.cse25 (< (+ |old(~s~0)| 4) ~MPR1~0)) (.cse0 (not (= ~pended~0 1))) (.cse3 (not (= ~compRegistered~0 0)))) (and (or (and (= ~s~0 ~NP~0) .cse0) .cse1 (not (= |old(~s~0)| ~NP~0)) .cse2 .cse3 .cse4 .cse5) (or (and (and .cse6 .cse7 .cse8 .cse9 .cse0 .cse10 .cse11) (<= ~s~0 (+ ~routine~0 5)) .cse12 (<= 6 (+ ~s~0 ~compRegistered~0)) .cse13) (= |IofCallDriver_#in~Irp| 0) (and (or .cse14 .cse15) (or .cse16 .cse15)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25) (or (and .cse12 (and .cse6 .cse7 .cse8 (= ~MPR1~0 ~s~0) .cse9 .cse0 .cse10 .cse11) .cse13) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (let ((.cse26 (not (= ~customIrp~0 0)))) (and (or .cse15 .cse16 .cse26) (or .cse15 .cse14 .cse26))) .cse24 .cse25) (or .cse1 .cse27 .cse2 (and (= ~s~0 ~SKIP1~0) .cse0) .cse3 (not (= ~SKIP1~0 |old(~s~0)|)) .cse4 .cse5)))) [2018-10-27 00:00:10,217 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 322) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point L320-2(lines 316 351) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L428 ceAbstractionStarter]: At program point L345(line 345) the Hoare annotation is: true [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point L341(lines 341 347) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionFINAL(lines 299 352) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point L335-1(lines 316 351) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point L323-1(lines 316 351) no Hoare annotation was computed. [2018-10-27 00:00:10,221 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 319) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 349) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point DiskPerfIoCompletionEXIT(lines 299 352) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L428 ceAbstractionStarter]: At program point DiskPerfIoCompletionENTRY(lines 299 352) the Hoare annotation is: true [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point L326-1(lines 316 351) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L421 ceAbstractionStarter]: At program point L128(lines 111 129) the Hoare annotation is: (or (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (< 2147483653 (+ |DiskPerfDispatchPnp_#in~DeviceObject| ~MPR3~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfDispatchPnp_#in~DeviceObject| 2147483654) ~MPR3~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (and (not (= 259 DiskPerfDispatchPnp_~status~0)) (and (<= 1 ~compRegistered~0) (= ~DC~0 ~s~0) (= ~routine~0 0) (not (= ~pended~0 1)))) (< (+ |DiskPerfDispatchPnp_#in~Irp| 2147483649) ~NP~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483648 (+ ~NP~0 |DiskPerfDispatchPnp_#in~Irp|))) [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point $Ultimate##6(lines 111 129) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpFINAL(lines 95 134) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point DiskPerfDispatchPnpEXIT(lines 95 134) no Hoare annotation was computed. [2018-10-27 00:00:10,222 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-10-27 00:00:10,223 INFO L421 ceAbstractionStarter]: At program point L110(lines 109 130) the Hoare annotation is: (or (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (and (= ~routine~0 0) (= 0 ~compRegistered~0) (= |old(~s~0)| ~s~0) (not (= ~pended~0 1))) (< (+ ~NP~0 |old(~s~0)|) 2) (< 2147483653 (+ |DiskPerfDispatchPnp_#in~DeviceObject| ~MPR3~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfDispatchPnp_#in~DeviceObject| 2147483654) ~MPR3~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< (+ |DiskPerfDispatchPnp_#in~Irp| 2147483649) ~NP~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483648 (+ ~NP~0 |DiskPerfDispatchPnp_#in~Irp|))) [2018-10-27 00:00:10,226 INFO L421 ceAbstractionStarter]: At program point L108(lines 107 130) the Hoare annotation is: (or (and (= 0 ~compRegistered~0) (= |old(~myStatus~0)| ~myStatus~0) (= ~routine~0 0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (< 2147483653 (+ |DiskPerfDispatchPnp_#in~DeviceObject| ~MPR3~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfDispatchPnp_#in~DeviceObject| 2147483654) ~MPR3~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< (+ |DiskPerfDispatchPnp_#in~Irp| 2147483649) ~NP~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483648 (+ ~NP~0 |DiskPerfDispatchPnp_#in~Irp|))) [2018-10-27 00:00:10,226 INFO L425 ceAbstractionStarter]: For program point L107(lines 107 130) no Hoare annotation was computed. [2018-10-27 00:00:10,226 INFO L421 ceAbstractionStarter]: At program point DiskPerfDispatchPnpENTRY(lines 95 134) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (and (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (<= 0 (* 2 ~compRegistered~0)) (<= (+ ~compRegistered~0 6) ~MPR3~0) (<= 2 (+ ~s~0 ~NP~0)) (<= (* 2 ~s~0) 2)) (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (< 2147483653 (+ |DiskPerfDispatchPnp_#in~DeviceObject| ~MPR3~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfDispatchPnp_#in~DeviceObject| 2147483654) ~MPR3~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< (+ |DiskPerfDispatchPnp_#in~Irp| 2147483649) ~NP~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483648 (+ ~NP~0 |DiskPerfDispatchPnp_#in~Irp|))) [2018-10-27 00:00:10,227 INFO L421 ceAbstractionStarter]: At program point L105(lines 104 131) the Hoare annotation is: (or (and (= |old(~myStatus~0)| ~myStatus~0) (and (= 0 ~compRegistered~0) (= ~routine~0 0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~pended~0 1))) (= ~s~0 1) (<= DiskPerfDispatchPnp_~DeviceObject (+ ~NP~0 2147483646)) (<= 0 (+ DiskPerfDispatchPnp_~irpSp__MinorFunction~0 ~MPR3~0 2147483642)) (<= 0 (+ (* 2 DiskPerfDispatchPnp_~DeviceObject) 4294967296)) (<= DiskPerfDispatchPnp_~irpSp__MinorFunction~0 (+ ~MPR3~0 2147483641)) (<= DiskPerfDispatchPnp_~Irp (+ ~compRegistered~0 2147483647)) (<= ~MPR1~0 (+ DiskPerfDispatchPnp_~Irp 2147483653))) (let ((.cse0 (= 1 |old(~pended~0)|)) (.cse1 (< ~SKIP2~0 (+ ~DC~0 2))) (.cse2 (not (= 0 |old(~routine~0)|))) (.cse3 (< ~MPR1~0 (+ ~SKIP1~0 2))) (.cse4 (< ~IPC~0 (+ ~MPR3~0 1))) (.cse5 (< ~IPC~0 (+ ~DC~0 5))) (.cse6 (not (= |old(~customIrp~0)| 0)))) (and (or (not (= |old(~myStatus~0)| 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (or (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6))) (< (+ ~NP~0 |old(~s~0)|) 2) (< 2147483653 (+ |DiskPerfDispatchPnp_#in~DeviceObject| ~MPR3~0)) (not (= 1 |old(~s~0)|)) (< (+ |old(~s~0)| 5) ~MPR3~0) (< ~MPR1~0 (+ |old(~compRegistered~0)| 5)) (< (+ ~pirp~0 |old(~s~0)| 2147483647) 0) (< (+ |old(~compRegistered~0)| 1) ~NP~0) (< (+ ~MPR3~0 ~MPR1~0) 11) (< (+ |DiskPerfDispatchPnp_#in~DeviceObject| 2147483654) ~MPR3~0) (< (+ |old(~s~0)| 4) ~MPR1~0) (< (+ |DiskPerfDispatchPnp_#in~Irp| 2147483649) ~NP~0) (< (+ |old(~compRegistered~0)| 2147483647) ~pirp~0) (< 2147483648 (+ ~NP~0 |DiskPerfDispatchPnp_#in~Irp|))) [2018-10-27 00:00:10,230 INFO L425 ceAbstractionStarter]: For program point L104(lines 104 131) no Hoare annotation was computed. [2018-10-27 00:00:10,230 INFO L425 ceAbstractionStarter]: For program point $Ultimate##5(lines 111 129) no Hoare annotation was computed. [2018-10-27 00:00:10,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:00:10,230 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~myStatus~0)| ~myStatus~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-10-27 00:00:10,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:00:10,230 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-27 00:00:10,231 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (* 2 ~pirp~0))) (and (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~SKIP2~0 ~s~0) (<= .cse0 4294967294) (= ~s~0 ~SKIP1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (<= 0 (+ .cse0 4294967296)) (= ~routine~0 0) (= ~MPR1~0 ~s~0) (= 0 ~myStatus~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)))) [2018-10-27 00:00:10,231 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-27 00:00:10,231 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-27 00:00:10,231 INFO L421 ceAbstractionStarter]: At program point L448(line 448) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,231 INFO L425 ceAbstractionStarter]: For program point L448-1(line 448) no Hoare annotation was computed. [2018-10-27 00:00:10,231 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushFINAL(lines 435 452) no Hoare annotation was computed. [2018-10-27 00:00:10,231 INFO L425 ceAbstractionStarter]: For program point DiskPerfShutdownFlushEXIT(lines 435 452) no Hoare annotation was computed. [2018-10-27 00:00:10,231 INFO L421 ceAbstractionStarter]: At program point DiskPerfShutdownFlushENTRY(lines 435 452) the Hoare annotation is: (or (and (= ~s~0 ~NP~0) (not (= ~pended~0 1))) (not (= 0 ~routine~0)) (not (= |old(~s~0)| ~NP~0)) (= 1 |old(~pended~0)|) (not (= ~compRegistered~0 0)) (< ~SKIP2~0 (+ ~DC~0 2)) (< ~IPC~0 (+ ~DC~0 5))) [2018-10-27 00:00:10,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 12:00:10 BoogieIcfgContainer [2018-10-27 00:00:10,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 00:00:10,381 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 00:00:10,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 00:00:10,381 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 00:00:10,388 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 11:51:22" (3/4) ... [2018-10-27 00:00:10,392 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSyncFilterWithTarget [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-10-27 00:00:10,399 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPower [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfSendToNextDriver [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfStartDevice [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfForwardIrpSynchronous [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRegisterDevice [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDeviceControl [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfRemoveDevice [2018-10-27 00:00:10,400 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfCreate [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfUnload [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIrpCompletion [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfIoCompletion [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfDispatchPnp [2018-10-27 00:00:10,401 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-27 00:00:10,413 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure DiskPerfShutdownFlush [2018-10-27 00:00:10,448 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 59 nodes and edges [2018-10-27 00:00:10,449 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-10-27 00:00:10,450 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-10-27 00:00:10,451 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-27 00:00:10,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,486 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,490 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && ((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp)) [2018-10-27 00:00:10,491 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && ((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp)) [2018-10-27 00:00:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-10-27 00:00:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,492 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\old(Irp) == 0 || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || (tmp_ndt_8 + MPR1 <= 2147483652 && 0 <= s + tmp_ndt_8 + 2147483643)) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && (((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || (((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643)) || (((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643)) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((\old(Irp) == 0 || (((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && 6 <= s + compRegistered)) || ((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) || ((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1) [2018-10-27 00:00:10,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || (!(259 == status) && ((1 <= compRegistered && DC == s) && routine == 0) && !(pended == 1))) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) [2018-10-27 00:00:10,493 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,505 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (NP == s && !(pended == 1)) || (((((((((((0 < myStatus + 1073741637 || ((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || !(\old(customIrp) == 0)) && (!(myStatus == 0) || ((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || !(\old(customIrp) == 0))) || pirp + MPR1 + 2147483643 < 0) || NP < compRegistered) || 2147483652 < pirp + MPR1) || 6 < \old(s) + MPR1) || MPR3 + MPR1 < 11) || compRegistered + 5 < MPR3) || 1 < routine + \old(s)) || 2 < 2 * NP) || \old(s) + 4 < MPR1) || routine + \old(s) < 1 [2018-10-27 00:00:10,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((!(myStatus == 0) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || (((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) [2018-10-27 00:00:10,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-10-27 00:00:10,506 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) [2018-10-27 00:00:10,507 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,507 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && 0 == myStatus) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC) || (((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) && 5 <= compRegistered + MPR1) && MPR1 + 1 <= MPR3) && 2 * irp_choice <= 4294967294) && 2 * compRegistered <= 0) && 2 * devobj <= 4294967294) && pirp <= NP + 2147483646) && s == 1) && MPR1 <= tmp_ndt_1 + 2147483653) && 0 <= 2 * irp_choice + 4294967296) && NP <= pirp + 2147483649) && tmp_ndt_3 <= compRegistered + 2147483647) && tmp_ndt_2 <= MPR1 + 2147483642) && 0 <= devobj + MPR1 + 2147483643) && 1 <= s + status) && tmp_ndt_1 <= s + 2147483646) && 0 <= tmp_ndt_2 + NP + 2147483647) && 6 <= NP + MPR1) && s + NP <= 2) && MPR3 + MPR1 <= 11) && status + compRegistered <= 2147483647) && 0 <= s + tmp_ndt_3 + 2147483647)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,508 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,508 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-10-27 00:00:10,508 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((\old(myStatus) == myStatus && ((0 == compRegistered && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) && s == 1) && DeviceObject <= NP + 2147483646) && 0 <= irpSp__MinorFunction + MPR3 + 2147483642) && 0 <= 2 * DeviceObject + 4294967296) && irpSp__MinorFunction <= MPR3 + 2147483641) && Irp <= compRegistered + 2147483647) && MPR1 <= Irp + 2147483653) || ((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) [2018-10-27 00:00:10,509 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && 0 == myStatus) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) || ((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) [2018-10-27 00:00:10,509 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) [2018-10-27 00:00:10,514 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,514 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 [2018-10-27 00:00:10,624 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4e9e4aaa-7bc1-4ed3-aff5-d9d5826a3404/bin-2019/utaipan/witness.graphml [2018-10-27 00:00:10,624 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 00:00:10,625 INFO L168 Benchmark]: Toolchain (without parser) took 531680.49 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 959.6 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,627 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:00:10,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 555.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.9 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 00:00:10,628 INFO L168 Benchmark]: Boogie Preprocessor took 204.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -216.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,628 INFO L168 Benchmark]: RCFGBuilder took 2284.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.7 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,628 INFO L168 Benchmark]: TraceAbstraction took 528353.98 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,629 INFO L168 Benchmark]: Witness Printer took 243.55 ms. Allocated memory is still 3.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-10-27 00:00:10,630 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 555.71 ms. Allocated memory is still 1.0 GB. Free memory was 956.9 MB in the beginning and 932.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.36 ms. Allocated memory is still 1.0 GB. Free memory is still 932.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 204.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 932.8 MB in the beginning and 1.1 GB in the end (delta: -216.4 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2284.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 82.7 MB). Peak memory consumption was 82.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 528353.98 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 3.4 GB. Max. memory is 11.5 GB. * Witness Printer took 243.55 ms. Allocated memory is still 3.5 GB. Free memory was 2.1 GB in the beginning and 2.0 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 55]: 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: 1000]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && ((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp)) - InvariantResult [Line: 780]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 711]: Loop Invariant Derived loop invariant: (((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1052]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 1002]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || !(myStatus == 0)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) && ((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && \old(customIrp) == customIrp) || 0 < myStatus + 1073741637) || ((\old(customIrp) == 1 && (((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && 1 <= compRegistered) && 1 <= s) && NP + 4 <= MPR1) && !(MPR3 == \old(s))) && routine == 0) && NP + 5 <= MPR3) && DC + 2 <= SKIP2) && NP == s) && s <= 1) && !(pended == 1)) && MPR3 + 1 <= IPC) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 == customIrp)) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled))) && (((NP == s && \old(customIrp) == customIrp) || (((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && ((((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) || (NP == s && \old(customIrp) == customIrp)) - InvariantResult [Line: 908]: Loop Invariant Derived loop invariant: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 845]: Loop Invariant Derived loop invariant: ((((((((compRegistered <= tmp_ndt_7 + 2147483649 && tmp_ndt_7 <= MPR3 + 2147483641) && compRegistered + malloc_ret <= 2147483648) && 0 <= MPR3 + malloc_ret + 2147483642) || pirp + MPR1 + 2147483643 < 0) || 2147483652 < pirp + MPR1) || s < compRegistered) || s + 4 < MPR1) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == pended) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < s) || 1 < NP) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == pended) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < s) || 1 < NP))) || MPR1 + 1 < MPR3 - InvariantResult [Line: 402]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1) || 0 < myStatus + 1073741637) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) && ((!(myStatus == 0) || ((((((((((((MPR3 < NP + 5 || 1 == pended) || MPR1 < NP + 4) || SKIP2 < DC + 2) || 1 < NP) || !(0 == routine)) || !(\old(s) == NP)) || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || IPC < MPR3 + 1) || compRegistered < 1) || IPC < DC + 5) || \old(s) < 1) || 1 < \old(setEventCalled)) || (((NP == s && \old(customIrp) == customIrp) && 1 <= setEventCalled) && setEventCalled <= 1))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || !(myStatus == 0))) && (((((((((((MPR3 < NP + 5 || MPR1 < SKIP1 + 2) || \old(setEventCalled) < 1) || NP < 1) || compRegistered < 1 || (!(0 == routine) || 1 == pended) || IPC < DC + 5) || IPC < MPR3 + 1) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || SKIP2 < DC + 2) || 1 < NP) || 1 < \old(setEventCalled)) || 0 < myStatus + 1073741637) - InvariantResult [Line: 790]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (IPC <= s && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || (((((((1 <= NP && NP + 5 <= MPR3) && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0))) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || (0 == status && (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || (((((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) || (((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) && SKIP1 + 2 <= MPR1) && SKIP2 <= s)) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 1023]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 901]: Loop Invariant Derived loop invariant: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 716]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || (((((((((((((((((((((((((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && 0 == myStatus) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC) || (((((((DC + 5 <= IPC && SKIP1 + 2 <= MPR1) && routine == 0) && DC + 2 <= SKIP2) && myStatus + 1073741637 <= 0) && \old(customIrp) == customIrp) && !(pended == 1)) && MPR3 + 1 <= IPC)) && 5 <= compRegistered + MPR1) && MPR1 + 1 <= MPR3) && 2 * irp_choice <= 4294967294) && 2 * compRegistered <= 0) && 2 * devobj <= 4294967294) && pirp <= NP + 2147483646) && s == 1) && MPR1 <= tmp_ndt_1 + 2147483653) && 0 <= 2 * irp_choice + 4294967296) && NP <= pirp + 2147483649) && tmp_ndt_3 <= compRegistered + 2147483647) && tmp_ndt_2 <= MPR1 + 2147483642) && 0 <= devobj + MPR1 + 2147483643) && 1 <= s + status) && tmp_ndt_1 <= s + 2147483646) && 0 <= tmp_ndt_2 + NP + 2147483647) && 6 <= NP + MPR1) && s + NP <= 2) && MPR3 + MPR1 <= 11) && status + compRegistered <= 2147483647) && 0 <= s + tmp_ndt_3 + 2147483647)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 843]: Loop Invariant Derived loop invariant: ((((((((compRegistered <= tmp_ndt_7 + 2147483649 && tmp_ndt_7 <= MPR3 + 2147483641) && compRegistered + malloc_ret <= 2147483648) && 0 <= MPR3 + malloc_ret + 2147483642) || pirp + MPR1 + 2147483643 < 0) || 2147483652 < pirp + MPR1) || s < compRegistered) || s + 4 < MPR1) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == pended) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < s) || 1 < NP) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == pended) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < s) || 1 < NP))) || MPR1 + 1 < MPR3 - InvariantResult [Line: 682]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && !(259 == status))) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || (((((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && status + 1073741789 <= 0)) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(compRegistered) == 0)) || 2 * \old(pirp) + 4294967296 < 0) || ((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && IPC == s) && status == lowerDriverReturn) && compRegistered <= 0)) || (((((((DC + 5 <= IPC && routine == 0) && DC + 2 <= SKIP2) && SKIP2 == s) && SKIP1 + 2 <= MPR1) && !(pended == 1)) && status == lowerDriverReturn) && compRegistered <= 0)) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || ((0 == status && DC == s) && !(pended == 1))) || !(\old(UNLOADED) == \old(s))) || (((((((1 <= NP && NP + 5 <= MPR3) && NP <= 1) && SKIP1 + 2 <= MPR1) && NP + 4 <= MPR1) && MPR3 + 1 <= IPC) && (((DC == s && DC + 5 <= IPC) && routine == 0) && DC + 2 <= SKIP2) && !(pended == 1)) && !(259 == status))) || !(\old(s) == \old(NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 879]: Loop Invariant Derived loop invariant: ((((((((((((((\old(Irp) == 0 || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || (tmp_ndt_8 + MPR1 <= 2147483652 && 0 <= s + tmp_ndt_8 + 2147483643)) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1) && (((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && (((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || (((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643)) || (((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643)) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5)) && ((((((((((((\old(Irp) == 0 || (((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && 6 <= s + compRegistered)) || ((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 == returnVal2) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) || ((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && returnVal2 + 1073741823 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1)) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1) - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) || (((routine == 0 && 0 == compRegistered) && \old(s) == s) && !(pended == 1))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 == compRegistered && \old(myStatus) == myStatus) && routine == 0) && 0 == myStatus) && NP == s) && \old(customIrp) == customIrp) && !(pended == 1)) || ((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) - InvariantResult [Line: 721]: Loop Invariant Derived loop invariant: ((((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && SKIP1 + 2 <= MPR1) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || (!(259 == status) && ((1 <= compRegistered && DC == s) && routine == 0) && !(pended == 1))) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((((((((((((((\old(myStatus) == myStatus && ((0 == compRegistered && routine == 0) && \old(customIrp) == customIrp) && !(pended == 1)) && s == 1) && DeviceObject <= NP + 2147483646) && 0 <= irpSp__MinorFunction + MPR3 + 2147483642) && 0 <= 2 * DeviceObject + 4294967296) && irpSp__MinorFunction <= MPR3 + 2147483641) && Irp <= compRegistered + 2147483647) && MPR1 <= Irp + 2147483653) || ((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)) && (((((((0 < \old(myStatus) + 1073741637 || 1 == \old(pended)) || SKIP2 < DC + 2) || !(0 == \old(routine))) || MPR1 < SKIP1 + 2) || IPC < MPR3 + 1) || IPC < DC + 5) || !(\old(customIrp) == 0)))) || NP + \old(s) < 2) || 2147483653 < \old(DeviceObject) + MPR3) || !(1 == \old(s))) || \old(s) + 5 < MPR3) || MPR1 < \old(compRegistered) + 5) || pirp + \old(s) + 2147483647 < 0) || \old(compRegistered) + 1 < NP) || MPR3 + MPR1 < 11) || \old(DeviceObject) + 2147483654 < MPR3) || \old(s) + 4 < MPR1) || \old(Irp) + 2147483649 < NP) || \old(compRegistered) + 2147483647 < pirp) || 2147483648 < NP + \old(Irp) - InvariantResult [Line: 1054]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 728]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 706]: Loop Invariant Derived loop invariant: ((((((((((((((!(\old(myStatus) == 0) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || ((s == NP && 0 == compRegistered) && !(pended == 1))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 906]: Loop Invariant Derived loop invariant: (((((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5) && (((((((((((((((((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && s <= routine + 5) && tmp_ndt_8 + MPR1 <= 2147483652) && 6 <= s + compRegistered) && 0 <= s + tmp_ndt_8 + 2147483643) || \old(Irp) == 0) || ((0 < myStatus + 1073741637 || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) && (!(myStatus == 0) || (((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4))) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && ((((((((((((tmp_ndt_8 + MPR1 <= 2147483652 && ((((((__cil_tmp7 + 1073741802 <= 0 && compRetStatus + 1073741802 <= 0) && 0 <= compRetStatus + 1073741802) && MPR1 == s) && 0 <= __cil_tmp7 + 1073741802) && !(pended == 1)) && 1 <= setEventCalled) && setEventCalled <= 1) && 0 <= s + tmp_ndt_8 + 2147483643) || pirp + 2147483654 < MPR3) || \old(Irp) + 2147483654 < MPR3) || NP < compRegistered) || 2147483652 < pirp + MPR1) || MPR1 + 2147483642 < \old(Irp)) || \old(DeviceObject) + 2147483654 < MPR3) || compRegistered + 5 < MPR3) || (((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || !(myStatus == 0)) || !(customIrp == 0)) && ((((((MPR3 < NP + 5 || (((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || compRegistered < 1) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || NP < 1) || 1 < \old(s)) || MPR1 < NP + 4) || 0 < myStatus + 1073741637) || !(customIrp == 0)))) || 2147483648 < \old(DeviceObject) + \old(s)) || \old(s) + 4 < MPR1)) && (((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5) - InvariantResult [Line: 1047]: Loop Invariant Derived loop invariant: ((((((!(0 == routine) || MPR1 < SKIP1 + 2) || 1 == \old(pended)) || (s == SKIP1 && !(pended == 1))) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 612]: Loop Invariant Derived loop invariant: (NP == s && !(pended == 1)) || (((((((((((0 < myStatus + 1073741637 || ((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || !(\old(customIrp) == 0)) && (!(myStatus == 0) || ((((MPR1 < SKIP1 + 2 || 1 == \old(pended)) || SKIP2 < DC + 2) || IPC < DC + 5) || IPC < MPR3 + 1) || !(\old(customIrp) == 0))) || pirp + MPR1 + 2147483643 < 0) || NP < compRegistered) || 2147483652 < pirp + MPR1) || 6 < \old(s) + MPR1) || MPR3 + MPR1 < 11) || compRegistered + 5 < MPR3) || 1 < routine + \old(s)) || 2 < 2 * NP) || \old(s) + 4 < MPR1) || routine + \old(s) < 1 - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((s == NP && !(pended == 1)) || !(0 == routine)) || !(\old(s) == NP)) || 1 == \old(pended)) || !(compRegistered == 0)) || SKIP2 < DC + 2) || IPC < DC + 5 - InvariantResult [Line: 726]: Loop Invariant Derived loop invariant: (((((((((((((((((((DC + 5 <= IPC && routine == 0) && s == NP) && 0 == compRegistered) && DC + 2 <= SKIP2) && !(pended == 1)) || !(\old(myStatus) == 0)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || 4294967294 < 2 * \old(pirp)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(0 == \old(routine))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(\old(s) == \old(MPR3))) || 2 * \old(pirp) + 4294967296 < 0) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 308 locations, 1 error locations. SAFE Result, 528.1s OverallTime, 48 OverallIterations, 4 TraceHistogramMax, 229.3s AutomataDifference, 0.0s DeadEndRemovalTime, 229.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 14250 SDtfs, 9804 SDslu, 38640 SDs, 0 SdLazy, 22289 SolverSat, 2853 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 60.2s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 722 GetRequests, 226 SyntacticMatches, 18 SemanticMatches, 478 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6913 ImplicationChecksByTransitivity, 83.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1044occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 20.6s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 0.9705469258622287 AbsIntWeakeningRatio, 2.1419753086419755 AbsIntAvgWeakeningVarsNumRemoved, 1355.2530864197531 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 48 MinimizatonAttempts, 2576 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 109 LocationsWithAnnotation, 4874 PreInvPairs, 5131 NumberOfFragments, 20239 HoareAnnotationTreeSize, 4874 FomulaSimplifications, 648280 FormulaSimplificationTreeSizeReduction, 22.2s HoareSimplificationTime, 109 FomulaSimplificationsInter, 740134 FormulaSimplificationTreeSizeReductionInter, 207.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 3466 NumberOfCodeBlocks, 3466 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 496790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 48 InterpolantComputations, 47 PerfectInterpolantSequences, 553/559 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...