./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aefcaabd16a50e389998bb4544e72a90e6b18c44 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:07:37,053 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:07:37,054 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:07:37,062 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:07:37,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:07:37,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:07:37,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:07:37,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:07:37,065 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:07:37,066 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:07:37,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:07:37,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:07:37,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:07:37,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:07:37,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:07:37,068 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:07:37,069 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:07:37,069 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:07:37,071 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:07:37,072 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:07:37,072 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:07:37,073 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:07:37,075 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:07:37,075 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:07:37,075 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:07:37,076 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:07:37,076 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:07:37,077 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:07:37,077 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:07:37,078 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:07:37,078 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:07:37,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:07:37,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:07:37,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:07:37,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:07:37,079 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:07:37,079 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:07:37,086 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:07:37,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:07:37,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:07:37,087 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:07:37,088 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:07:37,088 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:07:37,088 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:07:37,088 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:07:37,089 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:07:37,090 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:07:37,090 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:07:37,090 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:07:37,090 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:07:37,090 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:07:37,090 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:07:37,091 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:07:37,091 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:07:37,091 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:07:37,091 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:07:37,091 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:07:37,091 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:07:37,092 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:07:37,092 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:07:37,092 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:07:37,092 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aefcaabd16a50e389998bb4544e72a90e6b18c44 [2018-11-28 13:07:37,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:07:37,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:07:37,128 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:07:37,129 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:07:37,130 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:07:37,130 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/../../sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-28 13:07:37,175 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/data/23bdc5c9f/93ba8e4a80164011bddb1b58cb884e86/FLAG508782666 [2018-11-28 13:07:37,686 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:07:37,687 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/sv-benchmarks/c/ntdrivers/floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-28 13:07:37,710 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/data/23bdc5c9f/93ba8e4a80164011bddb1b58cb884e86/FLAG508782666 [2018-11-28 13:07:38,149 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/data/23bdc5c9f/93ba8e4a80164011bddb1b58cb884e86 [2018-11-28 13:07:38,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:07:38,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:07:38,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:07:38,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:07:38,155 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:07:38,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:07:38" (1/1) ... [2018-11-28 13:07:38,157 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6864cfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:38, skipping insertion in model container [2018-11-28 13:07:38,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:07:38" (1/1) ... [2018-11-28 13:07:38,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:07:38,221 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:07:39,134 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:07:39,176 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:07:39,407 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:07:39,504 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:07:39,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39 WrapperNode [2018-11-28 13:07:39,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:07:39,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:07:39,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:07:39,505 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:07:39,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,562 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:07:39,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:07:39,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:07:39,582 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:07:39,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... [2018-11-28 13:07:39,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:07:39,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:07:39,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:07:39,760 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:07:39,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:07:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure IoGetConfigurationInformation [2018-11-28 13:07:39,809 INFO L138 BoogieDeclarations]: Found implementation of procedure IoGetConfigurationInformation [2018-11-28 13:07:39,809 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-11-28 13:07:39,810 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:07:39,810 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2018-11-28 13:07:39,811 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2018-11-28 13:07:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2018-11-28 13:07:39,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2018-11-28 13:07:39,811 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:07:39,811 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2018-11-28 13:07:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-11-28 13:07:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-11-28 13:07:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-11-28 13:07:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-11-28 13:07:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2018-11-28 13:07:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2018-11-28 13:07:39,812 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2018-11-28 13:07:39,812 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2018-11-28 13:07:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2018-11-28 13:07:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2018-11-28 13:07:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2018-11-28 13:07:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2018-11-28 13:07:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyReadWrite [2018-11-28 13:07:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyReadWrite [2018-11-28 13:07:39,813 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2018-11-28 13:07:39,813 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2018-11-28 13:07:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2018-11-28 13:07:39,814 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2018-11-28 13:07:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:07:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedRemoveHeadList [2018-11-28 13:07:39,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedRemoveHeadList [2018-11-28 13:07:39,814 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2018-11-28 13:07:39,814 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2018-11-28 13:07:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-11-28 13:07:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-11-28 13:07:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure InterlockedExchange [2018-11-28 13:07:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure InterlockedExchange [2018-11-28 13:07:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-28 13:07:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-28 13:07:39,815 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-11-28 13:07:39,815 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-11-28 13:07:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2018-11-28 13:07:39,816 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2018-11-28 13:07:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2018-11-28 13:07:39,816 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2018-11-28 13:07:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:07:39,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:07:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2018-11-28 13:07:39,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2018-11-28 13:07:39,816 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2018-11-28 13:07:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2018-11-28 13:07:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2018-11-28 13:07:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2018-11-28 13:07:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:07:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:07:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure ExfInterlockedInsertTailList [2018-11-28 13:07:39,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ExfInterlockedInsertTailList [2018-11-28 13:07:39,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-28 13:07:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-11-28 13:07:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-11-28 13:07:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2018-11-28 13:07:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2018-11-28 13:07:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-28 13:07:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-11-28 13:07:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-11-28 13:07:39,818 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-11-28 13:07:39,818 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-11-28 13:07:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure DriverEntry [2018-11-28 13:07:39,819 INFO L138 BoogieDeclarations]: Found implementation of procedure DriverEntry [2018-11-28 13:07:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2018-11-28 13:07:39,819 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2018-11-28 13:07:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:07:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2018-11-28 13:07:39,819 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2018-11-28 13:07:39,819 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPower [2018-11-28 13:07:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPower [2018-11-28 13:07:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-11-28 13:07:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-11-28 13:07:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure KeReleaseSemaphore [2018-11-28 13:07:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure KeReleaseSemaphore [2018-11-28 13:07:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyUnload [2018-11-28 13:07:39,820 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyUnload [2018-11-28 13:07:39,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2018-11-28 13:07:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2018-11-28 13:07:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure RtlDeleteRegistryValue [2018-11-28 13:07:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlDeleteRegistryValue [2018-11-28 13:07:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure RtlQueryRegistryValues [2018-11-28 13:07:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure RtlQueryRegistryValues [2018-11-28 13:07:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 13:07:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy_guard [2018-11-28 13:07:39,821 INFO L138 BoogieDeclarations]: Found implementation of procedure memcpy_guard [2018-11-28 13:07:39,821 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2018-11-28 13:07:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2018-11-28 13:07:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-11-28 13:07:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ExAllocatePoolWithTag [2018-11-28 13:07:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ExAllocatePoolWithTag [2018-11-28 13:07:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2018-11-28 13:07:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2018-11-28 13:07:39,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:07:39,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:07:40,373 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:40,373 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:43,863 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:43,863 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:49,373 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:49,374 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:49,452 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:49,452 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:55,266 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:55,266 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:55,277 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:55,278 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:57,565 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:57,566 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:57,571 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:57,572 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:57,576 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:57,576 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:59,738 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:59,738 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:59,750 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:59,750 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:07:59,774 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:07:59,774 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:04,100 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:04,100 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:04,183 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:04,184 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:04,192 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:04,192 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:04,197 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:04,198 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:06,348 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:06,348 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:11,822 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:11,822 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:14,255 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-28 13:08:14,255 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-28 13:08:14,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:08:14,271 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-28 13:08:14,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:14 BoogieIcfgContainer [2018-11-28 13:08:14,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:08:14,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:08:14,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:08:14,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:08:14,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:07:38" (1/3) ... [2018-11-28 13:08:14,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380bdac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:08:14, skipping insertion in model container [2018-11-28 13:08:14,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:07:39" (2/3) ... [2018-11-28 13:08:14,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@380bdac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:08:14, skipping insertion in model container [2018-11-28 13:08:14,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:14" (3/3) ... [2018-11-28 13:08:14,278 INFO L112 eAbstractionObserver]: Analyzing ICFG floppy_true-unreach-call_true-valid-memsafety.i.cil.c [2018-11-28 13:08:14,285 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:08:14,290 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:08:14,299 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:08:14,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:08:14,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:08:14,321 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:08:14,321 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:08:14,321 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:08:14,321 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:08:14,321 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:08:14,321 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:08:14,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:08:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states. [2018-11-28 13:08:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:08:14,349 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:14,349 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:14,351 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:14,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:14,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2005583712, now seen corresponding path program 1 times [2018-11-28 13:08:14,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:14,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:14,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:14,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:14,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:14,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:14,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:14,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:14,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:14,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:14,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:14,716 INFO L87 Difference]: Start difference. First operand 670 states. Second operand 3 states. [2018-11-28 13:08:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:14,904 INFO L93 Difference]: Finished difference Result 1259 states and 1871 transitions. [2018-11-28 13:08:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:14,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 13:08:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:14,915 INFO L225 Difference]: With dead ends: 1259 [2018-11-28 13:08:14,915 INFO L226 Difference]: Without dead ends: 664 [2018-11-28 13:08:14,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:14,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-11-28 13:08:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 664. [2018-11-28 13:08:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2018-11-28 13:08:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 924 transitions. [2018-11-28 13:08:14,980 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 924 transitions. Word has length 31 [2018-11-28 13:08:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 664 states and 924 transitions. [2018-11-28 13:08:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 924 transitions. [2018-11-28 13:08:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-28 13:08:14,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:14,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:14,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1950006380, now seen corresponding path program 1 times [2018-11-28 13:08:14,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:14,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:14,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:15,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:15,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:15,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:15,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:15,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:15,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:15,167 INFO L87 Difference]: Start difference. First operand 664 states and 924 transitions. Second operand 3 states. [2018-11-28 13:08:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:15,532 INFO L93 Difference]: Finished difference Result 1612 states and 2267 transitions. [2018-11-28 13:08:15,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:15,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-28 13:08:15,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:15,538 INFO L225 Difference]: With dead ends: 1612 [2018-11-28 13:08:15,539 INFO L226 Difference]: Without dead ends: 1132 [2018-11-28 13:08:15,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2018-11-28 13:08:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 1113. [2018-11-28 13:08:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2018-11-28 13:08:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1564 transitions. [2018-11-28 13:08:15,588 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1564 transitions. Word has length 36 [2018-11-28 13:08:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:15,589 INFO L480 AbstractCegarLoop]: Abstraction has 1113 states and 1564 transitions. [2018-11-28 13:08:15,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1564 transitions. [2018-11-28 13:08:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:08:15,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:15,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:15,591 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:15,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:15,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1764617242, now seen corresponding path program 1 times [2018-11-28 13:08:15,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:15,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:15,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:15,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:15,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:15,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:15,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:15,810 INFO L87 Difference]: Start difference. First operand 1113 states and 1564 transitions. Second operand 3 states. [2018-11-28 13:08:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:15,926 INFO L93 Difference]: Finished difference Result 1849 states and 2633 transitions. [2018-11-28 13:08:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:15,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-11-28 13:08:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:15,935 INFO L225 Difference]: With dead ends: 1849 [2018-11-28 13:08:15,936 INFO L226 Difference]: Without dead ends: 1830 [2018-11-28 13:08:15,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:15,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2018-11-28 13:08:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1768. [2018-11-28 13:08:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2018-11-28 13:08:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2535 transitions. [2018-11-28 13:08:16,003 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2535 transitions. Word has length 48 [2018-11-28 13:08:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:16,003 INFO L480 AbstractCegarLoop]: Abstraction has 1768 states and 2535 transitions. [2018-11-28 13:08:16,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2535 transitions. [2018-11-28 13:08:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 13:08:16,006 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:16,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:16,006 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:16,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1394354843, now seen corresponding path program 1 times [2018-11-28 13:08:16,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:16,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:16,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:16,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:16,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:16,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:16,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:16,178 INFO L87 Difference]: Start difference. First operand 1768 states and 2535 transitions. Second operand 3 states. [2018-11-28 13:08:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:16,437 INFO L93 Difference]: Finished difference Result 1817 states and 2604 transitions. [2018-11-28 13:08:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:16,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 13:08:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:16,445 INFO L225 Difference]: With dead ends: 1817 [2018-11-28 13:08:16,445 INFO L226 Difference]: Without dead ends: 1813 [2018-11-28 13:08:16,446 INFO L631 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-11-28 13:08:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2018-11-28 13:08:16,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1805. [2018-11-28 13:08:16,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2018-11-28 13:08:16,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2586 transitions. [2018-11-28 13:08:16,506 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2586 transitions. Word has length 49 [2018-11-28 13:08:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:16,506 INFO L480 AbstractCegarLoop]: Abstraction has 1805 states and 2586 transitions. [2018-11-28 13:08:16,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2586 transitions. [2018-11-28 13:08:16,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-28 13:08:16,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:16,508 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:16,508 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:16,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:16,508 INFO L82 PathProgramCache]: Analyzing trace with hash -829314340, now seen corresponding path program 1 times [2018-11-28 13:08:16,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:16,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:16,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:16,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:16,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:16,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-11-28 13:08:16,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:16,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:16,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:16,697 INFO L87 Difference]: Start difference. First operand 1805 states and 2586 transitions. Second operand 3 states. [2018-11-28 13:08:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:17,052 INFO L93 Difference]: Finished difference Result 3168 states and 4604 transitions. [2018-11-28 13:08:17,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:17,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-11-28 13:08:17,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:17,070 INFO L225 Difference]: With dead ends: 3168 [2018-11-28 13:08:17,070 INFO L226 Difference]: Without dead ends: 3165 [2018-11-28 13:08:17,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:17,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2018-11-28 13:08:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 2965. [2018-11-28 13:08:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2965 states. [2018-11-28 13:08:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4288 transitions. [2018-11-28 13:08:17,182 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4288 transitions. Word has length 49 [2018-11-28 13:08:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:17,182 INFO L480 AbstractCegarLoop]: Abstraction has 2965 states and 4288 transitions. [2018-11-28 13:08:17,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4288 transitions. [2018-11-28 13:08:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:08:17,183 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:17,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:17,184 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:17,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:17,184 INFO L82 PathProgramCache]: Analyzing trace with hash 915294285, now seen corresponding path program 1 times [2018-11-28 13:08:17,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:17,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:17,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:17,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:17,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:17,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:17,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:17,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:17,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:17,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:17,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:17,328 INFO L87 Difference]: Start difference. First operand 2965 states and 4288 transitions. Second operand 3 states. [2018-11-28 13:08:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:17,607 INFO L93 Difference]: Finished difference Result 3572 states and 5207 transitions. [2018-11-28 13:08:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:17,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-28 13:08:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:17,623 INFO L225 Difference]: With dead ends: 3572 [2018-11-28 13:08:17,623 INFO L226 Difference]: Without dead ends: 3567 [2018-11-28 13:08:17,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2018-11-28 13:08:17,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3495. [2018-11-28 13:08:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2018-11-28 13:08:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 5066 transitions. [2018-11-28 13:08:17,745 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 5066 transitions. Word has length 50 [2018-11-28 13:08:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:17,745 INFO L480 AbstractCegarLoop]: Abstraction has 3495 states and 5066 transitions. [2018-11-28 13:08:17,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 5066 transitions. [2018-11-28 13:08:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-28 13:08:17,746 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:17,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:17,747 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:17,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash -177136653, now seen corresponding path program 1 times [2018-11-28 13:08:17,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:17,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:17,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:17,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:17,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:17,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:17,956 INFO L87 Difference]: Start difference. First operand 3495 states and 5066 transitions. Second operand 5 states. [2018-11-28 13:08:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:19,633 INFO L93 Difference]: Finished difference Result 6878 states and 9972 transitions. [2018-11-28 13:08:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:19,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-11-28 13:08:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:19,642 INFO L225 Difference]: With dead ends: 6878 [2018-11-28 13:08:19,642 INFO L226 Difference]: Without dead ends: 3662 [2018-11-28 13:08:19,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2018-11-28 13:08:19,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3489. [2018-11-28 13:08:19,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-11-28 13:08:19,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 5052 transitions. [2018-11-28 13:08:19,724 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 5052 transitions. Word has length 50 [2018-11-28 13:08:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:19,725 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 5052 transitions. [2018-11-28 13:08:19,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:19,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 5052 transitions. [2018-11-28 13:08:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-28 13:08:19,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:19,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:19,727 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:19,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1239616073, now seen corresponding path program 1 times [2018-11-28 13:08:19,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:19,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:19,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:19,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:19,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:19,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:19,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:19,843 INFO L87 Difference]: Start difference. First operand 3489 states and 5052 transitions. Second operand 5 states. [2018-11-28 13:08:20,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:20,635 INFO L93 Difference]: Finished difference Result 3573 states and 5198 transitions. [2018-11-28 13:08:20,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:20,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-11-28 13:08:20,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:20,648 INFO L225 Difference]: With dead ends: 3573 [2018-11-28 13:08:20,648 INFO L226 Difference]: Without dead ends: 3567 [2018-11-28 13:08:20,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:20,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2018-11-28 13:08:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 3489. [2018-11-28 13:08:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-11-28 13:08:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 5051 transitions. [2018-11-28 13:08:20,781 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 5051 transitions. Word has length 51 [2018-11-28 13:08:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:20,781 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 5051 transitions. [2018-11-28 13:08:20,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 5051 transitions. [2018-11-28 13:08:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:08:20,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:20,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:20,782 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:20,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2014283077, now seen corresponding path program 1 times [2018-11-28 13:08:20,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:20,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:20,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:20,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:20,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:20,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:20,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:20,947 INFO L87 Difference]: Start difference. First operand 3489 states and 5051 transitions. Second operand 5 states. [2018-11-28 13:08:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:21,792 INFO L93 Difference]: Finished difference Result 3569 states and 5192 transitions. [2018-11-28 13:08:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:08:21,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 13:08:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:21,804 INFO L225 Difference]: With dead ends: 3569 [2018-11-28 13:08:21,805 INFO L226 Difference]: Without dead ends: 3563 [2018-11-28 13:08:21,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2018-11-28 13:08:21,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3489. [2018-11-28 13:08:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2018-11-28 13:08:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 5050 transitions. [2018-11-28 13:08:21,939 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 5050 transitions. Word has length 53 [2018-11-28 13:08:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:21,939 INFO L480 AbstractCegarLoop]: Abstraction has 3489 states and 5050 transitions. [2018-11-28 13:08:21,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 5050 transitions. [2018-11-28 13:08:21,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-28 13:08:21,941 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:21,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:21,941 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:21,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:21,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2064664351, now seen corresponding path program 1 times [2018-11-28 13:08:21,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:21,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:21,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:22,100 INFO L87 Difference]: Start difference. First operand 3489 states and 5050 transitions. Second operand 5 states. [2018-11-28 13:08:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:22,217 INFO L93 Difference]: Finished difference Result 3504 states and 5066 transitions. [2018-11-28 13:08:22,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:22,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-11-28 13:08:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:22,230 INFO L225 Difference]: With dead ends: 3504 [2018-11-28 13:08:22,230 INFO L226 Difference]: Without dead ends: 3487 [2018-11-28 13:08:22,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2018-11-28 13:08:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3487. [2018-11-28 13:08:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3487 states. [2018-11-28 13:08:22,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3487 states to 3487 states and 5046 transitions. [2018-11-28 13:08:22,360 INFO L78 Accepts]: Start accepts. Automaton has 3487 states and 5046 transitions. Word has length 54 [2018-11-28 13:08:22,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:22,360 INFO L480 AbstractCegarLoop]: Abstraction has 3487 states and 5046 transitions. [2018-11-28 13:08:22,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:22,360 INFO L276 IsEmpty]: Start isEmpty. Operand 3487 states and 5046 transitions. [2018-11-28 13:08:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-28 13:08:22,362 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:22,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:22,363 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1884248000, now seen corresponding path program 1 times [2018-11-28 13:08:22,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:22,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:22,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:22,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:22,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:22,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:22,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:22,517 INFO L87 Difference]: Start difference. First operand 3487 states and 5046 transitions. Second operand 5 states. [2018-11-28 13:08:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:22,630 INFO L93 Difference]: Finished difference Result 3502 states and 5062 transitions. [2018-11-28 13:08:22,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:22,631 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-11-28 13:08:22,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:22,647 INFO L225 Difference]: With dead ends: 3502 [2018-11-28 13:08:22,647 INFO L226 Difference]: Without dead ends: 3480 [2018-11-28 13:08:22,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2018-11-28 13:08:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3480. [2018-11-28 13:08:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3480 states. [2018-11-28 13:08:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3480 states to 3480 states and 5037 transitions. [2018-11-28 13:08:22,770 INFO L78 Accepts]: Start accepts. Automaton has 3480 states and 5037 transitions. Word has length 53 [2018-11-28 13:08:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:22,770 INFO L480 AbstractCegarLoop]: Abstraction has 3480 states and 5037 transitions. [2018-11-28 13:08:22,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3480 states and 5037 transitions. [2018-11-28 13:08:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-28 13:08:22,771 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:22,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:22,771 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:22,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:22,772 INFO L82 PathProgramCache]: Analyzing trace with hash 247724382, now seen corresponding path program 1 times [2018-11-28 13:08:22,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:22,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:22,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:22,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:22,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:22,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:22,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:22,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:22,926 INFO L87 Difference]: Start difference. First operand 3480 states and 5037 transitions. Second operand 3 states. [2018-11-28 13:08:23,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:23,178 INFO L93 Difference]: Finished difference Result 9790 states and 14367 transitions. [2018-11-28 13:08:23,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:23,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-11-28 13:08:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:23,198 INFO L225 Difference]: With dead ends: 9790 [2018-11-28 13:08:23,198 INFO L226 Difference]: Without dead ends: 6540 [2018-11-28 13:08:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6540 states. [2018-11-28 13:08:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6540 to 6486. [2018-11-28 13:08:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6486 states. [2018-11-28 13:08:23,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6486 states to 6486 states and 9506 transitions. [2018-11-28 13:08:23,462 INFO L78 Accepts]: Start accepts. Automaton has 6486 states and 9506 transitions. Word has length 57 [2018-11-28 13:08:23,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:23,463 INFO L480 AbstractCegarLoop]: Abstraction has 6486 states and 9506 transitions. [2018-11-28 13:08:23,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:23,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6486 states and 9506 transitions. [2018-11-28 13:08:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-28 13:08:23,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:23,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:23,465 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:23,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:23,465 INFO L82 PathProgramCache]: Analyzing trace with hash 54968699, now seen corresponding path program 1 times [2018-11-28 13:08:23,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:23,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:23,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:23,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:23,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:23,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:23,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:23,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:23,618 INFO L87 Difference]: Start difference. First operand 6486 states and 9506 transitions. Second operand 3 states. [2018-11-28 13:08:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:25,885 INFO L93 Difference]: Finished difference Result 12239 states and 18124 transitions. [2018-11-28 13:08:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:25,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-28 13:08:25,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:25,899 INFO L225 Difference]: With dead ends: 12239 [2018-11-28 13:08:25,899 INFO L226 Difference]: Without dead ends: 6678 [2018-11-28 13:08:25,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6678 states. [2018-11-28 13:08:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6678 to 6590. [2018-11-28 13:08:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6590 states. [2018-11-28 13:08:26,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 9626 transitions. [2018-11-28 13:08:26,113 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 9626 transitions. Word has length 55 [2018-11-28 13:08:26,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:26,113 INFO L480 AbstractCegarLoop]: Abstraction has 6590 states and 9626 transitions. [2018-11-28 13:08:26,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:26,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 9626 transitions. [2018-11-28 13:08:26,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-28 13:08:26,114 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:26,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:26,114 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:26,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:26,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1252417857, now seen corresponding path program 1 times [2018-11-28 13:08:26,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:26,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:26,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:26,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:26,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:26,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:26,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:26,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:26,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:26,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:26,278 INFO L87 Difference]: Start difference. First operand 6590 states and 9626 transitions. Second operand 5 states. [2018-11-28 13:08:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:26,400 INFO L93 Difference]: Finished difference Result 6614 states and 9668 transitions. [2018-11-28 13:08:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:26,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-11-28 13:08:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:26,415 INFO L225 Difference]: With dead ends: 6614 [2018-11-28 13:08:26,416 INFO L226 Difference]: Without dead ends: 6598 [2018-11-28 13:08:26,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:26,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6598 states. [2018-11-28 13:08:26,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6598 to 6596. [2018-11-28 13:08:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6596 states. [2018-11-28 13:08:26,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6596 states to 6596 states and 9644 transitions. [2018-11-28 13:08:26,625 INFO L78 Accepts]: Start accepts. Automaton has 6596 states and 9644 transitions. Word has length 58 [2018-11-28 13:08:26,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:26,625 INFO L480 AbstractCegarLoop]: Abstraction has 6596 states and 9644 transitions. [2018-11-28 13:08:26,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 6596 states and 9644 transitions. [2018-11-28 13:08:26,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-28 13:08:26,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:26,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:26,627 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:26,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:26,627 INFO L82 PathProgramCache]: Analyzing trace with hash -647422898, now seen corresponding path program 1 times [2018-11-28 13:08:26,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:26,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:26,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:26,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:26,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:26,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:26,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:26,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:26,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:26,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:26,781 INFO L87 Difference]: Start difference. First operand 6596 states and 9644 transitions. Second operand 5 states. [2018-11-28 13:08:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:26,927 INFO L93 Difference]: Finished difference Result 6614 states and 9663 transitions. [2018-11-28 13:08:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:26,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2018-11-28 13:08:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:26,938 INFO L225 Difference]: With dead ends: 6614 [2018-11-28 13:08:26,938 INFO L226 Difference]: Without dead ends: 6594 [2018-11-28 13:08:26,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2018-11-28 13:08:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 6594. [2018-11-28 13:08:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6594 states. [2018-11-28 13:08:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6594 states to 6594 states and 9640 transitions. [2018-11-28 13:08:27,071 INFO L78 Accepts]: Start accepts. Automaton has 6594 states and 9640 transitions. Word has length 59 [2018-11-28 13:08:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:27,071 INFO L480 AbstractCegarLoop]: Abstraction has 6594 states and 9640 transitions. [2018-11-28 13:08:27,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 6594 states and 9640 transitions. [2018-11-28 13:08:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-28 13:08:27,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:27,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:27,073 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:27,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1453963269, now seen corresponding path program 1 times [2018-11-28 13:08:27,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:27,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:27,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:27,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:27,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:27,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:27,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:27,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:27,192 INFO L87 Difference]: Start difference. First operand 6594 states and 9640 transitions. Second operand 5 states. [2018-11-28 13:08:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:27,305 INFO L93 Difference]: Finished difference Result 6609 states and 9656 transitions. [2018-11-28 13:08:27,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:27,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-11-28 13:08:27,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:27,315 INFO L225 Difference]: With dead ends: 6609 [2018-11-28 13:08:27,315 INFO L226 Difference]: Without dead ends: 6589 [2018-11-28 13:08:27,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:27,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6589 states. [2018-11-28 13:08:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6589 to 6589. [2018-11-28 13:08:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6589 states. [2018-11-28 13:08:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6589 states to 6589 states and 9633 transitions. [2018-11-28 13:08:27,445 INFO L78 Accepts]: Start accepts. Automaton has 6589 states and 9633 transitions. Word has length 61 [2018-11-28 13:08:27,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:27,446 INFO L480 AbstractCegarLoop]: Abstraction has 6589 states and 9633 transitions. [2018-11-28 13:08:27,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:27,446 INFO L276 IsEmpty]: Start isEmpty. Operand 6589 states and 9633 transitions. [2018-11-28 13:08:27,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-28 13:08:27,446 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:27,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:27,447 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:27,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:27,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1986566083, now seen corresponding path program 1 times [2018-11-28 13:08:27,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:27,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:27,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:27,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:27,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:27,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:27,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:08:27,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:08:27,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:08:27,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:27,624 INFO L87 Difference]: Start difference. First operand 6589 states and 9633 transitions. Second operand 7 states. [2018-11-28 13:08:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:49,850 INFO L93 Difference]: Finished difference Result 11920 states and 17684 transitions. [2018-11-28 13:08:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:08:49,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-11-28 13:08:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:49,862 INFO L225 Difference]: With dead ends: 11920 [2018-11-28 13:08:49,862 INFO L226 Difference]: Without dead ends: 8217 [2018-11-28 13:08:49,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:08:49,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-11-28 13:08:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 7443. [2018-11-28 13:08:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7443 states. [2018-11-28 13:08:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7443 states to 7443 states and 10951 transitions. [2018-11-28 13:08:50,073 INFO L78 Accepts]: Start accepts. Automaton has 7443 states and 10951 transitions. Word has length 62 [2018-11-28 13:08:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:50,073 INFO L480 AbstractCegarLoop]: Abstraction has 7443 states and 10951 transitions. [2018-11-28 13:08:50,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:08:50,073 INFO L276 IsEmpty]: Start isEmpty. Operand 7443 states and 10951 transitions. [2018-11-28 13:08:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:08:50,075 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:50,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:50,075 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:50,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:50,075 INFO L82 PathProgramCache]: Analyzing trace with hash 553392058, now seen corresponding path program 1 times [2018-11-28 13:08:50,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:50,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:50,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:50,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:50,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:08:50,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:08:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:08:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:50,237 INFO L87 Difference]: Start difference. First operand 7443 states and 10951 transitions. Second operand 5 states. [2018-11-28 13:08:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:52,490 INFO L93 Difference]: Finished difference Result 14000 states and 20863 transitions. [2018-11-28 13:08:52,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:08:52,491 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-11-28 13:08:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:52,502 INFO L225 Difference]: With dead ends: 14000 [2018-11-28 13:08:52,502 INFO L226 Difference]: Without dead ends: 7623 [2018-11-28 13:08:52,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:08:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2018-11-28 13:08:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 7569. [2018-11-28 13:08:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7569 states. [2018-11-28 13:08:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7569 states to 7569 states and 11130 transitions. [2018-11-28 13:08:52,700 INFO L78 Accepts]: Start accepts. Automaton has 7569 states and 11130 transitions. Word has length 63 [2018-11-28 13:08:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:52,700 INFO L480 AbstractCegarLoop]: Abstraction has 7569 states and 11130 transitions. [2018-11-28 13:08:52,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:08:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 7569 states and 11130 transitions. [2018-11-28 13:08:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-28 13:08:52,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:52,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:52,702 INFO L423 AbstractCegarLoop]: === Iteration 19 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:52,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash 565981767, now seen corresponding path program 1 times [2018-11-28 13:08:52,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:52,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:52,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:52,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:52,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:52,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:52,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:52,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:52,846 INFO L87 Difference]: Start difference. First operand 7569 states and 11130 transitions. Second operand 3 states. [2018-11-28 13:08:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:55,088 INFO L93 Difference]: Finished difference Result 14194 states and 21133 transitions. [2018-11-28 13:08:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:55,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-28 13:08:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:55,100 INFO L225 Difference]: With dead ends: 14194 [2018-11-28 13:08:55,100 INFO L226 Difference]: Without dead ends: 7691 [2018-11-28 13:08:55,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7691 states. [2018-11-28 13:08:55,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7691 to 7609. [2018-11-28 13:08:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7609 states. [2018-11-28 13:08:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7609 states to 7609 states and 11170 transitions. [2018-11-28 13:08:55,274 INFO L78 Accepts]: Start accepts. Automaton has 7609 states and 11170 transitions. Word has length 63 [2018-11-28 13:08:55,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:55,275 INFO L480 AbstractCegarLoop]: Abstraction has 7609 states and 11170 transitions. [2018-11-28 13:08:55,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 7609 states and 11170 transitions. [2018-11-28 13:08:55,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:08:55,277 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:55,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:55,277 INFO L423 AbstractCegarLoop]: === Iteration 20 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:55,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,277 INFO L82 PathProgramCache]: Analyzing trace with hash -358840616, now seen corresponding path program 1 times [2018-11-28 13:08:55,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:55,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:55,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:55,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:08:55,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:08:55,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:08:55,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:55,378 INFO L87 Difference]: Start difference. First operand 7609 states and 11170 transitions. Second operand 3 states. [2018-11-28 13:08:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:08:55,667 INFO L93 Difference]: Finished difference Result 10449 states and 15560 transitions. [2018-11-28 13:08:55,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:08:55,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2018-11-28 13:08:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:08:55,682 INFO L225 Difference]: With dead ends: 10449 [2018-11-28 13:08:55,682 INFO L226 Difference]: Without dead ends: 10436 [2018-11-28 13:08:55,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:08:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10436 states. [2018-11-28 13:08:55,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10436 to 8896. [2018-11-28 13:08:55,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8896 states. [2018-11-28 13:08:55,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8896 states to 8896 states and 13100 transitions. [2018-11-28 13:08:55,899 INFO L78 Accepts]: Start accepts. Automaton has 8896 states and 13100 transitions. Word has length 64 [2018-11-28 13:08:55,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:08:55,899 INFO L480 AbstractCegarLoop]: Abstraction has 8896 states and 13100 transitions. [2018-11-28 13:08:55,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:08:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8896 states and 13100 transitions. [2018-11-28 13:08:55,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-28 13:08:55,900 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:08:55,900 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:08:55,900 INFO L423 AbstractCegarLoop]: === Iteration 21 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:08:55,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:08:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1488611288, now seen corresponding path program 1 times [2018-11-28 13:08:55,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:08:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:08:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:08:55,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:08:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:08:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:08:56,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:08:56,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:08:56,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:08:56,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:08:56,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:08:56,100 INFO L87 Difference]: Start difference. First operand 8896 states and 13100 transitions. Second operand 7 states. [2018-11-28 13:09:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:09,827 INFO L93 Difference]: Finished difference Result 13143 states and 19260 transitions. [2018-11-28 13:09:09,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:09:09,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-11-28 13:09:09,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:09,840 INFO L225 Difference]: With dead ends: 13143 [2018-11-28 13:09:09,840 INFO L226 Difference]: Without dead ends: 8675 [2018-11-28 13:09:09,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:09:09,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8675 states. [2018-11-28 13:09:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8675 to 7456. [2018-11-28 13:09:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7456 states. [2018-11-28 13:09:10,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7456 states to 7456 states and 10792 transitions. [2018-11-28 13:09:10,036 INFO L78 Accepts]: Start accepts. Automaton has 7456 states and 10792 transitions. Word has length 64 [2018-11-28 13:09:10,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:10,036 INFO L480 AbstractCegarLoop]: Abstraction has 7456 states and 10792 transitions. [2018-11-28 13:09:10,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:09:10,036 INFO L276 IsEmpty]: Start isEmpty. Operand 7456 states and 10792 transitions. [2018-11-28 13:09:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:09:10,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:10,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:10,038 INFO L423 AbstractCegarLoop]: === Iteration 22 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:10,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:10,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2082815510, now seen corresponding path program 1 times [2018-11-28 13:09:10,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:10,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:10,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:10,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:10,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:10,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:09:10,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:10,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:10,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:10,154 INFO L87 Difference]: Start difference. First operand 7456 states and 10792 transitions. Second operand 8 states. [2018-11-28 13:09:10,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:10,688 INFO L93 Difference]: Finished difference Result 7480 states and 10853 transitions. [2018-11-28 13:09:10,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:10,690 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-28 13:09:10,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:10,706 INFO L225 Difference]: With dead ends: 7480 [2018-11-28 13:09:10,706 INFO L226 Difference]: Without dead ends: 7476 [2018-11-28 13:09:10,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:10,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7476 states. [2018-11-28 13:09:10,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7476 to 7466. [2018-11-28 13:09:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2018-11-28 13:09:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 10817 transitions. [2018-11-28 13:09:10,955 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 10817 transitions. Word has length 65 [2018-11-28 13:09:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:10,955 INFO L480 AbstractCegarLoop]: Abstraction has 7466 states and 10817 transitions. [2018-11-28 13:09:10,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 10817 transitions. [2018-11-28 13:09:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:09:10,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:10,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:10,957 INFO L423 AbstractCegarLoop]: === Iteration 23 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:10,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash -2083092340, now seen corresponding path program 1 times [2018-11-28 13:09:10,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:10,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:10,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:10,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:11,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:11,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:11,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:11,048 INFO L87 Difference]: Start difference. First operand 7466 states and 10817 transitions. Second operand 5 states. [2018-11-28 13:09:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:11,888 INFO L93 Difference]: Finished difference Result 8956 states and 13095 transitions. [2018-11-28 13:09:11,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:11,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-11-28 13:09:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:11,901 INFO L225 Difference]: With dead ends: 8956 [2018-11-28 13:09:11,901 INFO L226 Difference]: Without dead ends: 8942 [2018-11-28 13:09:11,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:09:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8942 states. [2018-11-28 13:09:12,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8942 to 7471. [2018-11-28 13:09:12,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7471 states. [2018-11-28 13:09:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7471 states to 7471 states and 10826 transitions. [2018-11-28 13:09:12,146 INFO L78 Accepts]: Start accepts. Automaton has 7471 states and 10826 transitions. Word has length 65 [2018-11-28 13:09:12,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:12,147 INFO L480 AbstractCegarLoop]: Abstraction has 7471 states and 10826 transitions. [2018-11-28 13:09:12,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:09:12,147 INFO L276 IsEmpty]: Start isEmpty. Operand 7471 states and 10826 transitions. [2018-11-28 13:09:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-28 13:09:12,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:12,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:12,148 INFO L423 AbstractCegarLoop]: === Iteration 24 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:12,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:12,148 INFO L82 PathProgramCache]: Analyzing trace with hash -155110756, now seen corresponding path program 1 times [2018-11-28 13:09:12,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:12,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:12,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:12,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:12,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:12,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:09:12,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:12,275 INFO L87 Difference]: Start difference. First operand 7471 states and 10826 transitions. Second operand 8 states. [2018-11-28 13:09:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:12,656 INFO L93 Difference]: Finished difference Result 7484 states and 10840 transitions. [2018-11-28 13:09:12,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:12,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-11-28 13:09:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:12,668 INFO L225 Difference]: With dead ends: 7484 [2018-11-28 13:09:12,668 INFO L226 Difference]: Without dead ends: 7434 [2018-11-28 13:09:12,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7434 states. [2018-11-28 13:09:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7434 to 7434. [2018-11-28 13:09:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7434 states. [2018-11-28 13:09:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7434 states to 7434 states and 10776 transitions. [2018-11-28 13:09:12,894 INFO L78 Accepts]: Start accepts. Automaton has 7434 states and 10776 transitions. Word has length 65 [2018-11-28 13:09:12,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:12,894 INFO L480 AbstractCegarLoop]: Abstraction has 7434 states and 10776 transitions. [2018-11-28 13:09:12,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:12,894 INFO L276 IsEmpty]: Start isEmpty. Operand 7434 states and 10776 transitions. [2018-11-28 13:09:12,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-28 13:09:12,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:12,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:12,896 INFO L423 AbstractCegarLoop]: === Iteration 25 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:12,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:12,896 INFO L82 PathProgramCache]: Analyzing trace with hash 263290957, now seen corresponding path program 1 times [2018-11-28 13:09:12,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:12,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:12,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:12,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:12,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:12,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:12,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:12,984 INFO L87 Difference]: Start difference. First operand 7434 states and 10776 transitions. Second operand 3 states. [2018-11-28 13:09:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:13,262 INFO L93 Difference]: Finished difference Result 10764 states and 15651 transitions. [2018-11-28 13:09:13,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:13,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-11-28 13:09:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:13,276 INFO L225 Difference]: With dead ends: 10764 [2018-11-28 13:09:13,276 INFO L226 Difference]: Without dead ends: 7335 [2018-11-28 13:09:13,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7335 states. [2018-11-28 13:09:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7335 to 7272. [2018-11-28 13:09:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7272 states. [2018-11-28 13:09:13,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7272 states to 7272 states and 10523 transitions. [2018-11-28 13:09:13,486 INFO L78 Accepts]: Start accepts. Automaton has 7272 states and 10523 transitions. Word has length 68 [2018-11-28 13:09:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:13,486 INFO L480 AbstractCegarLoop]: Abstraction has 7272 states and 10523 transitions. [2018-11-28 13:09:13,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:13,486 INFO L276 IsEmpty]: Start isEmpty. Operand 7272 states and 10523 transitions. [2018-11-28 13:09:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-28 13:09:13,488 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:13,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:13,488 INFO L423 AbstractCegarLoop]: === Iteration 26 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:13,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:13,488 INFO L82 PathProgramCache]: Analyzing trace with hash 528998657, now seen corresponding path program 1 times [2018-11-28 13:09:13,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:13,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:13,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:13,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:13,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:13,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:13,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:13,567 INFO L87 Difference]: Start difference. First operand 7272 states and 10523 transitions. Second operand 3 states. [2018-11-28 13:09:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:15,824 INFO L93 Difference]: Finished difference Result 13649 states and 19990 transitions. [2018-11-28 13:09:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:15,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-28 13:09:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:15,835 INFO L225 Difference]: With dead ends: 13649 [2018-11-28 13:09:15,835 INFO L226 Difference]: Without dead ends: 7394 [2018-11-28 13:09:15,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2018-11-28 13:09:16,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 7288. [2018-11-28 13:09:16,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7288 states. [2018-11-28 13:09:16,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7288 states to 7288 states and 10539 transitions. [2018-11-28 13:09:16,038 INFO L78 Accepts]: Start accepts. Automaton has 7288 states and 10539 transitions. Word has length 66 [2018-11-28 13:09:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:16,038 INFO L480 AbstractCegarLoop]: Abstraction has 7288 states and 10539 transitions. [2018-11-28 13:09:16,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:16,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7288 states and 10539 transitions. [2018-11-28 13:09:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-28 13:09:16,039 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:16,040 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:16,040 INFO L423 AbstractCegarLoop]: === Iteration 27 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:16,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash 918769293, now seen corresponding path program 1 times [2018-11-28 13:09:16,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:16,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:16,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:16,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:16,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:16,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:16,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:16,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:16,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:16,153 INFO L87 Difference]: Start difference. First operand 7288 states and 10539 transitions. Second operand 3 states. [2018-11-28 13:09:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:16,904 INFO L93 Difference]: Finished difference Result 13609 states and 19873 transitions. [2018-11-28 13:09:16,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:16,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-11-28 13:09:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:16,918 INFO L225 Difference]: With dead ends: 13609 [2018-11-28 13:09:16,918 INFO L226 Difference]: Without dead ends: 7338 [2018-11-28 13:09:16,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7338 states. [2018-11-28 13:09:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7338 to 7178. [2018-11-28 13:09:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7178 states. [2018-11-28 13:09:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7178 states to 7178 states and 10387 transitions. [2018-11-28 13:09:17,131 INFO L78 Accepts]: Start accepts. Automaton has 7178 states and 10387 transitions. Word has length 69 [2018-11-28 13:09:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:17,131 INFO L480 AbstractCegarLoop]: Abstraction has 7178 states and 10387 transitions. [2018-11-28 13:09:17,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:17,131 INFO L276 IsEmpty]: Start isEmpty. Operand 7178 states and 10387 transitions. [2018-11-28 13:09:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-28 13:09:17,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:17,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:17,133 INFO L423 AbstractCegarLoop]: === Iteration 28 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:17,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:17,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1663620532, now seen corresponding path program 1 times [2018-11-28 13:09:17,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:17,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:17,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:17,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:17,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:17,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:17,216 INFO L87 Difference]: Start difference. First operand 7178 states and 10387 transitions. Second operand 3 states. [2018-11-28 13:09:18,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:18,312 INFO L93 Difference]: Finished difference Result 9871 states and 14351 transitions. [2018-11-28 13:09:18,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:18,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-11-28 13:09:18,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:18,324 INFO L225 Difference]: With dead ends: 9871 [2018-11-28 13:09:18,324 INFO L226 Difference]: Without dead ends: 7396 [2018-11-28 13:09:18,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2018-11-28 13:09:18,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 7298. [2018-11-28 13:09:18,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7298 states. [2018-11-28 13:09:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7298 states to 7298 states and 10571 transitions. [2018-11-28 13:09:18,548 INFO L78 Accepts]: Start accepts. Automaton has 7298 states and 10571 transitions. Word has length 70 [2018-11-28 13:09:18,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:18,548 INFO L480 AbstractCegarLoop]: Abstraction has 7298 states and 10571 transitions. [2018-11-28 13:09:18,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7298 states and 10571 transitions. [2018-11-28 13:09:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:09:18,549 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:18,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:18,549 INFO L423 AbstractCegarLoop]: === Iteration 29 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:18,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash -145467769, now seen corresponding path program 1 times [2018-11-28 13:09:18,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:18,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:18,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:18,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:18,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:09:18,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:09:18,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:09:18,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:09:18,657 INFO L87 Difference]: Start difference. First operand 7298 states and 10571 transitions. Second operand 4 states. [2018-11-28 13:09:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:19,163 INFO L93 Difference]: Finished difference Result 9215 states and 13293 transitions. [2018-11-28 13:09:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:09:19,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-11-28 13:09:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:19,171 INFO L225 Difference]: With dead ends: 9215 [2018-11-28 13:09:19,171 INFO L226 Difference]: Without dead ends: 5405 [2018-11-28 13:09:19,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:09:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2018-11-28 13:09:19,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 4888. [2018-11-28 13:09:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-11-28 13:09:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 6979 transitions. [2018-11-28 13:09:19,344 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 6979 transitions. Word has length 74 [2018-11-28 13:09:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:19,344 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 6979 transitions. [2018-11-28 13:09:19,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:09:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 6979 transitions. [2018-11-28 13:09:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:09:19,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:19,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:19,346 INFO L423 AbstractCegarLoop]: === Iteration 30 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:19,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:19,346 INFO L82 PathProgramCache]: Analyzing trace with hash -866854708, now seen corresponding path program 1 times [2018-11-28 13:09:19,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:19,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:19,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:19,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:19,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:19,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:19,445 INFO L87 Difference]: Start difference. First operand 4888 states and 6979 transitions. Second operand 3 states. [2018-11-28 13:09:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:21,650 INFO L93 Difference]: Finished difference Result 6974 states and 9949 transitions. [2018-11-28 13:09:21,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:21,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-11-28 13:09:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:21,656 INFO L225 Difference]: With dead ends: 6974 [2018-11-28 13:09:21,656 INFO L226 Difference]: Without dead ends: 4932 [2018-11-28 13:09:21,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4932 states. [2018-11-28 13:09:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4932 to 4832. [2018-11-28 13:09:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4832 states. [2018-11-28 13:09:21,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4832 states to 4832 states and 6915 transitions. [2018-11-28 13:09:21,854 INFO L78 Accepts]: Start accepts. Automaton has 4832 states and 6915 transitions. Word has length 71 [2018-11-28 13:09:21,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:21,854 INFO L480 AbstractCegarLoop]: Abstraction has 4832 states and 6915 transitions. [2018-11-28 13:09:21,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:21,854 INFO L276 IsEmpty]: Start isEmpty. Operand 4832 states and 6915 transitions. [2018-11-28 13:09:21,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-28 13:09:21,856 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:21,856 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:21,856 INFO L423 AbstractCegarLoop]: === Iteration 31 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:21,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:21,856 INFO L82 PathProgramCache]: Analyzing trace with hash -73823408, now seen corresponding path program 1 times [2018-11-28 13:09:21,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:21,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:21,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:21,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:21,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:21,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:09:21,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:21,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:21,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:21,984 INFO L87 Difference]: Start difference. First operand 4832 states and 6915 transitions. Second operand 8 states. [2018-11-28 13:09:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:22,366 INFO L93 Difference]: Finished difference Result 4848 states and 6932 transitions. [2018-11-28 13:09:22,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:22,366 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2018-11-28 13:09:22,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:22,371 INFO L225 Difference]: With dead ends: 4848 [2018-11-28 13:09:22,371 INFO L226 Difference]: Without dead ends: 4828 [2018-11-28 13:09:22,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4828 states. [2018-11-28 13:09:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4828 to 4828. [2018-11-28 13:09:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4828 states. [2018-11-28 13:09:22,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4828 states to 4828 states and 6909 transitions. [2018-11-28 13:09:22,518 INFO L78 Accepts]: Start accepts. Automaton has 4828 states and 6909 transitions. Word has length 71 [2018-11-28 13:09:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:22,518 INFO L480 AbstractCegarLoop]: Abstraction has 4828 states and 6909 transitions. [2018-11-28 13:09:22,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 4828 states and 6909 transitions. [2018-11-28 13:09:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-28 13:09:22,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:22,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:22,520 INFO L423 AbstractCegarLoop]: === Iteration 32 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:22,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:22,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1131807685, now seen corresponding path program 1 times [2018-11-28 13:09:22,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:22,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:22,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:09:22,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:09:22,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:09:22,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:09:22,641 INFO L87 Difference]: Start difference. First operand 4828 states and 6909 transitions. Second operand 7 states. [2018-11-28 13:09:24,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:24,953 INFO L93 Difference]: Finished difference Result 9239 states and 13325 transitions. [2018-11-28 13:09:24,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:09:24,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-11-28 13:09:24,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:24,960 INFO L225 Difference]: With dead ends: 9239 [2018-11-28 13:09:24,960 INFO L226 Difference]: Without dead ends: 4974 [2018-11-28 13:09:24,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2018-11-28 13:09:25,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 4836. [2018-11-28 13:09:25,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4836 states. [2018-11-28 13:09:25,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4836 states to 4836 states and 6917 transitions. [2018-11-28 13:09:25,118 INFO L78 Accepts]: Start accepts. Automaton has 4836 states and 6917 transitions. Word has length 72 [2018-11-28 13:09:25,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:25,118 INFO L480 AbstractCegarLoop]: Abstraction has 4836 states and 6917 transitions. [2018-11-28 13:09:25,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:09:25,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4836 states and 6917 transitions. [2018-11-28 13:09:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-28 13:09:25,120 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:25,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:25,120 INFO L423 AbstractCegarLoop]: === Iteration 33 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:25,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:25,120 INFO L82 PathProgramCache]: Analyzing trace with hash 876873084, now seen corresponding path program 1 times [2018-11-28 13:09:25,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:25,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:25,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:25,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:25,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:25,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:25,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:25,211 INFO L87 Difference]: Start difference. First operand 4836 states and 6917 transitions. Second operand 5 states. [2018-11-28 13:09:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:27,455 INFO L93 Difference]: Finished difference Result 9216 states and 13331 transitions. [2018-11-28 13:09:27,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:27,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-11-28 13:09:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:27,463 INFO L225 Difference]: With dead ends: 9216 [2018-11-28 13:09:27,463 INFO L226 Difference]: Without dead ends: 4956 [2018-11-28 13:09:27,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:27,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2018-11-28 13:09:27,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 4844. [2018-11-28 13:09:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4844 states. [2018-11-28 13:09:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4844 states to 4844 states and 6925 transitions. [2018-11-28 13:09:27,620 INFO L78 Accepts]: Start accepts. Automaton has 4844 states and 6925 transitions. Word has length 73 [2018-11-28 13:09:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:27,620 INFO L480 AbstractCegarLoop]: Abstraction has 4844 states and 6925 transitions. [2018-11-28 13:09:27,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:09:27,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4844 states and 6925 transitions. [2018-11-28 13:09:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-28 13:09:27,622 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:27,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:27,622 INFO L423 AbstractCegarLoop]: === Iteration 34 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:27,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:27,622 INFO L82 PathProgramCache]: Analyzing trace with hash 569745710, now seen corresponding path program 1 times [2018-11-28 13:09:27,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:27,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:27,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:27,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:27,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:09:27,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:09:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:27,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:27,759 INFO L87 Difference]: Start difference. First operand 4844 states and 6925 transitions. Second operand 6 states. [2018-11-28 13:09:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:27,967 INFO L93 Difference]: Finished difference Result 4875 states and 6967 transitions. [2018-11-28 13:09:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:27,968 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-11-28 13:09:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:27,975 INFO L225 Difference]: With dead ends: 4875 [2018-11-28 13:09:27,975 INFO L226 Difference]: Without dead ends: 4851 [2018-11-28 13:09:27,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:09:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states. [2018-11-28 13:09:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4849. [2018-11-28 13:09:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2018-11-28 13:09:28,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 6934 transitions. [2018-11-28 13:09:28,133 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 6934 transitions. Word has length 74 [2018-11-28 13:09:28,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:28,133 INFO L480 AbstractCegarLoop]: Abstraction has 4849 states and 6934 transitions. [2018-11-28 13:09:28,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:09:28,133 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 6934 transitions. [2018-11-28 13:09:28,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:09:28,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:28,134 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:28,135 INFO L423 AbstractCegarLoop]: === Iteration 35 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:28,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1370269763, now seen corresponding path program 1 times [2018-11-28 13:09:28,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:28,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:28,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:28,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:28,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:28,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:28,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:28,258 INFO L87 Difference]: Start difference. First operand 4849 states and 6934 transitions. Second operand 3 states. [2018-11-28 13:09:28,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:28,485 INFO L93 Difference]: Finished difference Result 8152 states and 11678 transitions. [2018-11-28 13:09:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:28,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2018-11-28 13:09:28,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:28,495 INFO L225 Difference]: With dead ends: 8152 [2018-11-28 13:09:28,496 INFO L226 Difference]: Without dead ends: 4820 [2018-11-28 13:09:28,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:28,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4820 states. [2018-11-28 13:09:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4820 to 4818. [2018-11-28 13:09:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4818 states. [2018-11-28 13:09:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 6881 transitions. [2018-11-28 13:09:28,659 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 6881 transitions. Word has length 80 [2018-11-28 13:09:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:28,659 INFO L480 AbstractCegarLoop]: Abstraction has 4818 states and 6881 transitions. [2018-11-28 13:09:28,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 6881 transitions. [2018-11-28 13:09:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-28 13:09:28,660 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:28,660 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:28,661 INFO L423 AbstractCegarLoop]: === Iteration 36 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:28,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1487507096, now seen corresponding path program 1 times [2018-11-28 13:09:28,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:28,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:28,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:09:28,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:28,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:09:28,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:28,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:28,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:28,815 INFO L87 Difference]: Start difference. First operand 4818 states and 6881 transitions. Second operand 8 states. [2018-11-28 13:09:28,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:28,987 INFO L93 Difference]: Finished difference Result 4839 states and 6914 transitions. [2018-11-28 13:09:28,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:28,988 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-11-28 13:09:28,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:28,993 INFO L225 Difference]: With dead ends: 4839 [2018-11-28 13:09:28,994 INFO L226 Difference]: Without dead ends: 4823 [2018-11-28 13:09:28,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4823 states. [2018-11-28 13:09:29,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4823 to 4815. [2018-11-28 13:09:29,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4815 states. [2018-11-28 13:09:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 6876 transitions. [2018-11-28 13:09:29,143 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 6876 transitions. Word has length 78 [2018-11-28 13:09:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:29,143 INFO L480 AbstractCegarLoop]: Abstraction has 4815 states and 6876 transitions. [2018-11-28 13:09:29,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:29,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 6876 transitions. [2018-11-28 13:09:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:09:29,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:29,144 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:29,144 INFO L423 AbstractCegarLoop]: === Iteration 37 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:29,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1345506641, now seen corresponding path program 1 times [2018-11-28 13:09:29,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:29,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:29,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:29,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:29,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:29,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:29,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:29,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:29,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:29,246 INFO L87 Difference]: Start difference. First operand 4815 states and 6876 transitions. Second operand 5 states. [2018-11-28 13:09:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:31,425 INFO L93 Difference]: Finished difference Result 9186 states and 13283 transitions. [2018-11-28 13:09:31,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:31,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 13:09:31,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:31,432 INFO L225 Difference]: With dead ends: 9186 [2018-11-28 13:09:31,432 INFO L226 Difference]: Without dead ends: 4899 [2018-11-28 13:09:31,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4899 states. [2018-11-28 13:09:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4899 to 4871. [2018-11-28 13:09:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2018-11-28 13:09:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 6932 transitions. [2018-11-28 13:09:31,589 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 6932 transitions. Word has length 76 [2018-11-28 13:09:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 4871 states and 6932 transitions. [2018-11-28 13:09:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:09:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 6932 transitions. [2018-11-28 13:09:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-28 13:09:31,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:31,590 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:31,590 INFO L423 AbstractCegarLoop]: === Iteration 38 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:31,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash 934290926, now seen corresponding path program 1 times [2018-11-28 13:09:31,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:31,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:31,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:31,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:31,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:09:31,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:09:31,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:09:31,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:31,691 INFO L87 Difference]: Start difference. First operand 4871 states and 6932 transitions. Second operand 5 states. [2018-11-28 13:09:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:31,890 INFO L93 Difference]: Finished difference Result 9720 states and 13839 transitions. [2018-11-28 13:09:31,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:09:31,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-11-28 13:09:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:31,899 INFO L225 Difference]: With dead ends: 9720 [2018-11-28 13:09:31,899 INFO L226 Difference]: Without dead ends: 4871 [2018-11-28 13:09:31,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:09:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2018-11-28 13:09:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 4871. [2018-11-28 13:09:32,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4871 states. [2018-11-28 13:09:32,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4871 states to 4871 states and 6931 transitions. [2018-11-28 13:09:32,087 INFO L78 Accepts]: Start accepts. Automaton has 4871 states and 6931 transitions. Word has length 76 [2018-11-28 13:09:32,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:32,088 INFO L480 AbstractCegarLoop]: Abstraction has 4871 states and 6931 transitions. [2018-11-28 13:09:32,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:09:32,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 6931 transitions. [2018-11-28 13:09:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:09:32,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:32,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:32,089 INFO L423 AbstractCegarLoop]: === Iteration 39 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:32,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash 534541463, now seen corresponding path program 1 times [2018-11-28 13:09:32,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:32,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:32,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:32,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:09:32,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:09:32,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:32,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:32,212 INFO L87 Difference]: Start difference. First operand 4871 states and 6931 transitions. Second operand 6 states. [2018-11-28 13:09:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:36,479 INFO L93 Difference]: Finished difference Result 9284 states and 13326 transitions. [2018-11-28 13:09:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:09:36,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2018-11-28 13:09:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:36,489 INFO L225 Difference]: With dead ends: 9284 [2018-11-28 13:09:36,490 INFO L226 Difference]: Without dead ends: 4960 [2018-11-28 13:09:36,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:09:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4960 states. [2018-11-28 13:09:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4960 to 4894. [2018-11-28 13:09:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4894 states. [2018-11-28 13:09:36,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 6947 transitions. [2018-11-28 13:09:36,664 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 6947 transitions. Word has length 80 [2018-11-28 13:09:36,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:36,664 INFO L480 AbstractCegarLoop]: Abstraction has 4894 states and 6947 transitions. [2018-11-28 13:09:36,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:09:36,664 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 6947 transitions. [2018-11-28 13:09:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:09:36,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:36,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:36,665 INFO L423 AbstractCegarLoop]: === Iteration 40 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:36,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1874302907, now seen corresponding path program 1 times [2018-11-28 13:09:36,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:36,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:36,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:36,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:36,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:09:36,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:09:36,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:09:36,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:36,787 INFO L87 Difference]: Start difference. First operand 4894 states and 6947 transitions. Second operand 9 states. [2018-11-28 13:09:37,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:37,244 INFO L93 Difference]: Finished difference Result 4913 states and 6968 transitions. [2018-11-28 13:09:37,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:09:37,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-28 13:09:37,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:37,250 INFO L225 Difference]: With dead ends: 4913 [2018-11-28 13:09:37,251 INFO L226 Difference]: Without dead ends: 4889 [2018-11-28 13:09:37,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:09:37,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4889 states. [2018-11-28 13:09:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4889 to 4889. [2018-11-28 13:09:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4889 states. [2018-11-28 13:09:37,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4889 states to 4889 states and 6940 transitions. [2018-11-28 13:09:37,408 INFO L78 Accepts]: Start accepts. Automaton has 4889 states and 6940 transitions. Word has length 79 [2018-11-28 13:09:37,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:37,408 INFO L480 AbstractCegarLoop]: Abstraction has 4889 states and 6940 transitions. [2018-11-28 13:09:37,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:09:37,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4889 states and 6940 transitions. [2018-11-28 13:09:37,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-28 13:09:37,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:37,409 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:37,409 INFO L423 AbstractCegarLoop]: === Iteration 41 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:37,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:37,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2098494259, now seen corresponding path program 1 times [2018-11-28 13:09:37,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:37,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:37,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:37,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:37,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:37,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:37,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:09:37,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:09:37,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:09:37,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:37,564 INFO L87 Difference]: Start difference. First operand 4889 states and 6940 transitions. Second operand 9 states. [2018-11-28 13:09:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:37,966 INFO L93 Difference]: Finished difference Result 4908 states and 6961 transitions. [2018-11-28 13:09:37,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:09:37,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 79 [2018-11-28 13:09:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:37,973 INFO L225 Difference]: With dead ends: 4908 [2018-11-28 13:09:37,973 INFO L226 Difference]: Without dead ends: 4885 [2018-11-28 13:09:37,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:09:37,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4885 states. [2018-11-28 13:09:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4885 to 4885. [2018-11-28 13:09:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4885 states. [2018-11-28 13:09:38,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4885 states to 4885 states and 6934 transitions. [2018-11-28 13:09:38,128 INFO L78 Accepts]: Start accepts. Automaton has 4885 states and 6934 transitions. Word has length 79 [2018-11-28 13:09:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:38,128 INFO L480 AbstractCegarLoop]: Abstraction has 4885 states and 6934 transitions. [2018-11-28 13:09:38,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:09:38,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4885 states and 6934 transitions. [2018-11-28 13:09:38,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-28 13:09:38,129 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:38,129 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:38,129 INFO L423 AbstractCegarLoop]: === Iteration 42 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:38,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1792127267, now seen corresponding path program 1 times [2018-11-28 13:09:38,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:38,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:38,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:38,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:38,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:38,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:09:38,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:09:38,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:09:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:38,253 INFO L87 Difference]: Start difference. First operand 4885 states and 6934 transitions. Second operand 9 states. [2018-11-28 13:09:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:38,668 INFO L93 Difference]: Finished difference Result 4904 states and 6955 transitions. [2018-11-28 13:09:38,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:09:38,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-28 13:09:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:38,676 INFO L225 Difference]: With dead ends: 4904 [2018-11-28 13:09:38,676 INFO L226 Difference]: Without dead ends: 4881 [2018-11-28 13:09:38,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:09:38,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2018-11-28 13:09:38,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2018-11-28 13:09:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2018-11-28 13:09:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 6928 transitions. [2018-11-28 13:09:38,829 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 6928 transitions. Word has length 80 [2018-11-28 13:09:38,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:38,829 INFO L480 AbstractCegarLoop]: Abstraction has 4881 states and 6928 transitions. [2018-11-28 13:09:38,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:09:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 6928 transitions. [2018-11-28 13:09:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-28 13:09:38,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:38,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:38,831 INFO L423 AbstractCegarLoop]: === Iteration 43 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:38,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:38,831 INFO L82 PathProgramCache]: Analyzing trace with hash -930771983, now seen corresponding path program 1 times [2018-11-28 13:09:38,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:38,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:38,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:38,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:38,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 13:09:38,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:38,945 INFO L87 Difference]: Start difference. First operand 4881 states and 6928 transitions. Second operand 8 states. [2018-11-28 13:09:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:39,291 INFO L93 Difference]: Finished difference Result 4900 states and 6959 transitions. [2018-11-28 13:09:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:09:39,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-11-28 13:09:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:39,297 INFO L225 Difference]: With dead ends: 4900 [2018-11-28 13:09:39,297 INFO L226 Difference]: Without dead ends: 4886 [2018-11-28 13:09:39,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:09:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4886 states. [2018-11-28 13:09:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4886 to 4878. [2018-11-28 13:09:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4878 states. [2018-11-28 13:09:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4878 states to 4878 states and 6923 transitions. [2018-11-28 13:09:39,450 INFO L78 Accepts]: Start accepts. Automaton has 4878 states and 6923 transitions. Word has length 81 [2018-11-28 13:09:39,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:39,450 INFO L480 AbstractCegarLoop]: Abstraction has 4878 states and 6923 transitions. [2018-11-28 13:09:39,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:39,450 INFO L276 IsEmpty]: Start isEmpty. Operand 4878 states and 6923 transitions. [2018-11-28 13:09:39,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-28 13:09:39,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:39,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:39,452 INFO L423 AbstractCegarLoop]: === Iteration 44 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:39,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1279914443, now seen corresponding path program 1 times [2018-11-28 13:09:39,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:39,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:39,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:39,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:39,560 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:39,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:39,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:39,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:09:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2018-11-28 13:09:39,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:09:39,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:09:39,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:09:39,981 INFO L87 Difference]: Start difference. First operand 4878 states and 6923 transitions. Second operand 8 states. [2018-11-28 13:09:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:47,876 INFO L93 Difference]: Finished difference Result 9674 states and 13971 transitions. [2018-11-28 13:09:47,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:09:47,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-11-28 13:09:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:47,892 INFO L225 Difference]: With dead ends: 9674 [2018-11-28 13:09:47,892 INFO L226 Difference]: Without dead ends: 5345 [2018-11-28 13:09:47,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:09:47,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2018-11-28 13:09:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4910. [2018-11-28 13:09:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4910 states. [2018-11-28 13:09:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4910 states to 4910 states and 6955 transitions. [2018-11-28 13:09:48,112 INFO L78 Accepts]: Start accepts. Automaton has 4910 states and 6955 transitions. Word has length 85 [2018-11-28 13:09:48,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:48,112 INFO L480 AbstractCegarLoop]: Abstraction has 4910 states and 6955 transitions. [2018-11-28 13:09:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:09:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4910 states and 6955 transitions. [2018-11-28 13:09:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-28 13:09:48,115 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:48,115 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:48,115 INFO L423 AbstractCegarLoop]: === Iteration 45 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:48,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:48,116 INFO L82 PathProgramCache]: Analyzing trace with hash -198040146, now seen corresponding path program 1 times [2018-11-28 13:09:48,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:09:48,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:09:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:48,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:09:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:48,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:09:48,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:09:48,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:48,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:48,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:48,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:48,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2018-11-28 13:09:48,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:09:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:09:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:09:48,915 INFO L87 Difference]: Start difference. First operand 4910 states and 6955 transitions. Second operand 14 states. [2018-11-28 13:10:19,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:19,817 INFO L93 Difference]: Finished difference Result 6172 states and 8587 transitions. [2018-11-28 13:10:19,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:10:19,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 86 [2018-11-28 13:10:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:19,821 INFO L225 Difference]: With dead ends: 6172 [2018-11-28 13:10:19,822 INFO L226 Difference]: Without dead ends: 1023 [2018-11-28 13:10:19,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:10:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2018-11-28 13:10:19,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 913. [2018-11-28 13:10:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-11-28 13:10:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1112 transitions. [2018-11-28 13:10:19,892 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1112 transitions. Word has length 86 [2018-11-28 13:10:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:19,893 INFO L480 AbstractCegarLoop]: Abstraction has 913 states and 1112 transitions. [2018-11-28 13:10:19,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:10:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1112 transitions. [2018-11-28 13:10:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-28 13:10:19,894 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:19,894 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:19,894 INFO L423 AbstractCegarLoop]: === Iteration 46 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:19,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1666412898, now seen corresponding path program 1 times [2018-11-28 13:10:19,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:19,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:20,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:20,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:20,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:20,074 INFO L87 Difference]: Start difference. First operand 913 states and 1112 transitions. Second operand 6 states. [2018-11-28 13:10:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:22,171 INFO L93 Difference]: Finished difference Result 1473 states and 1846 transitions. [2018-11-28 13:10:22,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:22,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-11-28 13:10:22,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:22,175 INFO L225 Difference]: With dead ends: 1473 [2018-11-28 13:10:22,175 INFO L226 Difference]: Without dead ends: 958 [2018-11-28 13:10:22,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:22,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2018-11-28 13:10:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 930. [2018-11-28 13:10:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-11-28 13:10:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1138 transitions. [2018-11-28 13:10:22,212 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1138 transitions. Word has length 89 [2018-11-28 13:10:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:22,212 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 1138 transitions. [2018-11-28 13:10:22,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1138 transitions. [2018-11-28 13:10:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-28 13:10:22,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:22,213 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:22,214 INFO L423 AbstractCegarLoop]: === Iteration 47 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:22,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:22,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1231030274, now seen corresponding path program 1 times [2018-11-28 13:10:22,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:22,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:22,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:22,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:22,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:22,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:22,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:22,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:22,336 INFO L87 Difference]: Start difference. First operand 930 states and 1138 transitions. Second operand 6 states. [2018-11-28 13:10:22,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:22,428 INFO L93 Difference]: Finished difference Result 1048 states and 1271 transitions. [2018-11-28 13:10:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:22,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-11-28 13:10:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:22,432 INFO L225 Difference]: With dead ends: 1048 [2018-11-28 13:10:22,432 INFO L226 Difference]: Without dead ends: 956 [2018-11-28 13:10:22,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-11-28 13:10:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 932. [2018-11-28 13:10:22,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-28 13:10:22,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1139 transitions. [2018-11-28 13:10:22,468 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1139 transitions. Word has length 94 [2018-11-28 13:10:22,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:22,469 INFO L480 AbstractCegarLoop]: Abstraction has 932 states and 1139 transitions. [2018-11-28 13:10:22,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:22,469 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1139 transitions. [2018-11-28 13:10:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-28 13:10:22,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:22,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:22,470 INFO L423 AbstractCegarLoop]: === Iteration 48 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:22,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash 39289058, now seen corresponding path program 1 times [2018-11-28 13:10:22,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:22,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:22,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:22,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:22,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:22,599 INFO L87 Difference]: Start difference. First operand 932 states and 1139 transitions. Second operand 5 states. [2018-11-28 13:10:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:23,137 INFO L93 Difference]: Finished difference Result 1878 states and 2398 transitions. [2018-11-28 13:10:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:23,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2018-11-28 13:10:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:23,142 INFO L225 Difference]: With dead ends: 1878 [2018-11-28 13:10:23,142 INFO L226 Difference]: Without dead ends: 1361 [2018-11-28 13:10:23,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:23,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2018-11-28 13:10:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1135. [2018-11-28 13:10:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2018-11-28 13:10:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1419 transitions. [2018-11-28 13:10:23,232 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1419 transitions. Word has length 95 [2018-11-28 13:10:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:23,233 INFO L480 AbstractCegarLoop]: Abstraction has 1135 states and 1419 transitions. [2018-11-28 13:10:23,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:23,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1419 transitions. [2018-11-28 13:10:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-28 13:10:23,234 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:23,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:23,234 INFO L423 AbstractCegarLoop]: === Iteration 49 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:23,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:23,234 INFO L82 PathProgramCache]: Analyzing trace with hash 227272631, now seen corresponding path program 1 times [2018-11-28 13:10:23,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:23,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:23,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:23,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:23,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:23,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:23,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:23,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:23,385 INFO L87 Difference]: Start difference. First operand 1135 states and 1419 transitions. Second operand 6 states. [2018-11-28 13:10:25,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:25,850 INFO L93 Difference]: Finished difference Result 1165 states and 1453 transitions. [2018-11-28 13:10:25,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:10:25,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2018-11-28 13:10:25,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:25,852 INFO L225 Difference]: With dead ends: 1165 [2018-11-28 13:10:25,852 INFO L226 Difference]: Without dead ends: 1090 [2018-11-28 13:10:25,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-11-28 13:10:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2018-11-28 13:10:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-11-28 13:10:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1368 transitions. [2018-11-28 13:10:25,900 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1368 transitions. Word has length 90 [2018-11-28 13:10:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:25,900 INFO L480 AbstractCegarLoop]: Abstraction has 1090 states and 1368 transitions. [2018-11-28 13:10:25,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1368 transitions. [2018-11-28 13:10:25,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:10:25,901 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:25,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:25,901 INFO L423 AbstractCegarLoop]: === Iteration 50 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:25,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:25,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1729849792, now seen corresponding path program 1 times [2018-11-28 13:10:25,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:25,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:25,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:25,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:26,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:26,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:10:26,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:10:26,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:10:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:26,022 INFO L87 Difference]: Start difference. First operand 1090 states and 1368 transitions. Second operand 3 states. [2018-11-28 13:10:26,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:26,082 INFO L93 Difference]: Finished difference Result 1827 states and 2337 transitions. [2018-11-28 13:10:26,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:10:26,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-28 13:10:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:26,086 INFO L225 Difference]: With dead ends: 1827 [2018-11-28 13:10:26,086 INFO L226 Difference]: Without dead ends: 1123 [2018-11-28 13:10:26,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-28 13:10:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1094. [2018-11-28 13:10:26,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1094 states. [2018-11-28 13:10:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1094 states to 1094 states and 1374 transitions. [2018-11-28 13:10:26,141 INFO L78 Accepts]: Start accepts. Automaton has 1094 states and 1374 transitions. Word has length 96 [2018-11-28 13:10:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:26,142 INFO L480 AbstractCegarLoop]: Abstraction has 1094 states and 1374 transitions. [2018-11-28 13:10:26,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:10:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1094 states and 1374 transitions. [2018-11-28 13:10:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:10:26,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:26,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:26,143 INFO L423 AbstractCegarLoop]: === Iteration 51 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:26,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1017375104, now seen corresponding path program 1 times [2018-11-28 13:10:26,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:26,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:26,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:26,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:26,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:10:26,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:10:26,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:10:26,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:26,301 INFO L87 Difference]: Start difference. First operand 1094 states and 1374 transitions. Second operand 3 states. [2018-11-28 13:10:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:26,403 INFO L93 Difference]: Finished difference Result 1921 states and 2444 transitions. [2018-11-28 13:10:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:10:26,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-11-28 13:10:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:26,406 INFO L225 Difference]: With dead ends: 1921 [2018-11-28 13:10:26,406 INFO L226 Difference]: Without dead ends: 1235 [2018-11-28 13:10:26,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:26,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-11-28 13:10:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1200. [2018-11-28 13:10:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1200 states. [2018-11-28 13:10:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1514 transitions. [2018-11-28 13:10:26,474 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1514 transitions. Word has length 96 [2018-11-28 13:10:26,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:26,474 INFO L480 AbstractCegarLoop]: Abstraction has 1200 states and 1514 transitions. [2018-11-28 13:10:26,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:10:26,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1514 transitions. [2018-11-28 13:10:26,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-28 13:10:26,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:26,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:26,475 INFO L423 AbstractCegarLoop]: === Iteration 52 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:26,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1692218836, now seen corresponding path program 1 times [2018-11-28 13:10:26,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:26,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:26,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:26,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:26,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:26,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:26,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:26,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:26,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:10:26,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:10:26,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:10:26,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:10:26,638 INFO L87 Difference]: Start difference. First operand 1200 states and 1514 transitions. Second operand 4 states. [2018-11-28 13:10:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:26,855 INFO L93 Difference]: Finished difference Result 2070 states and 2649 transitions. [2018-11-28 13:10:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:10:26,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-11-28 13:10:26,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:26,859 INFO L225 Difference]: With dead ends: 2070 [2018-11-28 13:10:26,859 INFO L226 Difference]: Without dead ends: 1205 [2018-11-28 13:10:26,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-11-28 13:10:26,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1201. [2018-11-28 13:10:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1201 states. [2018-11-28 13:10:26,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1515 transitions. [2018-11-28 13:10:26,954 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1515 transitions. Word has length 104 [2018-11-28 13:10:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:26,955 INFO L480 AbstractCegarLoop]: Abstraction has 1201 states and 1515 transitions. [2018-11-28 13:10:26,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:10:26,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1515 transitions. [2018-11-28 13:10:26,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-28 13:10:26,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:26,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:26,956 INFO L423 AbstractCegarLoop]: === Iteration 53 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:26,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:26,957 INFO L82 PathProgramCache]: Analyzing trace with hash 939768471, now seen corresponding path program 1 times [2018-11-28 13:10:26,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:26,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:26,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:26,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:26,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:27,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:27,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:27,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:27,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:27,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-28 13:10:27,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:27,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:27,503 INFO L87 Difference]: Start difference. First operand 1201 states and 1515 transitions. Second operand 6 states. [2018-11-28 13:10:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:27,727 INFO L93 Difference]: Finished difference Result 2075 states and 2656 transitions. [2018-11-28 13:10:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:27,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-28 13:10:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:27,732 INFO L225 Difference]: With dead ends: 2075 [2018-11-28 13:10:27,732 INFO L226 Difference]: Without dead ends: 1210 [2018-11-28 13:10:27,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:27,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2018-11-28 13:10:27,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1202. [2018-11-28 13:10:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2018-11-28 13:10:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1516 transitions. [2018-11-28 13:10:27,832 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1516 transitions. Word has length 105 [2018-11-28 13:10:27,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:27,832 INFO L480 AbstractCegarLoop]: Abstraction has 1202 states and 1516 transitions. [2018-11-28 13:10:27,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:27,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1516 transitions. [2018-11-28 13:10:27,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-28 13:10:27,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:27,833 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:27,833 INFO L423 AbstractCegarLoop]: === Iteration 54 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:27,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash 926996364, now seen corresponding path program 2 times [2018-11-28 13:10:27,834 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:27,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:27,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:27,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:27,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:28,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:28,011 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:28,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:10:28,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:10:28,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:28,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:28,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:10:28,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:10:28,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-28 13:10:28,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:10:28,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:10:28,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:28,547 INFO L87 Difference]: Start difference. First operand 1202 states and 1516 transitions. Second operand 8 states. [2018-11-28 13:10:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:28,884 INFO L93 Difference]: Finished difference Result 2098 states and 2689 transitions. [2018-11-28 13:10:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:10:28,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2018-11-28 13:10:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:28,888 INFO L225 Difference]: With dead ends: 2098 [2018-11-28 13:10:28,888 INFO L226 Difference]: Without dead ends: 1228 [2018-11-28 13:10:28,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2018-11-28 13:10:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1204. [2018-11-28 13:10:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1204 states. [2018-11-28 13:10:28,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1518 transitions. [2018-11-28 13:10:28,943 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1518 transitions. Word has length 106 [2018-11-28 13:10:28,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:28,943 INFO L480 AbstractCegarLoop]: Abstraction has 1204 states and 1518 transitions. [2018-11-28 13:10:28,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:10:28,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1518 transitions. [2018-11-28 13:10:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-28 13:10:28,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:28,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:28,945 INFO L423 AbstractCegarLoop]: === Iteration 55 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:28,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:28,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1967647111, now seen corresponding path program 1 times [2018-11-28 13:10:28,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:28,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:28,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:28,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:29,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:29,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:29,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:29,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:29,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:29,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:29,031 INFO L87 Difference]: Start difference. First operand 1204 states and 1518 transitions. Second operand 5 states. [2018-11-28 13:10:29,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:29,110 INFO L93 Difference]: Finished difference Result 1239 states and 1554 transitions. [2018-11-28 13:10:29,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:29,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-11-28 13:10:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:29,112 INFO L225 Difference]: With dead ends: 1239 [2018-11-28 13:10:29,112 INFO L226 Difference]: Without dead ends: 1183 [2018-11-28 13:10:29,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-28 13:10:29,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2018-11-28 13:10:29,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2018-11-28 13:10:29,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1492 transitions. [2018-11-28 13:10:29,166 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1492 transitions. Word has length 96 [2018-11-28 13:10:29,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:29,166 INFO L480 AbstractCegarLoop]: Abstraction has 1183 states and 1492 transitions. [2018-11-28 13:10:29,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1492 transitions. [2018-11-28 13:10:29,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-28 13:10:29,168 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:29,168 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:29,168 INFO L423 AbstractCegarLoop]: === Iteration 56 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:29,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:29,168 INFO L82 PathProgramCache]: Analyzing trace with hash 709806186, now seen corresponding path program 1 times [2018-11-28 13:10:29,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:29,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:29,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:29,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:29,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:29,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:29,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:29,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:29,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:29,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:29,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:29,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-28 13:10:29,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:10:29,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:10:29,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:10:29,770 INFO L87 Difference]: Start difference. First operand 1183 states and 1492 transitions. Second operand 8 states. [2018-11-28 13:10:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:30,039 INFO L93 Difference]: Finished difference Result 2066 states and 2646 transitions. [2018-11-28 13:10:30,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:10:30,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-11-28 13:10:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:30,043 INFO L225 Difference]: With dead ends: 2066 [2018-11-28 13:10:30,043 INFO L226 Difference]: Without dead ends: 1200 [2018-11-28 13:10:30,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:10:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2018-11-28 13:10:30,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1184. [2018-11-28 13:10:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1184 states. [2018-11-28 13:10:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1493 transitions. [2018-11-28 13:10:30,137 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1493 transitions. Word has length 108 [2018-11-28 13:10:30,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:30,137 INFO L480 AbstractCegarLoop]: Abstraction has 1184 states and 1493 transitions. [2018-11-28 13:10:30,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:10:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1493 transitions. [2018-11-28 13:10:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-28 13:10:30,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:30,139 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:30,139 INFO L423 AbstractCegarLoop]: === Iteration 57 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:30,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1826911403, now seen corresponding path program 2 times [2018-11-28 13:10:30,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:30,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:30,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:30,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:30,367 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:30,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:10:30,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:10:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:10:30,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 13:10:30,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:30,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:10:30,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 13:10:30,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2018-11-28 13:10:30,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:10:30,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:10:30,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:10:30,715 INFO L87 Difference]: Start difference. First operand 1184 states and 1493 transitions. Second operand 11 states. [2018-11-28 13:10:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:31,096 INFO L93 Difference]: Finished difference Result 1866 states and 2417 transitions. [2018-11-28 13:10:31,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:10:31,097 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 109 [2018-11-28 13:10:31,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:31,099 INFO L225 Difference]: With dead ends: 1866 [2018-11-28 13:10:31,099 INFO L226 Difference]: Without dead ends: 1000 [2018-11-28 13:10:31,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:10:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-11-28 13:10:31,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 980. [2018-11-28 13:10:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2018-11-28 13:10:31,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1217 transitions. [2018-11-28 13:10:31,181 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1217 transitions. Word has length 109 [2018-11-28 13:10:31,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:31,181 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 1217 transitions. [2018-11-28 13:10:31,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:10:31,181 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1217 transitions. [2018-11-28 13:10:31,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-28 13:10:31,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:31,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:31,183 INFO L423 AbstractCegarLoop]: === Iteration 58 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:31,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:31,183 INFO L82 PathProgramCache]: Analyzing trace with hash 628909173, now seen corresponding path program 1 times [2018-11-28 13:10:31,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:31,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:31,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:31,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:31,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:31,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:10:31,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:10:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:10:31,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:10:31,369 INFO L87 Difference]: Start difference. First operand 980 states and 1217 transitions. Second operand 9 states. [2018-11-28 13:10:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:31,759 INFO L93 Difference]: Finished difference Result 997 states and 1235 transitions. [2018-11-28 13:10:31,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:10:31,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-11-28 13:10:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:31,761 INFO L225 Difference]: With dead ends: 997 [2018-11-28 13:10:31,761 INFO L226 Difference]: Without dead ends: 923 [2018-11-28 13:10:31,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:10:31,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-28 13:10:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 923. [2018-11-28 13:10:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2018-11-28 13:10:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1153 transitions. [2018-11-28 13:10:31,816 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1153 transitions. Word has length 99 [2018-11-28 13:10:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:31,816 INFO L480 AbstractCegarLoop]: Abstraction has 923 states and 1153 transitions. [2018-11-28 13:10:31,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:10:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1153 transitions. [2018-11-28 13:10:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-28 13:10:31,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:31,817 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:31,817 INFO L423 AbstractCegarLoop]: === Iteration 59 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:31,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1769272061, now seen corresponding path program 1 times [2018-11-28 13:10:31,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:31,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:31,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:31,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:31,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:31,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:31,968 INFO L87 Difference]: Start difference. First operand 923 states and 1153 transitions. Second operand 5 states. [2018-11-28 13:10:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:32,294 INFO L93 Difference]: Finished difference Result 1380 states and 1722 transitions. [2018-11-28 13:10:32,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:32,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2018-11-28 13:10:32,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:32,297 INFO L225 Difference]: With dead ends: 1380 [2018-11-28 13:10:32,297 INFO L226 Difference]: Without dead ends: 801 [2018-11-28 13:10:32,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:32,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2018-11-28 13:10:32,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 801. [2018-11-28 13:10:32,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2018-11-28 13:10:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 981 transitions. [2018-11-28 13:10:32,338 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 981 transitions. Word has length 114 [2018-11-28 13:10:32,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:32,338 INFO L480 AbstractCegarLoop]: Abstraction has 801 states and 981 transitions. [2018-11-28 13:10:32,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 981 transitions. [2018-11-28 13:10:32,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-28 13:10:32,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:32,339 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:32,340 INFO L423 AbstractCegarLoop]: === Iteration 60 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:32,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:32,340 INFO L82 PathProgramCache]: Analyzing trace with hash 585328116, now seen corresponding path program 1 times [2018-11-28 13:10:32,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:32,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:32,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:32,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:32,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:32,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:32,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:32,478 INFO L87 Difference]: Start difference. First operand 801 states and 981 transitions. Second operand 6 states. [2018-11-28 13:10:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:32,554 INFO L93 Difference]: Finished difference Result 1249 states and 1534 transitions. [2018-11-28 13:10:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:32,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-11-28 13:10:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:32,557 INFO L225 Difference]: With dead ends: 1249 [2018-11-28 13:10:32,557 INFO L226 Difference]: Without dead ends: 803 [2018-11-28 13:10:32,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:32,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2018-11-28 13:10:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 797. [2018-11-28 13:10:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-11-28 13:10:32,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 974 transitions. [2018-11-28 13:10:32,597 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 974 transitions. Word has length 117 [2018-11-28 13:10:32,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:32,597 INFO L480 AbstractCegarLoop]: Abstraction has 797 states and 974 transitions. [2018-11-28 13:10:32,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:32,597 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 974 transitions. [2018-11-28 13:10:32,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-28 13:10:32,598 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:32,598 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:32,598 INFO L423 AbstractCegarLoop]: === Iteration 61 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:32,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:32,598 INFO L82 PathProgramCache]: Analyzing trace with hash 75259540, now seen corresponding path program 1 times [2018-11-28 13:10:32,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:32,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:32,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:32,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:32,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:32,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:32,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:32,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:32,757 INFO L87 Difference]: Start difference. First operand 797 states and 974 transitions. Second operand 6 states. [2018-11-28 13:10:34,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:34,863 INFO L93 Difference]: Finished difference Result 1220 states and 1483 transitions. [2018-11-28 13:10:34,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:34,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2018-11-28 13:10:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:34,865 INFO L225 Difference]: With dead ends: 1220 [2018-11-28 13:10:34,865 INFO L226 Difference]: Without dead ends: 789 [2018-11-28 13:10:34,866 INFO L631 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-11-28 13:10:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-11-28 13:10:34,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 783. [2018-11-28 13:10:34,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2018-11-28 13:10:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 953 transitions. [2018-11-28 13:10:34,904 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 953 transitions. Word has length 115 [2018-11-28 13:10:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:34,904 INFO L480 AbstractCegarLoop]: Abstraction has 783 states and 953 transitions. [2018-11-28 13:10:34,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 953 transitions. [2018-11-28 13:10:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-28 13:10:34,905 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:34,905 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:34,905 INFO L423 AbstractCegarLoop]: === Iteration 62 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:34,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:34,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1072583733, now seen corresponding path program 1 times [2018-11-28 13:10:34,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:34,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:34,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:35,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:35,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:35,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:35,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:35,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:35,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:35,015 INFO L87 Difference]: Start difference. First operand 783 states and 953 transitions. Second operand 5 states. [2018-11-28 13:10:44,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:44,324 INFO L93 Difference]: Finished difference Result 1468 states and 1761 transitions. [2018-11-28 13:10:44,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:44,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-11-28 13:10:44,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:44,326 INFO L225 Difference]: With dead ends: 1468 [2018-11-28 13:10:44,327 INFO L226 Difference]: Without dead ends: 987 [2018-11-28 13:10:44,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:44,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2018-11-28 13:10:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 879. [2018-11-28 13:10:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2018-11-28 13:10:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1044 transitions. [2018-11-28 13:10:44,382 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1044 transitions. Word has length 109 [2018-11-28 13:10:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:44,382 INFO L480 AbstractCegarLoop]: Abstraction has 879 states and 1044 transitions. [2018-11-28 13:10:44,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1044 transitions. [2018-11-28 13:10:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-28 13:10:44,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:44,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:44,383 INFO L423 AbstractCegarLoop]: === Iteration 63 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:44,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash 780224909, now seen corresponding path program 1 times [2018-11-28 13:10:44,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:44,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:44,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:44,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:10:44,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:44,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:10:44,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:10:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:10:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:10:44,535 INFO L87 Difference]: Start difference. First operand 879 states and 1044 transitions. Second operand 9 states. [2018-11-28 13:10:44,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:44,903 INFO L93 Difference]: Finished difference Result 885 states and 1049 transitions. [2018-11-28 13:10:44,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:10:44,903 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 110 [2018-11-28 13:10:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:44,905 INFO L225 Difference]: With dead ends: 885 [2018-11-28 13:10:44,905 INFO L226 Difference]: Without dead ends: 787 [2018-11-28 13:10:44,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:10:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-28 13:10:44,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 787. [2018-11-28 13:10:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-11-28 13:10:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 937 transitions. [2018-11-28 13:10:44,955 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 937 transitions. Word has length 110 [2018-11-28 13:10:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:44,955 INFO L480 AbstractCegarLoop]: Abstraction has 787 states and 937 transitions. [2018-11-28 13:10:44,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:10:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 937 transitions. [2018-11-28 13:10:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-28 13:10:44,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:44,956 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:44,956 INFO L423 AbstractCegarLoop]: === Iteration 64 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:44,956 INFO L82 PathProgramCache]: Analyzing trace with hash 680832973, now seen corresponding path program 1 times [2018-11-28 13:10:44,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:44,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:44,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:44,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:44,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:45,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:45,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:45,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:45,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:45,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:45,110 INFO L87 Difference]: Start difference. First operand 787 states and 937 transitions. Second operand 5 states. [2018-11-28 13:10:49,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:49,829 INFO L93 Difference]: Finished difference Result 1184 states and 1419 transitions. [2018-11-28 13:10:49,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:10:49,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-11-28 13:10:49,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:49,831 INFO L225 Difference]: With dead ends: 1184 [2018-11-28 13:10:49,831 INFO L226 Difference]: Without dead ends: 722 [2018-11-28 13:10:49,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:49,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-11-28 13:10:49,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 718. [2018-11-28 13:10:49,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-28 13:10:49,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 849 transitions. [2018-11-28 13:10:49,869 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 849 transitions. Word has length 127 [2018-11-28 13:10:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:49,869 INFO L480 AbstractCegarLoop]: Abstraction has 718 states and 849 transitions. [2018-11-28 13:10:49,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 849 transitions. [2018-11-28 13:10:49,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-28 13:10:49,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:49,871 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:49,871 INFO L423 AbstractCegarLoop]: === Iteration 65 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:49,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:49,871 INFO L82 PathProgramCache]: Analyzing trace with hash -609196172, now seen corresponding path program 1 times [2018-11-28 13:10:49,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:49,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:49,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:49,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:49,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:10:49,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:49,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:49,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:49,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:49,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:49,973 INFO L87 Difference]: Start difference. First operand 718 states and 849 transitions. Second operand 5 states. [2018-11-28 13:10:50,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:50,449 INFO L93 Difference]: Finished difference Result 762 states and 900 transitions. [2018-11-28 13:10:50,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:50,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-28 13:10:50,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:50,451 INFO L225 Difference]: With dead ends: 762 [2018-11-28 13:10:50,451 INFO L226 Difference]: Without dead ends: 717 [2018-11-28 13:10:50,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:50,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2018-11-28 13:10:50,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 717. [2018-11-28 13:10:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 717 states. [2018-11-28 13:10:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 847 transitions. [2018-11-28 13:10:50,488 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 847 transitions. Word has length 134 [2018-11-28 13:10:50,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:50,489 INFO L480 AbstractCegarLoop]: Abstraction has 717 states and 847 transitions. [2018-11-28 13:10:50,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 847 transitions. [2018-11-28 13:10:50,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-28 13:10:50,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:50,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:50,490 INFO L423 AbstractCegarLoop]: === Iteration 66 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:50,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:50,490 INFO L82 PathProgramCache]: Analyzing trace with hash -740403755, now seen corresponding path program 1 times [2018-11-28 13:10:50,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:50,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:50,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:50,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-28 13:10:50,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:50,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:50,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:50,617 INFO L87 Difference]: Start difference. First operand 717 states and 847 transitions. Second operand 5 states. [2018-11-28 13:10:51,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:51,083 INFO L93 Difference]: Finished difference Result 727 states and 855 transitions. [2018-11-28 13:10:51,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:51,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-28 13:10:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:51,085 INFO L225 Difference]: With dead ends: 727 [2018-11-28 13:10:51,085 INFO L226 Difference]: Without dead ends: 615 [2018-11-28 13:10:51,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:51,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-28 13:10:51,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2018-11-28 13:10:51,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-11-28 13:10:51,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 730 transitions. [2018-11-28 13:10:51,117 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 730 transitions. Word has length 134 [2018-11-28 13:10:51,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:51,117 INFO L480 AbstractCegarLoop]: Abstraction has 615 states and 730 transitions. [2018-11-28 13:10:51,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 730 transitions. [2018-11-28 13:10:51,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-28 13:10:51,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:51,118 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:51,118 INFO L423 AbstractCegarLoop]: === Iteration 67 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:51,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:51,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1651614248, now seen corresponding path program 1 times [2018-11-28 13:10:51,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:51,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:51,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:51,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:51,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:51,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:51,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 13:10:51,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:10:51,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:10:51,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:10:51,281 INFO L87 Difference]: Start difference. First operand 615 states and 730 transitions. Second operand 9 states. [2018-11-28 13:10:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:53,517 INFO L93 Difference]: Finished difference Result 714 states and 871 transitions. [2018-11-28 13:10:53,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:10:53,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 137 [2018-11-28 13:10:53,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:53,519 INFO L225 Difference]: With dead ends: 714 [2018-11-28 13:10:53,519 INFO L226 Difference]: Without dead ends: 653 [2018-11-28 13:10:53,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:10:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-28 13:10:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 635. [2018-11-28 13:10:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-11-28 13:10:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 751 transitions. [2018-11-28 13:10:53,562 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 751 transitions. Word has length 137 [2018-11-28 13:10:53,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:53,562 INFO L480 AbstractCegarLoop]: Abstraction has 635 states and 751 transitions. [2018-11-28 13:10:53,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:10:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 751 transitions. [2018-11-28 13:10:53,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-11-28 13:10:53,563 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:53,563 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:53,563 INFO L423 AbstractCegarLoop]: === Iteration 68 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:53,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:53,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2073056726, now seen corresponding path program 1 times [2018-11-28 13:10:53,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:53,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:53,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:53,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:53,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 13:10:53,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:10:53,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:10:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:53,737 INFO L87 Difference]: Start difference. First operand 635 states and 751 transitions. Second operand 7 states. [2018-11-28 13:10:53,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:53,918 INFO L93 Difference]: Finished difference Result 1186 states and 1407 transitions. [2018-11-28 13:10:53,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:10:53,919 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2018-11-28 13:10:53,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:53,921 INFO L225 Difference]: With dead ends: 1186 [2018-11-28 13:10:53,921 INFO L226 Difference]: Without dead ends: 1105 [2018-11-28 13:10:53,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:10:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2018-11-28 13:10:53,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 508. [2018-11-28 13:10:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508 states. [2018-11-28 13:10:53,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 595 transitions. [2018-11-28 13:10:53,955 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 595 transitions. Word has length 145 [2018-11-28 13:10:53,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:53,956 INFO L480 AbstractCegarLoop]: Abstraction has 508 states and 595 transitions. [2018-11-28 13:10:53,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:10:53,956 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 595 transitions. [2018-11-28 13:10:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-28 13:10:53,956 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:53,956 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:53,956 INFO L423 AbstractCegarLoop]: === Iteration 69 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:53,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -851821139, now seen corresponding path program 1 times [2018-11-28 13:10:53,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:53,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:53,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:53,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2018-11-28 13:10:54,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:54,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:10:54,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:54,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:54,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:54,094 INFO L87 Difference]: Start difference. First operand 508 states and 595 transitions. Second operand 6 states. [2018-11-28 13:10:54,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:54,154 INFO L93 Difference]: Finished difference Result 538 states and 624 transitions. [2018-11-28 13:10:54,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:10:54,154 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2018-11-28 13:10:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:54,155 INFO L225 Difference]: With dead ends: 538 [2018-11-28 13:10:54,155 INFO L226 Difference]: Without dead ends: 416 [2018-11-28 13:10:54,155 INFO L631 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-11-28 13:10:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-11-28 13:10:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 312. [2018-11-28 13:10:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-11-28 13:10:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 347 transitions. [2018-11-28 13:10:54,174 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 347 transitions. Word has length 144 [2018-11-28 13:10:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:54,174 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 347 transitions. [2018-11-28 13:10:54,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:54,174 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 347 transitions. [2018-11-28 13:10:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-11-28 13:10:54,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:54,175 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:54,175 INFO L423 AbstractCegarLoop]: === Iteration 70 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:54,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:54,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1109185383, now seen corresponding path program 1 times [2018-11-28 13:10:54,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:54,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:54,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:54,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:54,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:10:54,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:10:54,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:10:54,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:54,293 INFO L87 Difference]: Start difference. First operand 312 states and 347 transitions. Second operand 3 states. [2018-11-28 13:10:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:56,419 INFO L93 Difference]: Finished difference Result 397 states and 444 transitions. [2018-11-28 13:10:56,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:10:56,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2018-11-28 13:10:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:56,421 INFO L225 Difference]: With dead ends: 397 [2018-11-28 13:10:56,421 INFO L226 Difference]: Without dead ends: 331 [2018-11-28 13:10:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:10:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-28 13:10:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 310. [2018-11-28 13:10:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-11-28 13:10:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 344 transitions. [2018-11-28 13:10:56,441 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 344 transitions. Word has length 166 [2018-11-28 13:10:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:56,441 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 344 transitions. [2018-11-28 13:10:56,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:10:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 344 transitions. [2018-11-28 13:10:56,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-28 13:10:56,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:56,442 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:56,442 INFO L423 AbstractCegarLoop]: === Iteration 71 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:56,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 223751366, now seen corresponding path program 1 times [2018-11-28 13:10:56,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:56,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:56,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:56,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:56,577 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:56,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:56,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:56,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:56,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:56,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:56,578 INFO L87 Difference]: Start difference. First operand 310 states and 344 transitions. Second operand 5 states. [2018-11-28 13:10:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:58,671 INFO L93 Difference]: Finished difference Result 362 states and 398 transitions. [2018-11-28 13:10:58,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:10:58,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-11-28 13:10:58,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:58,672 INFO L225 Difference]: With dead ends: 362 [2018-11-28 13:10:58,672 INFO L226 Difference]: Without dead ends: 316 [2018-11-28 13:10:58,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-28 13:10:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-11-28 13:10:58,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 13:10:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 348 transitions. [2018-11-28 13:10:58,693 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 348 transitions. Word has length 169 [2018-11-28 13:10:58,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:58,693 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 348 transitions. [2018-11-28 13:10:58,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:10:58,693 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 348 transitions. [2018-11-28 13:10:58,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-28 13:10:58,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:58,694 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:58,694 INFO L423 AbstractCegarLoop]: === Iteration 72 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:58,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1312684313, now seen corresponding path program 1 times [2018-11-28 13:10:58,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:10:58,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:10:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:58,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:10:58,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:10:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-28 13:10:58,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:10:58,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:10:58,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:10:58,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:10:58,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:10:58,870 INFO L87 Difference]: Start difference. First operand 314 states and 348 transitions. Second operand 5 states. [2018-11-28 13:11:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:00,985 INFO L93 Difference]: Finished difference Result 424 states and 474 transitions. [2018-11-28 13:11:00,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:11:00,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2018-11-28 13:11:00,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:00,986 INFO L225 Difference]: With dead ends: 424 [2018-11-28 13:11:00,986 INFO L226 Difference]: Without dead ends: 314 [2018-11-28 13:11:00,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:11:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-11-28 13:11:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-11-28 13:11:01,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 13:11:01,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 347 transitions. [2018-11-28 13:11:01,007 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 347 transitions. Word has length 169 [2018-11-28 13:11:01,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:01,007 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 347 transitions. [2018-11-28 13:11:01,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:11:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 347 transitions. [2018-11-28 13:11:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-28 13:11:01,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:01,008 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:01,008 INFO L423 AbstractCegarLoop]: === Iteration 73 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:01,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:01,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1908184540, now seen corresponding path program 1 times [2018-11-28 13:11:01,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:01,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-11-28 13:11:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:11:01,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:11:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:11:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:11:01,233 INFO L87 Difference]: Start difference. First operand 314 states and 347 transitions. Second operand 11 states. [2018-11-28 13:11:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:05,201 INFO L93 Difference]: Finished difference Result 365 states and 409 transitions. [2018-11-28 13:11:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:11:05,201 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 198 [2018-11-28 13:11:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:05,202 INFO L225 Difference]: With dead ends: 365 [2018-11-28 13:11:05,202 INFO L226 Difference]: Without dead ends: 322 [2018-11-28 13:11:05,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:11:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-11-28 13:11:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2018-11-28 13:11:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-11-28 13:11:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 346 transitions. [2018-11-28 13:11:05,221 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 346 transitions. Word has length 198 [2018-11-28 13:11:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:05,221 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 346 transitions. [2018-11-28 13:11:05,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:11:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 346 transitions. [2018-11-28 13:11:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-28 13:11:05,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:05,222 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:05,222 INFO L423 AbstractCegarLoop]: === Iteration 74 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:05,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:05,222 INFO L82 PathProgramCache]: Analyzing trace with hash -699544854, now seen corresponding path program 1 times [2018-11-28 13:11:05,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:05,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-11-28 13:11:07,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:11:07,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:11:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:07,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:11:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2018-11-28 13:11:07,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-28 13:11:07,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-28 13:11:07,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-11-28 13:11:07,941 INFO L87 Difference]: Start difference. First operand 314 states and 346 transitions. Second operand 19 states. [2018-11-28 13:11:10,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:10,631 INFO L93 Difference]: Finished difference Result 622 states and 694 transitions. [2018-11-28 13:11:10,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-28 13:11:10,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 201 [2018-11-28 13:11:10,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:10,632 INFO L225 Difference]: With dead ends: 622 [2018-11-28 13:11:10,632 INFO L226 Difference]: Without dead ends: 310 [2018-11-28 13:11:10,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:11:10,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-28 13:11:10,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 296. [2018-11-28 13:11:10,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-28 13:11:10,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2018-11-28 13:11:10,650 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 201 [2018-11-28 13:11:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:10,651 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2018-11-28 13:11:10,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-28 13:11:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2018-11-28 13:11:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-28 13:11:10,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:10,651 INFO L402 BasicCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:10,651 INFO L423 AbstractCegarLoop]: === Iteration 75 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:10,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1977403217, now seen corresponding path program 1 times [2018-11-28 13:11:10,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:10,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:10,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-28 13:11:10,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:11:10,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:11:10,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:11,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-28 13:11:11,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:11,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2018-11-28 13:11:11,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:11:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:11:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:11:11,416 INFO L87 Difference]: Start difference. First operand 296 states and 321 transitions. Second operand 20 states. [2018-11-28 13:11:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:14,085 INFO L93 Difference]: Finished difference Result 590 states and 650 transitions. [2018-11-28 13:11:14,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:11:14,086 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 205 [2018-11-28 13:11:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:14,086 INFO L225 Difference]: With dead ends: 590 [2018-11-28 13:11:14,086 INFO L226 Difference]: Without dead ends: 316 [2018-11-28 13:11:14,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:11:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-11-28 13:11:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 301. [2018-11-28 13:11:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-11-28 13:11:14,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 326 transitions. [2018-11-28 13:11:14,104 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 326 transitions. Word has length 205 [2018-11-28 13:11:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:14,104 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 326 transitions. [2018-11-28 13:11:14,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:11:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 326 transitions. [2018-11-28 13:11:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-28 13:11:14,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:14,105 INFO L402 BasicCegarLoop]: trace histogram [7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:14,105 INFO L423 AbstractCegarLoop]: === Iteration 76 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:14,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash -2046260463, now seen corresponding path program 1 times [2018-11-28 13:11:14,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:11:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:11:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:14,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:11:14,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:11:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-28 13:11:14,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:11:14,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-28 13:11:14,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-28 13:11:14,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 13:11:14,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:11:14,406 INFO L87 Difference]: Start difference. First operand 301 states and 326 transitions. Second operand 11 states. [2018-11-28 13:11:16,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:16,549 INFO L93 Difference]: Finished difference Result 310 states and 338 transitions. [2018-11-28 13:11:16,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:11:16,550 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 206 [2018-11-28 13:11:16,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:16,550 INFO L225 Difference]: With dead ends: 310 [2018-11-28 13:11:16,550 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:11:16,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-28 13:11:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:11:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:11:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:11:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:11:16,552 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-11-28 13:11:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:16,552 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:11:16,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-28 13:11:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:11:16,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:11:16,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:11:16,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,863 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,924 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,979 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,996 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,998 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:16,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,002 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,144 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,790 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,791 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,896 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,909 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,911 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,985 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:17,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,148 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,159 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,160 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,161 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,180 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,191 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,231 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,244 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,274 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,295 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,360 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,374 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,481 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,520 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,638 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,770 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,776 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,852 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,864 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,876 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,877 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,882 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,899 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,901 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:18,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,128 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,202 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,207 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,217 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,253 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,343 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,346 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,350 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,361 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,532 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,538 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,566 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,591 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,596 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,612 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,637 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,650 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,652 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,702 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,703 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,708 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,716 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,718 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,724 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,753 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,755 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,756 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,857 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,879 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:19,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,232 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,286 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,291 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,293 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 13:11:20,753 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2018-11-28 13:11:21,162 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 45 [2018-11-28 13:11:21,288 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 46 [2018-11-28 13:11:21,648 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2018-11-28 13:11:22,077 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 98 [2018-11-28 13:11:22,873 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-28 13:11:23,479 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2018-11-28 13:11:23,743 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 44 [2018-11-28 13:11:23,976 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2018-11-28 13:11:24,294 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 99 [2018-11-28 13:11:24,856 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-28 13:11:25,121 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2018-11-28 13:11:25,762 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2018-11-28 13:11:26,195 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 42 [2018-11-28 13:11:26,346 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 39 [2018-11-28 13:11:26,607 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 42 [2018-11-28 13:11:27,259 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-28 13:11:27,519 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-28 13:11:28,018 WARN L180 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 76 [2018-11-28 13:11:28,183 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 49 [2018-11-28 13:11:28,346 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-28 13:11:28,525 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 43 [2018-11-28 13:11:28,848 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2018-11-28 13:11:29,249 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 50 [2018-11-28 13:11:29,594 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 1 [2018-11-28 13:11:30,249 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-28 13:11:30,796 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 57 [2018-11-28 13:11:31,107 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2018-11-28 13:11:31,413 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 98 [2018-11-28 13:11:31,703 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 27 [2018-11-28 13:11:32,211 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 100 [2018-11-28 13:11:32,753 WARN L180 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 60 [2018-11-28 13:11:33,392 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2018-11-28 13:11:33,804 WARN L180 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 59 [2018-11-28 13:11:34,425 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 1 [2018-11-28 13:11:35,046 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 49 [2018-11-28 13:11:35,369 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 49 [2018-11-28 13:11:36,138 WARN L180 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 75 [2018-11-28 13:11:36,513 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 33 [2018-11-28 13:11:37,005 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 44 [2018-11-28 13:11:37,671 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 43 [2018-11-28 13:11:37,955 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 50 [2018-11-28 13:11:38,199 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 43 [2018-11-28 13:11:38,413 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2018-11-28 13:11:39,005 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 50 [2018-11-28 13:11:39,662 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 57 [2018-11-28 13:11:40,046 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 49 [2018-11-28 13:11:40,267 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationFINAL(lines 7527 7536) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L451 ceAbstractionStarter]: At program point IoGetConfigurationInformationENTRY(lines 7527 7536) the Hoare annotation is: true [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point IoGetConfigurationInformationEXIT(lines 7527 7536) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point IoRegisterDeviceInterfaceEXIT(lines 7593 7616) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point L7611(lines 7593 7616) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L451 ceAbstractionStarter]: At program point IoRegisterDeviceInterfaceENTRY(lines 7593 7616) the Hoare annotation is: true [2018-11-28 13:11:40,756 INFO L451 ceAbstractionStarter]: At program point L7604(lines 7603 7613) the Hoare annotation is: true [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point L7600(lines 7600 7614) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L451 ceAbstractionStarter]: At program point L7601(lines 7600 7614) the Hoare annotation is: true [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7605 7612) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7605 7612) no Hoare annotation was computed. [2018-11-28 13:11:40,756 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 2118 2139) no Hoare annotation was computed. [2018-11-28 13:11:40,757 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 2118 2139) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~SKIP1~0 ~s~0)) (not (= ~myStatus~0 0)) (not (= ~PagingReferenceCount~0 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,757 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 2118 2139) no Hoare annotation was computed. [2018-11-28 13:11:40,757 INFO L444 ceAbstractionStarter]: At program point L6931(line 6931) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,757 INFO L448 ceAbstractionStarter]: For program point L6927(lines 6927 6970) no Hoare annotation was computed. [2018-11-28 13:11:40,757 INFO L448 ceAbstractionStarter]: For program point FloppyProcessQueuedRequestsEXIT(lines 6890 7003) no Hoare annotation was computed. [2018-11-28 13:11:40,757 INFO L448 ceAbstractionStarter]: For program point L6915-1(line 6915) no Hoare annotation was computed. [2018-11-28 13:11:40,757 INFO L444 ceAbstractionStarter]: At program point L6915(line 6915) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,757 INFO L444 ceAbstractionStarter]: At program point L6944(lines 6943 6966) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,757 INFO L448 ceAbstractionStarter]: For program point L6940(lines 6940 6967) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point L6903(line 6903) the Hoare annotation is: (let ((.cse7 (= ~SKIP1~0 ~NP~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse9 (= ~SKIP1~0 ~MPR1~0)) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (= ~NP~0 ~MPR3~0)) (.cse13 (not (= 0 |old(~pended~0)|)))) (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (.cse2 (not (= ~compRegistered~0 1))) (.cse12 (= ~IPC~0 ~MPR3~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (let ((.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) (.cse5 (or .cse0 .cse1 .cse2 .cse12 .cse4)) (.cse6 (= ~NP~0 ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (= 1 ~setEventCalled~0)) (or .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 (not (= ~compRegistered~0 0)) .cse3 .cse13 .cse4) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 (not (= ~customIrp~0 0))))))) [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point L6961(line 6961) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point $Ultimate##24(lines 6945 6965) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point $Ultimate##23(lines 6945 6965) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point L6949-1(line 6949) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point L6949(line 6949) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point L6974(lines 6902 6995) the Hoare annotation is: (let ((.cse7 (= ~SKIP1~0 ~NP~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse9 (= ~SKIP1~0 ~MPR1~0)) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (= ~NP~0 ~MPR3~0)) (.cse13 (not (= 0 |old(~pended~0)|)))) (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (.cse2 (not (= ~compRegistered~0 1))) (.cse12 (= ~IPC~0 ~MPR3~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (let ((.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) (.cse5 (or .cse0 .cse1 .cse2 .cse12 .cse4)) (.cse6 (= ~NP~0 ~MPR1~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (= 1 ~setEventCalled~0)) (or .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 (not (= ~compRegistered~0 0)) .cse3 .cse13 .cse4) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 (not (= ~customIrp~0 0))))))) [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point L6908-1(lines 6908 6912) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point L6908(lines 6908 6912) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point L6941(lines 6940 6967) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,758 INFO L448 ceAbstractionStarter]: For program point L6937(lines 6937 6968) no Hoare annotation was computed. [2018-11-28 13:11:40,758 INFO L444 ceAbstractionStarter]: At program point FloppyProcessQueuedRequestsENTRY(lines 6890 7003) the Hoare annotation is: (let ((.cse7 (= ~SKIP1~0 ~NP~0)) (.cse8 (= ~DC~0 ~IPC~0)) (.cse9 (= ~SKIP1~0 ~MPR1~0)) (.cse10 (not (= |old(~s~0)| ~NP~0))) (.cse11 (= ~NP~0 ~MPR3~0)) (.cse13 (not (= 0 |old(~pended~0)|)))) (let ((.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse1 (or .cse7 .cse8 .cse9 .cse10 .cse11 .cse13)) (.cse2 (not (= ~compRegistered~0 1))) (.cse12 (= ~IPC~0 ~MPR3~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (let ((.cse5 (or .cse0 .cse1 .cse2 .cse12 .cse4)) (.cse6 (= ~NP~0 ~MPR1~0)) (.cse3 (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= |old(~setEventCalled~0)| 1)) .cse5 .cse6 (= 1 ~setEventCalled~0)) (or (= 0 ~myStatus~0) (not (= |old(~myStatus~0)| 0)) .cse5 .cse6 (not (= ~customIrp~0 0))) (or .cse3 .cse7 .cse8 .cse9 .cse10 .cse0 .cse11 .cse12 (not (= ~compRegistered~0 0)) .cse13 .cse4))))) [2018-11-28 13:11:40,759 INFO L444 ceAbstractionStarter]: At program point L6954(line 6954) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6954-1(line 6954) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6917-2(lines 6902 6995) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6979(lines 6979 6985) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6917(lines 6917 6922) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L444 ceAbstractionStarter]: At program point L6938(lines 6934 6969) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6934(lines 6934 6969) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L6905(lines 6905 6906) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L444 ceAbstractionStarter]: At program point L6996(lines 6890 7003) the Hoare annotation is: (let ((.cse3 (= ~SKIP1~0 ~NP~0)) (.cse4 (= ~DC~0 ~IPC~0)) (.cse5 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= |old(~s~0)| ~NP~0))) (.cse8 (= ~NP~0 ~MPR3~0)) (.cse12 (not (= 0 |old(~pended~0)|)))) (let ((.cse7 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse18 (or .cse3 .cse4 .cse5 .cse6 .cse8 .cse12)) (.cse19 (not (= ~compRegistered~0 1))) (.cse11 (= ~IPC~0 ~MPR3~0)) (.cse13 (= ~SKIP2~0 ~DC~0)) (.cse9 (= ~NP~0 ~s~0)) (.cse10 (= ~pended~0 1))) (let ((.cse15 (= FloppyProcessQueuedRequests_~headOfList~0.offset 0)) (.cse16 (= FloppyProcessQueuedRequests_~headOfList~0.base 0)) (.cse17 (= ~PagingReferenceCount~0 1)) (.cse14 (= 0 ~pended~0)) (.cse0 (and (not .cse13) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~IPC~0 ~DC~0)) (= ~s~0 |old(~s~0)|) .cse9 .cse10 (not (= ~MPR3~0 ~NP~0)) (not .cse3))) (.cse1 (or .cse7 .cse18 .cse19 .cse11 .cse13)) (.cse2 (= ~NP~0 ~MPR1~0))) (and (or (not (= |old(~setEventCalled~0)| 1)) .cse0 (= 1 ~setEventCalled~0) .cse1 .cse2) (or .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (and .cse9 .cse10) .cse11 (not (= ~compRegistered~0 0)) .cse12 .cse13 (and .cse14 .cse15 .cse9 .cse16 .cse17)) (or .cse0 .cse1 .cse2 (and .cse15 .cse16 .cse17)) (or (and .cse14 .cse9) .cse0 .cse7 .cse18 .cse19 .cse13) (or .cse0 (not (= |old(~myStatus~0)| 0)) .cse1 (= 0 ~myStatus~0) .cse2 (not (= ~customIrp~0 0))))))) [2018-11-28 13:11:40,759 INFO L444 ceAbstractionStarter]: At program point L6926(lines 6902 6995) the Hoare annotation is: (let ((.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse0 (not (= |old(~PagingReferenceCount~0)| 1))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (not (= ~compRegistered~0 1)) .cse7) (or .cse1 .cse2 .cse3 .cse4 .cse0 .cse5 (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) .cse6 .cse7))) [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L3896(lines 3896 3906) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L451 ceAbstractionStarter]: At program point L3830(line 3830) the Hoare annotation is: true [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L3830-1(line 3830) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteFINAL(lines 3815 3909) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L451 ceAbstractionStarter]: At program point FloppyReadWriteENTRY(lines 3815 3909) the Hoare annotation is: true [2018-11-28 13:11:40,759 INFO L448 ceAbstractionStarter]: For program point L3843(lines 3843 3859) no Hoare annotation was computed. [2018-11-28 13:11:40,759 INFO L451 ceAbstractionStarter]: At program point L3844(lines 3840 3860) the Hoare annotation is: true [2018-11-28 13:11:40,759 INFO L451 ceAbstractionStarter]: At program point L3877(lines 3861 3895) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3840(lines 3840 3860) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L3902(line 3902) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3865(lines 3865 3874) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3828(lines 3828 3836) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3861(lines 3861 3895) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point FloppyReadWriteEXIT(lines 3815 3909) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L3882(line 3882) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3878(lines 3878 3894) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3845(lines 3845 3849) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3878-1(lines 3820 3908) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3845-2(lines 3845 3849) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L3866(lines 3862 3875) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3862(lines 3862 3875) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3891-1(line 3891) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L3891(line 3891) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L3854(line 3854) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L3854-1(line 3854) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L7642(lines 7627 7647) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L7635(lines 7634 7644) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point IoSetDeviceInterfaceStateEXIT(lines 7627 7647) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point L7631(lines 7631 7645) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point L7632(lines 7631 7645) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L451 ceAbstractionStarter]: At program point IoSetDeviceInterfaceStateENTRY(lines 7627 7647) the Hoare annotation is: true [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7636 7643) no Hoare annotation was computed. [2018-11-28 13:11:40,760 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7636 7643) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3322(lines 3322 3328) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3355(lines 3355 3368) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3322-2(lines 3322 3328) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L444 ceAbstractionStarter]: At program point L3223(lines 3222 3498) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3405(lines 3405 3411) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3240(lines 3240 3492) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L444 ceAbstractionStarter]: At program point L3241(lines 3240 3492) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,761 INFO L444 ceAbstractionStarter]: At program point L3489(lines 3245 3490) the Hoare annotation is: (let ((.cse1 (= ~pended~0 1)) (.cse2 (= ~s~0 ~SKIP2~0)) (.cse4 (= 0 ~compRegistered~0)) (.cse3 (= 0 ~pended~0)) (.cse0 (= ~s~0 ~DC~0))) (or (and .cse0 .cse1) (and .cse2 (= ~compRegistered~0 0) .cse1) (and .cse2 .cse3 .cse4 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= FloppyPnp_~ntStatus~3 259)) (or (and .cse3 .cse4 .cse0) (and (= ~compRegistered~0 1) .cse3 .cse0))))) [2018-11-28 13:11:40,761 INFO L444 ceAbstractionStarter]: At program point L3357(line 3357) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3225(lines 3225 3497) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L444 ceAbstractionStarter]: At program point L3308(line 3308) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~s~0))) (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= |old(~customIrp~0)| ~customIrp~0) (<= FloppyPnp_~ntStatus~3 259) (<= 259 FloppyPnp_~ntStatus~3) .cse0) (and (= ~compRegistered~0 0) (= ~pended~0 1) .cse0) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3308-1(line 3308) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3457(lines 3457 3465) no Hoare annotation was computed. [2018-11-28 13:11:40,761 INFO L448 ceAbstractionStarter]: For program point L3391-1(line 3391) no Hoare annotation was computed. [2018-11-28 13:11:40,762 INFO L444 ceAbstractionStarter]: At program point L3391(line 3391) the Hoare annotation is: (or (and (= ~compRegistered~0 1) (= 0 ~pended~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,762 INFO L444 ceAbstractionStarter]: At program point L3457-2(lines 3457 3465) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 (= ~compRegistered~0 0) (= ~pended~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,762 INFO L448 ceAbstractionStarter]: For program point L3441-1(line 3441) no Hoare annotation was computed. [2018-11-28 13:11:40,762 INFO L444 ceAbstractionStarter]: At program point L3441(line 3441) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~s~0))) (or (and (= ~compRegistered~0 0) (= ~pended~0 1) .cse0) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~PagingReferenceCount~0 1) .cse0) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,762 INFO L444 ceAbstractionStarter]: At program point L3342(line 3342) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,762 INFO L448 ceAbstractionStarter]: For program point L3342-1(line 3342) no Hoare annotation was computed. [2018-11-28 13:11:40,762 INFO L448 ceAbstractionStarter]: For program point L3260(lines 3260 3276) no Hoare annotation was computed. [2018-11-28 13:11:40,762 INFO L448 ceAbstractionStarter]: For program point L3409-1(lines 3405 3411) no Hoare annotation was computed. [2018-11-28 13:11:40,762 INFO L444 ceAbstractionStarter]: At program point L3409(line 3409) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,763 INFO L444 ceAbstractionStarter]: At program point L3244(lines 3243 3491) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3211(lines 3211 3221) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3459-1(line 3459) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L444 ceAbstractionStarter]: At program point L3459(line 3459) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 (= ~compRegistered~0 0) (= ~pended~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3360(lines 3360 3367) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3360-1(lines 3355 3368) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3228(lines 3228 3496) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3261(lines 3261 3267) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3443(lines 3443 3452) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L448 ceAbstractionStarter]: For program point L3377-1(line 3377) no Hoare annotation was computed. [2018-11-28 13:11:40,763 INFO L444 ceAbstractionStarter]: At program point L3377(line 3377) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= ~compRegistered~0 1) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,764 INFO L448 ceAbstractionStarter]: For program point L3443-2(lines 3443 3452) no Hoare annotation was computed. [2018-11-28 13:11:40,764 INFO L448 ceAbstractionStarter]: For program point L3427-1(lines 3245 3488) no Hoare annotation was computed. [2018-11-28 13:11:40,764 INFO L444 ceAbstractionStarter]: At program point L3427(line 3427) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,764 INFO L448 ceAbstractionStarter]: For program point FloppyPnpEXIT(lines 3181 3515) no Hoare annotation was computed. [2018-11-28 13:11:40,764 INFO L444 ceAbstractionStarter]: At program point L3229(lines 3225 3497) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,764 INFO L444 ceAbstractionStarter]: At program point L3362(line 3362) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,764 INFO L444 ceAbstractionStarter]: At program point L3395(line 3395) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (and .cse0 (= ~pended~0 1)) (and (= ~compRegistered~0 1) (= 0 ~pended~0) (not (= FloppyPnp_~ntStatus~3 259)) .cse0) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,764 INFO L448 ceAbstractionStarter]: For program point L3329(lines 3329 3397) no Hoare annotation was computed. [2018-11-28 13:11:40,764 INFO L448 ceAbstractionStarter]: For program point L3445-1(lines 3445 3446) no Hoare annotation was computed. [2018-11-28 13:11:40,764 INFO L444 ceAbstractionStarter]: At program point L3445(lines 3445 3446) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~SKIP2~0))) (or (and .cse0 (= ~compRegistered~0 0) (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse0 (= ~lowerDriverReturn~0 FloppyPnp_~ntStatus~3) (= ~PagingReferenceCount~0 1)))) [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3379(lines 3379 3386) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point FloppyPnpFINAL(lines 3181 3515) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3379-2(lines 3379 3386) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3231(lines 3231 3495) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3248(line 3248) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3281-1(line 3281) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L444 ceAbstractionStarter]: At program point L3281(line 3281) the Hoare annotation is: (or (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3298(lines 3298 3304) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3265-1(lines 3261 3267) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L444 ceAbstractionStarter]: At program point L3265(line 3265) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3199(lines 3199 3205) no Hoare annotation was computed. [2018-11-28 13:11:40,765 INFO L448 ceAbstractionStarter]: For program point L3199-2(lines 3199 3205) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L444 ceAbstractionStarter]: At program point L3480(line 3480) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point L3480-1(lines 3476 3482) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point L3381-1(line 3381) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L444 ceAbstractionStarter]: At program point L3381(line 3381) the Hoare annotation is: (let ((.cse7 (= 0 ~pended~0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (= 0 ~myStatus~0)) (.cse2 (= 1 ~setEventCalled~0)) (.cse3 (= ~PagingReferenceCount~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (<= FloppyPnp_~ntStatus~3 259)) (.cse6 (<= 259 FloppyPnp_~ntStatus~3))) (or (and .cse0 .cse1 (= ~MPR3~0 ~s~0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse7 .cse0 .cse1 (= ~NP~0 ~s~0) .cse2 .cse3 .cse4 .cse5 .cse6) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,766 INFO L444 ceAbstractionStarter]: At program point L3216(line 3216) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~compRegistered~0 0) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point L3216-1(line 3216) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point $Ultimate##21(lines 3245 3490) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point $Ultimate##20(lines 3245 3490) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point L3332(lines 3332 3338) no Hoare annotation was computed. [2018-11-28 13:11:40,766 INFO L448 ceAbstractionStarter]: For program point L3415-1(line 3415) no Hoare annotation was computed. [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3415(line 3415) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3316(line 3316) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (and (= ~compRegistered~0 0) .cse0 (= ~pended~0 1)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) .cse0) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,767 INFO L448 ceAbstractionStarter]: For program point L3283(lines 3283 3318) no Hoare annotation was computed. [2018-11-28 13:11:40,767 INFO L448 ceAbstractionStarter]: For program point L3234(lines 3234 3494) no Hoare annotation was computed. [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3350(line 3350) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3350-1(line 3350) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,767 INFO L448 ceAbstractionStarter]: For program point L3433-1(lines 3429 3435) no Hoare annotation was computed. [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3433(line 3433) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,767 INFO L444 ceAbstractionStarter]: At program point L3235(lines 3231 3495) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 FloppyPnp_~ntStatus~3) (= 0 ~pended~0) (= 0 ~compRegistered~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3351(line 3351) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3285-1(lines 3285 3286) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L444 ceAbstractionStarter]: At program point L3285(lines 3285 3286) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (and (= ~compRegistered~0 0) .cse0 (= ~pended~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) .cse0 (= |old(~customIrp~0)| ~customIrp~0) (<= FloppyPnp_~ntStatus~3 259) (<= 259 FloppyPnp_~ntStatus~3)))) [2018-11-28 13:11:40,768 INFO L444 ceAbstractionStarter]: At program point L3302(line 3302) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3302-1(lines 3298 3304) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3253(lines 3253 3259) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3253-2(lines 3253 3259) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L444 ceAbstractionStarter]: At program point L3336(line 3336) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3336-1(lines 3332 3338) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3237(lines 3237 3493) no Hoare annotation was computed. [2018-11-28 13:11:40,768 INFO L448 ceAbstractionStarter]: For program point L3469(line 3469) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L444 ceAbstractionStarter]: At program point L3238(lines 3237 3493) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~NP~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3271-1(line 3271) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L444 ceAbstractionStarter]: At program point L3271(line 3271) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~SKIP1~0 ~s~0))) [2018-11-28 13:11:40,769 INFO L444 ceAbstractionStarter]: At program point L3486(line 3486) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= FloppyPnp_~ntStatus~3 259)) (= ~SKIP1~0 ~s~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3486-1(line 3486) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3288(lines 3288 3294) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3222(lines 3222 3498) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3288-2(lines 3288 3294) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3503(lines 3503 3509) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L448 ceAbstractionStarter]: For program point L3503-2(lines 3503 3509) no Hoare annotation was computed. [2018-11-28 13:11:40,769 INFO L444 ceAbstractionStarter]: At program point FloppyPnpENTRY(lines 3181 3515) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (= ~PagingReferenceCount~0 0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,770 INFO L448 ceAbstractionStarter]: For program point L7104(line 7104) no Hoare annotation was computed. [2018-11-28 13:11:40,770 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 7041 7217) no Hoare annotation was computed. [2018-11-28 13:11:40,770 INFO L448 ceAbstractionStarter]: For program point L7096(lines 7096 7133) no Hoare annotation was computed. [2018-11-28 13:11:40,770 INFO L444 ceAbstractionStarter]: At program point L7088(lines 7087 7136) the Hoare annotation is: (or (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,770 INFO L448 ceAbstractionStarter]: For program point L7171(lines 7171 7181) no Hoare annotation was computed. [2018-11-28 13:11:40,770 INFO L444 ceAbstractionStarter]: At program point L7130(lines 7060 7145) the Hoare annotation is: (let ((.cse9 (= ~s~0 ~DC~0))) (let ((.cse0 (not .cse9)) (.cse3 (= ~s~0 ~SKIP2~0)) (.cse5 (= 0 ~pended~0)) (.cse8 (not (= ~SKIP2~0 ~s~0))) (.cse10 (not (= ~IPC~0 ~s~0))) (.cse1 (not (= ~MPR1~0 ~SKIP1~0))) (.cse2 (not (= ~IPC~0 ~DC~0))) (.cse4 (= ~compRegistered~0 0)) (.cse11 (= ~pended~0 1)) (.cse6 (not (= ~MPR3~0 ~NP~0))) (.cse7 (not (= ~SKIP1~0 ~NP~0)))) (or (and (= main_~status~4 ~lowerDriverReturn~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse1 .cse5 .cse8 .cse9 .cse10 .cse6 .cse7) (and .cse1 .cse5 (= 0 ~compRegistered~0) .cse8 .cse9 .cse10 .cse6 .cse7)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse8 (= 0 main_~status~4) .cse9 .cse10 .cse6) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse6 .cse7) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse5 .cse8 .cse9 .cse10 .cse6 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse5 .cse8 .cse9 .cse10 .cse6) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (and (not (= ~SKIP2~0 ~DC~0)) .cse1 .cse2 .cse4 (= ~NP~0 ~s~0) .cse11 .cse6 .cse7)))) [2018-11-28 13:11:40,770 INFO L444 ceAbstractionStarter]: At program point L7163(lines 7156 7212) the Hoare annotation is: (let ((.cse1 (not (= ~SKIP2~0 ~s~0))) (.cse3 (not (= ~IPC~0 ~s~0))) (.cse4 (not (= ~MPR3~0 ~NP~0))) (.cse2 (= ~s~0 ~DC~0))) (let ((.cse6 (= ~pended~0 1)) (.cse8 (not .cse2)) (.cse9 (not (= ~IPC~0 ~DC~0))) (.cse10 (= ~s~0 ~SKIP2~0)) (.cse11 (= ~compRegistered~0 0)) (.cse5 (not (= ~MPR1~0 ~SKIP1~0))) (.cse0 (and .cse1 .cse2 .cse3 .cse4)) (.cse7 (not (= ~SKIP1~0 ~NP~0)))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse0 (= 0 (+ main_~status~4 2147483631))) (and .cse1 (= 0 main_~status~4) .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (and .cse5 .cse0 .cse6 .cse7) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse8 .cse5 .cse9 .cse10 .cse11 .cse6 .cse4 .cse7) (and (= 0 (+ main_~status~4 1073741738)) .cse0) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= main_~status~4 ~lowerDriverReturn~0) .cse8 .cse5 .cse9 .cse10 .cse11 .cse4 .cse7) (not (= |old(~s~0)| |old(~IPC~0)|)) (and (or (and .cse5 (= 0 ~compRegistered~0) .cse0 .cse7) (and (= ~compRegistered~0 1) .cse5 .cse0 .cse7)) (not (= 259 main_~status~4))) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,771 INFO L444 ceAbstractionStarter]: At program point L7097(lines 7096 7133) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~MPR1~0 ~SKIP1~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= ~compRegistered~0 0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0)) (not (= ~SKIP1~0 ~NP~0)))) [2018-11-28 13:11:40,771 INFO L444 ceAbstractionStarter]: At program point L7155(lines 7148 7213) the Hoare annotation is: (let ((.cse3 (= ~s~0 ~DC~0))) (let ((.cse7 (not .cse3)) (.cse0 (not (= ~MPR1~0 ~SKIP1~0))) (.cse8 (not (= ~IPC~0 ~DC~0))) (.cse9 (= ~s~0 ~SKIP2~0)) (.cse10 (= ~compRegistered~0 0)) (.cse11 (= ~pended~0 1)) (.cse6 (not (= ~SKIP1~0 ~NP~0))) (.cse1 (= 0 ~pended~0)) (.cse2 (not (= ~SKIP2~0 ~s~0))) (.cse4 (not (= ~IPC~0 ~s~0))) (.cse5 (not (= ~MPR3~0 ~NP~0)))) (or (not (= |old(~myStatus~0)| 0)) (= ~s~0 ~UNLOADED~0) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 (= 0 ~compRegistered~0) .cse2 .cse3 .cse4 .cse5 .cse6)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse1 .cse2 (= 0 main_~status~4) .cse3 .cse4 .cse5) (and (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse0 .cse8 .cse9 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse7 .cse0 .cse8 .cse9 .cse10 .cse11 .cse5 .cse6) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse1 .cse2 .cse3 .cse4 .cse5 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse1 .cse2 .cse3 .cse4 .cse5) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,771 INFO L448 ceAbstractionStarter]: For program point L7114(line 7114) no Hoare annotation was computed. [2018-11-28 13:11:40,771 INFO L448 ceAbstractionStarter]: For program point L7172(lines 7172 7178) no Hoare annotation was computed. [2018-11-28 13:11:40,771 INFO L448 ceAbstractionStarter]: For program point L7090(lines 7090 7135) no Hoare annotation was computed. [2018-11-28 13:11:40,771 INFO L448 ceAbstractionStarter]: For program point $Ultimate##18(lines 7101 7131) no Hoare annotation was computed. [2018-11-28 13:11:40,771 INFO L444 ceAbstractionStarter]: At program point L7057-1(line 7057) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (and (not (= ~s~0 ~DC~0)) (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~SKIP2~0 ~s~0)) (= ~s~0 ~UNLOADED~0) (= 0 main_~status~4) (not (= ~MPR3~0 ~IPC~0)) (not (= ~IPC~0 ~s~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~myStatus~0) (not (= ~MPR3~0 ~s~0)) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,772 INFO L444 ceAbstractionStarter]: At program point L7057(line 7057) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= |old(~s~0)| ~s~0) (= 0 main_~status~4) (= ~NP~0 ~MPR1~0) (= ~s~0 ~DC~0) (= ~s~0 ~SKIP1~0) (= ~IPC~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,772 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 7041 7217) no Hoare annotation was computed. [2018-11-28 13:11:40,772 INFO L448 ceAbstractionStarter]: For program point $Ultimate##19(lines 7101 7131) no Hoare annotation was computed. [2018-11-28 13:11:40,772 INFO L444 ceAbstractionStarter]: At program point L7140(line 7140) the Hoare annotation is: (let ((.cse9 (= ~s~0 ~DC~0))) (let ((.cse0 (not .cse9)) (.cse3 (= ~s~0 ~SKIP2~0)) (.cse5 (= 0 ~pended~0)) (.cse8 (not (= ~SKIP2~0 ~s~0))) (.cse10 (not (= ~IPC~0 ~s~0))) (.cse1 (not (= ~MPR1~0 ~SKIP1~0))) (.cse2 (not (= ~IPC~0 ~DC~0))) (.cse4 (= ~compRegistered~0 0)) (.cse11 (= ~pended~0 1)) (.cse6 (not (= ~MPR3~0 ~NP~0))) (.cse7 (not (= ~SKIP1~0 ~NP~0)))) (or (and (= main_~status~4 ~lowerDriverReturn~0) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (and (or (and (= ~compRegistered~0 1) .cse1 .cse5 .cse8 .cse9 .cse10 .cse6 .cse7) (and .cse1 .cse5 (= 0 ~compRegistered~0) .cse8 .cse9 .cse10 .cse6 .cse7)) (not (= 259 main_~status~4))) (not (= |old(~compRegistered~0)| 0)) (and .cse5 .cse8 (= 0 main_~status~4) .cse9 .cse10 .cse6) (and .cse1 .cse8 .cse9 .cse10 .cse11 .cse6 .cse7) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7) (not (= |old(~s~0)| |old(~NP~0)|)) (and .cse5 .cse8 .cse9 .cse10 .cse6 (= 0 (+ main_~status~4 2147483631))) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse5 .cse8 .cse9 .cse10 .cse6) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0)) (and (not (= ~SKIP2~0 ~DC~0)) .cse1 .cse2 .cse4 (= ~NP~0 ~s~0) .cse11 .cse6 .cse7)))) [2018-11-28 13:11:40,772 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 7041 7217) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~IPC~0 ~s~0) (= |old(~s~0)| ~MPR1~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~NP~0 |old(~s~0)|) (= |old(~customIrp~0)| ~customIrp~0) (= ~PagingReferenceCount~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,772 INFO L448 ceAbstractionStarter]: For program point L7058(line 7058) no Hoare annotation was computed. [2018-11-28 13:11:40,772 INFO L444 ceAbstractionStarter]: At program point L7091(lines 7090 7135) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7124(line 7124) no Hoare annotation was computed. [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7157(lines 7157 7161) no Hoare annotation was computed. [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7149(lines 7149 7153) no Hoare annotation was computed. [2018-11-28 13:11:40,773 INFO L444 ceAbstractionStarter]: At program point L7174(line 7174) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,773 INFO L451 ceAbstractionStarter]: At program point L7100(lines 7099 7132) the Hoare annotation is: true [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7191(lines 7191 7207) no Hoare annotation was computed. [2018-11-28 13:11:40,773 INFO L444 ceAbstractionStarter]: At program point L7183(lines 7170 7209) the Hoare annotation is: (let ((.cse8 (not (= ~SKIP2~0 ~DC~0))) (.cse9 (not (= ~IPC~0 ~DC~0))) (.cse10 (= ~compRegistered~0 0)) (.cse7 (not (= ~MPR1~0 ~SKIP1~0))) (.cse1 (not (= ~SKIP2~0 ~s~0))) (.cse2 (= ~s~0 ~DC~0)) (.cse3 (not (= ~IPC~0 ~s~0))) (.cse4 (not (= ~MPR3~0 ~NP~0))) (.cse11 (not (= ~SKIP1~0 ~NP~0)))) (let ((.cse0 (or (and (= main_~status~4 ~lowerDriverReturn~0) .cse7 .cse8 .cse9 .cse10 .cse4 .cse11) (and .cse7 .cse1 .cse2 .cse3 .cse4 .cse11))) (.cse6 (= ~s~0 ~SKIP2~0)) (.cse5 (= ~pended~0 1))) (or (and (or (and (= ~compRegistered~0 1) .cse0) (and (= 0 ~compRegistered~0) .cse0)) (not (= 259 main_~status~4))) (not (= |old(~myStatus~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (and .cse1 (= 0 main_~status~4) .cse2 .cse3 .cse4) (not (= |old(~s~0)| |old(~DC~0)|)) (and .cse1 .cse2 .cse3 .cse4 (= 0 (+ main_~status~4 2147483631))) (not (= |old(~compRegistered~0)| 0)) (and .cse0 .cse5) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (= 0 (+ main_~status~4 1073741738)) .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse0) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= 0 |old(~pended~0)|)) (and .cse7 .cse8 .cse9 .cse6 .cse10 .cse5 .cse4 .cse11) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7084(lines 7084 7137) no Hoare annotation was computed. [2018-11-28 13:11:40,773 INFO L448 ceAbstractionStarter]: For program point L7109(line 7109) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7167(lines 7167 7210) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7200-1(lines 7148 7213) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7200(lines 7200 7206) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7192(lines 7192 7198) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7060-1(lines 7053 7216) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7060(lines 7060 7147) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7093(lines 7093 7134) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L444 ceAbstractionStarter]: At program point L7085(lines 7084 7137) the Hoare annotation is: (or (and (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= 0 ~pended~0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~NP~0))) (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7077(lines 7060 7145) no Hoare annotation was computed. [2018-11-28 13:11:40,774 INFO L444 ceAbstractionStarter]: At program point L7094(lines 7093 7134) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,774 INFO L448 ceAbstractionStarter]: For program point L7119(line 7119) no Hoare annotation was computed. [2018-11-28 13:11:40,775 INFO L448 ceAbstractionStarter]: For program point L7185(lines 7185 7189) no Hoare annotation was computed. [2018-11-28 13:11:40,775 INFO L444 ceAbstractionStarter]: At program point L7202(line 7202) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,775 INFO L448 ceAbstractionStarter]: For program point L7070(lines 7070 7075) no Hoare annotation was computed. [2018-11-28 13:11:40,775 INFO L444 ceAbstractionStarter]: At program point L7194(line 7194) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,775 INFO L444 ceAbstractionStarter]: At program point L7070-2(lines 7070 7075) the Hoare annotation is: (or (not (= |old(~myStatus~0)| 0)) (not (= |old(~PagingReferenceCount~0)| 0)) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (not (= |old(~SKIP2~0)| |old(~s~0)|)) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~UNLOADED~0)| |old(~s~0)|)) (and (not (= ~MPR1~0 ~SKIP1~0)) (= 0 ~pended~0) (= 0 ~compRegistered~0) (not (= ~MPR3~0 ~IPC~0)) (not (= ~MPR1~0 ~NP~0)) (not (= ~SKIP2~0 ~DC~0)) (not (= ~IPC~0 ~DC~0)) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0) (not (= ~MPR3~0 ~NP~0)) (= ~PagingReferenceCount~0 0) (not (= ~SKIP1~0 ~NP~0))) (not (= |old(~s~0)| |old(~DC~0)|)) (not (= |old(~s~0)| |old(~NP~0)|)) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (not (= |old(~s~0)| |old(~IPC~0)|)) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,781 INFO L448 ceAbstractionStarter]: For program point L7087(lines 7087 7136) no Hoare annotation was computed. [2018-11-28 13:11:40,781 INFO L448 ceAbstractionStarter]: For program point L7170(lines 7170 7209) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedInsertTailListENTRY(lines 7273 7281) the Hoare annotation is: true [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListFINAL(lines 7273 7281) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedInsertTailListEXIT(lines 7273 7281) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseEXIT(lines 2667 2681) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point L2677-1(line 2677) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L444 ceAbstractionStarter]: At program point L2677(line 2677) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (= ~NP~0 ~s~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,782 INFO L444 ceAbstractionStarter]: At program point FloppyCreateCloseENTRY(lines 2667 2681) the Hoare annotation is: (or (= ~DC~0 ~IPC~0) (= ~NP~0 ~s~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point FloppyCreateCloseFINAL(lines 2667 2681) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point L7664-1(lines 7656 7669) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L444 ceAbstractionStarter]: At program point L7664(line 7664) the Hoare annotation is: (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0)) [2018-11-28 13:11:40,782 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 7656 7669) the Hoare annotation is: (or (or (not (= ~setEventCalled~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= 0 ~pended~0)) (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0)) (= ~NP~0 ~s~0)) [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 7656 7669) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point L8062(lines 8062 8079) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point L8021-1(line 8021) no Hoare annotation was computed. [2018-11-28 13:11:40,782 INFO L448 ceAbstractionStarter]: For program point PoCallDriverEXIT(lines 8011 8083) no Hoare annotation was computed. [2018-11-28 13:11:40,790 INFO L444 ceAbstractionStarter]: At program point L8021(line 8021) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,790 INFO L444 ceAbstractionStarter]: At program point L8038(lines 8037 8056) the Hoare annotation is: (or (= ~SKIP1~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,790 INFO L448 ceAbstractionStarter]: For program point L8071(lines 8071 8078) no Hoare annotation was computed. [2018-11-28 13:11:40,790 INFO L448 ceAbstractionStarter]: For program point L8063(lines 8063 8069) no Hoare annotation was computed. [2018-11-28 13:11:40,790 INFO L448 ceAbstractionStarter]: For program point PoCallDriverFINAL(lines 8011 8083) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point L8026(line 8026) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point PoCallDriverENTRY(lines 8011 8083) the Hoare annotation is: (or (= ~SKIP1~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point L8076-1(lines 8058 8080) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point L8076(line 8076) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point L8035(lines 8034 8057) the Hoare annotation is: (or (= ~SKIP1~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point L8019-1(lines 8018 8082) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point L8019(lines 8019 8033) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 8042 8054) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 8042 8054) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point L8024(lines 8024 8030) no Hoare annotation was computed. [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point L8053(lines 8018 8082) the Hoare annotation is: (or (= ~SKIP1~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L444 ceAbstractionStarter]: At program point L8041(lines 8040 8055) the Hoare annotation is: (or (= ~SKIP1~0 ~s~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= ~SKIP1~0 |old(~s~0)|)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,791 INFO L448 ceAbstractionStarter]: For program point L8037(lines 8037 8056) no Hoare annotation was computed. [2018-11-28 13:11:40,807 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListEXIT(lines 7284 7291) no Hoare annotation was computed. [2018-11-28 13:11:40,807 INFO L451 ceAbstractionStarter]: At program point ExfInterlockedRemoveHeadListENTRY(lines 7284 7291) the Hoare annotation is: true [2018-11-28 13:11:40,807 INFO L448 ceAbstractionStarter]: For program point ExfInterlockedRemoveHeadListFINAL(lines 7284 7291) no Hoare annotation was computed. [2018-11-28 13:11:40,807 INFO L448 ceAbstractionStarter]: For program point L3772(lines 3772 3778) no Hoare annotation was computed. [2018-11-28 13:11:40,807 INFO L444 ceAbstractionStarter]: At program point L3706(lines 3705 3796) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,807 INFO L448 ceAbstractionStarter]: For program point FloppyPowerEXIT(lines 3688 3814) no Hoare annotation was computed. [2018-11-28 13:11:40,807 INFO L444 ceAbstractionStarter]: At program point L3810(line 3810) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~s~0)) [2018-11-28 13:11:40,807 INFO L448 ceAbstractionStarter]: For program point L3810-1(line 3810) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point $Ultimate##6(lines 3713 3793) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L444 ceAbstractionStarter]: At program point FloppyPowerENTRY(lines 3688 3814) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3757(lines 3757 3767) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3757-2(lines 3757 3767) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3753(lines 3753 3784) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L444 ceAbstractionStarter]: At program point L3774(line 3774) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3708(lines 3708 3795) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3741-1(line 3741) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L444 ceAbstractionStarter]: At program point L3741(line 3741) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (= ~NP~0 ~s~0) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3774-1(line 3774) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point L3717-1(lines 3717 3726) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point $Ultimate##5(lines 3713 3793) no Hoare annotation was computed. [2018-11-28 13:11:40,808 INFO L448 ceAbstractionStarter]: For program point FloppyPowerFINAL(lines 3688 3814) no Hoare annotation was computed. [2018-11-28 13:11:40,809 INFO L444 ceAbstractionStarter]: At program point L3804(line 3804) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,815 INFO L444 ceAbstractionStarter]: At program point L3709(lines 3708 3795) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~s~0) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3771(lines 3771 3781) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3804-1(lines 3800 3806) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3705(lines 3705 3796) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3730(lines 3730 3746) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L444 ceAbstractionStarter]: At program point L3792(lines 3696 3813) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 ~pended~0)) (= ~SKIP2~0 ~DC~0) (= ~NP~0 ~s~0)) [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3718(lines 3718 3723) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L451 ceAbstractionStarter]: At program point FloppyPnpCompleteENTRY(lines 3678 3687) the Hoare annotation is: true [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteFINAL(lines 3678 3687) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point FloppyPnpCompleteEXIT(lines 3678 3687) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L3683-1(line 3683) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L451 ceAbstractionStarter]: At program point L3683(line 3683) the Hoare annotation is: true [2018-11-28 13:11:40,815 INFO L444 ceAbstractionStarter]: At program point L7866(lines 7858 7879) the Hoare annotation is: (let ((.cse13 (= |old(~customIrp~0)| ~customIrp~0)) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= ~compRegistered~0 1))) (.cse8 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~NP~0 ~MPR1~0)) (.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse12 (= ~NP~0 ~s~0)) (.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse7 (= ~NP~0 ~MPR3~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse9 (not (= 0 ~pended~0))) (.cse11 (= ~SKIP2~0 ~DC~0))) (and (or (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse12 (= 1 ~setEventCalled~0) .cse13)) (or .cse1 .cse2 (not (= 1 ~pended~0)) .cse3 .cse4 .cse7 .cse14 .cse12 .cse11) (or .cse13 (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse14 .cse9 .cse11) .cse8 .cse10 (not (= |old(~customIrp~0)| 0))) (or .cse0 .cse5 .cse6 .cse8 .cse10 (not (= |old(~s~0)| ~MPR3~0)) (or .cse3 (or .cse1 .cse2 .cse7 .cse9 .cse11))) (or .cse1 .cse2 .cse3 .cse12 .cse4 .cse7 .cse14 .cse9 .cse11))) [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 7853 7896) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L7858(lines 7858 7879) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point L7891(lines 7853 7896) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 7885 7892) no Hoare annotation was computed. [2018-11-28 13:11:40,815 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 7885 7892) no Hoare annotation was computed. [2018-11-28 13:11:40,822 INFO L444 ceAbstractionStarter]: At program point L7881(lines 7880 7894) the Hoare annotation is: (let ((.cse18 (= 0 ~pended~0)) (.cse17 (= ~compRegistered~0 1)) (.cse19 (= ~PagingReferenceCount~0 1))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not .cse19)) (.cse4 (not .cse17)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (= ~IPC~0 ~MPR3~0)) (.cse6 (= ~NP~0 ~MPR1~0)) (.cse8 (= ~SKIP1~0 ~NP~0)) (.cse9 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse10 (= ~NP~0 ~MPR3~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse11 (not .cse18)) (.cse12 (= ~SKIP2~0 ~DC~0)) (.cse0 (= ~NP~0 ~s~0))) (and (or (and .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12)))) (or .cse8 .cse9 (not (= 1 ~pended~0)) .cse7 .cse13 .cse0 .cse10 .cse14 .cse12) (let ((.cse15 (and .cse17 (and (not (= ~MPR1~0 ~SKIP1~0)) (not .cse12) (not (= ~IPC~0 ~DC~0)) .cse18 .cse0 (= ~NP~0 |old(~s~0)|) (not (= ~MPR3~0 ~NP~0)) (not .cse8)) (not (= ~MPR3~0 ~IPC~0)) .cse19)) (.cse16 (= 1 ~setEventCalled~0))) (or (and (= |old(~customIrp~0)| 1) .cse15 (= 0 ~customIrp~0) .cse16) (or .cse2 .cse8 .cse9 .cse7 .cse13 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse12) (and .cse15 .cse16 .cse1))) (or .cse1 (or .cse8 .cse9 .cse7 .cse13 .cse10 .cse14 .cse11 .cse12) .cse5 .cse6 (not (= |old(~customIrp~0)| 0))) (or .cse8 .cse9 .cse7 .cse13 .cse10 .cse14 .cse11 .cse12 .cse0)))) [2018-11-28 13:11:40,823 INFO L448 ceAbstractionStarter]: For program point L7871-1(lines 7857 7895) no Hoare annotation was computed. [2018-11-28 13:11:40,823 INFO L448 ceAbstractionStarter]: For program point L7871(lines 7871 7877) no Hoare annotation was computed. [2018-11-28 13:11:40,823 INFO L444 ceAbstractionStarter]: At program point L7873(line 7873) the Hoare annotation is: (let ((.cse4 (not (= |old(~s~0)| ~NP~0))) (.cse12 (not (= ~compRegistered~0 0))) (.cse0 (not (= |old(~setEventCalled~0)| 1))) (.cse5 (not (= ~PagingReferenceCount~0 1))) (.cse6 (not (= ~compRegistered~0 1))) (.cse8 (= ~IPC~0 ~MPR3~0)) (.cse10 (= ~NP~0 ~MPR1~0)) (.cse3 (= ~SKIP1~0 ~MPR1~0)) (.cse1 (= ~SKIP1~0 ~NP~0)) (.cse2 (= ~DC~0 ~IPC~0)) (.cse7 (= ~NP~0 ~MPR3~0)) (.cse9 (not (= 0 ~pended~0))) (.cse11 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) (or .cse1 .cse2 (not (= 1 ~pended~0)) .cse3 .cse4 .cse7 .cse12 .cse11) (or .cse1 .cse2 .cse3 .cse4 .cse7 .cse12 .cse9 .cse11) (or .cse0 .cse5 .cse6 .cse8 .cse10 (not (= |old(~s~0)| ~MPR3~0)) (or .cse3 (or .cse1 .cse2 .cse7 .cse9 .cse11))))) [2018-11-28 13:11:40,823 INFO L448 ceAbstractionStarter]: For program point L7859(lines 7859 7864) no Hoare annotation was computed. [2018-11-28 13:11:40,823 INFO L444 ceAbstractionStarter]: At program point L7884(lines 7883 7893) the Hoare annotation is: (let ((.cse18 (= 0 ~pended~0)) (.cse17 (= ~compRegistered~0 1)) (.cse19 (= ~PagingReferenceCount~0 1))) (let ((.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not .cse19)) (.cse4 (not .cse17)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse5 (= ~IPC~0 ~MPR3~0)) (.cse6 (= ~NP~0 ~MPR1~0)) (.cse8 (= ~SKIP1~0 ~NP~0)) (.cse9 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse13 (not (= |old(~s~0)| ~NP~0))) (.cse10 (= ~NP~0 ~MPR3~0)) (.cse14 (not (= ~compRegistered~0 0))) (.cse11 (not .cse18)) (.cse12 (= ~SKIP2~0 ~DC~0)) (.cse0 (= ~NP~0 ~s~0))) (and (or (and .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12)))) (or .cse8 .cse9 (not (= 1 ~pended~0)) .cse7 .cse13 .cse0 .cse10 .cse14 .cse12) (let ((.cse15 (and .cse17 (and (not (= ~MPR1~0 ~SKIP1~0)) (not .cse12) (not (= ~IPC~0 ~DC~0)) .cse18 .cse0 (= ~NP~0 |old(~s~0)|) (not (= ~MPR3~0 ~NP~0)) (not .cse8)) (not (= ~MPR3~0 ~IPC~0)) .cse19)) (.cse16 (= 1 ~setEventCalled~0))) (or (and (= |old(~customIrp~0)| 1) .cse15 (= 0 ~customIrp~0) .cse16) (or .cse2 .cse8 .cse9 .cse7 .cse13 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse12) (and .cse15 .cse16 .cse1))) (or .cse1 (or .cse8 .cse9 .cse7 .cse13 .cse10 .cse14 .cse11 .cse12) .cse5 .cse6 (not (= |old(~customIrp~0)| 0))) (or .cse8 .cse9 .cse7 .cse13 .cse10 .cse14 .cse11 .cse12 .cse0)))) [2018-11-28 13:11:40,830 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 7853 7896) the Hoare annotation is: (let ((.cse0 (= 1 ~setEventCalled~0)) (.cse2 (not (= |old(~setEventCalled~0)| 1))) (.cse3 (not (= ~PagingReferenceCount~0 1))) (.cse4 (not (= ~compRegistered~0 1))) (.cse13 (= ~NP~0 ~s~0)) (.cse1 (= |old(~customIrp~0)| ~customIrp~0)) (.cse8 (= ~SKIP1~0 ~NP~0)) (.cse9 (= ~DC~0 ~IPC~0)) (.cse7 (= ~SKIP1~0 ~MPR1~0)) (.cse14 (not (= |old(~s~0)| ~NP~0))) (.cse10 (= ~NP~0 ~MPR3~0)) (.cse15 (not (= ~compRegistered~0 0))) (.cse11 (not (= 0 ~pended~0))) (.cse12 (= ~SKIP2~0 ~DC~0)) (.cse5 (= ~IPC~0 ~MPR3~0)) (.cse6 (= ~NP~0 ~MPR1~0))) (and (or (and (= ~s~0 |old(~s~0)|) .cse0 .cse1) (or .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~s~0)| ~MPR3~0)) (or .cse7 (or .cse8 .cse9 .cse10 .cse11 .cse12)))) (or (and .cse13 .cse0 .cse1) (or .cse2 .cse8 .cse9 .cse7 .cse14 .cse3 .cse4 .cse10 .cse5 .cse11 .cse6 .cse12)) (or .cse8 .cse9 .cse7 .cse14 .cse13 .cse10 .cse15 .cse11 .cse12) (or .cse8 .cse9 (not (= 1 ~pended~0)) .cse7 .cse14 .cse10 .cse13 .cse15 .cse12) (or .cse1 (or .cse8 .cse9 .cse7 .cse14 .cse10 .cse15 .cse11 .cse12) .cse5 .cse6 (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:40,830 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreFINAL(lines 7822 7829) no Hoare annotation was computed. [2018-11-28 13:11:40,830 INFO L451 ceAbstractionStarter]: At program point KeReleaseSemaphoreENTRY(lines 7822 7829) the Hoare annotation is: true [2018-11-28 13:11:40,830 INFO L448 ceAbstractionStarter]: For program point KeReleaseSemaphoreEXIT(lines 7822 7829) no Hoare annotation was computed. [2018-11-28 13:11:40,830 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadFINAL(lines 2187 2198) no Hoare annotation was computed. [2018-11-28 13:11:40,830 INFO L451 ceAbstractionStarter]: At program point FloppyUnloadENTRY(lines 2187 2198) the Hoare annotation is: true [2018-11-28 13:11:40,830 INFO L448 ceAbstractionStarter]: For program point FloppyUnloadEXIT(lines 2187 2198) no Hoare annotation was computed. [2018-11-28 13:11:40,830 INFO L448 ceAbstractionStarter]: For program point L7756-1(lines 7748 7761) no Hoare annotation was computed. [2018-11-28 13:11:40,830 INFO L444 ceAbstractionStarter]: At program point L7756(line 7756) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~IPC~0)) (.cse1 (not (= |old(~s~0)| ~NP~0))) (.cse2 (= ~NP~0 ~MPR3~0)) (.cse3 (= ~SKIP2~0 ~DC~0))) (and (or (= ~SKIP1~0 ~NP~0) .cse0 (not (= 1 ~pended~0)) (= ~SKIP1~0 ~MPR1~0) .cse1 .cse2 .cse3) (or .cse0 (not (= 0 ~pended~0)) .cse1 .cse2 .cse3))) [2018-11-28 13:11:40,841 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 7748 7761) the Hoare annotation is: (let ((.cse0 (= ~DC~0 ~IPC~0)) (.cse2 (not (= |old(~s~0)| ~NP~0))) (.cse1 (= ~NP~0 ~s~0)) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse4 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (not (= 0 ~pended~0)) .cse1 .cse2 .cse3 .cse4) (or (= ~SKIP1~0 ~NP~0) .cse0 (not (= 1 ~pended~0)) (= ~SKIP1~0 ~MPR1~0) .cse2 .cse1 .cse3 .cse4))) [2018-11-28 13:11:40,841 INFO L448 ceAbstractionStarter]: For program point L7752(lines 7752 7758) no Hoare annotation was computed. [2018-11-28 13:11:40,841 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 7748 7761) no Hoare annotation was computed. [2018-11-28 13:11:40,841 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,841 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memmoveENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,841 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,841 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,841 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memmoveEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L451 ceAbstractionStarter]: At program point InterlockedExchangeENTRY(lines 1774 1778) the Hoare annotation is: true [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeFINAL(lines 1774 1778) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point InterlockedExchangeEXIT(lines 1774 1778) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point L8116(lines 8099 8121) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point PsCreateSystemThreadEXIT(lines 8099 8121) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L451 ceAbstractionStarter]: At program point L8106(lines 8105 8119) the Hoare annotation is: true [2018-11-28 13:11:40,842 INFO L451 ceAbstractionStarter]: At program point L8109(lines 8108 8118) the Hoare annotation is: true [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point L8105(lines 8105 8119) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8110 8117) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L451 ceAbstractionStarter]: At program point PsCreateSystemThreadENTRY(lines 8099 8121) the Hoare annotation is: true [2018-11-28 13:11:40,842 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8110 8117) no Hoare annotation was computed. [2018-11-28 13:11:40,842 INFO L444 ceAbstractionStarter]: At program point L3545-1(line 3545) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,842 INFO L444 ceAbstractionStarter]: At program point L3545(line 3545) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,848 INFO L444 ceAbstractionStarter]: At program point L3611-2(lines 3611 3633) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~compRegistered~0 1)) (.cse2 (= ~NP~0 ~s~0)) (.cse3 (= ~PagingReferenceCount~0 1))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= FloppyStartDevice_~InterfaceType~0 0) .cse1 .cse2 .cse3) (and .cse0 (not (= FloppyStartDevice_~ntStatus~4 259)) .cse1 .cse2 .cse3))) [2018-11-28 13:11:40,848 INFO L444 ceAbstractionStarter]: At program point L3603(lines 3589 3636) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceFINAL(lines 3516 3677) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L444 ceAbstractionStarter]: At program point FloppyStartDeviceENTRY(lines 3516 3677) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,849 INFO L444 ceAbstractionStarter]: At program point L3620(lines 3620 3623) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3554(lines 3554 3561) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3587-1(lines 3587 3669) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3587(lines 3587 3669) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3620-1(lines 3620 3623) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3554-1(lines 3549 3562) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3612(lines 3611 3633) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3546(line 3546) no Hoare annotation was computed. [2018-11-28 13:11:40,849 INFO L448 ceAbstractionStarter]: For program point L3604(lines 3604 3608) no Hoare annotation was computed. [2018-11-28 13:11:40,855 INFO L448 ceAbstractionStarter]: For program point L3571-1(line 3571) no Hoare annotation was computed. [2018-11-28 13:11:40,855 INFO L448 ceAbstractionStarter]: For program point L3604-2(lines 3604 3608) no Hoare annotation was computed. [2018-11-28 13:11:40,855 INFO L444 ceAbstractionStarter]: At program point L3571(line 3571) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,855 INFO L444 ceAbstractionStarter]: At program point L3662(line 3662) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,855 INFO L444 ceAbstractionStarter]: At program point L3646(lines 3646 3647) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,855 INFO L448 ceAbstractionStarter]: For program point L3613(lines 3613 3617) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3646-1(lines 3646 3647) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3638(lines 3638 3644) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3638-2(lines 3638 3644) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L444 ceAbstractionStarter]: At program point L3556(line 3556) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3589(lines 3589 3636) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3573(lines 3573 3580) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3573-2(lines 3573 3580) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3590(lines 3590 3601) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3549(lines 3549 3562) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L448 ceAbstractionStarter]: For program point L3673-1(line 3673) no Hoare annotation was computed. [2018-11-28 13:11:40,856 INFO L444 ceAbstractionStarter]: At program point L3673(line 3673) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= ~pended~0 1)) (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= ~compRegistered~0 1) (= 0 ~pended~0) .cse0 (= ~PagingReferenceCount~0 1))))) [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point FloppyStartDeviceEXIT(lines 3516 3677) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3649(lines 3649 3656) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3649-2(lines 3649 3656) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3575-1(line 3575) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L444 ceAbstractionStarter]: At program point L3575(line 3575) the Hoare annotation is: (let ((.cse6 (= 0 ~pended~0)) (.cse1 (<= FloppyStartDevice_~ntStatus~4 259)) (.cse5 (< 258 FloppyStartDevice_~ntStatus~4)) (.cse0 (= ~compRegistered~0 1)) (.cse2 (= 1 ~setEventCalled~0)) (.cse3 (= ~PagingReferenceCount~0 1)) (.cse4 (= |old(~customIrp~0)| ~customIrp~0))) (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and .cse0 (= ~MPR3~0 ~s~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse6 .cse1 .cse5 .cse0 (= ~NP~0 ~s~0) .cse2 .cse3 .cse4))) [2018-11-28 13:11:40,863 INFO L444 ceAbstractionStarter]: At program point L3592(line 3592) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3625(lines 3625 3631) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3592-1(line 3592) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L444 ceAbstractionStarter]: At program point L3584(lines 3584 3585) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:40,863 INFO L444 ceAbstractionStarter]: At program point L3551(line 3551) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) [2018-11-28 13:11:40,863 INFO L448 ceAbstractionStarter]: For program point L3584-1(lines 3584 3585) no Hoare annotation was computed. [2018-11-28 13:11:40,863 INFO L444 ceAbstractionStarter]: At program point L3634(lines 3587 3667) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= 259 FloppyStartDevice_~ntStatus~4)) (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:40,870 INFO L448 ceAbstractionStarter]: For program point L3651-1(lines 3651 3652) no Hoare annotation was computed. [2018-11-28 13:11:40,870 INFO L444 ceAbstractionStarter]: At program point L3651(lines 3651 3652) the Hoare annotation is: (or (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (not (= |old(~PagingReferenceCount~0)| 1)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0))) (and (not (= FloppyStartDevice_~ntStatus~4 259)) (and (= 0 ~pended~0) (= ~compRegistered~0 1) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)))) [2018-11-28 13:11:40,870 INFO L448 ceAbstractionStarter]: For program point L3594(lines 3594 3598) no Hoare annotation was computed. [2018-11-28 13:11:40,870 INFO L448 ceAbstractionStarter]: For program point L7995(lines 7979 8000) no Hoare annotation was computed. [2018-11-28 13:11:40,870 INFO L451 ceAbstractionStarter]: At program point L7988(lines 7987 7997) the Hoare annotation is: true [2018-11-28 13:11:40,870 INFO L448 ceAbstractionStarter]: For program point L7984(lines 7984 7998) no Hoare annotation was computed. [2018-11-28 13:11:40,870 INFO L451 ceAbstractionStarter]: At program point L7985(lines 7984 7998) the Hoare annotation is: true [2018-11-28 13:11:40,870 INFO L448 ceAbstractionStarter]: For program point ObReferenceObjectByHandleEXIT(lines 7979 8000) no Hoare annotation was computed. [2018-11-28 13:11:40,870 INFO L451 ceAbstractionStarter]: At program point ObReferenceObjectByHandleENTRY(lines 7979 8000) the Hoare annotation is: true [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7989 7996) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7989 7996) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point L8210(lines 8194 8215) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L451 ceAbstractionStarter]: At program point L8203(lines 8202 8212) the Hoare annotation is: true [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point RtlDeleteRegistryValueEXIT(lines 8194 8215) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point L8199(lines 8199 8213) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L451 ceAbstractionStarter]: At program point L8200(lines 8199 8213) the Hoare annotation is: true [2018-11-28 13:11:40,871 INFO L451 ceAbstractionStarter]: At program point RtlDeleteRegistryValueENTRY(lines 8194 8215) the Hoare annotation is: true [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8204 8211) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8204 8211) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L448 ceAbstractionStarter]: For program point L7410(lines 7387 7415) no Hoare annotation was computed. [2018-11-28 13:11:40,871 INFO L444 ceAbstractionStarter]: At program point IoBuildDeviceIoControlRequestENTRY(lines 7387 7415) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= ~s~0 ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point IoBuildDeviceIoControlRequestEXIT(lines 7387 7415) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L451 ceAbstractionStarter]: At program point L7400(lines 7399 7412) the Hoare annotation is: true [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7401 7411) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point L7396(lines 7396 7413) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L451 ceAbstractionStarter]: At program point L7397(lines 7396 7413) the Hoare annotation is: true [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7401 7411) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 7841 7848) the Hoare annotation is: true [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 7841 7848) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 7841 7848) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 7027 7040) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 7027 7040) the Hoare annotation is: (or (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~compRegistered~0)| 0)) (not (= 0 |old(~pended~0)|)) (not (= ~PagingReferenceCount~0 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 7027 7040) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point L2179-2(lines 2179 2183) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point L2174(lines 2174 2178) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point DriverEntryFINAL(lines 2142 2186) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point L2174-2(lines 2174 2178) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L448 ceAbstractionStarter]: For program point DriverEntryEXIT(lines 2142 2186) no Hoare annotation was computed. [2018-11-28 13:11:40,874 INFO L451 ceAbstractionStarter]: At program point DriverEntryENTRY(lines 2142 2186) the Hoare annotation is: true [2018-11-28 13:11:40,875 INFO L448 ceAbstractionStarter]: For program point L2163(lines 2163 2167) no Hoare annotation was computed. [2018-11-28 13:11:40,875 INFO L451 ceAbstractionStarter]: At program point L2160(line 2160) the Hoare annotation is: true [2018-11-28 13:11:40,875 INFO L448 ceAbstractionStarter]: For program point L2160-1(line 2160) no Hoare annotation was computed. [2018-11-28 13:11:40,875 INFO L448 ceAbstractionStarter]: For program point L2179(lines 2179 2183) no Hoare annotation was computed. [2018-11-28 13:11:40,875 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2099) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 2095 2101) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 2095 2101) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 2095 2101) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point L8254(lines 8254 8268) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point L8255(lines 8254 8268) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point RtlQueryRegistryValuesEXIT(lines 8248 8270) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point RtlQueryRegistryValuesENTRY(lines 8248 8270) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point L8265(lines 8248 8270) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point L8258(lines 8257 8267) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8259 8266) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8259 8266) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point L-1-3(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,880 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memcpyENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:11:40,880 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memcpyEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:11:40,881 INFO L444 ceAbstractionStarter]: At program point L7703(lines 7702 7717) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse6) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse8 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (= 1 ~setEventCalled~0))))) [2018-11-28 13:11:40,881 INFO L448 ceAbstractionStarter]: For program point L7699(lines 7699 7718) no Hoare annotation was computed. [2018-11-28 13:11:40,881 INFO L448 ceAbstractionStarter]: For program point L7724(lines 7724 7741) no Hoare annotation was computed. [2018-11-28 13:11:40,884 INFO L448 ceAbstractionStarter]: For program point L7683-1(line 7683) no Hoare annotation was computed. [2018-11-28 13:11:40,884 INFO L444 ceAbstractionStarter]: At program point L7683(line 7683) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse7) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (= ~NP~0 ~s~0)))) [2018-11-28 13:11:40,885 INFO L444 ceAbstractionStarter]: At program point L7700(lines 7699 7718) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse6) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse8 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (= 1 ~setEventCalled~0))))) [2018-11-28 13:11:40,885 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 7672 7745) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse6) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse8 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (= ~NP~0 ~s~0)))) [2018-11-28 13:11:40,885 INFO L448 ceAbstractionStarter]: For program point L7733(lines 7733 7740) no Hoare annotation was computed. [2018-11-28 13:11:40,885 INFO L448 ceAbstractionStarter]: For program point L7725(lines 7725 7731) no Hoare annotation was computed. [2018-11-28 13:11:40,885 INFO L444 ceAbstractionStarter]: At program point L7688(line 7688) the Hoare annotation is: (let ((.cse3 (not (= 0 ~pended~0))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse5 (= ~SKIP2~0 ~DC~0))) (and (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5)) (and (= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (= ~NP~0 ~s~0) (= 1 ~setEventCalled~0))) (or .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse3 .cse5) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse4 .cse6 .cse7 .cse5))) [2018-11-28 13:11:40,885 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 7672 7745) no Hoare annotation was computed. [2018-11-28 13:11:40,885 INFO L444 ceAbstractionStarter]: At program point L7738(line 7738) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse6 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse7) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse6 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)))) [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L7738-1(lines 7720 7742) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 7672 7745) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L444 ceAbstractionStarter]: At program point L7697(lines 7696 7719) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse6) (or (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse8 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (and (= ~s~0 ~MPR1~0) (= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0) (= 1 ~setEventCalled~0))))) [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point $Ultimate##12(lines 7704 7716) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point $Ultimate##11(lines 7704 7716) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L7681-1(lines 7680 7744) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L7681(lines 7681 7695) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L7686(lines 7686 7692) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L444 ceAbstractionStarter]: At program point L7715(lines 7680 7744) the Hoare annotation is: (let ((.cse4 (not (= ~compRegistered~0 0))) (.cse5 (not (= ~SKIP1~0 |old(~s~0)|))) (.cse6 (= ~SKIP1~0 ~s~0)) (.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse8 (not (= 0 ~pended~0))) (.cse3 (= ~NP~0 ~MPR3~0)) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 (not (= 1 ~pended~0)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse8 .cse7 .cse6) (let ((.cse9 (= ~s~0 ~MPR1~0)) (.cse10 (= (+ IofCallDriver_~compRetStatus1~0 1073741802) 0)) (.cse11 (= 1 ~setEventCalled~0))) (or (and .cse9 .cse10 .cse11 (= IofCallDriver_~returnVal2~0 259)) (or (= ~NP~0 ~MPR1~0) (or .cse0 .cse1 .cse2 .cse8 (not (= |old(~s~0)| ~NP~0)) (not (= ~PagingReferenceCount~0 1)) (not (= ~compRegistered~0 1)) .cse3 (= ~IPC~0 ~MPR3~0) .cse7)) (and .cse9 .cse10 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0) .cse11) (and .cse9 .cse10 (= 0 IofCallDriver_~returnVal2~0) .cse11))))) [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L2620(lines 2620 2626) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L2620-2(lines 2620 2626) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point L2614(lines 2614 2634) no Hoare annotation was computed. [2018-11-28 13:11:40,895 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadFINAL(lines 2557 2666) no Hoare annotation was computed. [2018-11-28 13:11:40,899 INFO L448 ceAbstractionStarter]: For program point L2641(lines 2641 2645) no Hoare annotation was computed. [2018-11-28 13:11:40,899 INFO L444 ceAbstractionStarter]: At program point L2662(line 2662) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0)) (.cse6 (= ~pended~0 1))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) .cse5 .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse2 .cse3 .cse0 .cse4 (and .cse6 (= ~PagingReferenceCount~0 0)) .cse5 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1 (and .cse6 (= ~PagingReferenceCount~0 1))))) [2018-11-28 13:11:40,899 INFO L448 ceAbstractionStarter]: For program point L2596(lines 2596 2602) no Hoare annotation was computed. [2018-11-28 13:11:40,899 INFO L448 ceAbstractionStarter]: For program point L2660(lines 2660 2661) no Hoare annotation was computed. [2018-11-28 13:11:40,900 INFO L448 ceAbstractionStarter]: For program point L2662-1(line 2662) no Hoare annotation was computed. [2018-11-28 13:11:40,900 INFO L448 ceAbstractionStarter]: For program point L2596-2(lines 2596 2602) no Hoare annotation was computed. [2018-11-28 13:11:40,900 INFO L444 ceAbstractionStarter]: At program point FlQueueIrpToThreadENTRY(lines 2557 2666) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse6 (not (= ~compRegistered~0 0))) (.cse7 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0)) (.cse8 (= 0 ~pended~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) .cse5 .cse6 .cse7 (not (= ~customIrp~0 0)) (and .cse8 (= ~PagingReferenceCount~0 1))) (or .cse2 .cse3 .cse0 .cse4 .cse5 .cse6 .cse7 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1 (and .cse8 (= ~PagingReferenceCount~0 0))))) [2018-11-28 13:11:40,900 INFO L444 ceAbstractionStarter]: At program point L2656(line 2656) the Hoare annotation is: (let ((.cse0 (= ~SKIP1~0 ~NP~0)) (.cse1 (= ~DC~0 ~IPC~0)) (.cse2 (= ~SKIP1~0 ~MPR1~0)) (.cse3 (not (= ~s~0 ~NP~0))) (.cse4 (= ~NP~0 ~MPR3~0)) (.cse5 (not (= ~compRegistered~0 0))) (.cse6 (not (= 0 |old(~pended~0)|))) (.cse7 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (not (= |old(~PagingReferenceCount~0)| 0)) .cse7) (or .cse0 .cse1 .cse2 .cse3 (not (= |old(~PagingReferenceCount~0)| 1)) .cse4 (= ~IPC~0 ~MPR3~0) .cse5 .cse6 (= ~NP~0 ~MPR1~0) .cse7 (not (= ~customIrp~0 0))))) [2018-11-28 13:11:40,900 INFO L448 ceAbstractionStarter]: For program point L2590(lines 2590 2650) no Hoare annotation was computed. [2018-11-28 13:11:40,900 INFO L444 ceAbstractionStarter]: At program point L2656-1(lines 2652 2658) the Hoare annotation is: (let ((.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse5 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0)) (.cse6 (= ~pended~0 1))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) .cse5 .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or .cse2 .cse3 .cse0 .cse4 (and .cse6 (= ~PagingReferenceCount~0 0)) .cse5 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1 (and .cse6 (= ~PagingReferenceCount~0 1))))) [2018-11-28 13:11:40,900 INFO L448 ceAbstractionStarter]: For program point FlQueueIrpToThreadEXIT(lines 2557 2666) no Hoare annotation was computed. [2018-11-28 13:11:40,900 INFO L448 ceAbstractionStarter]: For program point L2590-2(lines 2590 2650) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2652(lines 2652 2658) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2611-1(lines 2611 2612) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L444 ceAbstractionStarter]: At program point L2611(lines 2611 2612) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) (and .cse5 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or (and .cse5 (= ~PagingReferenceCount~0 1)) .cse2 .cse3 .cse0 .cse4 .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1))) [2018-11-28 13:11:40,912 INFO L444 ceAbstractionStarter]: At program point L2638(line 2638) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) (and .cse5 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or (and .cse5 (= ~PagingReferenceCount~0 1)) .cse2 .cse3 .cse0 .cse4 .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1))) [2018-11-28 13:11:40,912 INFO L444 ceAbstractionStarter]: At program point L2636(lines 2636 2637) the Hoare annotation is: (let ((.cse5 (= 0 ~pended~0)) (.cse2 (= ~SKIP1~0 ~NP~0)) (.cse3 (= ~DC~0 ~IPC~0)) (.cse0 (= ~SKIP1~0 ~MPR1~0)) (.cse4 (not (= ~s~0 ~NP~0))) (.cse6 (= ~NP~0 ~MPR3~0)) (.cse7 (not (= ~compRegistered~0 0))) (.cse8 (not (= 0 |old(~pended~0)|))) (.cse1 (= ~SKIP2~0 ~DC~0))) (and (or .cse0 (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) .cse1 .cse2 .cse3 .cse4 (not (= |old(~PagingReferenceCount~0)| 1)) (and .cse5 (not (= (mod ~PagingReferenceCount~0 4294967296) 0))) .cse6 .cse7 .cse8 (not (= ~customIrp~0 0))) (or (and .cse5 (= ~PagingReferenceCount~0 1)) .cse2 .cse3 .cse0 .cse4 .cse6 .cse7 .cse8 (not (= |old(~PagingReferenceCount~0)| 0)) .cse1))) [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2638-1(line 2638) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2636-1(lines 2636 2637) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2568(lines 2568 2580) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2942(lines 2941 2959) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2876(lines 2876 2903) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L444 ceAbstractionStarter]: At program point L2992(lines 2992 2993) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2992-1(lines 2992 2993) no Hoare annotation was computed. [2018-11-28 13:11:40,912 INFO L448 ceAbstractionStarter]: For program point L2893(lines 2893 2898) no Hoare annotation was computed. [2018-11-28 13:11:40,925 INFO L444 ceAbstractionStarter]: At program point L2761(lines 2760 3127) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,925 INFO L448 ceAbstractionStarter]: For program point L2943(lines 2943 2947) no Hoare annotation was computed. [2018-11-28 13:11:40,925 INFO L448 ceAbstractionStarter]: For program point L2877(lines 2877 2882) no Hoare annotation was computed. [2018-11-28 13:11:40,925 INFO L448 ceAbstractionStarter]: For program point L2778(lines 2778 3121) no Hoare annotation was computed. [2018-11-28 13:11:40,925 INFO L448 ceAbstractionStarter]: For program point L2745-1(lines 2741 2747) no Hoare annotation was computed. [2018-11-28 13:11:40,925 INFO L444 ceAbstractionStarter]: At program point L2745(line 2745) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,925 INFO L444 ceAbstractionStarter]: At program point L3092(line 3092) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,925 INFO L448 ceAbstractionStarter]: For program point L3092-1(line 3092) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2729(lines 2729 2739) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L3142(lines 3142 3158) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L3109-1(lines 3109 3110) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L444 ceAbstractionStarter]: At program point L3109(lines 3109 3110) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2911(line 2911) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2713(lines 2713 2725) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2713-2(lines 2713 2725) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L444 ceAbstractionStarter]: At program point L2994(lines 2994 2995) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2994-1(lines 2994 2995) no Hoare annotation was computed. [2018-11-28 13:11:40,926 INFO L448 ceAbstractionStarter]: For program point L2763(lines 2763 3126) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L444 ceAbstractionStarter]: At program point L3077(lines 2790 3117) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L2714(lines 2714 2722) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L2830(lines 2830 2835) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlFINAL(lines 2682 3180) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L3078(lines 3078 3097) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L2847-1(lines 2847 2848) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L444 ceAbstractionStarter]: At program point L2847(lines 2847 2848) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L2781(lines 2781 3120) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L3029(lines 3029 3045) no Hoare annotation was computed. [2018-11-28 13:11:40,939 INFO L448 ceAbstractionStarter]: For program point L2930(lines 2930 2937) no Hoare annotation was computed. [2018-11-28 13:11:40,940 INFO L448 ceAbstractionStarter]: For program point L2930-2(lines 2930 2937) no Hoare annotation was computed. [2018-11-28 13:11:40,940 INFO L448 ceAbstractionStarter]: For program point L3145(lines 3145 3157) no Hoare annotation was computed. [2018-11-28 13:11:40,940 INFO L444 ceAbstractionStarter]: At program point L2980(lines 2980 2981) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,940 INFO L448 ceAbstractionStarter]: For program point L2980-1(lines 2980 2981) no Hoare annotation was computed. [2018-11-28 13:11:40,940 INFO L448 ceAbstractionStarter]: For program point L2815-1(lines 2815 2816) no Hoare annotation was computed. [2018-11-28 13:11:40,940 INFO L444 ceAbstractionStarter]: At program point L2815(lines 2815 2816) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,940 INFO L444 ceAbstractionStarter]: At program point L2716(line 2716) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L2716-1(line 2716) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L3129(lines 3129 3177) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L3063-1(lines 3063 3064) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L444 ceAbstractionStarter]: At program point L3063(lines 3063 3064) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L2964(lines 2964 3076) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L2766(lines 2766 3125) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L2799(lines 2799 2804) no Hoare annotation was computed. [2018-11-28 13:11:40,952 INFO L448 ceAbstractionStarter]: For program point L2849-1(lines 2849 2850) no Hoare annotation was computed. [2018-11-28 13:11:40,953 INFO L444 ceAbstractionStarter]: At program point L2849(lines 2849 2850) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,953 INFO L444 ceAbstractionStarter]: At program point L2866(line 2866) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,953 INFO L448 ceAbstractionStarter]: For program point L2866-1(line 2866) no Hoare annotation was computed. [2018-11-28 13:11:40,953 INFO L444 ceAbstractionStarter]: At program point L2734(line 2734) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,953 INFO L444 ceAbstractionStarter]: At program point L2767(lines 2763 3126) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,953 INFO L448 ceAbstractionStarter]: For program point L2734-1(line 2734) no Hoare annotation was computed. [2018-11-28 13:11:40,953 INFO L444 ceAbstractionStarter]: At program point L3114(lines 2705 3179) the Hoare annotation is: (let ((.cse0 (= ~NP~0 ~s~0))) (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (and (= 0 ~pended~0) .cse0 (not (= 259 FloppyDeviceControl_~ntStatus~2))) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and .cse0 (= ~pended~0 1)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)))) [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L3081(lines 3081 3088) no Hoare annotation was computed. [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L3015(lines 3015 3047) no Hoare annotation was computed. [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L2784(lines 2784 3119) no Hoare annotation was computed. [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L2817-1(lines 2817 2818) no Hoare annotation was computed. [2018-11-28 13:11:40,957 INFO L444 ceAbstractionStarter]: At program point L2817(lines 2817 2818) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L2751-1(line 2751) no Hoare annotation was computed. [2018-11-28 13:11:40,957 INFO L444 ceAbstractionStarter]: At program point L2751(line 2751) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (and (= 0 ~pended~0) (= ~SKIP1~0 ~s~0)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,957 INFO L444 ceAbstractionStarter]: At program point L3098(lines 2793 3116) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,957 INFO L448 ceAbstractionStarter]: For program point L2999-1(line 2999) no Hoare annotation was computed. [2018-11-28 13:11:40,958 INFO L444 ceAbstractionStarter]: At program point L2999(line 2999) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,958 INFO L448 ceAbstractionStarter]: For program point L3148(lines 3148 3156) no Hoare annotation was computed. [2018-11-28 13:11:40,958 INFO L444 ceAbstractionStarter]: At program point L2785(lines 2781 3120) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,958 INFO L448 ceAbstractionStarter]: For program point L3132(lines 3132 3171) no Hoare annotation was computed. [2018-11-28 13:11:40,958 INFO L444 ceAbstractionStarter]: At program point L3066(lines 3066 3067) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,964 INFO L444 ceAbstractionStarter]: At program point L3132-1(lines 3132 3171) the Hoare annotation is: (or (= ~IPC~0 ~MPR3~0) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~DC~0 ~IPC~0) (not (= ~compRegistered~0 0)) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~PagingReferenceCount~0)| 0)) (and (not (= 259 FloppyDeviceControl_~ntStatus~2)) (and (= 0 ~pended~0) (= |old(~s~0)| ~s~0))) (= ~SKIP1~0 ~NP~0) (not (= |old(~s~0)| ~NP~0)) (and (= ~NP~0 ~s~0) (= ~pended~0 1)) (= ~NP~0 ~MPR3~0) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,965 INFO L444 ceAbstractionStarter]: At program point L3066-1(lines 3066 3067) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= FloppyDeviceControl_~ntStatus~2 0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2967(lines 2967 2972) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2868(lines 2868 2875) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2868-1(lines 2868 2875) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2769(lines 2769 3124) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point $Ultimate##38(lines 2795 3115) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point $Ultimate##37(lines 2795 3115) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2984(lines 2984 2989) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2885(lines 2885 2900) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L3133(lines 3133 3161) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L2787(lines 2787 3118) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L3068(lines 3068 3069) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L3151(lines 3151 3155) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point FloppyDeviceControlEXIT(lines 2682 3180) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L3052(lines 3052 3061) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L448 ceAbstractionStarter]: For program point L3151-2(lines 3132 3169) no Hoare annotation was computed. [2018-11-28 13:11:40,965 INFO L444 ceAbstractionStarter]: At program point L2788(lines 2787 3118) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L3036(lines 3036 3044) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L3003-1(lines 3003 3005) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L444 ceAbstractionStarter]: At program point L3003(lines 3003 3005) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,979 INFO L444 ceAbstractionStarter]: At program point L2904(lines 2769 3124) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2772(lines 2772 3123) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2921(lines 2921 2928) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L3136(lines 3136 3160) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L3103-1(lines 3099 3105) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L444 ceAbstractionStarter]: At program point L3103(line 3103) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (= ~IPC~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2839(lines 2839 2845) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2740(lines 2740 2756) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L444 ceAbstractionStarter]: At program point FloppyDeviceControlENTRY(lines 2682 3180) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2889(lines 2889 2899) no Hoare annotation was computed. [2018-11-28 13:11:40,979 INFO L448 ceAbstractionStarter]: For program point L2790(lines 2790 3117) no Hoare annotation was computed. [2018-11-28 13:11:40,980 INFO L448 ceAbstractionStarter]: For program point L2757(lines 2757 3128) no Hoare annotation was computed. [2018-11-28 13:11:40,980 INFO L448 ceAbstractionStarter]: For program point L2807(lines 2807 2813) no Hoare annotation was computed. [2018-11-28 13:11:40,980 INFO L448 ceAbstractionStarter]: For program point L2741(lines 2741 2747) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L3022(lines 3022 3046) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2857(lines 2857 2864) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L444 ceAbstractionStarter]: At program point L2758(lines 2757 3128) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2973(lines 2973 2978) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2775(lines 2775 3122) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L3139(lines 3139 3159) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L3007(lines 3007 3014) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L444 ceAbstractionStarter]: At program point L2941-2(lines 2941 2959) the Hoare annotation is: (let ((.cse0 (= 0 ~pended~0)) (.cse1 (= ~NP~0 ~s~0))) (or (= ~SKIP1~0 ~MPR1~0) (and .cse0 .cse1 (= 0 FloppyDeviceControl_~ntStatus~2)) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0)) (and .cse0 (<= (+ FloppyDeviceControl_~ntStatus~2 2147483643) 0) .cse1))) [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2991-1(line 2991) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L444 ceAbstractionStarter]: At program point L2991(line 2991) the Hoare annotation is: (or (= ~SKIP1~0 ~MPR1~0) (= ~IPC~0 ~MPR3~0) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~NP~0 ~MPR1~0) (= ~SKIP2~0 ~DC~0) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0)) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= ~customIrp~0 0))) [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2826(lines 2826 2836) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L2760(lines 2760 3127) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L6497(lines 6497 6505) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L6456-1(lines 6455 6463) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L6456(lines 6456 6460) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L6481(lines 6481 6514) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L448 ceAbstractionStarter]: For program point L6494(lines 6494 6506) no Hoare annotation was computed. [2018-11-28 13:11:40,990 INFO L451 ceAbstractionStarter]: At program point L6453-2(lines 6453 6465) the Hoare annotation is: true [2018-11-28 13:11:40,991 INFO L448 ceAbstractionStarter]: For program point L6478(lines 6478 6515) no Hoare annotation was computed. [2018-11-28 13:11:40,991 INFO L451 ceAbstractionStarter]: At program point L6466(lines 6452 6467) the Hoare annotation is: true [2018-11-28 13:11:40,991 INFO L448 ceAbstractionStarter]: For program point L6491(lines 6491 6507) no Hoare annotation was computed. [2018-11-28 13:11:41,001 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersEXIT(lines 6446 6520) no Hoare annotation was computed. [2018-11-28 13:11:41,001 INFO L448 ceAbstractionStarter]: For program point L6454(line 6454) no Hoare annotation was computed. [2018-11-28 13:11:41,001 INFO L448 ceAbstractionStarter]: For program point L6487(lines 6487 6511) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6487-2(lines 6487 6511) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6475(lines 6475 6516) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6500(lines 6500 6504) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point FlCheckFormatParametersFINAL(lines 6446 6520) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6455(lines 6455 6463) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6488(lines 6488 6508) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6484(lines 6484 6513) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L451 ceAbstractionStarter]: At program point FlCheckFormatParametersENTRY(lines 6446 6520) the Hoare annotation is: true [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6472(lines 6472 6517) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6468(lines 6468 6518) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~s~0 |old(~s~0)|) (= |old(~PagingReferenceCount~0)| ~PagingReferenceCount~0) (= |old(~customIrp~0)| ~customIrp~0)) [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point memcpy_guardEXIT(lines 10 15) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L451 ceAbstractionStarter]: At program point memcpy_guardENTRY(lines 10 15) the Hoare annotation is: true [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point memcpy_guardFINAL(lines 10 15) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L444 ceAbstractionStarter]: At program point L6784-2(lines 6784 6790) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point L6784(lines 6784 6790) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestEXIT(lines 6774 6845) no Hoare annotation was computed. [2018-11-28 13:11:41,002 INFO L444 ceAbstractionStarter]: At program point FloppyQueueRequestENTRY(lines 6774 6845) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 0))) [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6810(lines 6810 6816) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L444 ceAbstractionStarter]: At program point L6806(line 6806) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6810-2(lines 6810 6816) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point FloppyQueueRequestFINAL(lines 6774 6845) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6806-1(line 6806) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6837(lines 6837 6838) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L444 ceAbstractionStarter]: At program point L6798(line 6798) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6800(lines 6800 6823) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L444 ceAbstractionStarter]: At program point L6833-1(lines 6829 6835) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0) (and (= ~NP~0 ~s~0) (= ~pended~0 1) (= ~PagingReferenceCount~0 1))) [2018-11-28 13:11:41,011 INFO L444 ceAbstractionStarter]: At program point L6833(line 6833) the Hoare annotation is: (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6794(line 6794) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6796-1(lines 6796 6842) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6796(lines 6796 6842) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6798-1(line 6798) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6829(lines 6829 6835) no Hoare annotation was computed. [2018-11-28 13:11:41,011 INFO L444 ceAbstractionStarter]: At program point L6825(lines 6796 6842) the Hoare annotation is: (or (and (= 0 ~pended~0) (= ~NP~0 ~s~0) (= ~PagingReferenceCount~0 1)) (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= ~compRegistered~0 0)) (not (= 0 |old(~pended~0)|)) (not (= |old(~PagingReferenceCount~0)| 0)) (= ~SKIP2~0 ~DC~0)) [2018-11-28 13:11:41,011 INFO L448 ceAbstractionStarter]: For program point L6591(lines 6591 6597) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point L6588-1(lines 6588 6589) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L444 ceAbstractionStarter]: At program point L6588(lines 6588 6589) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:41,026 INFO L444 ceAbstractionStarter]: At program point FlFdcDeviceIoENTRY(lines 6576 6613) the Hoare annotation is: (or (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))) (and (= ~NP~0 ~s~0) (= |old(~customIrp~0)| ~customIrp~0))) [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoEXIT(lines 6576 6613) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point L6603(lines 6603 6610) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point L6605-1(line 6605) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point FlFdcDeviceIoFINAL(lines 6576 6613) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L444 ceAbstractionStarter]: At program point L6605(line 6605) the Hoare annotation is: (let ((.cse1 (= 1 ~setEventCalled~0)) (.cse0 (= 259 FlFdcDeviceIo_~ntStatus~16))) (or (and .cse0 (= ~NP~0 ~s~0) .cse1) (and (and (= ~MPR3~0 ~s~0) .cse1) .cse0) (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0))))) [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point L6601-1(line 6601) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L444 ceAbstractionStarter]: At program point L6601(line 6601) the Hoare annotation is: (or (= ~NP~0 ~s~0) (or (or (not (= ~PagingReferenceCount~0 1)) (or (= ~SKIP1~0 ~NP~0) (= ~DC~0 ~IPC~0) (= ~SKIP1~0 ~MPR1~0) (not (= |old(~s~0)| ~NP~0)) (= ~NP~0 ~MPR3~0) (not (= 0 ~pended~0))) (not (= ~compRegistered~0 1)) (= ~IPC~0 ~MPR3~0) (= ~SKIP2~0 ~DC~0)) (= ~NP~0 ~MPR1~0) (not (= |old(~customIrp~0)| 0)))) [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point L6603-2(lines 6603 6610) no Hoare annotation was computed. [2018-11-28 13:11:41,026 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagFINAL(lines 7237 7249) no Hoare annotation was computed. [2018-11-28 13:11:41,027 INFO L448 ceAbstractionStarter]: For program point ExAllocatePoolWithTagEXIT(lines 7237 7249) no Hoare annotation was computed. [2018-11-28 13:11:41,027 INFO L451 ceAbstractionStarter]: At program point ExAllocatePoolWithTagENTRY(lines 7237 7249) the Hoare annotation is: true [2018-11-28 13:11:41,027 INFO L448 ceAbstractionStarter]: For program point L2494(lines 2494 2538) no Hoare annotation was computed. [2018-11-28 13:11:41,027 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyFINAL(lines 2483 2556) no Hoare annotation was computed. [2018-11-28 13:11:41,027 INFO L451 ceAbstractionStarter]: At program point L2507(lines 2506 2534) the Hoare annotation is: true [2018-11-28 13:11:41,027 INFO L448 ceAbstractionStarter]: For program point L2503(lines 2503 2535) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 2511 2532) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2501(lines 2500 2536) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 2511 2532) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point L2497(lines 2497 2537) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2495(lines 2494 2538) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point L2489(lines 2489 2493) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2510(lines 2509 2533) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point L2506(lines 2506 2534) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2504(lines 2503 2535) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point FlAcpiConfigureFloppyENTRY(lines 2483 2556) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point L2500(lines 2500 2536) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point FlAcpiConfigureFloppyEXIT(lines 2483 2556) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2498(lines 2497 2537) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point L2531(lines 2511 2532) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~pended~0) (= 0 ~compRegistered~0) (= ~s~0 ~UNLOADED~0) (= ~NP~0 ~MPR1~0) (= 0 ~customIrp~0) (= ~IPC~0 ~s~0) (= ~DC~0 ~s~0) (= ~s~0 ~SKIP2~0) (= 0 ~myStatus~0) (= ~NP~0 ~s~0) (= ~MPR3~0 ~s~0) (= ~PagingReferenceCount~0 0) (= ~SKIP1~0 ~s~0)) [2018-11-28 13:11:41,043 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point L7583(lines 7555 7588) no Hoare annotation was computed. [2018-11-28 13:11:41,043 INFO L448 ceAbstractionStarter]: For program point IoQueryDeviceDescriptionEXIT(lines 7555 7588) no Hoare annotation was computed. [2018-11-28 13:11:41,044 INFO L451 ceAbstractionStarter]: At program point L7576(lines 7575 7585) the Hoare annotation is: true [2018-11-28 13:11:41,044 INFO L451 ceAbstractionStarter]: At program point IoQueryDeviceDescriptionENTRY(lines 7555 7588) the Hoare annotation is: true [2018-11-28 13:11:41,044 INFO L448 ceAbstractionStarter]: For program point L7572(lines 7572 7586) no Hoare annotation was computed. [2018-11-28 13:11:41,044 INFO L451 ceAbstractionStarter]: At program point L7573(lines 7572 7586) the Hoare annotation is: true [2018-11-28 13:11:41,044 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7577 7584) no Hoare annotation was computed. [2018-11-28 13:11:41,044 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7577 7584) no Hoare annotation was computed. [2018-11-28 13:11:41,044 INFO L451 ceAbstractionStarter]: At program point L7486(lines 7485 7499) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L451 ceAbstractionStarter]: At program point L7489(lines 7488 7498) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point L7485(lines 7485 7499) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L451 ceAbstractionStarter]: At program point IoDeleteSymbolicLinkENTRY(lines 7481 7501) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point IoDeleteSymbolicLinkEXIT(lines 7481 7501) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point L7496(lines 7481 7501) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 7490 7497) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 7490 7497) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point L8287(lines 8272 8292) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L451 ceAbstractionStarter]: At program point ZwCloseENTRY(lines 8272 8292) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L451 ceAbstractionStarter]: At program point L8280(lines 8279 8289) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point L8276(lines 8276 8290) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point ZwCloseEXIT(lines 8272 8292) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L451 ceAbstractionStarter]: At program point L8277(lines 8276 8290) the Hoare annotation is: true [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point $Ultimate##4(lines 8281 8288) no Hoare annotation was computed. [2018-11-28 13:11:41,059 INFO L448 ceAbstractionStarter]: For program point $Ultimate##3(lines 8281 8288) no Hoare annotation was computed. [2018-11-28 13:11:41,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:11:41 BoogieIcfgContainer [2018-11-28 13:11:41,121 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:11:41,122 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:11:41,122 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:11:41,122 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:11:41,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:08:14" (3/4) ... [2018-11-28 13:11:41,128 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 13:11:41,135 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoGetConfigurationInformation [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoRegisterDeviceInterface [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyReadWrite [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoSetDeviceInterfaceState [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyProcessQueuedRequests [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnp [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyCreateClose [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedInsertTailList [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PoCallDriver [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExfInterlockedRemoveHeadList [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPower [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyPnpComplete [2018-11-28 13:11:41,136 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeReleaseSemaphore [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyUnload [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memmove [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure InterlockedExchange [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure PsCreateSystemThread [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyStartDevice [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ObReferenceObjectByHandle [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlDeleteRegistryValue [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoBuildDeviceIoControlRequest [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure DriverEntry [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-11-28 13:11:41,137 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure RtlQueryRegistryValues [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlQueueIrpToThread [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyDeviceControl [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlCheckFormatParameters [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure memcpy_guard [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FloppyQueueRequest [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlFdcDeviceIo [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ExAllocatePoolWithTag [2018-11-28 13:11:41,138 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure FlAcpiConfigureFloppy [2018-11-28 13:11:41,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoQueryDeviceDescription [2018-11-28 13:11:41,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IoDeleteSymbolicLink [2018-11-28 13:11:41,139 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ZwClose [2018-11-28 13:11:41,172 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1167 nodes and edges [2018-11-28 13:11:41,175 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 580 nodes and edges [2018-11-28 13:11:41,177 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 279 nodes and edges [2018-11-28 13:11:41,180 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 128 nodes and edges [2018-11-28 13:11:41,182 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2018-11-28 13:11:41,184 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2018-11-28 13:11:41,186 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-11-28 13:11:41,189 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 13:11:41,191 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 13:11:41,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP))) || ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || !(\old(PagingReferenceCount) == 0)) || (((!(MPR1 == SKIP1) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && pended == 1) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (0 == status + 1073741738 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(IPC))) || (((((!(MPR1 == SKIP1) && 0 == compRegistered) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((compRegistered == 1 && !(MPR1 == SKIP1)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,226 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((compRegistered == 1 && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)))) || (0 == compRegistered && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))))) && !(259 == status)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && pended == 1)) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status + 1073741738 && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (s == SKIP2 && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) [2018-11-28 13:11:41,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) [2018-11-28 13:11:41,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,227 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((s == DC && pended == 1) || ((s == SKIP2 && compRegistered == 0) && pended == 1)) || (((s == SKIP2 && 0 == pended) && 0 == compRegistered) && lowerDriverReturn == ntStatus)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (!(ntStatus == 259) && (((0 == pended && 0 == compRegistered) && s == DC) || ((compRegistered == 1 && 0 == pended) && s == DC))) [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((((((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled) && returnVal2 == 259) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || (((s == MPR1 && compRetStatus1 + 1073741802 == 0) && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled)) || (((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 0 == returnVal2) && 1 == setEventCalled)) [2018-11-28 13:11:41,228 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) [2018-11-28 13:11:41,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) [2018-11-28 13:11:41,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC) && (((!(\old(setEventCalled) == 1) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || 1 == setEventCalled)) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || !(0 == \old(pended))) || SKIP2 == DC)) && ((((0 == myStatus || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || !(customIrp == 0)) [2018-11-28 13:11:41,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,229 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(\old(setEventCalled) == 1) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || 1 == setEventCalled) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || (NP == s && pended == 1)) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) || ((((0 == pended && headOfList == 0) && NP == s) && headOfList == 0) && PagingReferenceCount == 1))) && ((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || ((headOfList == 0 && headOfList == 0) && PagingReferenceCount == 1))) && ((((((0 == pended && NP == s) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 1)) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC)) && ((((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || 0 == myStatus) || NP == MPR1) || !(customIrp == 0)) [2018-11-28 13:11:41,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,230 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && 0 == pended) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && compRegistered == 0) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) [2018-11-28 13:11:41,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == pended) && compRegistered == 0) && NP == s) && !(MPR3 == NP)) && !(SKIP1 == NP)) [2018-11-28 13:11:41,232 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s [2018-11-28 13:11:41,232 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 == MPR1 || IPC == MPR3) || ((0 == pended && NP == s) && !(259 == ntStatus))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || (NP == s && pended == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,233 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || ((NP == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || NP == s) || SKIP2 == DC)) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == s) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) [2018-11-28 13:11:41,234 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((0 == pended && NP == s) && PagingReferenceCount == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || SKIP2 == DC [2018-11-28 13:11:41,234 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (((0 == pended && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-28 13:11:41,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) [2018-11-28 13:11:41,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == pended && InterfaceType == 0) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1)) || ((((0 == pended && !(ntStatus == 259)) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-28 13:11:41,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((!(259 == ntStatus) && 0 == pended) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) [2018-11-28 13:11:41,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) [2018-11-28 13:11:41,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) [2018-11-28 13:11:41,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,237 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,237 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC [2018-11-28 13:11:41,241 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) [2018-11-28 13:11:41,242 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,242 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,243 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,243 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) [2018-11-28 13:11:41,243 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) [2018-11-28 13:11:41,243 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,243 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,244 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,244 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || ((0 == pended && NP == s) && PagingReferenceCount == 0)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || ((0 == pended && NP == s) && PagingReferenceCount == 0)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) [2018-11-28 13:11:41,245 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((SKIP1 == MPR1 || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && NP == s)) || !(customIrp == 0) [2018-11-28 13:11:41,246 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((SKIP1 == MPR1 || ((0 == pended && NP == s) && 0 == ntStatus)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || ((0 == pended && ntStatus + 2147483643 <= 0) && NP == s) [2018-11-28 13:11:41,406 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d83b8ecb-3f81-4f2e-8136-b7ba2dd68eda/bin-2019/uautomizer/witness.graphml [2018-11-28 13:11:41,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:11:41,407 INFO L168 Benchmark]: Toolchain (without parser) took 243254.96 ms. Allocated memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: 1.4 GB). Free memory was 945.2 MB in the beginning and 1.5 GB in the end (delta: -578.8 MB). Peak memory consumption was 778.6 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,407 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:11:41,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1352.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.2 MB in the beginning and 955.8 MB in the end (delta: -10.6 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 1.2 GB. Free memory was 955.8 MB in the beginning and 947.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,408 INFO L168 Benchmark]: Boogie Preprocessor took 177.57 ms. Allocated memory is still 1.2 GB. Free memory was 947.5 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,408 INFO L168 Benchmark]: RCFGBuilder took 34511.86 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 904.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,408 INFO L168 Benchmark]: TraceAbstraction took 206849.59 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 181.4 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 371.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,408 INFO L168 Benchmark]: Witness Printer took 284.16 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:11:41,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1352.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 945.2 MB in the beginning and 955.8 MB in the end (delta: -10.6 MB). Peak memory consumption was 138.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.27 ms. Allocated memory is still 1.2 GB. Free memory was 955.8 MB in the beginning and 947.5 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 177.57 ms. Allocated memory is still 1.2 GB. Free memory was 947.5 MB in the beginning and 904.4 MB in the end (delta: 43.0 MB). Peak memory consumption was 43.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 34511.86 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 904.4 MB in the beginning and 2.0 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * TraceAbstraction took 206849.59 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 181.4 MB). Free memory was 2.0 GB in the beginning and 1.6 GB in the end (delta: 371.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 284.16 ms. Allocated memory is still 2.4 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 59.8 MB). Peak memory consumption was 59.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2099]: 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: 2497]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3240]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 7156]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || !(\old(compRegistered) == 0)) || !(\old(PagingReferenceCount) == 0)) || (((!(MPR1 == SKIP1) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && pended == 1) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || (0 == status + 1073741738 && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(IPC))) || (((((!(MPR1 == SKIP1) && 0 == compRegistered) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((compRegistered == 1 && !(MPR1 == SKIP1)) && ((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2511]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6452]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8199]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6943]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) - InvariantResult [Line: 7631]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8202]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7634]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2787]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || ((0 == pended && NP == s) && PagingReferenceCount == 0)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 2790]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || ((0 == pended && NP == s) && PagingReferenceCount == 0)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 2500]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7060]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && 0 == pended) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && compRegistered == 0) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) - InvariantResult [Line: 7096]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0)) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && 0 == pended) && compRegistered == 0) && NP == s) && !(MPR3 == NP)) && !(SKIP1 == NP)) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) - InvariantResult [Line: 3222]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 6940]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) - InvariantResult [Line: 3705]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 3587]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((!(259 == ntStatus) && 0 == pended) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 7099]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8034]: Loop Invariant Derived loop invariant: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 2705]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 == MPR1 || IPC == MPR3) || ((0 == pended && NP == s) && !(259 == ntStatus))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || (NP == s && pended == 1)) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 2509]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8018]: Loop Invariant Derived loop invariant: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 8276]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2494]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3237]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 2781]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 6902]: Loop Invariant Derived loop invariant: ((((((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || SKIP2 == DC) && (((!(\old(setEventCalled) == 1) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || 1 == setEventCalled)) && ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || ((0 == pended && NP == s) && PagingReferenceCount == 1)) || !(0 == \old(pended))) || SKIP2 == DC)) && ((((0 == myStatus || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || !(customIrp == 0)) - InvariantResult [Line: 7148]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(\old(myStatus) == 0) || s == UNLOADED) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(DC))) || (((((((((compRegistered == 1 && !(MPR1 == SKIP1)) && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && !(259 == status))) || !(\old(compRegistered) == 0)) || (((((0 == pended && !(SKIP2 == s)) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || ((((((((status == lowerDriverReturn && !(s == DC)) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && 0 == pended) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP))) || ((((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((!(s == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(NP))) || (((((0 == pended && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || (((((0 == status + 1073741738 && 0 == pended) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 6890]: Loop Invariant Derived loop invariant: (((((((!(\old(setEventCalled) == 1) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || 1 == setEventCalled) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) && (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || (NP == s && pended == 1)) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) || ((((0 == pended && headOfList == 0) && NP == s) && headOfList == 0) && PagingReferenceCount == 1))) && ((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || NP == MPR1) || ((headOfList == 0 && headOfList == 0) && PagingReferenceCount == 1))) && ((((((0 == pended && NP == s) || (((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(PagingReferenceCount) == 1)) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC)) && ((((((((((((!(SKIP2 == DC) && !(MPR1 == SKIP1)) && !(IPC == DC)) && s == \old(s)) && NP == s) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP)) || !(\old(myStatus) == 0)) || (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || IPC == MPR3) || SKIP2 == DC) || 0 == myStatus) || NP == MPR1) || !(customIrp == 0)) - InvariantResult [Line: 7696]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) - InvariantResult [Line: 7084]: Loop Invariant Derived loop invariant: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7572]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3231]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && 0 == myStatus) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) - InvariantResult [Line: 2763]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 7600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6934]: Loop Invariant Derived loop invariant: (((!(\old(PagingReferenceCount) == 1) || ((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(0 == \old(pended))) || !(compRegistered == 1)) || SKIP2 == DC) && (((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || SKIP2 == DC) - InvariantResult [Line: 7680]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((((((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled) && returnVal2 == 259) || NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || (((s == MPR1 && compRetStatus1 + 1073741802 == 0) && returnVal2 + 1073741823 <= 0) && 1 == setEventCalled)) || (((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 0 == returnVal2) && 1 == setEventCalled)) - InvariantResult [Line: 7488]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8279]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7396]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7699]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) - InvariantResult [Line: 7984]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7575]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7603]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2506]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3708]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 3862]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7883]: Loop Invariant Derived loop invariant: (((((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) - InvariantResult [Line: 3861]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8105]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7485]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3840]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7399]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7087]: Loop Invariant Derived loop invariant: ((((((((((((((((!(SKIP2 == DC) && !(IPC == DC)) && 0 == pended) && NP == s) && !(MPR3 == NP)) || !(\old(myStatus) == 0)) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 7170]: Loop Invariant Derived loop invariant: (((((((((((((((((((((compRegistered == 1 && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP)))) || (0 == compRegistered && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))))) && !(259 == status)) || !(\old(myStatus) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || ((((!(SKIP2 == s) && 0 == status) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || !(\old(s) == \old(DC))) || ((((!(SKIP2 == s) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && 0 == status + 2147483631)) || !(\old(compRegistered) == 0)) || ((((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))) && pended == 1)) || !(\old(PagingReferenceCount) == 0)) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || ((((0 == status + 1073741738 && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP))) || (s == SKIP2 && (((((((status == lowerDriverReturn && !(MPR1 == SKIP1)) && !(SKIP2 == DC)) && !(IPC == DC)) && compRegistered == 0) && !(MPR3 == NP)) && !(SKIP1 == NP)) || (((((!(MPR1 == SKIP1) && !(SKIP2 == s)) && s == DC) && !(IPC == s)) && !(MPR3 == NP)) && !(SKIP1 == NP))))) || !(\old(s) == \old(NP))) || !(0 == \old(pended))) || (((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && s == SKIP2) && compRegistered == 0) && pended == 1) && !(MPR3 == NP)) && !(SKIP1 == NP))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 8257]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7702]: Loop Invariant Derived loop invariant: (((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || SKIP1 == s) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC) || SKIP1 == s)) && ((NP == MPR1 || ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(0 == pended)) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || SKIP2 == DC) || ((s == MPR1 && compRetStatus1 + 1073741802 == 0) && 1 == setEventCalled)) - InvariantResult [Line: 6453]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 8037]: Loop Invariant Derived loop invariant: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: 6796]: Loop Invariant Derived loop invariant: ((((((((((0 == pended && NP == s) && PagingReferenceCount == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || SKIP2 == DC - InvariantResult [Line: 3225]: Loop Invariant Derived loop invariant: (((((0 == ntStatus && 0 == pended) && 0 == compRegistered) && NP == s) && PagingReferenceCount == 1) && \old(customIrp) == customIrp) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: 8254]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3589]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (((0 == pended && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 2760]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 3696]: Loop Invariant Derived loop invariant: (((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s - InvariantResult [Line: 7858]: Loop Invariant Derived loop invariant: (((((((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || ((NP == s && 1 == setEventCalled) && \old(customIrp) == customIrp)) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || NP == s) || SKIP2 == DC)) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC)) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || NP == s) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) - InvariantResult [Line: 7987]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7090]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2769]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 2503]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3611]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(\old(PagingReferenceCount) == 1)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || ((((0 == pended && InterfaceType == 0) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1)) || ((((0 == pended && !(ntStatus == 259)) && compRegistered == 1) && NP == s) && PagingReferenceCount == 1) - InvariantResult [Line: 3245]: Loop Invariant Derived loop invariant: ((((s == DC && pended == 1) || ((s == SKIP2 && compRegistered == 0) && pended == 1)) || (((s == SKIP2 && 0 == pended) && 0 == compRegistered) && lowerDriverReturn == ntStatus)) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0)) || (!(ntStatus == 259) && (((0 == pended && 0 == compRegistered) && s == DC) || ((compRegistered == 1 && 0 == pended) && s == DC))) - InvariantResult [Line: 8040]: Loop Invariant Derived loop invariant: (((((((SKIP1 == s || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || NP == MPR3) || !(compRegistered == 0)) || !(SKIP1 == \old(s))) || !(0 == pended)) || SKIP2 == DC - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7093]: Loop Invariant Derived loop invariant: ((((((((((((!(\old(myStatus) == 0) || !(\old(PagingReferenceCount) == 0)) || !(\old(SKIP1) == \old(s))) || !(\old(SKIP2) == \old(s))) || !(\old(s) == \old(MPR1))) || !(\old(UNLOADED) == \old(s))) || (((((((((((!(MPR1 == SKIP1) && 0 == pended) && 0 == compRegistered) && !(MPR3 == IPC)) && !(MPR1 == NP)) && !(SKIP2 == DC)) && !(IPC == DC)) && NP == s) && \old(customIrp) == customIrp) && !(MPR3 == NP)) && PagingReferenceCount == 0) && !(SKIP1 == NP))) || !(\old(s) == \old(DC))) || !(\old(s) == \old(NP))) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(s) == \old(MPR3))) || !(\old(s) == \old(IPC))) || !(\old(customIrp) == 0) - InvariantResult [Line: 2793]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || (0 == pended && NP == s)) || !(customIrp == 0) - InvariantResult [Line: 2941]: Loop Invariant Derived loop invariant: ((((((((((((SKIP1 == MPR1 || ((0 == pended && NP == s) && 0 == ntStatus)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0)) || ((0 == pended && ntStatus + 2147483643 <= 0) && NP == s) - InvariantResult [Line: 7880]: Loop Invariant Derived loop invariant: (((((NP == s && \old(customIrp) == customIrp) || (((((!(\old(setEventCalled) == 1) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || IPC == MPR3) || NP == MPR1) || !(\old(s) == MPR3)) || SKIP1 == MPR1 || (((SKIP1 == NP || DC == IPC) || NP == MPR3) || !(0 == pended)) || SKIP2 == DC) && ((((((((SKIP1 == NP || DC == IPC) || !(1 == pended)) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == s) || NP == MPR3) || !(compRegistered == 0)) || SKIP2 == DC)) && (((((\old(customIrp) == 1 && ((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 0 == customIrp) && 1 == setEventCalled) || ((((((((((!(\old(setEventCalled) == 1) || SKIP1 == NP) || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || !(PagingReferenceCount == 1)) || !(compRegistered == 1)) || NP == MPR3) || IPC == MPR3) || !(0 == pended)) || NP == MPR1) || SKIP2 == DC) || (((((compRegistered == 1 && ((((((!(MPR1 == SKIP1) && !(SKIP2 == DC)) && !(IPC == DC)) && 0 == pended) && NP == s) && NP == \old(s)) && !(MPR3 == NP)) && !(SKIP1 == NP)) && !(MPR3 == IPC)) && PagingReferenceCount == 1) && 1 == setEventCalled) && \old(customIrp) == customIrp))) && ((((\old(customIrp) == customIrp || ((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || IPC == MPR3) || NP == MPR1) || !(\old(customIrp) == 0))) && ((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == pended)) || SKIP2 == DC) || NP == s) - InvariantResult [Line: 2757]: Loop Invariant Derived loop invariant: (((((((((((SKIP1 == MPR1 || (0 == pended && NP == s)) || IPC == MPR3) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || SKIP1 == NP) || DC == IPC) || !(\old(s) == NP)) || NP == MPR3) || !(compRegistered == 0)) || !(0 == \old(pended))) || !(customIrp == 0) - InvariantResult [Line: 8108]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3243]: Loop Invariant Derived loop invariant: (((0 == pended && 0 == compRegistered) && !(ntStatus == 259)) && NP == s) || ((((((((((SKIP1 == NP || DC == IPC) || SKIP1 == MPR1) || !(\old(s) == NP)) || NP == MPR3) || IPC == MPR3) || !(\old(compRegistered) == 0)) || !(0 == \old(pended))) || !(\old(PagingReferenceCount) == 0)) || NP == MPR1) || SKIP2 == DC) || !(\old(customIrp) == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 708 locations, 1 error locations. SAFE Result, 206.7s OverallTime, 76 OverallIterations, 7 TraceHistogramMax, 156.4s AutomataDifference, 0.0s DeadEndRemovalTime, 24.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 56671 SDtfs, 22402 SDslu, 150304 SDs, 0 SdLazy, 15355 SolverSat, 3703 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 143.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 1148 SyntacticMatches, 11 SemanticMatches, 421 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8896occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.4s AutomataMinimizationTime, 76 MinimizatonAttempts, 9250 StatesRemovedByMinimization, 56 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 247 LocationsWithAnnotation, 50756 PreInvPairs, 51348 NumberOfFragments, 13169 HoareAnnotationTreeSize, 50756 FomulaSimplifications, 607569 FormulaSimplificationTreeSizeReduction, 3.5s HoareSimplificationTime, 247 FomulaSimplificationsInter, 247915 FormulaSimplificationTreeSizeReductionInter, 20.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 1.2s SsaConstructionTime, 5.0s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 7905 NumberOfCodeBlocks, 7898 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 7821 ConstructedInterpolants, 0 QuantifiedInterpolants, 1204336 SizeOfPredicates, 14 NumberOfNonLiveVariables, 32150 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 84 InterpolantComputations, 71 PerfectInterpolantSequences, 475/552 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...